About the Execution of M4M.full for SmallOperatingSystem-PT-MT8192DC2048
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9935.030 | 379437.00 | 347239.00 | 1550.30 | TF?TTTTFTTFTFTFF | normal |
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-full
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 r166-smll-152705516800124
=====================================================================
--------------------
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 1527074038416
BK_STOP 1527074417853
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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 235 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 || 3044505 markings, 8317272 edges, 608901 markings/sec, 0 secs
lola: sara is running 5 secs || 5426204 markings, 15840588 edges, 476340 markings/sec, 5 secs
lola: sara is running 10 secs || 7692386 markings, 23050123 edges, 453236 markings/sec, 10 secs
lola: sara is running 15 secs || 9874972 markings, 30064948 edges, 436517 markings/sec, 15 secs
lola: sara is running 20 secs || 11969145 markings, 36996095 edges, 418835 markings/sec, 20 secs
lola: sara is running 25 secs || 14234336 markings, 44351140 edges, 453038 markings/sec, 25 secs
lola: sara is running 30 secs || 16340787 markings, 51224038 edges, 421290 markings/sec, 30 secs
lola: sara is running 35 secs || 18484842 markings, 58203547 edges, 428811 markings/sec, 35 secs
lola: sara is running 40 secs || 20593753 markings, 65235677 edges, 421782 markings/sec, 40 secs
lola: sara is running 45 secs || 22651613 markings, 71999136 edges, 411572 markings/sec, 45 secs
lola: sara is running 50 secs || 24751064 markings, 78753634 edges, 419890 markings/sec, 50 secs
lola: sara is running 55 secs || 26968691 markings, 86135483 edges, 443525 markings/sec, 55 secs
lola: sara is running 60 secs || 29204373 markings, 93658227 edges, 447136 markings/sec, 60 secs
lola: sara is running 65 secs || 31197997 markings, 100147064 edges, 398725 markings/sec, 65 secs
lola: sara is running 70 secs || 33236418 markings, 106937720 edges, 407684 markings/sec, 70 secs
lola: sara is running 75 secs || 35350971 markings, 114140198 edges, 422911 markings/sec, 75 secs
lola: sara is running 80 secs || 37408674 markings, 120578349 edges, 411541 markings/sec, 80 secs
lola: sara is running 85 secs || 39240387 markings, 126665542 edges, 366343 markings/sec, 85 secs
lola: sara is running 90 secs || 41105233 markings, 133038205 edges, 372969 markings/sec, 90 secs
lola: sara is running 95 secs || 43128974 markings, 139901861 edges, 404748 markings/sec, 95 secs
lola: sara is running 100 secs || 45021182 markings, 146140076 edges, 378442 markings/sec, 100 secs
lola: sara is running 105 secs || 47046892 markings, 153017167 edges, 405142 markings/sec, 105 secs
lola: sara is running 110 secs || 49008644 markings, 159537032 edges, 392350 markings/sec, 110 secs
lola: sara is running 115 secs || 50890137 markings, 165789952 edges, 376299 markings/sec, 115 secs
lola: sara is running 120 secs || 52803108 markings, 171946973 edges, 382594 markings/sec, 120 secs
lola: sara is running 125 secs || 54720660 markings, 178482765 edges, 383510 markings/sec, 125 secs
lola: sara is running 130 secs || 56644741 markings, 185081829 edges, 384816 markings/sec, 130 secs
lola: sara is running 135 secs || 58860455 markings, 192386796 edges, 443143 markings/sec, 135 secs
lola: sara is running 140 secs || 60955372 markings, 199406054 edges, 418983 markings/sec, 140 secs
lola: sara is running 145 secs || 62942043 markings, 206166163 edges, 397334 markings/sec, 145 secs
lola: sara is running 150 secs || 64842503 markings, 212531206 edges, 380092 markings/sec, 150 secs
lola: sara is running 155 secs || 66743026 markings, 218565879 edges, 380105 markings/sec, 155 secs
lola: sara is running 160 secs || 68551983 markings, 224745963 edges, 361791 markings/sec, 160 secs
lola: sara is running 165 secs || 70397919 markings, 231337007 edges, 369187 markings/sec, 165 secs
lola: sara is running 170 secs || 72509694 markings, 238510147 edges, 422355 markings/sec, 170 secs
lola: sara is running 175 secs || 74566150 markings, 245105853 edges, 411291 markings/sec, 175 secs
lola: sara is running 180 secs || 76476526 markings, 251306902 edges, 382075 markings/sec, 180 secs
lola: sara is running 185 secs || 78297961 markings, 257424072 edges, 364287 markings/sec, 185 secs
lola: sara is running 190 secs || 80095789 markings, 263767332 edges, 359566 markings/sec, 190 secs
lola: sara is running 195 secs || 82200125 markings, 270907234 edges, 420867 markings/sec, 195 secs
lola: sara is running 200 secs || 84410930 markings, 278096889 edges, 442161 markings/sec, 200 secs
lola: sara is running 205 secs || 86485370 markings, 285073684 edges, 414888 markings/sec, 205 secs
lola: sara is running 210 secs || 88557622 markings, 291945316 edges, 414450 markings/sec, 210 secs
lola: sara is running 215 secs || 90582148 markings, 298711339 edges, 404905 markings/sec, 215 secs
lola: sara is running 220 secs || 92438604 markings, 305099811 edges, 371291 markings/sec, 220 secs
lola: sara is running 225 secs || 94354295 markings, 311468188 edges, 383138 markings/sec, 225 secs
lola: sara is running 230 secs || 96278024 markings, 317514745 edges, 384746 markings/sec, 230 secs
lola: sara is running 235 secs || 98185968 markings, 323592780 edges, 381589 markings/sec, 235 secs
lola: sara is running 240 secs || 100077060 markings, 329675861 edges, 378218 markings/sec, 240 secs
lola: sara is running 245 secs || 101911262 markings, 336114194 edges, 366840 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 || 4536531 markings, 6804794 edges, 907306 markings/sec, 0 secs
lola: sara is running 5 secs || 9023089 markings, 13534631 edges, 897312 markings/sec, 5 secs
lola: sara is running 10 secs || 12916108 markings, 19376188 edges, 778604 markings/sec, 10 secs
lola: sara is running 15 secs || 16359720 markings, 24771075 edges, 688722 markings/sec, 15 secs
lola: sara is running 20 secs || 19516833 markings, 29993717 edges, 631423 markings/sec, 20 secs
lola: sara is running 25 secs || 22494746 markings, 35109468 edges, 595583 markings/sec, 25 secs
lola: sara is running 30 secs || 25341552 markings, 40142589 edges, 569361 markings/sec, 30 secs
lola: sara is running 35 secs || 28084445 markings, 45107573 edges, 548579 markings/sec, 35 secs
lola: sara is running 40 secs || 30757838 markings, 50032595 edges, 534679 markings/sec, 40 secs
lola: sara is running 45 secs || 33374201 markings, 54934095 edges, 523273 markings/sec, 45 secs
lola: sara is running 50 secs || 35933369 markings, 59795218 edges, 511834 markings/sec, 50 secs
lola: sara is running 55 secs || 38453998 markings, 64634465 edges, 504126 markings/sec, 55 secs
lola: sara is running 60 secs || 40942463 markings, 69468852 edges, 497693 markings/sec, 60 secs
lola: sara is running 65 secs || 43396127 markings, 74280627 edges, 490733 markings/sec, 65 secs
lola: sara is running 70 secs || 45818175 markings, 79067951 edges, 484410 markings/sec, 70 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 267 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 291 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
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16385 markings, 16384 edges
lola: subprocess 7 will run for 356 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: ========================================
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 458 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 534 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 641 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 801 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 1069 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 1603 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 3206 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 stderr -----
----- Finished stdout -----
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-full"
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-full"
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 r166-smll-152705516800124"
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 '
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 ;