fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r100-smll-152658630600061
Last Updated
June 26, 2018

About the Execution of LoLA for HouseConstruction-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
149.300 383.00 90.00 2.50 TTTTFTTTTTTFFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HouseConstruction-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630600061
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526703456569

info: Time: 3600 - MCC
===========================================================================================
prep: translating HouseConstruction-PT-005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HouseConstruction-PT-005 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ HouseConstruction-PT-005 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-005-ReachabilityCardinality.task
lola: E (F ((3 <= p16))) : E (F ((3 <= p26))) : E (F (((3 <= p18) AND (p2 <= p12)))) : E (F ((2 <= p20))) : E (F (((3 <= p15) AND (p23 <= p19) AND (p18 <= p15) AND (p23 + 1 <= p16) AND (2 <= p6)))) : A (G (((p1 + 1 <= p3) OR (p10 <= 1) OR (1 <= p10)))) : E (F ((3 <= p26))) : E (F (((p10 <= 2) AND (p9 + 1 <= p21) AND (p13 <= p7) AND (3 <= p25) AND ((p19 <= p27) OR (p25 <= p23))))) : E (F (((p20 + 1 <= p14) AND (p7 <= 2) AND (3 <= p14)))) : E (F (((p18 + 1 <= p21) AND (p14 + 1 <= p17) AND (p2 <= 1)))) : E (F ((((3 <= p19) AND (p19 <= p1)) OR ((p10 <= p23) AND (p5 <= p14) AND (2 <= p22) AND (p10 <= p8))))) : A (G (((p17 <= p27) OR (p21 <= p13) OR (p17 <= p16) OR ((p26 + 1 <= p4) AND ((3 <= p13) OR (p2 <= p20)))))) : A (G (((p27 <= 1) OR (p26 + 1 <= p2) OR (((p23 <= p20) OR (p15 <= p1)) AND (p21 <= 2))))) : E (F (((1 <= p26) AND (3 <= p5)))) : E (F (((3 <= p23) AND ((2 <= p2) OR (3 <= p2) OR (p3 <= 1))))) : E (F (((2 <= p22) AND ((p9 <= p12) OR (1 <= p18)) AND (3 <= p3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p16)))
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 ((3 <= p16)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p16)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-0 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: E (F ((3 <= p26)))
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 ((3 <= p26)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p26)
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p20)))
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 ((2 <= p20)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (2 <= p20)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p26)))
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 ((3 <= p26)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
try reading problem file HouseConstruction-PT-005-ReachabilityCardinality-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p26)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-6 TRUE 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: E (F (((1 <= p26) AND (3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= p26) AND (3 <= p5))))
lola: processed formula length: 34
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p26) AND (3 <= p5))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-13 TRUE 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: E (F (((3 <= p18) AND (p2 <= p12))))
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 (((3 <= p18) AND (p2 <= p12))))
lola: processed formula length: 36
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= p18) AND (p2 <= p12))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + 1 <= p14) AND (p7 <= 2) AND (3 <= p14))))
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 (((p20 + 1 <= p14) AND (p7 <= 2) AND (3 <= p14))))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p20 + 1 <= p14) AND (p7 <= 2) AND (3 <= p14))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-6-0.sara
lola: ========================================

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

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-5 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 (((3 <= p23) AND ((2 <= p2) OR (3 <= p2) OR (p3 <= 1)))))
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 (((3 <= p23) AND ((2 <= p2) OR (3 <= p2) OR (p3 <= 1)))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= p23) AND ((2 <= p2) OR (3 <= p2) OR (p3 <= 1)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-8-0.sara

lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: sara: place or transition ordering is non-deterministic
subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p18 + 1 <= p21) AND (p14 + 1 <= p17) AND (p2 <= 1))))
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 (((p18 + 1 <= p21) AND (p14 + 1 <= p17) AND (p2 <= 1))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p18 + 1 <= p21) AND (p14 + 1 <= p17) AND (p2 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-9-0.sara
lola: lola: state equation: calling and running sara

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p22) AND ((p9 <= p12) OR (1 <= p18)) AND (3 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
sara: try reading problem file HouseConstruction-PT-005-ReachabilityCardinality-9-0.sara.
lola: processed formula: E (F (((2 <= p22) AND ((p9 <= p12) OR (1 <= p18)) AND (3 <= p3))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: sara: place or transition ordering is non-deterministic
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: ((2 <= p22) AND ((p9 <= p12) OR (1 <= p18)) AND (3 <= p3))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
lola:
FORMULA HouseConstruction-PT-005-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file HouseConstruction-PT-005-ReachabilityCardinality-10-0.sara.
lola: ...considering subproblem: E (F (((3 <= p15) AND (p23 <= p19) AND (p18 <= p15) AND (p23 + 1 <= p16) AND (2 <= p6))))
sara: place or transition ordering is non-deterministic
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 (((3 <= p15) AND (p23 <= p19) AND (p18 <= p15) AND (p23 + 1 <= p16) AND (2 <= p6))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= p15) AND (p23 <= p19) AND (p18 <= p15) AND (p23 + 1 <= p16) AND (2 <= p6))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 508 markings, 578 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p27 <= 1) OR (p26 + 1 <= p2) OR (((p23 <= p20) OR (p15 <= p1)) AND (p21 <= 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:694
lola: processed formula: A (G (((p27 <= 1) OR (p26 + 1 <= p2) OR (((p23 <= p20) OR (p15 <= p1)) AND (p21 <= 2)))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: formula 0: ((2 <= p27) AND (p2 <= p26) AND (((p20 + 1 <= p23) AND (p1 + 1 <= p15)) OR (3 <= p21)))
lola:
FORMULA HouseConstruction-PT-005-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p19) AND (p19 <= p1)) OR ((p10 <= p23) AND (p5 <= p14) AND (2 <= p22) AND (p10 <= p8)))))
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 ((((3 <= p19) AND (p19 <= p1)) OR ((p10 <= p23) AND (p5 <= p14) AND (2 <= p22) AND (p10 <= p8)))))
lola: processed formula length: 104
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((3 <= p19) AND (p19 <= p1)) OR ((p10 <= p23) AND (p5 <= p14) AND (2 <= p22) AND (p10 <= p8)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p10 <= 2) AND (p9 + 1 <= p21) AND (p13 <= p7) AND (3 <= p25) AND ((p19 <= p27) OR (p25 <= p23)))))
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 (((p10 <= 2) AND (p9 + 1 <= p21) AND (p13 <= p7) AND (3 <= p25) AND ((p19 <= p27) OR (p25 <= p23)))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p10 <= 2) AND (p9 + 1 <= p21) AND (p13 <= p7) AND (3 <= p25) AND ((p19 <= p27) OR (p25 <= p23)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 38 markings, 37 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p17 <= p27) OR (p21 <= p13) OR (p17 <= p16) OR ((p26 + 1 <= p4) AND ((3 <= p13) OR (p2 <= p20))))))
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 (((p17 <= p27) OR (p21 <= p13) OR (p17 <= p16) OR ((p26 + 1 <= p4) AND ((3 <= p13) OR (p2 <= p20))))))
lola: processed formula length: 111
lola: 2 rewrites
lola: closed formula file HouseConstruction-PT-005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p27 + 1 <= p17) AND (p13 + 1 <= p21) AND (p16 + 1 <= p17) AND ((p4 <= p26) OR ((p13 <= 2) AND (p20 + 1 <= p2))))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-005-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HouseConstruction-PT-005-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file HouseConstruction-PT-005-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes yes yes yes no no yes yes yes
lola:
preliminary result: yes yes yes yes no yes yes yes yes yes yes no no yes yes yes

lola: memory consumption: 24536 KB
lola: time consumption: 0 seconds

BK_STOP 1526703456952

--------------------
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="HouseConstruction-PT-005"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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