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 268K
-rw-r--r-- 1 mcc users 3.8K May 30 20:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 20:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 28 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 06:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 06:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 27 03:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 03:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 89K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-12b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169500120
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527779034332

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-12b 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 DiscoveryGPU-PT-12b formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DiscoveryGPU-PT-12b @ 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 352 places, 374 transitions, 338 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 438 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-12b-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p265)
lola: LP says that atomic proposition is always false: (3 <= p262)
lola: LP says that atomic proposition is always false: (2 <= p299)
lola: LP says that atomic proposition is always false: (2 <= p30)
lola: LP says that atomic proposition is always false: (3 <= p288)
lola: LP says that atomic proposition is always false: (2 <= p260)
lola: LP says that atomic proposition is always false: (2 <= p257)
lola: LP says that atomic proposition is always false: (3 <= p333)
lola: LP says that atomic proposition is always false: (3 <= p175)
lola: LP says that atomic proposition is always false: (2 <= p231)
lola: LP says that atomic proposition is always false: (2 <= p225)
lola: LP says that atomic proposition is always false: (2 <= p306)
lola: LP says that atomic proposition is always false: (2 <= p127)
lola: LP says that atomic proposition is always false: (3 <= p140)
lola: LP says that atomic proposition is always false: (3 <= p46)
lola: LP says that atomic proposition is always false: (3 <= p33)
lola: LP says that atomic proposition is always false: (2 <= p172)
lola: LP says that atomic proposition is always false: (2 <= p293)
lola: LP says that atomic proposition is always false: (2 <= p236)
lola: LP says that atomic proposition is always false: (2 <= p298)
lola: A (X ((() OR A (F ((1 <= p229)))))) : E (G ((p60 <= p296))) : A (F (())) : E (G (TRUE)) : (() AND A (G ((p167 <= p201)))) : (A (F (((p50 + 1 <= p80)))) AND (A (F ((p61 <= p293))) AND (A (X ((p72 <= p143))) AND ()))) : ((NOT(A (G (FALSE))) OR (p332 <= p106)) AND A (G ((p58 <= p15)))) : A (X ((() OR A (G ((p196 <= p236)))))) : A (F (E (X (())))) : E (G ((E (X ((p243 <= p107))) OR (p132 + 1 <= p53)))) : (NOT(A (G ((p177 <= p147)))) OR (1 <= p102)) : A ((E (G ((p154 <= p312))) U E (X ((1 <= p75))))) : E (X (A (G (((p29 <= p318)))))) : (E (((p89 <= p164) U (p11 + 1 <= p14))) OR A (G ((p75 <= p268)))) : NOT(A (F (((1 <= p249) OR ((1 <= p255) AND (p344 <= p87)))))) : ((E (F ((p58 <= p67))) AND (((p271 <= 0) OR (p168 + 1 <= p108)) AND E (F ((1 <= p295))))) OR NOT(A (((p137 <= p60) U FALSE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
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: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
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: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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 DiscoveryGPU-PT-12b-CTLCardinality-3 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 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: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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 DiscoveryGPU-PT-12b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p196 <= p236)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p236 + 1 <= p196)
lola: processed formula length: 18
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is not invariant from successors.
lola: 20 markings, 19 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p229)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p229 <= 0)
lola: processed formula length: 11
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 41 markings, 41 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((p243 <= p107))) OR (p132 + 1 <= p53))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(EX((p243 <= p107))) AND (p53 <= p132))))
lola: processed formula length: 58
lola: 39 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 38 markings, 38 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-9 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 ((E (G ((p154 <= p312))) U E (X ((1 <= p75)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(NOT(A(TRUE U (p312 + 1 <= p154))) U EX((1 <= p75)))
lola: processed formula length: 53
lola: 39 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 181 markings, 257 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-11 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: E (X (A (G (((p29 <= p318))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U ((p318 + 1 <= p29)))))
lola: processed formula length: 38
lola: 38 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 399387 markings, 1527406 edges, 79877 markings/sec, 0 secs
lola: 802938 markings, 3148798 edges, 80710 markings/sec, 5 secs
lola: 1179474 markings, 4740781 edges, 75307 markings/sec, 10 secs
lola: 1557961 markings, 6350599 edges, 75697 markings/sec, 15 secs
lola: 1987176 markings, 8039673 edges, 85843 markings/sec, 20 secs
lola: 2376182 markings, 9726530 edges, 77801 markings/sec, 25 secs
lola: 2763878 markings, 11319580 edges, 77539 markings/sec, 30 secs
lola: 3140027 markings, 12872919 edges, 75230 markings/sec, 35 secs
lola: 3446550 markings, 14420332 edges, 61305 markings/sec, 40 secs
lola: 3745484 markings, 16067581 edges, 59787 markings/sec, 45 secs
lola: 4021048 markings, 17659580 edges, 55113 markings/sec, 50 secs
lola: 4286767 markings, 19195266 edges, 53144 markings/sec, 55 secs
lola: 4607342 markings, 20896628 edges, 64115 markings/sec, 60 secs
lola: 4895171 markings, 22439600 edges, 57566 markings/sec, 65 secs
lola: 5253058 markings, 23972301 edges, 71577 markings/sec, 70 secs
lola: 5627394 markings, 25535082 edges, 74867 markings/sec, 75 secs
lola: 5988946 markings, 27070639 edges, 72310 markings/sec, 80 secs
lola: 6324251 markings, 28594629 edges, 67061 markings/sec, 85 secs
lola: 6665780 markings, 30137091 edges, 68306 markings/sec, 90 secs
lola: 7008149 markings, 31666616 edges, 68474 markings/sec, 95 secs
lola: 7354802 markings, 33185158 edges, 69331 markings/sec, 100 secs
lola: 7704478 markings, 34800448 edges, 69935 markings/sec, 105 secs
lola: 8015522 markings, 36465114 edges, 62209 markings/sec, 110 secs
lola: 8328238 markings, 38136861 edges, 62543 markings/sec, 115 secs
lola: 8656105 markings, 39598426 edges, 65573 markings/sec, 120 secs
lola: 9016426 markings, 41228152 edges, 72064 markings/sec, 125 secs
lola: 9323543 markings, 42869062 edges, 61423 markings/sec, 130 secs
lola: 9673397 markings, 44565326 edges, 69971 markings/sec, 135 secs
lola: 10024390 markings, 46347403 edges, 70199 markings/sec, 140 secs
lola: 10366987 markings, 47887832 edges, 68519 markings/sec, 145 secs
lola: 10703469 markings, 49398140 edges, 67296 markings/sec, 150 secs
lola: 11024687 markings, 50965854 edges, 64244 markings/sec, 155 secs
lola: 11346855 markings, 52516907 edges, 64434 markings/sec, 160 secs
lola: 11649917 markings, 54062125 edges, 60612 markings/sec, 165 secs
lola: 11946343 markings, 55609070 edges, 59285 markings/sec, 170 secs
lola: 12255966 markings, 57137653 edges, 61925 markings/sec, 175 secs
lola: 12576532 markings, 58680900 edges, 64113 markings/sec, 180 secs
lola: 12866255 markings, 60216327 edges, 57945 markings/sec, 185 secs
lola: 13197024 markings, 61823574 edges, 66154 markings/sec, 190 secs
lola: 13478319 markings, 63304204 edges, 56259 markings/sec, 195 secs
lola: 13787728 markings, 64805232 edges, 61882 markings/sec, 200 secs
lola: 14130167 markings, 66358561 edges, 68488 markings/sec, 205 secs
lola: 14481384 markings, 67886686 edges, 70243 markings/sec, 210 secs
lola: 14895170 markings, 69605212 edges, 82757 markings/sec, 215 secs
lola: 15240802 markings, 71378029 edges, 69126 markings/sec, 220 secs
lola: 15622452 markings, 73104889 edges, 76330 markings/sec, 225 secs
lola: 15977001 markings, 74803817 edges, 70910 markings/sec, 230 secs
lola: 16324138 markings, 76559980 edges, 69427 markings/sec, 235 secs
lola: 16663490 markings, 78283432 edges, 67870 markings/sec, 240 secs
lola: 17045708 markings, 80031051 edges, 76444 markings/sec, 245 secs
lola: 17447402 markings, 81796250 edges, 80339 markings/sec, 250 secs
lola: 17835639 markings, 83601963 edges, 77647 markings/sec, 255 secs
lola: 18159996 markings, 85324057 edges, 64871 markings/sec, 260 secs
lola: 18495880 markings, 87014636 edges, 67177 markings/sec, 265 secs
lola: 18894657 markings, 88752742 edges, 79755 markings/sec, 270 secs
lola: 19278207 markings, 90521780 edges, 76710 markings/sec, 275 secs
lola: 19634607 markings, 92307563 edges, 71280 markings/sec, 280 secs
lola: 19985356 markings, 94077993 edges, 70150 markings/sec, 285 secs
lola: 20363532 markings, 95849509 edges, 75635 markings/sec, 290 secs
lola: 20743410 markings, 97585129 edges, 75976 markings/sec, 295 secs
lola: 21127468 markings, 99407964 edges, 76812 markings/sec, 300 secs
lola: 21495336 markings, 101193231 edges, 73574 markings/sec, 305 secs
lola: 21852617 markings, 103006498 edges, 71456 markings/sec, 310 secs
lola: 22194531 markings, 104791789 edges, 68383 markings/sec, 315 secs
lola: 22575232 markings, 106567979 edges, 76140 markings/sec, 320 secs
lola: 22905580 markings, 108348741 edges, 66070 markings/sec, 325 secs
lola: 23268875 markings, 110110107 edges, 72659 markings/sec, 330 secs
lola: 23606907 markings, 111877111 edges, 67606 markings/sec, 335 secs
lola: 23939757 markings, 113703996 edges, 66570 markings/sec, 340 secs
lola: 24256978 markings, 115518352 edges, 63444 markings/sec, 345 secs
lola: 24558331 markings, 117337457 edges, 60271 markings/sec, 350 secs
lola: 24870983 markings, 119151503 edges, 62530 markings/sec, 355 secs
lola: 25176339 markings, 120984306 edges, 61071 markings/sec, 360 secs
lola: 25506220 markings, 122803549 edges, 65976 markings/sec, 365 secs
lola: 25796397 markings, 124643517 edges, 58035 markings/sec, 370 secs
lola: 26113559 markings, 126453368 edges, 63432 markings/sec, 375 secs
lola: 26412703 markings, 128254834 edges, 59829 markings/sec, 380 secs
lola: 26741422 markings, 130015467 edges, 65744 markings/sec, 385 secs
lola: 27052608 markings, 131755377 edges, 62237 markings/sec, 390 secs
lola: 27475451 markings, 133560849 edges, 84569 markings/sec, 395 secs
lola: 27913660 markings, 135412053 edges, 87642 markings/sec, 400 secs
lola: 28322799 markings, 137262527 edges, 81828 markings/sec, 405 secs
lola: 28717750 markings, 139067064 edges, 78990 markings/sec, 410 secs
lola: 29141192 markings, 140872698 edges, 84688 markings/sec, 415 secs
lola: 29527407 markings, 142686374 edges, 77243 markings/sec, 420 secs
lola: 29942496 markings, 144510027 edges, 83018 markings/sec, 425 secs
lola: 30337922 markings, 146289863 edges, 79085 markings/sec, 430 secs
lola: 30736338 markings, 148139574 edges, 79683 markings/sec, 435 secs
lola: 31119747 markings, 149989721 edges, 76682 markings/sec, 440 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no yes unknown unknown unknown no no yes unknown no unknown unknown unknown yes
lola: memory consumption: 2873916 KB
lola: time consumption: 447 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p50 + 1 <= p80)))) AND (A (F ((p61 <= p293))) AND A (X ((p72 <= p143)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p61 <= p293)))
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: (p293 + 1 <= p61)
lola: processed formula length: 17
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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: ========================================
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p50 + 1 <= p80))))
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: ((p80 <= p50))
lola: processed formula length: 14
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 42 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p167 <= p201)))
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 ((p167 <= p201)))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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: (p201 + 1 <= p167)
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: 25 markings, 24 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p58 <= p15)))
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 ((p58 <= p15)))
lola: processed formula length: 20
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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: 30 markings, 29 edges
lola: ========================================
lola: ========================================

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p60 <= p296)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p60 <= p296)))
lola: processed formula length: 21
lola: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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 is possibly preserved.
lola: 42 markings, 42 edges

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1041 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p249 <= 0) AND ((p255 <= 0) OR (p87 + 1 <= p344)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p249 <= 0) AND ((p255 <= 0) OR (p87 + 1 <= p344)))))
lola: processed formula length: 61
lola: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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 is possibly preserved.
lola: 19 markings, 19 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p147 + 1 <= p177))) OR (1 <= p102))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p102)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p102)
lola: processed formula length: 11
lola: 35 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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: ========================================
lola: subprocess 15 will run for 3123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p147 + 1 <= p177)))
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 ((p147 + 1 <= p177)))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLCardinality.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: (p147 + 1 <= p177)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-12b-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 40 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA DiscoveryGPU-PT-12b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p89 <= p164) U (p11 + 1 <= p14))) OR A (G ((p75 <= p268))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes no yes no no no no no yes yes no unknown unknown yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 26120 KB
lola: time consumption: 3570 seconds
lola: time limit reached - aborting
lola:
preliminary result: no yes no yes no no no no no yes yes no unknown unknown yes yes
lola:
preliminary result: no yes no yes no no no no no yes yes no unknown unknown yes yes
lola: memory consumption: 26120 KB
lola: time consumption: 3570 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="DiscoveryGPU-PT-12b"
export BK_EXAMINATION="CTLCardinality"
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/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b 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 DiscoveryGPU-PT-12b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-csrt-152749169500120"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;