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 276K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K 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 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 112K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DNAwalker-PT-09ringLR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735400283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526793907492

info: Time: 3600 - MCC
===========================================================================================
prep: translating DNAwalker-PT-09ringLR Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DNAwalker-PT-09ringLR formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DNAwalker-PT-09ringLR @ 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: 287/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 163 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-09ringLR-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= B21)
lola: LP says that atomic proposition is always false: (3 <= B10)
lola: LP says that atomic proposition is always false: (3 <= B20)
lola: E (X (NOT(A (F ((A18 <= A16)))))) : E ((((A2 + 1 <= A9)) U A (X ((3 <= A10))))) : A (F (A (((A21 <= A5) U (2 <= A5))))) : A (X (A (F (((1 <= B20) OR (3 <= A10)))))) : (E (X (())) OR ((A21 <= A13) AND (E (F (FALSE)) AND ((A17 <= 1) OR (A3 <= 1))))) : A (G (A (F (((B21 <= A11) AND (3 <= A6)))))) : E (G (E (((A20 <= B20) U (A1 <= A4))))) : A (F ((1 <= A11))) : A (F ((3 <= A10))) : A (F ((B10 <= A11))) : ((A (((2 <= A11) U (2 <= A7))) OR E (G ((A3 <= 1)))) AND (A14 <= B2)) : A ((E (F ((3 <= A10))) U ((2 <= A5) AND (A16 + 1 <= B2)))) : A (G (NOT(A (F ((3 <= A21)))))) : E (G ((B3 <= A13))) : (((A6 + 1 <= B10) AND (A1 + 1 <= A8) AND (B2 <= A12) AND (A18 <= 2) AND (A9 <= 0) AND (A19 + 1 <= A8)) OR A (F (A (X ((2 <= A14)))))) : A (F (E (G ((A16 + 1 <= A2)))))
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:440
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
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:118
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 200 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: 16 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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 DNAwalker-PT-09ringLR-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((A2 + 1 <= A9)) U A (X ((3 <= A10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(((A2 + 1 <= A9)) U AX((3 <= A10)))
lola: processed formula length: 36
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 914103 markings, 3856955 edges, 182821 markings/sec, 0 secs
lola: 2042378 markings, 6873970 edges, 225655 markings/sec, 5 secs
lola: 3035198 markings, 10258235 edges, 198564 markings/sec, 10 secs
lola: 3832249 markings, 14047477 edges, 159410 markings/sec, 15 secs
lola: 4549414 markings, 18033175 edges, 143433 markings/sec, 20 secs
lola: 5487919 markings, 21517534 edges, 187701 markings/sec, 25 secs
lola: 6454193 markings, 24609853 edges, 193255 markings/sec, 30 secs
lola: 7370235 markings, 27927120 edges, 183208 markings/sec, 35 secs
lola: 8202606 markings, 30950164 edges, 166474 markings/sec, 40 secs
lola: 9028210 markings, 34320713 edges, 165121 markings/sec, 45 secs
lola: 9881049 markings, 37588893 edges, 170568 markings/sec, 50 secs
lola: 10730987 markings, 40610100 edges, 169988 markings/sec, 55 secs
lola: 11580817 markings, 43876469 edges, 169966 markings/sec, 60 secs
lola: 12391934 markings, 47066973 edges, 162223 markings/sec, 65 secs
lola: 13190459 markings, 50496090 edges, 159705 markings/sec, 70 secs
lola: 14054874 markings, 53663730 edges, 172883 markings/sec, 75 secs
lola: 14745755 markings, 57184292 edges, 138176 markings/sec, 80 secs
lola: 15572144 markings, 60182581 edges, 165278 markings/sec, 85 secs
lola: 16321307 markings, 63090865 edges, 149833 markings/sec, 90 secs
lola: 17083109 markings, 66437235 edges, 152360 markings/sec, 95 secs
lola: 17833043 markings, 69834649 edges, 149987 markings/sec, 100 secs
lola: 18595989 markings, 73138756 edges, 152589 markings/sec, 105 secs
lola: 19294485 markings, 77120588 edges, 139699 markings/sec, 110 secs
lola: 20006814 markings, 81239250 edges, 142466 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20257431 markings, 82018267 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= B20) OR (3 <= A10))))))
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: ((B20 <= 0) AND (A10 <= 2))
lola: processed formula length: 27
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 14 markings, 14 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((A16 + 1 <= A18)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (A16 + 1 <= A18)
lola: processed formula length: 16
lola: 17 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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 is not possibly preserved from any successor.
lola: 127 markings, 126 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((A6 + 1 <= B10) AND (A1 + 1 <= A8) AND (B2 <= A12) AND (A18 <= 2) AND (A9 <= 0) AND (A19 + 1 <= A8)) OR A (F (A (X ((2 <= A14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A6 + 1 <= B10) AND (A1 + 1 <= A8) AND (B2 <= A12) AND (A18 <= 2) AND (A9 <= 0) AND (A19 + 1 <= A8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((A6 + 1 <= B10) AND (A1 + 1 <= A8) AND (B2 <= A12) AND (A18 <= 2) AND (A9 <= 0) AND (A19 + 1 <= A8))
lola: processed formula length: 101
lola: 16 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-CTLCardinality.task
lola: processed formula with 6 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 5 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((2 <= A14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((2 <= A14)))
lola: processed formula length: 24
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A21 <= 2)))
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:695
lola: processed formula: A (G ((A21 <= 2)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (3 <= A21)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-09ringLR-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-09ringLR-CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 453864 markings, 1889784 edges, 90773 markings/sec, 0 secs
lola: sara is running 5 secs || 848981 markings, 3931527 edges, 79023 markings/sec, 5 secs
lola: sara is running 10 secs || 1263950 markings, 5968060 edges, 82994 markings/sec, 10 secs
lola: sara is running 15 secs || 1688098 markings, 7979428 edges, 84830 markings/sec, 15 secs
lola: sara is running 20 secs || 2169010 markings, 9994643 edges, 96182 markings/sec, 20 secs
lola: sara is running 25 secs || 2582338 markings, 12240270 edges, 82666 markings/sec, 25 secs
lola: sara is running 30 secs || 2975345 markings, 14568102 edges, 78601 markings/sec, 30 secs
lola: sara is running 35 secs || 3387618 markings, 16646792 edges, 82455 markings/sec, 35 secs
lola: sara is running 40 secs || 3759443 markings, 18857136 edges, 74365 markings/sec, 40 secs
lola: sara is running 45 secs || 4090321 markings, 21146447 edges, 66176 markings/sec, 45 secs
lola: sara is running 50 secs || 4467462 markings, 23399588 edges, 75428 markings/sec, 50 secs
lola: sara is running 55 secs || 4882302 markings, 25595415 edges, 82968 markings/sec, 55 secs
lola: sara is running 60 secs || 5248638 markings, 27993066 edges, 73267 markings/sec, 60 secs
lola: sara is running 65 secs || 5674810 markings, 30269667 edges, 85234 markings/sec, 65 secs
lola: sara is running 70 secs || 6116740 markings, 32562206 edges, 88386 markings/sec, 70 secs
lola: sara is running 75 secs || 6507372 markings, 34661116 edges, 78126 markings/sec, 75 secs
lola: sara is running 80 secs || 6938180 markings, 36686245 edges, 86162 markings/sec, 80 secs
lola: sara is running 85 secs || 7395730 markings, 38831884 edges, 91510 markings/sec, 85 secs
lola: sara is running 90 secs || 7790688 markings, 41141781 edges, 78992 markings/sec, 90 secs
lola: sara is running 95 secs || 8198899 markings, 43278675 edges, 81642 markings/sec, 95 secs
lola: sara is running 100 secs || 8568577 markings, 45640679 edges, 73936 markings/sec, 100 secs
lola: sara is running 105 secs || 8931817 markings, 47895231 edges, 72648 markings/sec, 105 secs
lola: sara is running 110 secs || 9276609 markings, 50234685 edges, 68958 markings/sec, 110 secs
lola: sara is running 115 secs || 9722729 markings, 52378703 edges, 89224 markings/sec, 115 secs
lola: sara is running 120 secs || 10150316 markings, 54514715 edges, 85517 markings/sec, 120 secs
lola: sara is running 125 secs || 10537228 markings, 56768478 edges, 77382 markings/sec, 125 secs
lola: sara is running 130 secs || 10956888 markings, 58958155 edges, 83932 markings/sec, 130 secs
lola: sara is running 135 secs || 11329816 markings, 61182363 edges, 74586 markings/sec, 135 secs
lola: sara is running 140 secs || 11754799 markings, 63336614 edges, 84997 markings/sec, 140 secs
lola: sara is running 145 secs || 12310397 markings, 65464732 edges, 111120 markings/sec, 145 secs
lola: sara is running 150 secs || 12766448 markings, 67771682 edges, 91210 markings/sec, 150 secs
lola: sara is running 155 secs || 13167584 markings, 70094750 edges, 80227 markings/sec, 155 secs
lola: sara is running 160 secs || 13505493 markings, 72483799 edges, 67582 markings/sec, 160 secs
lola: sara is running 165 secs || 13870581 markings, 74745503 edges, 73018 markings/sec, 165 secs
lola: sara is running 170 secs || 14303838 markings, 77075483 edges, 86651 markings/sec, 170 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 14559446 markings, 78739249 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= A10)))
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: (A10 <= 2)
lola: processed formula length: 10
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 15 markings, 15 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A5)))
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: (A5 <= 1)
lola: processed formula length: 9
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 13 markings, 13 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= A11)))
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: (A11 <= 0)
lola: processed formula length: 10
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 18 markings, 18 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((B3 <= A13)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((B3 <= A13)))
lola: processed formula length: 19
lola: 16 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 18 markings, 18 edges

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((B10 <= A11)))
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: (A11 + 1 <= B10)
lola: processed formula length: 16
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 17 markings, 17 edges

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((B21 <= A11) AND (3 <= A6))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((A11 + 1 <= B21) OR (A6 <= 2))
lola: processed formula length: 32
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 15 markings, 15 edges

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================lola: subprocess 12 will run for 725 seconds at most (--localtimelimit=0)

lola: ========================================
lola: ...considering subproblem: A (F (E (G ((A16 + 1 <= A2)))))
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:297
lola: processed formula: A(TRUE U NOT(A(TRUE U (A2 <= A16))))
lola: processed formula length: 36
lola: 19 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 19 markings, 38 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 966 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((A20 <= B20) U (A1 <= A4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((A20 <= B20) U (A1 <= A4)))))
lola: processed formula length: 48
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 19 markings, 39 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((3 <= A10))) U ((2 <= A5) AND (A16 + 1 <= B2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U (3 <= A10)) U ((2 <= A5) AND (A16 + 1 <= B2)))
lola: processed formula length: 57
lola: 18 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 863534 markings, 4921583 edges, 172707 markings/sec, 0 secs
lola: 1639827 markings, 9933844 edges, 155259 markings/sec, 5 secs
lola: 2307226 markings, 14626549 edges, 133480 markings/sec, 10 secs
lola: 2917121 markings, 19648674 edges, 121979 markings/sec, 15 secs
lola: 3505863 markings, 24641854 edges, 117748 markings/sec, 20 secs
lola: 4065026 markings, 29737544 edges, 111833 markings/sec, 25 secs
lola: 4821697 markings, 34307257 edges, 151334 markings/sec, 30 secs
lola: 5469251 markings, 39208429 edges, 129511 markings/sec, 35 secs
lola: 6066550 markings, 44122479 edges, 119460 markings/sec, 40 secs
lola: 6647981 markings, 49170109 edges, 116286 markings/sec, 45 secs
lola: 7352259 markings, 53989219 edges, 140856 markings/sec, 50 secs
lola: 7937059 markings, 58387774 edges, 116960 markings/sec, 55 secs
lola: 8477061 markings, 63020392 edges, 108000 markings/sec, 60 secs
lola: 9007386 markings, 67665788 edges, 106065 markings/sec, 65 secs
lola: 9530762 markings, 72586729 edges, 104675 markings/sec, 70 secs
lola: 10045671 markings, 77318492 edges, 102982 markings/sec, 75 secs
lola: 10490682 markings, 81981122 edges, 89002 markings/sec, 80 secs
lola: 11017226 markings, 86842286 edges, 105309 markings/sec, 85 secs
lola: 11485509 markings, 91374416 edges, 93657 markings/sec, 90 secs
lola: 11926917 markings, 96135721 edges, 88282 markings/sec, 95 secs
lola: 12370240 markings, 100960620 edges, 88665 markings/sec, 100 secs
lola: 12899670 markings, 105620679 edges, 105886 markings/sec, 105 secs
lola: 13474516 markings, 109876704 edges, 114969 markings/sec, 110 secs
lola: 14048665 markings, 114085354 edges, 114830 markings/sec, 115 secs
lola: 14594920 markings, 118170390 edges, 109251 markings/sec, 120 secs
lola: 15041991 markings, 122333412 edges, 89414 markings/sec, 125 secs
lola: 15452033 markings, 126287524 edges, 82008 markings/sec, 130 secs
lola: 16000521 markings, 130575671 edges, 109698 markings/sec, 135 secs
lola: 16572437 markings, 134898521 edges, 114383 markings/sec, 140 secs
lola: 17005210 markings, 139010241 edges, 86555 markings/sec, 145 secs
lola: 17547649 markings, 143362196 edges, 108488 markings/sec, 150 secs
lola: 18028900 markings, 147699003 edges, 96250 markings/sec, 155 secs
lola: 18511056 markings, 151916582 edges, 96431 markings/sec, 160 secs
lola: 18976585 markings, 156277871 edges, 93106 markings/sec, 165 secs
lola: 19561794 markings, 160584953 edges, 117042 markings/sec, 170 secs
lola: 20080188 markings, 164936003 edges, 103679 markings/sec, 175 secs
lola: 20618574 markings, 169252751 edges, 107677 markings/sec, 180 secs
lola: 21145628 markings, 173444441 edges, 105411 markings/sec, 185 secs
lola: 21606847 markings, 177716605 edges, 92244 markings/sec, 190 secs
lola: 22022043 markings, 181932275 edges, 83039 markings/sec, 195 secs
lola: 22419333 markings, 185947489 edges, 79458 markings/sec, 200 secs
lola: 22873580 markings, 190108214 edges, 90849 markings/sec, 205 secs
lola: 23396681 markings, 194485876 edges, 104620 markings/sec, 210 secs
lola: 23901984 markings, 198804171 edges, 101061 markings/sec, 215 secs
lola: 24349989 markings, 203323885 edges, 89601 markings/sec, 220 secs
lola: 24826370 markings, 207810841 edges, 95276 markings/sec, 225 secs
lola: 25343985 markings, 212452109 edges, 103523 markings/sec, 230 secs
lola: 25788341 markings, 216959838 edges, 88871 markings/sec, 235 secs
lola: 26258709 markings, 221475755 edges, 94074 markings/sec, 240 secs
lola: 26764377 markings, 226190192 edges, 101134 markings/sec, 245 secs
lola: 27238552 markings, 231073937 edges, 94835 markings/sec, 250 secs
lola: 27738557 markings, 236138112 edges, 100001 markings/sec, 255 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 28209796 markings, 240889488 edges
lola: ========================================

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (((2 <= A11) U (2 <= A7))) OR E (G ((A3 <= 1)))) AND (A14 <= B2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((A3 <= 1)))
lola: processed formula length: 17
lola: 16 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 11 markings, 11 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 (((2 <= A11) U (2 <= A7))) OR E (G ((A3 <= 1)))) AND (A14 <= B2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((A3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((A3 <= 1)))
lola: processed formula length: 17
lola: 16 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-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: 11 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A14 <= B2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A14 <= B2)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file DNAwalker-PT-09ringLR-CTLCardinality.task
lola: processed formula with 1 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 DNAwalker-PT-09ringLR-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no yes no yes yes no no
lola:
preliminary result: no no no no no no yes no no no yes no yes yes no no
lola: memory consumption: 23412 KB
lola: time consumption: 935 seconds

BK_STOP 1526794842365

--------------------
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="DNAwalker-PT-09ringLR"
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/DNAwalker-PT-09ringLR.tgz
mv DNAwalker-PT-09ringLR 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 DNAwalker-PT-09ringLR, 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 r064-smll-152649735400283"
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 ;