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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.1K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SmallOperatingSystem-PT-MT8192DC2048, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-smll-152705517500124
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527121516963


BK_STOP 1527121902240

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SmallOperatingSystem-PT-MT8192DC2048 as instance name.
Using SmallOperatingSystem as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 163131, 'Memory': 3677.01, 'Tool': 'lola'}, {'Time': 165031, 'Memory': 3677.63, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola SmallOperatingSystem-PT-MT8192DC2048...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
SmallOperatingSystem-PT-MT8192DC2048: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
SmallOperatingSystem-PT-MT8192DC2048: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ SmallOperatingSystem-PT-MT8192DC2048 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.task
lola: A (G (((1 <= TaskOnDisk) OR ((LoadingMem <= FreeMemSegment) AND (FreeMemSegment <= TaskOnDisk)) OR ((DiskControllerUnit + 1 <= TaskReady) AND (TaskSuspended <= 2))))) : A (G (((2 <= FreeMemSegment) AND ((3 <= DiskControllerUnit) OR (1 <= FreeMemSegment) OR (TransferToDisk <= 0))))) : A (G (((ExecutingTask <= CPUUnit) AND ((3 <= TaskReady) OR (3 <= TransferToDisk) OR (2 <= CPUUnit) OR (3 <= FreeMemSegment))))) : E (F ((CPUUnit <= 2))) : A (G ((3 <= TaskOnDisk))) : A (G (())) : E (F ((((FreeMemSegment <= TaskSuspended) AND ((CPUUnit <= ExecutingTask) OR (LoadingMem <= TaskSuspended))) OR (DiskControllerUnit <= ExecutingTask)))) : E (F ((((2 <= LoadingMem) OR (TaskReady + 1 <= TaskSuspended)) AND (TaskOnDisk <= CPUUnit)))) : E (F (((ExecutingTask <= 2) AND (FreeMemSegment <= 0) AND (ExecutingTask <= FreeMemSegment)))) : A (G (TRUE)) : A (G ((2 <= FreeMemSegment))) : E (F ((((DiskControllerUnit <= 0) AND (LoadingMem <= 2))))) : E (F (())) : E (F (((CPUUnit <= DiskControllerUnit) AND (1 <= TaskOnDisk) AND (CPUUnit + 1 <= ExecutingTask)))) : E (F (((TaskOnDisk <= LoadingMem) AND (2 <= TaskSuspended)))) : E (F (((TaskOnDisk + 1 <= CPUUnit) AND ((TransferToDisk + 1 <= DiskControllerUnit)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= TaskOnDisk) OR ((LoadingMem <= FreeMemSegment) AND (FreeMemSegment <= TaskOnDisk)) OR ((DiskControllerUnit + 1 <= TaskReady) AND (TaskSuspended <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= FreeMemSegment) AND ((3 <= DiskControllerUnit) OR (1 <= FreeMemSegment) OR (TransferToDisk <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14335 markings, 14334 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask <= CPUUnit) AND ((3 <= TaskReady) OR (3 <= TransferToDisk) OR (2 <= CPUUnit) OR (3 <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2959127 markings, 8057910 edges, 591825 markings/sec, 0 secs
lola: sara is running 5 secs || 5247071 markings, 15271148 edges, 457589 markings/sec, 5 secs
lola: sara is running 10 secs || 7387148 markings, 22111751 edges, 428015 markings/sec, 10 secs
lola: sara is running 15 secs || 9548519 markings, 29071946 edges, 432274 markings/sec, 15 secs
lola: sara is running 20 secs || 11573377 markings, 35661696 edges, 404972 markings/sec, 20 secs
lola: sara is running 25 secs || 13762368 markings, 42871535 edges, 437798 markings/sec, 25 secs
lola: sara is running 30 secs || 15789865 markings, 49391690 edges, 405499 markings/sec, 30 secs
lola: sara is running 35 secs || 17900539 markings, 56312118 edges, 422135 markings/sec, 35 secs
lola: sara is running 40 secs || 19868374 markings, 62832527 edges, 393567 markings/sec, 40 secs
lola: sara is running 45 secs || 21946483 markings, 69655668 edges, 415622 markings/sec, 45 secs
lola: sara is running 50 secs || 23928204 markings, 76040785 edges, 396344 markings/sec, 50 secs
lola: sara is running 55 secs || 26118292 markings, 83193527 edges, 438018 markings/sec, 55 secs
lola: sara is running 60 secs || 28226736 markings, 90371098 edges, 421689 markings/sec, 60 secs
lola: sara is running 65 secs || 30256461 markings, 97016684 edges, 405945 markings/sec, 65 secs
lola: sara is running 70 secs || 32189746 markings, 103464203 edges, 386657 markings/sec, 70 secs
lola: sara is running 75 secs || 34156138 markings, 110143047 edges, 393278 markings/sec, 75 secs
lola: sara is running 80 secs || 36236507 markings, 116977929 edges, 416074 markings/sec, 80 secs
lola: sara is running 85 secs || 38178632 markings, 123161976 edges, 388425 markings/sec, 85 secs
lola: sara is running 90 secs || 40065968 markings, 129440010 edges, 377467 markings/sec, 90 secs
lola: sara is running 95 secs || 41969814 markings, 135974224 edges, 380769 markings/sec, 95 secs
lola: sara is running 100 secs || 43928778 markings, 142483834 edges, 391793 markings/sec, 100 secs
lola: sara is running 105 secs || 45916149 markings, 149140196 edges, 397474 markings/sec, 105 secs
lola: sara is running 110 secs || 47870026 markings, 155750784 edges, 390775 markings/sec, 110 secs
lola: sara is running 115 secs || 49810004 markings, 162020577 edges, 387996 markings/sec, 115 secs
lola: sara is running 120 secs || 51684655 markings, 168155636 edges, 374930 markings/sec, 120 secs
lola: sara is running 125 secs || 53559868 markings, 174442024 edges, 375043 markings/sec, 125 secs
lola: sara is running 130 secs || 55383399 markings, 180887036 edges, 364706 markings/sec, 130 secs
lola: sara is running 135 secs || 57360094 markings, 187497528 edges, 395339 markings/sec, 135 secs
lola: sara is running 140 secs || 59578542 markings, 194733240 edges, 443690 markings/sec, 140 secs
lola: sara is running 145 secs || 61574954 markings, 201546100 edges, 399282 markings/sec, 145 secs
lola: sara is running 150 secs || 63490383 markings, 208082045 edges, 383086 markings/sec, 150 secs
lola: sara is running 155 secs || 65400299 markings, 214177210 edges, 381983 markings/sec, 155 secs
lola: sara is running 160 secs || 67215853 markings, 220232822 edges, 363111 markings/sec, 160 secs
lola: sara is running 165 secs || 68997089 markings, 226351310 edges, 356247 markings/sec, 165 secs
lola: sara is running 170 secs || 70867886 markings, 232933848 edges, 374159 markings/sec, 170 secs
lola: sara is running 175 secs || 72979781 markings, 240014409 edges, 422379 markings/sec, 175 secs
lola: sara is running 180 secs || 74921163 markings, 246341854 edges, 388276 markings/sec, 180 secs
lola: sara is running 185 secs || 76850634 markings, 252395852 edges, 385894 markings/sec, 185 secs
lola: sara is running 190 secs || 78622469 markings, 258447336 edges, 354367 markings/sec, 190 secs
lola: sara is running 195 secs || 80364707 markings, 264756574 edges, 348448 markings/sec, 195 secs
lola: sara is running 200 secs || 82531429 markings, 271946753 edges, 433344 markings/sec, 200 secs
lola: sara is running 205 secs || 84648470 markings, 278894150 edges, 423408 markings/sec, 205 secs
lola: sara is running 210 secs || 86668493 markings, 285642154 edges, 404005 markings/sec, 210 secs
lola: sara is running 215 secs || 88698975 markings, 292431854 edges, 406096 markings/sec, 215 secs
lola: sara is running 220 secs || 90675844 markings, 299027677 edges, 395374 markings/sec, 220 secs
lola: sara is running 225 secs || 92507496 markings, 305323756 edges, 366330 markings/sec, 225 secs
lola: sara is running 230 secs || 94391428 markings, 311606252 edges, 376786 markings/sec, 230 secs
lola: sara is running 235 secs || 96289652 markings, 317556871 edges, 379645 markings/sec, 235 secs
lola: sara is running 240 secs || 98178629 markings, 323561191 edges, 377795 markings/sec, 240 secs
lola: sara is running 245 secs || 100047766 markings, 329554703 edges, 373827 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4450329 markings, 6675491 edges, 890066 markings/sec, 0 secs
lola: sara is running 5 secs || 8119718 markings, 12179575 edges, 733878 markings/sec, 5 secs
lola: sara is running 10 secs || 11439790 markings, 17159683 edges, 664014 markings/sec, 10 secs
lola: sara is running 15 secs || 14540527 markings, 21876126 edges, 620147 markings/sec, 15 secs
lola: sara is running 20 secs || 17474267 markings, 26588154 edges, 586748 markings/sec, 20 secs
lola: sara is running 25 secs || 20273784 markings, 31279314 edges, 559903 markings/sec, 25 secs
lola: sara is running 30 secs || 22975905 markings, 35951964 edges, 540424 markings/sec, 30 secs
lola: sara is running 35 secs || 25612763 markings, 40631426 edges, 527372 markings/sec, 35 secs
lola: sara is running 40 secs || 28162581 markings, 45247725 edges, 509964 markings/sec, 40 secs
lola: sara is running 45 secs || 30676240 markings, 49883391 edges, 502732 markings/sec, 45 secs
lola: sara is running 50 secs || 33145417 markings, 54503459 edges, 493835 markings/sec, 50 secs
lola: sara is running 55 secs || 35575064 markings, 59110660 edges, 485929 markings/sec, 55 secs
lola: sara is running 60 secs || 37974554 markings, 63713801 edges, 479898 markings/sec, 60 secs
lola: sara is running 65 secs || 40342321 markings, 68301525 edges, 473553 markings/sec, 65 secs
lola: sara is running 70 secs || 42691977 markings, 72896125 edges, 469931 markings/sec, 70 secs
lola: sara is running 75 secs || 45020477 markings, 77491152 edges, 465700 markings/sec, 75 secs
lola: sara is running 80 secs || 47330390 markings, 82074458 edges, 461983 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48178193 markings, 83769392 edges
lola: ========================================
lola: subprocess 4 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= TaskOnDisk)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FreeMemSegment <= TaskSuspended) AND ((CPUUnit <= ExecutingTask) OR (LoadingMem <= TaskSuspended))) OR (DiskControllerUnit <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16385 markings, 16384 edges
lola: ========================================
lola: subprocess 7 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= LoadingMem) OR (TaskReady + 1 <= TaskSuspended)) AND (TaskOnDisk <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ExecutingTask <= 2) AND (FreeMemSegment <= 0) AND (ExecutingTask <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14337 markings, 14336 edges
lola: ========================================
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14335 markings, 14334 edges
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((DiskControllerUnit <= 0) AND (LoadingMem <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30701 markings, 32746 edges
lola: ========================================
lola: subprocess 12 will run for 800 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1066 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= DiskControllerUnit) AND (1 <= TaskOnDisk) AND (CPUUnit + 1 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1599 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskOnDisk <= LoadingMem) AND (2 <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3199 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskOnDisk + 1 <= CPUUnit) AND ((TransferToDisk + 1 <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown yes yes yes yes no yes yes no yes no yes no no
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="SmallOperatingSystem-PT-MT8192DC2048"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
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/SmallOperatingSystem-PT-MT8192DC2048.tgz
mv SmallOperatingSystem-PT-MT8192DC2048 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 mcc4mcc-structural"
echo " Input is SmallOperatingSystem-PT-MT8192DC2048, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-smll-152705517500124"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;