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 608K
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 34K 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 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K 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 167K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-PT-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258000569
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528162340626

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-PT-000010 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-000010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ SharedMemory-PT-000010 @ 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: 341/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 131
lola: finding significant places
lola: 131 places, 210 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 240 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-PT-000010-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (Ext_Bus <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: after: (0 <= 9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (Ext_Bus <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: after: (0 <= 9)
lola: always true
lola: LP says that atomic proposition is always true: (3 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: LP says that atomic proposition is always false: (2 <= Ext_Bus)
lola: LP says that atomic proposition is always true: (2 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: LP says that atomic proposition is always true: (1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: A (G (X ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)))) : A ((G (G (TRUE)) U (OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Ext_Mem_Acc_2_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_8_10))) : A (G (G (((Ext_Bus <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9) U TRUE)))) : A (G ((1 <= Active_3 + Active_1 + Active_2 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + Active_10))) : A (G (G (G (G (TRUE))))) : A ((FALSE U G (X (TRUE)))) : A (TRUE) : A ((2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)) : A ((X (G ((Active_6 <= Ext_Mem_Acc_5_2))) U ((Queue_5 <= Ext_Mem_Acc_6_8) U (Ext_Mem_Acc_1_3 <= Ext_Mem_Acc_8_2)))) : A ((Ext_Mem_Acc_5_9 <= Ext_Mem_Acc_7_3)) : A ((Ext_Mem_Acc_10_2 <= Ext_Mem_Acc_2_7)) : A (G ((Ext_Mem_Acc_6_2 <= Ext_Mem_Acc_5_9))) : A (X ((Memory_7 <= Ext_Mem_Acc_8_1))) : A (G (X (F (X ((Memory_3 <= Active_4)))))) : A (G ((Ext_Mem_Acc_5_3 <= Ext_Mem_Acc_2_5))) : A (G ((Ext_Mem_Acc_2_3 <= Ext_Mem_Acc_9_7)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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 SharedMemory-PT-000010-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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 SharedMemory-PT-000010-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 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: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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 SharedMemory-PT-000010-LTLCardinality-6 TRUE 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: (2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)
lola: processed formula length: 105
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: processed formula with 1 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-000010-LTLCardinality-7 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: (Ext_Mem_Acc_5_9 <= Ext_Mem_Acc_7_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ext_Mem_Acc_5_9 <= Ext_Mem_Acc_7_3)
lola: processed formula length: 36
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: processed formula with 1 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 SharedMemory-PT-000010-LTLCardinality-9 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: (Ext_Mem_Acc_10_2 <= Ext_Mem_Acc_2_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ext_Mem_Acc_10_2 <= Ext_Mem_Acc_2_7)
lola: processed formula length: 37
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: processed formula with 1 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 SharedMemory-PT-000010-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((Active_6 <= Ext_Mem_Acc_5_2))) U ((Queue_5 <= Ext_Mem_Acc_6_8) U (Ext_Mem_Acc_1_3 <= Ext_Mem_Acc_8_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((Active_6 <= Ext_Mem_Acc_5_2))) U ((Queue_5 <= Ext_Mem_Acc_6_8) U (Ext_Mem_Acc_1_3 <= Ext_Mem_Acc_8_2))))
lola: processed formula length: 115
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9))))
lola: processed formula length: 254
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Memory_7 <= Ext_Mem_Acc_8_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((Memory_7 <= Ext_Mem_Acc_8_1)))
lola: processed formula length: 37
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Ext_Mem_Acc_6_2 <= Ext_Mem_Acc_5_9)))
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 ((Ext_Mem_Acc_6_2 <= Ext_Mem_Acc_5_9)))
lola: processed formula length: 44
lola: 33 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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_9 + 1 <= Ext_Mem_Acc_6_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000010-LTLCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Ext_Mem_Acc_5_3 <= Ext_Mem_Acc_2_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 ((Ext_Mem_Acc_5_3 <= Ext_Mem_Acc_2_5)))
lola: processed formula length: 44
lola: 33 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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_2_5 + 1 <= Ext_Mem_Acc_5_3)
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: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file SharedMemory-PT-000010-LTLCardinality-10-0.sara.
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Ext_Mem_Acc_2_3 <= Ext_Mem_Acc_9_7)))
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 ((Ext_Mem_Acc_2_3 <= Ext_Mem_Acc_9_7)))
lola: processed formula length: 44
lola: 33 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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_9_7 + 1 <= Ext_Mem_Acc_2_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000010-LTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Active_3 + Active_1 + Active_2 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + Active_10)))
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 <= Active_3 + Active_1 + Active_2 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + Active_10)))
lola: processed formula length: 123
lola: 33 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.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: (Active_3 + Active_1 + Active_2 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + Active_10 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-PT-000010-LTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Ext_Mem_Acc_2_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Ext_Mem_Acc_2_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_... (shortened)
lola: processed formula length: 1783
lola: 33 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Memory_3 <= Active_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Memory_3 <= Active_4))))
lola: processed formula length: 34
lola: 31 rewrites
lola: closed formula file SharedMemory-PT-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 40 edges
lola: ========================================

FORMULA SharedMemory-PT-000010-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no yes yes yes no no no no no
lola:
preliminary result: no yes yes no yes yes yes no yes yes yes no no no no no
lola: memory consumption: 19300 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1528162341072

--------------------
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-000010"
export BK_EXAMINATION="LTLCardinality"
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-000010.tgz
mv SharedMemory-PT-000010 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-000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732258000569"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;