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 376K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-PT-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708742900103
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527167190458

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-PT-000005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SharedMemory-PT-000005 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ SharedMemory-PT-000005 @ 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: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 41
lola: finding significant places
lola: 41 places, 55 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-PT-000005-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (3 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= Ext_Bus)
lola: LP says that atomic proposition is always true: (3 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5)
lola: LP says that atomic proposition is always false: (2 <= Ext_Bus)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5)
lola: LP says that atomic proposition is always false: (3 <= Queue_1)
lola: LP says that atomic proposition is always false: (3 <= OwnMemAcc_2)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_2_4)
lola: LP says that atomic proposition is always false: (3 <= Memory_3)
lola: LP says that atomic proposition is always false: (2 <= Ext_Mem_Acc_4_1)
lola: LP says that atomic proposition is always false: (2 <= Memory_3)
lola: LP says that atomic proposition is always false: (3 <= OwnMemAcc_5)
lola: E (F ((((Ext_Bus <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4) AND (1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)) OR (Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)))) : A (G (((3 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5))))) : E (F (((((2 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5))) OR ((3 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5))))) : E (F ((Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= 0))) : A (G (((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Ext_Bus) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + 1 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4) AND (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5)))) : A (G ((1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5))) : A (G ((((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4) AND (2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND (OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND (2 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5))))) : A (G (((2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) OR (Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5))))) : E (F (((OwnMemAcc_5 <= Active_5) OR ((Ext_Mem_Acc_3_4 + 1 <= OwnMemAcc_5))))) : A (G (())) : E (F (())) : A (G (((1 <= OwnMemAcc_1) AND (Active_1 + 1 <= Ext_Mem_Acc_4_5) AND (Queue_1 <= Ext_Mem_Acc_5_3)))) : A (G (((Memory_4 <= Ext_Mem_Acc_5_2) OR (Ext_Mem_Acc_4_5 <= OwnMemAcc_1)))) : E (F ((OwnMemAcc_5 <= OwnMemAcc_3))) : E (F (FALSE)) : E (F (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 12 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-ReachabilityCardinality-9 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 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: 12 rewrites
lola: closed formula file SharedMemory-PT-000005-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 SharedMemory-PT-000005-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((OwnMemAcc_5 <= OwnMemAcc_3)))
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 ((OwnMemAcc_5 <= OwnMemAcc_3)))
lola: processed formula length: 36
lola: 13 rewrites
lola: closed formula file SharedMemory-PT-000005-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: (OwnMemAcc_5 <= OwnMemAcc_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-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 (((OwnMemAcc_5 <= Active_5) OR ((Ext_Mem_Acc_3_4 + 1 <= OwnMemAcc_5)))))
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 (((OwnMemAcc_5 <= Active_5) OR ((Ext_Mem_Acc_3_4 + 1 <= OwnMemAcc_5)))))
lola: processed formula length: 78
lola: 13 rewrites
lola: closed formula file SharedMemory-PT-000005-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: ((OwnMemAcc_5 <= Active_5) OR ((Ext_Mem_Acc_3_4 + 1 <= OwnMemAcc_5)))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Memory_4 <= Ext_Mem_Acc_5_2) OR (Ext_Mem_Acc_4_5 <= OwnMemAcc_1))))
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 (((Memory_4 <= Ext_Mem_Acc_5_2) OR (Ext_Mem_Acc_4_5 <= OwnMemAcc_1))))
lola: processed formula length: 76
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: ((Ext_Mem_Acc_5_2 + 1 <= Memory_4) AND (OwnMemAcc_1 + 1 <= Ext_Mem_Acc_4_5))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 5 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)))
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 ((1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)))
lola: processed formula length: 62
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-7-0.sara

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= OwnMemAcc_1) AND (Active_1 + 1 <= Ext_Mem_Acc_4_5) AND (Queue_1 <= Ext_Mem_Acc_5_3))))
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 (((1 <= OwnMemAcc_1) AND (Active_1 + 1 <= Ext_Mem_Acc_4_5) AND (Queue_1 <= Ext_Mem_Acc_5_3))))
lola: processed formula length: 99
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: ((OwnMemAcc_1 <= 0) OR (Ext_Mem_Acc_4_5 <= Active_1) OR (Ext_Mem_Acc_5_3 + 1 <= Queue_1))
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5)))))
lola: processed formula length: 205
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 0 markings, 0 edges
lola: formula 0: ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= 2) OR ((OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5)))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-9-0.sara
sara: try reading problem file SharedMemory-PT-000005-ReachabilityCardinality-6-0.sara.
lola: state equation: calling and running sara
lola: ========================================

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-1 FALSE 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: A (G (((2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) OR (Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)))))
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 (((2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND ((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) OR (Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)))))
lola: processed formula length: 290
sara: try reading problem file SharedMemory-PT-000005-ReachabilityCardinality-9-0.sara.
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: 0 markings, 0 edges
lola: formula 0: ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= 1) OR ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + 1 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-7 FALSE 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: ========================================
lola: ...considering subproblem: E (F (((((2 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5))) OR ((3 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5)))))
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 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5))) OR ((3 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5)))))
lola: processed formula length: 264
lola: 13 rewrites
lola: closed formula file SharedMemory-PT-000005-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 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5))) OR ((3 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) AND (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file SharedMemory-PT-000005-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-2 TRUE 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: E (F ((Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= 0)))
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 ((Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= 0)))
lola: processed formula length: 372
lola: 13 rewrites
lola: closed formula file SharedMemory-PT-000005-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: formula 0: (Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-12-0.sara
lola: ========================================
lola:
FORMULA SharedMemory-PT-000005-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((Ext_Bus <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + ... (shortened)
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 ((((Ext_Bus <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + ... (shortened)
lola: processed formula length: 966
lola: 13 rewrites
lola: closed formula file SharedMemory-PT-000005-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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: formula 0: (((Ext_Bus <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4) AND (1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5)) OR (Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc... (shortened)
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 ((((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc... (shortened)
lola: processed formula length: 695
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694

FORMULA SharedMemory-PT-000005-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: formula 0: (((Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + 1 <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) OR (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 <= 1) OR (Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5) OR (OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 <= 1)))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-14-0.sara
lola: ========================================
sara: try reading problem file SharedMemory-PT-000005-ReachabilityCardinality-12-0.sara.


lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Ext_Bus) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + 1 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Ext_Bus) AND (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + 1 <= Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc... (shortened)
lola: processed formula length: 613
lola: 14 rewrites
lola: closed formula file SharedMemory-PT-000005-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Ext_Bus <= Active_1 + Active_2 + Active_3 + Active_4 + Active_5) OR (Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5) OR (Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5))
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000005-ReachabilityCardinality-15-0.sara
lola:
FORMULA SharedMemory-PT-000005-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no yes no no no no yes no no
lola:
preliminary result: yes no yes yes no no no no yes no no no no yes no no
lola: memory consumption: 22816 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-PT-000005"
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/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 SharedMemory-PT-000005, 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 r172-smll-152708742900103"
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 ;