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 196K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K 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 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K 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 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K 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 2.1K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0128DC0032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400038
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527200584054

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0128DC0032 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0128DC0032 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT0128DC0032 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always false: (TaskOnDisk <= ExecutingTask)
lola: LP says that atomic proposition is always true: (FreeMemSegment <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (CPUUnit <= TaskOnDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= TransferToDisk)
lola: always true
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: E (F (((FreeMemSegment <= TaskSuspended) AND (TaskReady <= DiskControllerUnit)))) : E (F (((FreeMemSegment <= 1) AND (TransferToDisk <= 2) AND ((FreeMemSegment + 1 <= LoadingMem) OR (DiskControllerUnit + 1 <= ExecutingTask))))) : (((2 <= TransferToDisk) AND (((1 <= CPUUnit) AND (TaskSuspended <= 1)) OR (CPUUnit <= TaskSuspended))) OR A (G (A (F ((1 <= CPUUnit)))))) : (() AND A (G (((TaskSuspended + 1 <= CPUUnit) OR (DiskControllerUnit <= 0))))) : NOT(E (F ((FreeMemSegment <= TaskSuspended)))) : (FALSE OR A (G (TRUE))) : (A (G ((((1 <= LoadingMem)) OR (2 <= FreeMemSegment)))) OR (((2 <= TaskSuspended) OR (3 <= ExecutingTask)) AND ((TaskReady <= 0)))) : (A (X (((CPUUnit <= 0)))) OR NOT(E (F ((DiskControllerUnit <= 0))))) : A (G (E ((TRUE U (LoadingMem <= FreeMemSegment))))) : E (F ((((2 <= LoadingMem) OR ((1 <= LoadingMem) AND (1 <= TaskReady))) AND E (G ((TaskOnDisk <= FreeMemSegment)))))) : A (F (A (G ((1 <= DiskControllerUnit))))) : A (G (A (X ((TaskSuspended + 1 <= CPUUnit))))) : A ((A (G ((3 <= FreeMemSegment))) U A (G ((1 <= CPUUnit))))) : A (G ((((CPUUnit + 1 <= TaskReady) OR (TaskReady + 1 <= CPUUnit)) OR A (G ((3 <= ExecutingTask)))))) : A (G ((A (G ((ExecutingTask <= CPUUnit))) OR ()))) : A (G ((3 <= DiskControllerUnit)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 20 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-5 TRUE 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: (A (X (((CPUUnit <= 0)))) OR A (G ((1 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= DiskControllerUnit)))
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 ((1 <= DiskControllerUnit)))
lola: processed formula length: 33
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: (DiskControllerUnit <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((CPUUnit <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
sara: try reading problem file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-0.sara.
lola: processed formula: AX(((CPUUnit <= 0)))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-7 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: A (X (A (G ((TaskSuspended + 1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (CPUUnit <= TaskSuspended)
lola: processed formula length: 26
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 192 markings, 191 edges

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= DiskControllerUnit)))
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 ((3 <= DiskControllerUnit)))
lola: processed formula length: 33
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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:694
lola: formula 0: (DiskControllerUnit <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ExecutingTask <= CPUUnit)))
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 ((ExecutingTask <= CPUUnit)))
lola: processed formula length: 34
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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:694
lola: formula 0: (CPUUnit + 1 <= ExecutingTask)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-4-0.sara

lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3305 markings, 4960 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended + 1 <= FreeMemSegment)))
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 ((TaskSuspended + 1 <= FreeMemSegment)))
lola: processed formula length: 45
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: (FreeMemSegment <= TaskSuspended)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 225 markings, 224 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-4 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: A (G (((TaskSuspended + 1 <= CPUUnit) OR (DiskControllerUnit <= 0))))
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 (((TaskSuspended + 1 <= CPUUnit) OR (DiskControllerUnit <= 0))))
lola: processed formula length: 70
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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:694
lola: formula 0: ((CPUUnit <= TaskSuspended) AND (1 <= DiskControllerUnit))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 193 markings, 192 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-3 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: E (F (((FreeMemSegment <= TaskSuspended) AND (TaskReady <= DiskControllerUnit))))
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 (((FreeMemSegment <= TaskSuspended) AND (TaskReady <= DiskControllerUnit))))
lola: processed formula length: 81
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: ((FreeMemSegment <= TaskSuspended) AND (TaskReady <= DiskControllerUnit))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 225 markings, 224 edges
lola:
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-0 TRUE 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 (F (((FreeMemSegment <= 1) AND (TransferToDisk <= 2) AND ((FreeMemSegment + 1 <= LoadingMem) OR (DiskControllerUnit + 1 <= ExecutingTask)))))
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 (((FreeMemSegment <= 1) AND (TransferToDisk <= 2) AND ((FreeMemSegment + 1 <= LoadingMem) OR (DiskControllerUnit + 1 <= ExecutingTask)))))
lola: processed formula length: 144
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: ((FreeMemSegment <= 1) AND (TransferToDisk <= 2) AND ((FreeMemSegment + 1 <= LoadingMem) OR (DiskControllerUnit + 1 <= ExecutingTask)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 223 markings, 222 edges

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-1 TRUE 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: A (G (E (F ((LoadingMem <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (LoadingMem <= FreeMemSegment)
lola: processed formula length: 30
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality.task
lola: ========================================
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2924353 markings, 7741806 edges, 584871 markings/sec, 0 secs
lola: 5541529 markings, 14967783 edges, 523435 markings/sec, 5 secs
lola: 8026140 markings, 21870105 edges, 496922 markings/sec, 10 secs
lola: 10427926 markings, 28576370 edges, 480357 markings/sec, 15 secs
lola: 12780865 markings, 35181776 edges, 470588 markings/sec, 20 secs
lola: 15082554 markings, 41651929 edges, 460338 markings/sec, 25 secs
lola: 17328850 markings, 47989197 edges, 449259 markings/sec, 30 secs
lola: 19517799 markings, 54204951 edges, 437790 markings/sec, 35 secs
lola: 21702324 markings, 60389419 edges, 436905 markings/sec, 40 secs
lola: 23814553 markings, 66414320 edges, 422446 markings/sec, 45 secs
lola: 25947526 markings, 72466054 edges, 426595 markings/sec, 50 secs
lola: 28049121 markings, 78454979 edges, 420319 markings/sec, 55 secs
lola: 30083275 markings, 84266089 edges, 406831 markings/sec, 60 secs
lola: 32134173 markings, 90114363 edges, 410180 markings/sec, 65 secs
lola: 34192506 markings, 95993607 edges, 411667 markings/sec, 70 secs
lola: 36197791 markings, 101758219 edges, 401057 markings/sec, 75 secs
lola: 38204030 markings, 107525501 edges, 401248 markings/sec, 80 secs
lola: 40231945 markings, 113331248 edges, 405583 markings/sec, 85 secs
lola: 42216618 markings, 119025810 edges, 396935 markings/sec, 90 secs
lola: 44196731 markings, 124727561 edges, 396023 markings/sec, 95 secs
lola: 46001569 markings, 129960740 edges, 360968 markings/sec, 100 secs
lola: 47715233 markings, 134854995 edges, 342733 markings/sec, 105 secs
lola: 49433964 markings, 139836200 edges, 343746 markings/sec, 110 secs
lola: 51173754 markings, 144836154 edges, 347958 markings/sec, 115 secs
lola: 52996371 markings, 150078548 edges, 364523 markings/sec, 120 secs
lola: 54835203 markings, 155445994 edges, 367766 markings/sec, 125 secs
lola: 56741341 markings, 160957133 edges, 381228 markings/sec, 130 secs
lola: 58606790 markings, 166362362 edges, 373090 markings/sec, 135 secs
lola: 60463978 markings, 171755344 edges, 371438 markings/sec, 140 secs
lola: 62364226 markings, 177277816 edges, 380050 markings/sec, 145 secs
lola: 64266080 markings, 182772542 edges, 380371 markings/sec, 150 secs
lola: 66102616 markings, 188172779 edges, 367307 markings/sec, 155 secs
lola: 67997893 markings, 193721249 edges, 379055 markings/sec, 160 secs
lola: 69863392 markings, 199165894 edges, 373100 markings/sec, 165 secs
lola: 71733631 markings, 204645141 edges, 374048 markings/sec, 170 secs
lola: 73565371 markings, 210058261 edges, 366348 markings/sec, 175 secs
lola: 75387737 markings, 215451249 edges, 364473 markings/sec, 180 secs
lola: 77239500 markings, 220932934 edges, 370353 markings/sec, 185 secs
lola: 79085859 markings, 226395920 edges, 369272 markings/sec, 190 secs
lola: 80911294 markings, 231858068 edges, 365087 markings/sec, 195 secs
lola: 82700652 markings, 237238348 edges, 357872 markings/sec, 200 secs
lola: 84499630 markings, 242653779 edges, 359796 markings/sec, 205 secs
lola: 86256767 markings, 247985006 edges, 351427 markings/sec, 210 secs
lola: 88044484 markings, 253415380 edges, 357543 markings/sec, 215 secs
lola: 89887383 markings, 259023892 edges, 368580 markings/sec, 220 secs
lola: 91853433 markings, 265043082 edges, 393210 markings/sec, 225 secs
lola: 92515271 markings, 272458771 edges, 132368 markings/sec, 230 secs
lola: 92517973 markings, 278400912 edges, 540 markings/sec, 235 secs
lola: 92520025 markings, 283814143 edges, 410 markings/sec, 240 secs
lola: 92521879 markings, 289146516 edges, 371 markings/sec, 245 secs
lola: 92523788 markings, 294467829 edges, 382 markings/sec, 250 secs
lola: 93257878 markings, 300896571 edges, 146818 markings/sec, 255 secs
lola: 93259478 markings, 305941134 edges, 320 markings/sec, 260 secs
lola: 93277000 markings, 311124329 edges, 3504 markings/sec, 265 secs
lola: 93307474 markings, 316144648 edges, 6095 markings/sec, 270 secs
lola: 93346760 markings, 321338491 edges, 7857 markings/sec, 275 secs
lola: 93487071 markings, 326500721 edges, 28062 markings/sec, 280 secs
lola: 93526839 markings, 331375658 edges, 7954 markings/sec, 285 secs
lola: 93698434 markings, 336531952 edges, 34319 markings/sec, 290 secs
lola: 93818256 markings, 341614492 edges, 23964 markings/sec, 295 secs
lola: 94010421 markings, 346783004 edges, 38433 markings/sec, 300 secs
lola: 94075998 markings, 351677632 edges, 13115 markings/sec, 305 secs
lola: 94118505 markings, 356516192 edges, 8501 markings/sec, 310 secs
lola: 94405724 markings, 361771858 edges, 57444 markings/sec, 315 secs
lola: 94547498 markings, 366774787 edges, 28355 markings/sec, 320 secs
lola: 94752411 markings, 371846850 edges, 40983 markings/sec, 325 secs
lola: 94778439 markings, 376159120 edges, 5206 markings/sec, 330 secs
lola: 94835933 markings, 380757845 edges, 11499 markings/sec, 335 secs
lola: 95058472 markings, 385564963 edges, 44508 markings/sec, 340 secs
lola: 95220189 markings, 390189462 edges, 32343 markings/sec, 345 secs
lola: 95426092 markings, 395074634 edges, 41181 markings/sec, 350 secs
lola: 95528313 markings, 399664199 edges, 20444 markings/sec, 355 secs
lola: 95651788 markings, 404324542 edges, 24695 markings/sec, 360 secs
lola: 95682125 markings, 408677342 edges, 6067 markings/sec, 365 secs
lola: 95849540 markings, 413245365 edges, 33483 markings/sec, 370 secs
lola: 96003908 markings, 417934847 edges, 30874 markings/sec, 375 secs
lola: 96292863 markings, 422876812 edges, 57791 markings/sec, 380 secs
lola: 96418543 markings, 427623736 edges, 25136 markings/sec, 385 secs
lola: 96619400 markings, 432320871 edges, 40171 markings/sec, 390 secs
lola: 96814875 markings, 437042612 edges, 39095 markings/sec, 395 secs
lola: 96897308 markings, 441195402 edges, 16487 markings/sec, 400 secs
lola: 96934722 markings, 445364944 edges, 7483 markings/sec, 405 secs
lola: 97120221 markings, 449850740 edges, 37100 markings/sec, 410 secs
lola: 97317497 markings, 454341564 edges, 39455 markings/sec, 415 secs
lola: 97353380 markings, 458371392 edges, 7177 markings/sec, 420 secs
lola: 97499339 markings, 463042107 edges, 29192 markings/sec, 425 secs
lola: 97653146 markings, 467816594 edges, 30761 markings/sec, 430 secs
lola: 97749402 markings, 472336161 edges, 19251 markings/sec, 435 secs
lola: 97941530 markings, 476842053 edges, 38426 markings/sec, 440 secs
lola: 98081728 markings, 481330430 edges, 28040 markings/sec, 445 secs
lola: 98266723 markings, 486026096 edges, 36999 markings/sec, 450 secs
lola: 98487356 markings, 490769008 edges, 44127 markings/sec, 455 secs
lola: 98575147 markings, 495350299 edges, 17558 markings/sec, 460 secs
lola: 98976471 markings, 500501989 edges, 80265 markings/sec, 465 secs
lola: 99056120 markings, 505121599 edges, 15930 markings/sec, 470 secs
lola: 99142282 markings, 509584734 edges, 17232 markings/sec, 475 secs
lola: 99331626 markings, 514201963 edges, 37869 markings/sec, 480 secs
lola: 99424606 markings, 518572160 edges, 18596 markings/sec, 485 secs
lola: 99646924 markings, 523311002 edges, 44464 markings/sec, 490 secs
lola: 99754956 markings, 527760454 edges, 21606 markings/sec, 495 secs
lola: 99873387 markings, 532336665 edges, 23686 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes yes unknown no no yes unknown no unknown unknown unknown no unknown unknown no no
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((CPUUnit + 1 <= TaskReady) OR (TaskReady + 1 <= CPUUnit)) OR A (G ((3 <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (((TaskReady <= CPUUnit) AND (CPUUnit <= TaskReady)) AND E(TRUE U (ExecutingTask <= 2)))))
lola: processed formula length: 103
lola: 26 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: 160 markings, 160 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= LoadingMem) OR ((1 <= LoadingMem) AND (1 <= TaskReady))) AND E (G ((TaskOnDisk <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (((2 <= LoadingMem) OR ((1 <= LoadingMem) AND (1 <= TaskReady))) AND NOT(A(TRUE U (FreeMemSegment + 1 <= TaskOnDisk)))))
lola: processed formula length: 130
lola: 23 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: 2821610 markings, 8079850 edges, 564322 markings/sec, 0 secs
lola: 4255405 markings, 15433551 edges, 286759 markings/sec, 5 secs
lola: 5320686 markings, 22389783 edges, 213056 markings/sec, 10 secs
lola: 6448461 markings, 29794493 edges, 225555 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6538081 markings, 31404098 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 759 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= DiskControllerUnit)))))
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: (DiskControllerUnit <= 0)
lola: processed formula length: 25
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: 3298 markings, 6367 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1012 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= TransferToDisk) AND (((1 <= CPUUnit) AND (TaskSuspended <= 1)) OR (CPUUnit <= TaskSuspended))) OR A (G (A (F ((1 <= CPUUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1012 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= CPUUnit)))))
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: (CPUUnit <= 0)
lola: processed formula length: 14
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-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: 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: 11608 markings, 20078 edges
lola: ========================================
lola: subprocess 14 will run for 1519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= TransferToDisk) AND (((1 <= CPUUnit) AND (TaskSuspended <= 1)) OR (CPUUnit <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= TransferToDisk) AND (((1 <= CPUUnit) AND (TaskSuspended <= 1)) OR (CPUUnit <= TaskSuspended)))
lola: processed formula length: 102
lola: 20 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= CPUUnit))) OR (A (G ((3 <= FreeMemSegment))) AND A (F (A (G ((1 <= CPUUnit)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes yes no no no yes unknown no unknown no no no unknown no no no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 23756 KB
lola: time consumption: 2051 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes yes no no no yes unknown no unknown no no no unknown no no no
lola:
preliminary result: yes yes no no no yes unknown no unknown no no no unknown no no no
lola: memory consumption: 23756 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="SmallOperatingSystem-PT-MT0128DC0032"
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/SmallOperatingSystem-PT-MT0128DC0032.tgz
mv SmallOperatingSystem-PT-MT0128DC0032 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 SmallOperatingSystem-PT-MT0128DC0032, 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 r160-smll-152705512400038"
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 ;