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 2.7M
-rw-r--r-- 1 mcc users 2.9K May 29 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 29 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 28 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 28 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 28 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 28 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.4K May 27 05:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 27 05:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 26 06:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 06:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 2.5M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145700394
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528092776561

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-3b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DLCflexbar-PT-3b formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ DLCflexbar-PT-3b @ 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: 17800/65536 symbol table entries, 5786 collisions
lola: preprocessing...
lola: Size of bit vector: 7245
lola: finding significant places
lola: 7245 places, 10555 transitions, 6890 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14419 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-3b-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p4633)
lola: LP says that atomic proposition is always false: (3 <= p5741)
lola: LP says that atomic proposition is always false: (2 <= p6801)
lola: LP says that atomic proposition is always false: (2 <= p3667)
lola: LP says that atomic proposition is always false: (2 <= p5333)
lola: LP says that atomic proposition is always false: (3 <= p5834)
lola: LP says that atomic proposition is always false: (3 <= p6467)
lola: LP says that atomic proposition is always false: (3 <= p520)
lola: LP says that atomic proposition is always false: (3 <= p568)
lola: LP says that atomic proposition is always false: (3 <= p1200)
lola: LP says that atomic proposition is always false: (3 <= p132)
lola: LP says that atomic proposition is always false: (2 <= p3515)
lola: LP says that atomic proposition is always false: (2 <= p1850)
lola: LP says that atomic proposition is always false: (3 <= p4797)
lola: LP says that atomic proposition is always false: (3 <= p848)
lola: A (G (())) : E (F (())) : E (F (((p2774 + 1 <= p4415)))) : E (F ((((p5787 <= p3795) OR (1 <= p4305)) AND (1 <= p284)))) : E (F (((1 <= p173)))) : A (G ((p4321 <= p3591))) : E (F (((p3692 + 1 <= p6734) AND (p5872 <= p6785)))) : E (F (((p519 + 1 <= p5007) OR (p5247 + 1 <= p3050)))) : E (F (FALSE)) : E (F ((1 <= p2016))) : E (F ((p223 + 1 <= p3700))) : E (F ((((p2602 + 1 <= p2580) OR (p3160 + 1 <= p6934))))) : E (F (FALSE)) : A (G ((((p3132 <= 0) AND (p4767 <= 0)) OR (p5602 + 1 <= p5532)))) : A (G (((p4537 <= p273)))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 206 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-3b-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 220 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-3b-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 236 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-3b-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 254 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-3b-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 275 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: 15 rewrites
lola: closed formula file DLCflexbar-PT-3b-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p173))))
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 <= p173))))
lola: processed formula length: 21
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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 <= p173))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1207 markings, 1354 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p2016)))
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 <= p2016)))
lola: processed formula length: 20
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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 <= p2016)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 159 markings, 158 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p223 + 1 <= p3700)))
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 ((p223 + 1 <= p3700)))
lola: processed formula length: 27
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: (p223 + 1 <= p3700)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p2774 + 1 <= p4415))))
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 (((p2774 + 1 <= p4415))))
lola: processed formula length: 30
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: ((p2774 + 1 <= p4415))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6745 markings, 7363 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p4537 <= p273))))
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 (((p4537 <= p273))))
lola: processed formula length: 25
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: ((p273 + 1 <= p4537))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5224 markings, 5669 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p4321 <= p3591)))
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 ((p4321 <= p3591)))
lola: processed formula length: 24
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: (p3591 + 1 <= p4321)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3905 markings, 4275 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2602 + 1 <= p2580) OR (p3160 + 1 <= p6934)))))
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 ((((p2602 + 1 <= p2580) OR (p3160 + 1 <= p6934)))))
lola: processed formula length: 57
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: (((p2602 + 1 <= p2580) OR (p3160 + 1 <= p6934)))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p5787 <= p3795) OR (1 <= p4305)) AND (1 <= p284))))
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 ((((p5787 <= p3795) OR (1 <= p4305)) AND (1 <= p284))))
lola: processed formula length: 61
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: (((p5787 <= p3795) OR (1 <= p4305)) AND (1 <= p284))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1161 markings, 1300 edges

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3132 <= 0) AND (p4767 <= 0)) OR (p5602 + 1 <= p5532))))
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 ((((p3132 <= 0) AND (p4767 <= 0)) OR (p5602 + 1 <= p5532))))
lola: processed formula length: 66
lola: 17 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: (((1 <= p3132) OR (1 <= p4767)) AND (p5532 <= p5602))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3692 + 1 <= p6734) AND (p5872 <= p6785))))
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 (((p3692 + 1 <= p6734) AND (p5872 <= p6785))))
lola: processed formula length: 51
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: ((p3692 + 1 <= p6734) AND (p5872 <= p6785))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 908 markings, 957 edges

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p519 + 1 <= p5007) OR (p5247 + 1 <= p3050))))
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 (((p519 + 1 <= p5007) OR (p5247 + 1 <= p3050))))
lola: processed formula length: 54
lola: 16 rewrites
lola: closed formula file DLCflexbar-PT-3b-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: ((p519 + 1 <= p5007) OR (p5247 + 1 <= p3050))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3b-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3b-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================

FORMULA DLCflexbar-PT-3b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes yes no yes yes yes no no no yes
lola:
preliminary result: yes no yes yes yes no yes yes no yes yes yes no no no yes
lola: memory consumption: 38136 KB
lola: time consumption: 262 seconds

BK_STOP 1528093039708

--------------------
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="DLCflexbar-PT-3b"
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/DLCflexbar-PT-3b.tgz
mv DLCflexbar-PT-3b 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 DLCflexbar-PT-3b, 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 r268-smll-152749145700394"
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 ;