About the Execution of LoLA for DLCflexbar-PT-5b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 736.140 | 2048268.00 | 2482983.00 | 4121.80 | TTTTFFFFTTTFTTFT | 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 6.6M
-rw-r--r-- 1 mcc users 3.6K May 29 20:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 29 20:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 28 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 28 16:26 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.5K May 28 09:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 28 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 27 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 27 07:53 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.7K May 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 09:34 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 6.5M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-5b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145700430
=====================================================================
--------------------
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-5b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-5b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1528121720474
info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-5b 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-5b formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ DLCflexbar-PT-5b @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43788/65536 symbol table entries, 19548 collisions
lola: preprocessing...
lola: Size of bit vector: 17305
lola: finding significant places
lola: 17305 places, 26483 transitions, 16326 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 37603 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-5b-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p15068)
lola: LP says that atomic proposition is always false: (3 <= p606)
lola: LP says that atomic proposition is always false: (3 <= p15809)
lola: LP says that atomic proposition is always false: (2 <= p9814)
lola: LP says that atomic proposition is always false: (2 <= p5890)
lola: LP says that atomic proposition is always false: (3 <= p3820)
lola: LP says that atomic proposition is always false: (3 <= p10351)
lola: LP says that atomic proposition is always false: (3 <= p4309)
lola: LP says that atomic proposition is always false: (3 <= p5741)
lola: LP says that atomic proposition is always false: (2 <= p12728)
lola: LP says that atomic proposition is always false: (3 <= p15724)
lola: LP says that atomic proposition is always false: (3 <= p12761)
lola: LP says that atomic proposition is always false: (3 <= p8221)
lola: LP says that atomic proposition is always false: (2 <= p6896)
lola: LP says that atomic proposition is always false: (2 <= p13929)
lola: LP says that atomic proposition is always false: (2 <= p11875)
lola: LP says that atomic proposition is always false: (3 <= p15559)
lola: LP says that atomic proposition is always false: (2 <= p7610)
lola: LP says that atomic proposition is always false: (3 <= p2296)
lola: LP says that atomic proposition is always false: (3 <= p8027)
lola: LP says that atomic proposition is always false: (2 <= p2477)
lola: E (F (((p14523 + 1 <= p4911)))) : A (G (TRUE)) : E (F ((p1561 + 1 <= p13545))) : E (F ((((p2060 <= p17171) OR (p11800 <= p15438) OR (p3343 + 1 <= p3473)) AND ((p5316 + 1 <= p668) OR (p13899 + 1 <= p5838))))) : A (G ((((p287 <= p608) OR (p13708 <= p16173))))) : A (G (((p449 <= p5654) OR (p6244 + 1 <= p16026) OR (p4678 <= p7289)))) : A (G ((((p12947 <= p16894) AND (p12930 <= p14823) AND ((p15180 <= p15359) OR (p16452 <= p3008))) OR ((p9135 <= p8156) AND ((p2142 <= p10291)))))) : E (F (FALSE)) : A (G (())) : A (G ((((p8093 <= p7490) OR (p7942 <= p3212))))) : E (F (((p12676 <= p13821) AND ((p12647 + 1 <= p7655))))) : E (F (())) : E (F ((1 <= p8248))) : A (G (())) : E (F (FALSE)) : E (F ((p16083 + 1 <= p8190)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 120 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: 18 rewrites
lola: closed formula file DLCflexbar-PT-5b-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-5b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 128 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: 18 rewrites
lola: closed formula file DLCflexbar-PT-5b-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-5b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 137 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: 18 rewrites
lola: closed formula file DLCflexbar-PT-5b-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-5b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 148 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: 18 rewrites
lola: closed formula file DLCflexbar-PT-5b-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-5b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 160 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: 18 rewrites
lola: closed formula file DLCflexbar-PT-5b-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-5b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 175 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: 18 rewrites
lola: closed formula file DLCflexbar-PT-5b-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-5b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p8248)))
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 <= p8248)))
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file DLCflexbar-PT-5b-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 <= p8248)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-6-0.sara.
lola: sara is running 0 secs || 3796 markings, 4161 edges, 759 markings/sec, 0 secs
lola: sara is running 5 secs || 8123 markings, 8952 edges, 865 markings/sec, 5 secs
lola: sara is running 10 secs || 12226 markings, 13483 edges, 821 markings/sec, 10 secs
lola: sara is running 15 secs || 16232 markings, 17906 edges, 801 markings/sec, 15 secs
lola: sara is running 20 secs || 20047 markings, 22126 edges, 763 markings/sec, 20 secs
lola: sara is running 25 secs || 23632 markings, 26094 edges, 717 markings/sec, 25 secs
lola: sara is running 30 secs || 27098 markings, 29923 edges, 693 markings/sec, 30 secs
lola: sara is running 35 secs || 30439 markings, 33617 edges, 668 markings/sec, 35 secs
lola: sara is running 40 secs || 34698 markings, 38367 edges, 852 markings/sec, 40 secs
lola: sara is running 45 secs || 41380 markings, 46027 edges, 1336 markings/sec, 45 secs
lola: sara is running 50 secs || 49141 markings, 54940 edges, 1552 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50277 markings, 56240 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p14523 + 1 <= p4911))))
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 (((p14523 + 1 <= p4911))))
lola: processed formula length: 31
lola: 19 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: ((p14523 + 1 <= p4911))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1561 + 1 <= p13545)))
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 ((p1561 + 1 <= p13545)))
lola: processed formula length: 29
lola: 19 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: (p1561 + 1 <= p13545)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 4544 markings, 5144 edges, 909 markings/sec, 0 secs
lola: sara is running 5 secs || 9389 markings, 10673 edges, 969 markings/sec, 5 secs
lola: sara is running 10 secs || 13372 markings, 15223 edges, 797 markings/sec, 10 secs
lola: sara is running 15 secs || 16945 markings, 19469 edges, 715 markings/sec, 15 secs
lola: sara is running 20 secs || 20815 markings, 24170 edges, 774 markings/sec, 20 secs
lola: sara is running 25 secs || 24787 markings, 28992 edges, 794 markings/sec, 25 secs
lola: sara is running 30 secs || 31448 markings, 36454 edges, 1332 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33207 markings, 38381 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p16083 + 1 <= p8190)))
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 ((p16083 + 1 <= p8190)))
lola: processed formula length: 29
lola: 19 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: (p16083 + 1 <= p8190)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 900 markings, 899 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12676 <= p13821) AND ((p12647 + 1 <= p7655)))))
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 (((p12676 <= p13821) AND ((p12647 + 1 <= p7655)))))
lola: processed formula length: 56
lola: 19 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: ((p12676 <= p13821) AND ((p12647 + 1 <= p7655)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 362 markings, 361 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p287 <= p608) OR (p13708 <= p16173)))))
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 ((((p287 <= p608) OR (p13708 <= p16173)))))
lola: processed formula length: 49
lola: 20 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: (((p608 + 1 <= p287) AND (p16173 + 1 <= p13708)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 4167 markings, 4710 edges, 833 markings/sec, 0 secs
lola: sara is running 5 secs || 9181 markings, 10811 edges, 1003 markings/sec, 5 secs
lola: sara is running 10 secs || 14645 markings, 17890 edges, 1093 markings/sec, 10 secs
lola: sara is running 15 secs || 20179 markings, 24582 edges, 1107 markings/sec, 15 secs
lola: sara is running 20 secs || 25790 markings, 31547 edges, 1122 markings/sec, 20 secs
lola: sara is running 25 secs || 31171 markings, 37776 edges, 1076 markings/sec, 25 secs
lola: sara is running 30 secs || 36280 markings, 43753 edges, 1022 markings/sec, 30 secs
lola: sara is running 35 secs || 41216 markings, 49518 edges, 987 markings/sec, 35 secs
lola: sara is running 40 secs || 45972 markings, 55078 edges, 951 markings/sec, 40 secs
lola: sara is running 45 secs || 50544 markings, 60427 edges, 914 markings/sec, 45 secs
lola: sara is running 50 secs || 54656 markings, 65255 edges, 822 markings/sec, 50 secs
lola: sara is running 55 secs || 58312 markings, 69550 edges, 731 markings/sec, 55 secs
lola: sara is running 60 secs || 61792 markings, 73605 edges, 696 markings/sec, 60 secs
lola: sara is running 65 secs || 65276 markings, 77713 edges, 697 markings/sec, 65 secs
lola: sara is running 70 secs || 68818 markings, 81858 edges, 708 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69461 markings, 82579 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p8093 <= p7490) OR (p7942 <= p3212)))))
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 ((((p8093 <= p7490) OR (p7942 <= p3212)))))
lola: processed formula length: 49
lola: 20 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: (((p7490 + 1 <= p8093) AND (p3212 + 1 <= p7942)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-12-0.sara.
lola: sara is running 0 secs || 11065 markings, 12273 edges, 2213 markings/sec, 0 secs
lola: sara is running 5 secs || 21538 markings, 23932 edges, 2095 markings/sec, 5 secs
lola: sara is running 10 secs || 29704 markings, 33147 edges, 1633 markings/sec, 10 secs
lola: sara is running 15 secs || 38478 markings, 43081 edges, 1755 markings/sec, 15 secs
lola: sara is running 20 secs || 50137 markings, 56232 edges, 2332 markings/sec, 20 secs
lola: sara is running 25 secs || 57524 markings, 64528 edges, 1477 markings/sec, 25 secs
lola: sara is running 30 secs || 63952 markings, 71782 edges, 1286 markings/sec, 30 secs
lola: sara is running 35 secs || 70437 markings, 79111 edges, 1297 markings/sec, 35 secs
lola: sara is running 40 secs || 77047 markings, 86589 edges, 1322 markings/sec, 40 secs
lola: sara is running 45 secs || 83765 markings, 94287 edges, 1344 markings/sec, 45 secs
lola: sara is running 50 secs || 91387 markings, 102916 edges, 1524 markings/sec, 50 secs
lola: sara is running 55 secs || 98361 markings, 110875 edges, 1395 markings/sec, 55 secs
lola: sara is running 60 secs || 104890 markings, 118333 edges, 1306 markings/sec, 60 secs
lola: sara is running 65 secs || 111830 markings, 126237 edges, 1388 markings/sec, 65 secs
lola: sara is running 70 secs || 118088 markings, 133318 edges, 1252 markings/sec, 70 secs
lola: sara is running 75 secs || 124312 markings, 140388 edges, 1245 markings/sec, 75 secs
lola: sara is running 80 secs || 130824 markings, 147799 edges, 1302 markings/sec, 80 secs
lola: sara is running 85 secs || 137396 markings, 155259 edges, 1314 markings/sec, 85 secs
lola: sara is running 90 secs || 143830 markings, 162524 edges, 1287 markings/sec, 90 secs
lola: sara is running 95 secs || 150426 markings, 170044 edges, 1319 markings/sec, 95 secs
lola: sara is running 100 secs || 156664 markings, 177196 edges, 1248 markings/sec, 100 secs
lola: sara is running 105 secs || 163713 markings, 185235 edges, 1410 markings/sec, 105 secs
lola: sara is running 110 secs || 169956 markings, 192274 edges, 1249 markings/sec, 110 secs
lola: sara is running 115 secs || 176198 markings, 199369 edges, 1248 markings/sec, 115 secs
lola: sara is running 120 secs || 182819 markings, 206898 edges, 1324 markings/sec, 120 secs
lola: sara is running 125 secs || 189172 markings, 214114 edges, 1271 markings/sec, 125 secs
lola: sara is running 130 secs || 195623 markings, 221397 edges, 1290 markings/sec, 130 secs
lola: sara is running 135 secs || 202141 markings, 228833 edges, 1304 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || 208422 markings, 236047 edges, 1256 markings/sec, 140 secs
lola: sara is running 145 secs || 215529 markings, 244065 edges, 1421 markings/sec, 145 secs
lola: sara is running 150 secs || 221763 markings, 251091 edges, 1247 markings/sec, 150 secs
lola: sara is running 155 secs || 227992 markings, 258173 edges, 1246 markings/sec, 155 secs
lola: sara is running 160 secs || 234620 markings, 265713 edges, 1326 markings/sec, 160 secs
lola: sara is running 165 secs || 241713 markings, 273694 edges, 1419 markings/sec, 165 secs
lola: sara is running 170 secs || 248668 markings, 281555 edges, 1391 markings/sec, 170 secs
lola: sara is running 175 secs || 255587 markings, 289399 edges, 1384 markings/sec, 175 secs
lola: sara is running 180 secs || 262600 markings, 297343 edges, 1403 markings/sec, 180 secs
lola: sara is running 185 secs || 268901 markings, 304477 edges, 1260 markings/sec, 185 secs
lola: sara is running 190 secs || 275168 markings, 311558 edges, 1253 markings/sec, 190 secs
lola: sara is running 195 secs || 281574 markings, 318814 edges, 1281 markings/sec, 195 secs
lola: sara is running 200 secs || 288238 markings, 326459 edges, 1333 markings/sec, 200 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 518 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p449 <= p5654) OR (p6244 + 1 <= p16026) OR (p4678 <= p7289))))
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 (((p449 <= p5654) OR (p6244 + 1 <= p16026) OR (p4678 <= p7289))))
lola: processed formula length: 72
lola: 20 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: ((p5654 + 1 <= p449) AND (p16026 <= p6244) AND (p7289 + 1 <= p4678))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-13-0.sara.
lola: sara is running 0 secs || 3861 markings, 4357 edges, 772 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7445 markings, 8495 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2060 <= p17171) OR (p11800 <= p15438) OR (p3343 + 1 <= p3473)) AND ((p5316 + 1 <= p668) OR (p13899 + 1 <= p5838)))))
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 ((((p2060 <= p17171) OR (p11800 <= p15438) OR (p3343 + 1 <= p3473)) AND ((p5316 + 1 <= p668) OR (p13899 + 1 <= p5838)))))
lola: processed formula length: 129
lola: 19 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: (((p2060 <= p17171) OR (p11800 <= p15438) OR (p3343 + 1 <= p3473)) AND ((p5316 + 1 <= p668) OR (p13899 + 1 <= p5838)))
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 1547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p12947 <= p16894) AND (p12930 <= p14823) AND ((p15180 <= p15359) OR (p16452 <= p3008))) OR ((p9135 <= p8156) AND ((p2142 <= p10291))))))
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 ((((p12947 <= p16894) AND (p12930 <= p14823) AND ((p15180 <= p15359) OR (p16452 <= p3008))) OR ((p9135 <= p8156) AND ((p2142 <= p10291))))))
lola: processed formula length: 147
lola: 20 rewrites
lola: closed formula file DLCflexbar-PT-5b-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: (((p16894 + 1 <= p12947) OR (p14823 + 1 <= p12930) OR ((p15359 + 1 <= p15180) AND (p3008 + 1 <= p16452))) AND ((p8156 + 1 <= p9135) OR ((p10291 + 1 <= p2142))))
lola: state equation: Generated DNF with 14 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-5b-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-5b-ReachabilityCardinality-15-0.sara.
lola: sara is running 0 secs || 3212 markings, 3602 edges, 642 markings/sec, 0 secs
lola: sara is running 5 secs || 8737 markings, 10220 edges, 1105 markings/sec, 5 secs
lola: sara is running 10 secs || 14547 markings, 17218 edges, 1162 markings/sec, 10 secs
lola: sara is running 15 secs || 20392 markings, 24260 edges, 1169 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26237 markings, 31267 edges
lola: ========================================
FORMULA DLCflexbar-PT-5b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes yes yes no yes yes no yes
lola:
preliminary result: yes yes yes yes no no no no yes yes yes no yes yes no yes
lola: memory consumption: 64656 KB
lola: time consumption: 2047 seconds
BK_STOP 1528123768742
--------------------
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-5b"
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-5b.tgz
mv DLCflexbar-PT-5b 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-5b, 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-152749145700430"
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 '
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 ;