About the Execution of 2018-Gold for PolyORBLF-COL-S02J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
379.380 | 131563.00 | 133411.00 | 254.10 | FF?FTTTFTTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326100038.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is PolyORBLF-COL-S02J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326100038
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 4.4K Feb 12 09:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 09:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 8 09:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 09:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 1 08:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 154K Mar 10 17:31 model.pnml
--------------------
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 PolyORBLF-COL-S02J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552879053604
info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S02J06T06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S02J06T06 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S02J06T06 @ 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: 1600/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17152
lola: finding significant places
lola: 536 places, 1064 transitions, 486 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1483 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p273)
lola: LP says that atomic proposition is always false: (3 <= p137 + p138 + p139 + p140 + p141 + p142)
lola: LP says that atomic proposition is always true: (p20 + p21 + p22 + p23 + p24 + p25 <= p486)
lola: LP says that atomic proposition is always false: (3 <= p274 + p275 + p276 + p277 + p278 + p279)
lola: LP says that atomic proposition is always false: (3 <= p415)
lola: LP says that atomic proposition is always false: (2 <= p71 + p70 + p69 + p68 + p67 + p66)
lola: LP says that atomic proposition is always false: (3 <= p273)
lola: A (G (G (G (X ((p387 + p386 <= p415)))))) : A (F ((G ((p515 <= p330)) U X (FALSE)))) : A (X (X ((p8 + p9 + p10 + p11 + p12 + p13 <= p50 + p51 + p52 + p53 + p49 + p48)))) : A ((G (X (FALSE)) U (p425 <= p136))) : A (F ((p530 + p531 + p532 + p533 + p534 + p535 <= p50 + p51 + p52 + p53 + p49 + p48))) : A (X ((G ((p72 <= p8 + p9 + p10 + p11 + p12 + p13)) U X ((p310 + p311 + p312 + p313 + p314 + p315 + p316 <= p406 + p407 + p408 + p409 + p410 + p411))))) : A (F (X (X (TRUE)))) : A (G (F (G (FALSE)))) : A ((F (G ((p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 <= p26))) U F ((p331 <= p286 + p287 + p288 + p289 + p290 + p291)))) : A (((1 <= p155) U (FALSE U (p137 + p138 + p139 + p140 + p141 + p142 <= p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479)))) : A (G (X (F (X ((1 <= p416)))))) : A ((1 <= p517)) : A (((3 <= p260) U (3 <= p332 + p333 + p334 + p335 + p336 + p337))) : A (F (F (X (FALSE)))) : A ((p394 + p395 + p396 + p397 + p398 + p399 <= p387 + p386)) : A (((1 <= p41) U X (FALSE)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 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: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.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 PolyORBLF-COL-S02J06T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p425 <= p136)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p425 <= p136)
lola: processed formula length: 14
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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 PolyORBLF-COL-S02J06T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 249 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: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.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 PolyORBLF-COL-S02J06T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p517)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p517)
lola: processed formula length: 11
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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 PolyORBLF-COL-S02J06T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 290 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: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.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 PolyORBLF-COL-S02J06T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p394 + p395 + p396 + p397 + p398 + p399 <= p387 + p386)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p394 + p395 + p396 + p397 + p398 + p399 <= p387 + p386)
lola: processed formula length: 56
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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 PolyORBLF-COL-S02J06T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 348 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: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.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 PolyORBLF-COL-S02J06T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p387 + p386 <= p415))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p387 + p386 <= p415))))
lola: processed formula length: 33
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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: 393 markings, 393 edges
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((p310 + p311 + p312 + p313 + p314 + p315 + p316 <= p406 + p407 + p408 + p409 + p410 + p411)) OR (G ((p72 <= p8 + p9 + p10 + p11 + p12 + p13)) AND X (F ((p310 + p311 + p312 + p313 + p314 + p315 + p316 <= p406 + p407 + p408 + p409 + p410 + p411)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((p310 + p311 + p312 + p313 + p314 + p315 + p316 <= p406 + p407 + p408 + p409 + p410 + p411)) OR (G ((p72 <= p8 + p9 + p10 + p11 + p12 + p13)) AND X (F ((p310 + p311 + p312 + p313 + p314 + p315 + p316 <= p406 + p407 + p408 + p409 + p410 + p411)))))))
lola: processed formula length: 259
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 9 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: 14 markings, 16 edges
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 498 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: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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: 3 markings, 2 edges
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p8 + p9 + p10 + p11 + p12 + p13 <= p50 + p51 + p52 + p53 + p49 + p48))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p8 + p9 + p10 + p11 + p12 + p13 <= p50 + p51 + p52 + p53 + p49 + p48))))
lola: processed formula length: 82
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 6 markings, 6 edges
lola:
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p530 + p531 + p532 + p533 + p534 + p535 <= p50 + p51 + p52 + p53 + p49 + p48)))
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: (p50 + p51 + p52 + p53 + p49 + p48 + 1 <= p530 + p531 + p532 + p533 + p534 + p535)
lola: processed formula length: 82
lola: 51 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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 PolyORBLF-COL-S02J06T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p416))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p416))))
lola: processed formula length: 23
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-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: 152756 markings, 220134 edges, 30551 markings/sec, 0 secs
lola: 294084 markings, 424006 edges, 28266 markings/sec, 5 secs
lola: 427171 markings, 605319 edges, 26617 markings/sec, 10 secs
lola: 558315 markings, 793602 edges, 26229 markings/sec, 15 secs
lola: 698802 markings, 995615 edges, 28097 markings/sec, 20 secs
lola: 832049 markings, 1182948 edges, 26649 markings/sec, 25 secs
lola: 961964 markings, 1368714 edges, 25983 markings/sec, 30 secs
lola: 1079434 markings, 1543801 edges, 23494 markings/sec, 35 secs
lola: 1197134 markings, 1706683 edges, 23540 markings/sec, 40 secs
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: 1267591 markings, 1807607 edges
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
subprocess 13 will run for 1146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p331 <= p286 + p287 + p288 + p289 + p290 + p291)) OR (F ((p331 <= p286 + p287 + p288 + p289 + p290 + p291)) AND F (G ((p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p331 <= p286 + p287 + p288 + p289 + p290 + p291)) OR (F ((p331 <= p286 + p287 + p288 + p289 + p290 + p291)) AND F (G ((p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 <= p26))))))
lola: processed formula length: 221
lola: 49 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 36173 markings, 50290 edges
lola:
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p260) U (3 <= p332 + p333 + p334 + p335 + p336 + p337)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((3 <= p260) U (3 <= p332 + p333 + p334 + p335 + p336 + p337)))
lola: processed formula length: 66
lola: 53 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 4 markings, 3 edges
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p155) U (p137 + p138 + p139 + p140 + p141 + p142 <= p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= p155) U (p137 + p138 + p139 + p140 + p141 + p142 <= p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479)))
lola: processed formula length: 356
lola: 53 rewrites
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes no yes yes no no no no yes no
lola:
preliminary result: no no yes no yes yes yes no yes yes no no no no yes no
lola: memory consumption: 22028 KB
lola: time consumption: 132 seconds
BK_STOP 1552879185167
--------------------
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="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is PolyORBLF-COL-S02J06T06, 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 r121-smll-155272326100038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 '
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 ;