fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r162-smll-152705514000124
Last Updated
June 26, 2018

About the Execution of Irma.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
9461.590 390338.00 361247.00 1615.40 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 irma4mcc-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 r162-smll-152705514000124
=====================================================================


--------------------
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 1527059720708


BK_STOP 1527060111046

--------------------
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...

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 @ 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 || 2637538 markings, 7073079 edges, 527508 markings/sec, 0 secs
lola: sara is running 5 secs || 5042707 markings, 14651221 edges, 481034 markings/sec, 5 secs
lola: sara is running 10 secs || 7239231 markings, 21614290 edges, 439305 markings/sec, 10 secs
lola: sara is running 15 secs || 9485794 markings, 28865726 edges, 449313 markings/sec, 15 secs
lola: sara is running 20 secs || 11569307 markings, 35649843 edges, 416703 markings/sec, 20 secs
lola: sara is running 25 secs || 13821465 markings, 43057472 edges, 450432 markings/sec, 25 secs
lola: sara is running 30 secs || 15913126 markings, 49797133 edges, 418332 markings/sec, 30 secs
lola: sara is running 35 secs || 18052973 markings, 56865564 edges, 427969 markings/sec, 35 secs
lola: sara is running 40 secs || 20086658 markings, 63570831 edges, 406737 markings/sec, 40 secs
lola: sara is running 45 secs || 22165543 markings, 70362158 edges, 415777 markings/sec, 45 secs
lola: sara is running 50 secs || 24200317 markings, 76913545 edges, 406955 markings/sec, 50 secs
lola: sara is running 55 secs || 26394347 markings, 84197630 edges, 438806 markings/sec, 55 secs
lola: sara is running 60 secs || 28599237 markings, 91591426 edges, 440978 markings/sec, 60 secs
lola: sara is running 65 secs || 30475320 markings, 97712093 edges, 375217 markings/sec, 65 secs
lola: sara is running 70 secs || 32219094 markings, 103549206 edges, 348755 markings/sec, 70 secs
lola: sara is running 75 secs || 34009135 markings, 109632925 edges, 358008 markings/sec, 75 secs
lola: sara is running 80 secs || 35981919 markings, 116207796 edges, 394557 markings/sec, 80 secs
lola: sara is running 85 secs || 37812377 markings, 121943450 edges, 366092 markings/sec, 85 secs
lola: sara is running 90 secs || 39578628 markings, 127803726 edges, 353250 markings/sec, 90 secs
lola: sara is running 95 secs || 41361927 markings, 133860893 edges, 356660 markings/sec, 95 secs
lola: sara is running 100 secs || 43193296 markings, 140124851 edges, 366274 markings/sec, 100 secs
lola: sara is running 105 secs || 44991785 markings, 146026381 edges, 359698 markings/sec, 105 secs
lola: sara is running 110 secs || 46852414 markings, 152378685 edges, 372126 markings/sec, 110 secs
lola: sara is running 115 secs || 48687425 markings, 158446759 edges, 367002 markings/sec, 115 secs
lola: sara is running 120 secs || 50447088 markings, 164285808 edges, 351933 markings/sec, 120 secs
lola: sara is running 125 secs || 52276641 markings, 169958217 edges, 365911 markings/sec, 125 secs
lola: sara is running 130 secs || 54026827 markings, 176088122 edges, 350037 markings/sec, 130 secs
lola: sara is running 135 secs || 55767243 markings, 182190597 edges, 348083 markings/sec, 135 secs
lola: sara is running 140 secs || 57692113 markings, 188595026 edges, 384974 markings/sec, 140 secs
lola: sara is running 145 secs || 59808002 markings, 195478892 edges, 423178 markings/sec, 145 secs
lola: sara is running 150 secs || 61689283 markings, 201907026 edges, 376256 markings/sec, 150 secs
lola: sara is running 155 secs || 63502727 markings, 208117795 edges, 362689 markings/sec, 155 secs
lola: sara is running 160 secs || 65300248 markings, 213875788 edges, 359504 markings/sec, 160 secs
lola: sara is running 165 secs || 67032155 markings, 219575411 edges, 346381 markings/sec, 165 secs
lola: sara is running 170 secs || 68707562 markings, 225360614 edges, 335081 markings/sec, 170 secs
lola: sara is running 175 secs || 70468174 markings, 231605803 edges, 352122 markings/sec, 175 secs
lola: sara is running 180 secs || 72476568 markings, 238410139 edges, 401679 markings/sec, 180 secs
lola: sara is running 185 secs || 74428839 markings, 244700096 edges, 390454 markings/sec, 185 secs
lola: sara is running 190 secs || 76218495 markings, 250548718 edges, 357931 markings/sec, 190 secs
lola: sara is running 195 secs || 77958707 markings, 256204741 edges, 348042 markings/sec, 195 secs
lola: sara is running 200 secs || 79665087 markings, 262101234 edges, 341276 markings/sec, 200 secs
lola: sara is running 205 secs || 81463592 markings, 268472682 edges, 359701 markings/sec, 205 secs
lola: sara is running 210 secs || 83622542 markings, 275504818 edges, 431790 markings/sec, 210 secs
lola: sara is running 215 secs || 85633058 markings, 282138717 edges, 402103 markings/sec, 215 secs
lola: sara is running 220 secs || 87544258 markings, 288539356 edges, 382240 markings/sec, 220 secs
lola: sara is running 225 secs || 89565787 markings, 295262721 edges, 404306 markings/sec, 225 secs
lola: sara is running 230 secs || 91335303 markings, 301318024 edges, 353903 markings/sec, 230 secs
lola: sara is running 235 secs || 93131018 markings, 307375484 edges, 359143 markings/sec, 235 secs
lola: sara is running 240 secs || 94941852 markings, 313342361 edges, 362167 markings/sec, 240 secs
lola: sara is running 245 secs || 96718463 markings, 318931417 edges, 355322 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 || 4540769 markings, 6811151 edges, 908154 markings/sec, 0 secs
lola: sara is running 5 secs || 8080216 markings, 12120323 edges, 707889 markings/sec, 5 secs
lola: sara is running 10 secs || 11546962 markings, 17320441 edges, 693349 markings/sec, 10 secs
lola: sara is running 15 secs || 14586178 markings, 21948037 edges, 607843 markings/sec, 15 secs
lola: sara is running 20 secs || 17258720 markings, 26234916 edges, 534508 markings/sec, 20 secs
lola: sara is running 25 secs || 19750096 markings, 30389296 edges, 498275 markings/sec, 25 secs
lola: sara is running 30 secs || 22149518 markings, 34507634 edges, 479884 markings/sec, 30 secs
lola: sara is running 35 secs || 24594669 markings, 38810000 edges, 489030 markings/sec, 35 secs
lola: sara is running 40 secs || 26914908 markings, 42976598 edges, 464048 markings/sec, 40 secs
lola: sara is running 45 secs || 29237290 markings, 47220665 edges, 464476 markings/sec, 45 secs
lola: sara is running 50 secs || 31643486 markings, 51687973 edges, 481239 markings/sec, 50 secs
lola: sara is running 55 secs || 34036962 markings, 56187847 edges, 478695 markings/sec, 55 secs
lola: sara is running 60 secs || 36402492 markings, 60694193 edges, 473106 markings/sec, 60 secs
lola: sara is running 65 secs || 38750050 markings, 65210350 edges, 469512 markings/sec, 65 secs
lola: sara is running 70 secs || 41076868 markings, 69733283 edges, 465364 markings/sec, 70 secs
lola: sara is running 75 secs || 43395931 markings, 74280042 edges, 463813 markings/sec, 75 secs
lola: sara is running 80 secs || 45656660 markings, 78751550 edges, 452146 markings/sec, 80 secs
lola: sara is running 85 secs || 47893783 markings, 83202713 edges, 447425 markings/sec, 85 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: 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 319 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: ========================================
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: subprocess 8 will run for 399 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
lola: ========================================
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-ReachabilityCardinality-8.sara.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 456 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 532 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 639 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 799 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 1065 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 1597 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 3194 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: RESULT
lola:
SUMMARY: yes no unknown yes yes yes yes no yes yes no yes no yes no no
lola: ========================================
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="irma4mcc-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 irma4mcc-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 r162-smll-152705514000124"
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 ;