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

About the Execution of Irma.full for RobotManipulation-PT-00500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12113.530 1068316.00 1036190.00 3694.30 1000 1001 ? 1000 1001 1000 1000 1001 1001 1000 1000 1000 1000 1000 1001 1000 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 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is RobotManipulation-PT-00500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-152685548800058
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526898824388


BK_STOP 1526899892704

--------------------
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 RobotManipulation-PT-00500 as instance name.
Using RobotManipulation as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', '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': 774216, 'Memory': 4195.91, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
UpperBounds lola RobotManipulation-PT-00500...

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00500: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
UpperBounds @ RobotManipulation-PT-00500 @ 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00500-UpperBounds.task
lola: MAX(initialized) : MAX(initialize) : MAX(r_active) : MAX(initialized) : MAX(p_i2) : MAX(off) : MAX(p_sc) : MAX(initialize) : MAX(initialize) : MAX(initialized) : MAX(p_sc) : MAX(initialized) : MAX(p_rdy) : MAX(move) : MAX(initialize) : MAX(r_stopped)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4115253 markings, 6184619 edges, 823051 markings/sec, 0 secs
lola: 9056916 markings, 12924258 edges, 988333 markings/sec, 5 secs
lola: 13681792 markings, 19085396 edges, 924975 markings/sec, 10 secs
lola: 15986234 markings, 24149940 edges, 460888 markings/sec, 15 secs
lola: 20365922 markings, 30212731 edges, 875938 markings/sec, 20 secs
lola: 25180008 markings, 36852559 edges, 962817 markings/sec, 25 secs
lola: 29116955 markings, 43034351 edges, 787389 markings/sec, 30 secs
lola: 31478696 markings, 47879858 edges, 472348 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 32928056 markings, 50888083 edges
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4565112 markings, 7662635 edges, 913022 markings/sec, 0 secs
lola: 9183959 markings, 15431595 edges, 923769 markings/sec, 5 secs
lola: 12095914 markings, 21677202 edges, 582391 markings/sec, 10 secs
lola: 15316319 markings, 26661949 edges, 644081 markings/sec, 15 secs
lola: 18571940 markings, 31699719 edges, 651124 markings/sec, 20 secs
lola: 21771390 markings, 36648258 edges, 639890 markings/sec, 25 secs
lola: 25121826 markings, 41760487 edges, 670087 markings/sec, 30 secs
lola: 28131157 markings, 47207202 edges, 601866 markings/sec, 35 secs
lola: 29173549 markings, 51256938 edges, 208478 markings/sec, 40 secs
lola: 29807570 markings, 54686608 edges, 126804 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: 29944036 markings, 55886071 edges
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_active)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 3108459 markings, 6882924 edges, 621692 markings/sec, 0 secs
lola: 5956431 markings, 13234055 edges, 569594 markings/sec, 5 secs
lola: 8730504 markings, 19394511 edges, 554815 markings/sec, 10 secs
lola: 11469115 markings, 25506867 edges, 547722 markings/sec, 15 secs
lola: 14207530 markings, 31613944 edges, 547683 markings/sec, 20 secs
lola: 16953020 markings, 37739331 edges, 549098 markings/sec, 25 secs
lola: 19943446 markings, 44398850 edges, 598085 markings/sec, 30 secs
lola: 22934369 markings, 51039159 edges, 598185 markings/sec, 35 secs
lola: 25878276 markings, 57575333 edges, 588781 markings/sec, 40 secs
lola: 28703651 markings, 63893121 edges, 565075 markings/sec, 45 secs
lola: 31521578 markings, 70195971 edges, 563585 markings/sec, 50 secs
lola: 34208574 markings, 76185610 edges, 537399 markings/sec, 55 secs
lola: 36889640 markings, 82123372 edges, 536213 markings/sec, 60 secs
lola: 39514437 markings, 87952102 edges, 524959 markings/sec, 65 secs
lola: 42142851 markings, 93823822 edges, 525683 markings/sec, 70 secs
lola: 44755027 markings, 99644536 edges, 522435 markings/sec, 75 secs
lola: 47370406 markings, 105473919 edges, 523076 markings/sec, 80 secs
lola: 49993642 markings, 111328818 edges, 524647 markings/sec, 85 secs
lola: 52642552 markings, 117233178 edges, 529782 markings/sec, 90 secs
lola: 55175486 markings, 122925139 edges, 506587 markings/sec, 95 secs
lola: 57889081 markings, 128959765 edges, 542719 markings/sec, 100 secs
lola: 60568140 markings, 134900808 edges, 535812 markings/sec, 105 secs
lola: 63117795 markings, 140616956 edges, 509931 markings/sec, 110 secs
lola: 65726185 markings, 146439755 edges, 521678 markings/sec, 115 secs
lola: 68368938 markings, 152317291 edges, 528551 markings/sec, 120 secs
lola: 70976614 markings, 158149447 edges, 521535 markings/sec, 125 secs
lola: 73617107 markings, 164009916 edges, 528099 markings/sec, 130 secs
lola: 76199327 markings, 169785502 edges, 516444 markings/sec, 135 secs
lola: 78762047 markings, 175532186 edges, 512544 markings/sec, 140 secs
lola: 81464713 markings, 181542302 edges, 540533 markings/sec, 145 secs
lola: 84146904 markings, 187519279 edges, 536438 markings/sec, 150 secs
lola: 86678940 markings, 193138725 edges, 506407 markings/sec, 155 secs
lola: 89358410 markings, 199096118 edges, 535894 markings/sec, 160 secs
lola: 92054835 markings, 205122436 edges, 539285 markings/sec, 165 secs
lola: 94773195 markings, 211181703 edges, 543672 markings/sec, 170 secs
lola: 97462034 markings, 217169353 edges, 537768 markings/sec, 175 secs
lola: 100181408 markings, 223198568 edges, 543875 markings/sec, 180 secs
lola: 102759260 markings, 228984216 edges, 515570 markings/sec, 185 secs
lola: 105390287 markings, 234851104 edges, 526205 markings/sec, 190 secs
lola: 108032544 markings, 240749503 edges, 528451 markings/sec, 195 secs
lola: 110685205 markings, 246649765 edges, 530532 markings/sec, 200 secs
lola: 113345646 markings, 252576304 edges, 532088 markings/sec, 205 secs
lola: 116025619 markings, 258526581 edges, 535995 markings/sec, 210 secs
lola: 118669988 markings, 264473144 edges, 528874 markings/sec, 215 secs
lola: 121365087 markings, 270466418 edges, 539020 markings/sec, 220 secs
lola: 124027926 markings, 276434328 edges, 532568 markings/sec, 225 secs
lola: 126608935 markings, 282214574 edges, 516202 markings/sec, 230 secs
lola: 129350763 markings, 288309464 edges, 548366 markings/sec, 235 secs
lola: 132050913 markings, 294301746 edges, 540030 markings/sec, 240 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 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 3997401 markings, 6021015 edges, 799480 markings/sec, 0 secs
lola: 8946032 markings, 12776556 edges, 989726 markings/sec, 5 secs
lola: 13594393 markings, 18969006 edges, 929672 markings/sec, 10 secs
lola: 15879249 markings, 24001540 edges, 456971 markings/sec, 15 secs
lola: 20302420 markings, 30124503 edges, 884634 markings/sec, 20 secs
lola: 25190225 markings, 36865589 edges, 977561 markings/sec, 25 secs
lola: 29151168 markings, 43098557 edges, 792189 markings/sec, 30 secs
lola: 31503466 markings, 47940919 edges, 470460 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 32928056 markings, 50888083 edges
lola: ========================================
lola: subprocess 4 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_i2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4550510 markings, 7637798 edges, 910102 markings/sec, 0 secs
lola: 9162227 markings, 15395098 edges, 922343 markings/sec, 5 secs
lola: 12117863 markings, 21710008 edges, 591127 markings/sec, 10 secs
lola: 15373614 markings, 26750577 edges, 651150 markings/sec, 15 secs
lola: 18648790 markings, 31818007 edges, 655035 markings/sec, 20 secs
lola: 21882833 markings, 36820444 edges, 646809 markings/sec, 25 secs
lola: 25275945 markings, 41991353 edges, 678622 markings/sec, 30 secs
lola: 28172471 markings, 47425285 edges, 579305 markings/sec, 35 secs
lola: 29226352 markings, 51471997 edges, 210776 markings/sec, 40 secs
lola: 29835157 markings, 54903421 edges, 121761 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: 29944036 markings, 55886071 edges
lola: ========================================
lola: subprocess 5 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(off)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4296978 markings, 8038300 edges, 859396 markings/sec, 0 secs
lola: 8658315 markings, 16211221 edges, 872267 markings/sec, 5 secs
lola: 11148559 markings, 23735728 edges, 498049 markings/sec, 10 secs
lola: 14323534 markings, 29279212 edges, 634995 markings/sec, 15 secs
lola: 17585661 markings, 34948930 edges, 652425 markings/sec, 20 secs
lola: 20548049 markings, 40073778 edges, 592478 markings/sec, 25 secs
lola: 23700334 markings, 45499090 edges, 630457 markings/sec, 30 secs
lola: 26903016 markings, 50980950 edges, 640536 markings/sec, 35 secs
lola: 27928055 markings, 55790939 edges, 205008 markings/sec, 40 secs
lola: 28700810 markings, 60301652 edges, 154551 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 28964010 markings, 62406533 edges
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_sc)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4218745 markings, 7995756 edges, 843749 markings/sec, 0 secs
lola: 8421753 markings, 15966410 edges, 840602 markings/sec, 5 secs
lola: 11028434 markings, 23524082 edges, 521336 markings/sec, 10 secs
lola: 14290050 markings, 29149584 edges, 652323 markings/sec, 15 secs
lola: 17527194 markings, 34791790 edges, 647429 markings/sec, 20 secs
lola: 20663739 markings, 40333806 edges, 627309 markings/sec, 25 secs
lola: 23738599 markings, 45846803 edges, 614972 markings/sec, 30 secs
lola: 27139846 markings, 51758527 edges, 680249 markings/sec, 35 secs
lola: 28033441 markings, 56636599 edges, 178719 markings/sec, 40 secs
lola: 28679786 markings, 60754027 edges, 129269 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 28956026 markings, 62390561 edges
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4292734 markings, 7204508 edges, 858547 markings/sec, 0 secs
lola: 8871986 markings, 14906749 edges, 915850 markings/sec, 5 secs
lola: 11760108 markings, 21155993 edges, 577624 markings/sec, 10 secs
lola: 15280997 markings, 26606387 edges, 704178 markings/sec, 15 secs
lola: 18877105 markings, 32171868 edges, 719222 markings/sec, 20 secs
lola: 22501224 markings, 37776211 edges, 724824 markings/sec, 25 secs
lola: 26321699 markings, 43561076 edges, 764095 markings/sec, 30 secs
lola: 28525628 markings, 48945226 edges, 440786 markings/sec, 35 secs
lola: 29634817 markings, 53519392 edges, 221838 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: 29944036 markings, 55886071 edges
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4450378 markings, 7469436 edges, 890076 markings/sec, 0 secs
lola: 9123661 markings, 15330262 edges, 934657 markings/sec, 5 secs
lola: 12215154 markings, 21861534 edges, 618299 markings/sec, 10 secs
lola: 15589724 markings, 27084315 edges, 674914 markings/sec, 15 secs
lola: 18978040 markings, 32327866 edges, 677663 markings/sec, 20 secs
lola: 22325960 markings, 37505407 edges, 669584 markings/sec, 25 secs
lola: 25815522 markings, 42801029 edges, 697912 markings/sec, 30 secs
lola: 28317433 markings, 48184689 edges, 500382 markings/sec, 35 secs
lola: 29443350 markings, 52476779 edges, 225183 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: 29944036 markings, 55886071 edges
lola: ========================================
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4117293 markings, 6187509 edges, 823459 markings/sec, 0 secs
lola: 8719474 markings, 12474493 edges, 920436 markings/sec, 5 secs
lola: 12957948 markings, 18121074 edges, 847695 markings/sec, 10 secs
lola: 14780996 markings, 22478487 edges, 364610 markings/sec, 15 secs
lola: 18474714 markings, 27596534 edges, 738744 markings/sec, 20 secs
lola: 22618928 markings, 33321994 edges, 828843 markings/sec, 25 secs
lola: 26976988 markings, 39321201 edges, 871612 markings/sec, 30 secs
lola: 29723883 markings, 44202693 edges, 549379 markings/sec, 35 secs
lola: 31637631 markings, 48277967 edges, 382750 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 32928056 markings, 50888083 edges
lola: ========================================
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_sc)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4015654 markings, 7611410 edges, 803131 markings/sec, 0 secs
lola: 8263452 markings, 15666217 edges, 849560 markings/sec, 5 secs
lola: 11003996 markings, 23450576 edges, 548109 markings/sec, 10 secs
lola: 14018071 markings, 28680527 edges, 602815 markings/sec, 15 secs
lola: 17353030 markings, 34486981 edges, 666992 markings/sec, 20 secs
lola: 20581407 markings, 40187309 edges, 645675 markings/sec, 25 secs
lola: 23748715 markings, 45863497 edges, 633462 markings/sec, 30 secs
lola: 26992743 markings, 51498575 edges, 648806 markings/sec, 35 secs
lola: 28062106 markings, 56838517 edges, 213873 markings/sec, 40 secs
lola: 28810218 markings, 61518833 edges, 149622 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 28956026 markings, 62390561 edges
lola: ========================================
lola: subprocess 11 will run for 560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4389061 markings, 6563540 edges, 877812 markings/sec, 0 secs
lola: 9305678 markings, 13255636 edges, 983323 markings/sec, 5 secs
lola: 13949428 markings, 19442358 edges, 928750 markings/sec, 10 secs
lola: 16125414 markings, 24342878 edges, 435197 markings/sec, 15 secs
lola: 20570337 markings, 30493884 edges, 888985 markings/sec, 20 secs
lola: 25470457 markings, 37250492 edges, 980024 markings/sec, 25 secs
lola: 29290300 markings, 43362833 edges, 763969 markings/sec, 30 secs
lola: 31547493 markings, 48088795 edges, 451439 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 32928056 markings, 50888083 edges
lola: ========================================
lola: subprocess 12 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rdy)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4185838 markings, 7763303 edges, 837168 markings/sec, 0 secs
lola: 8170589 markings, 15242692 edges, 796950 markings/sec, 5 secs
lola: 12198983 markings, 22874421 edges, 805679 markings/sec, 10 secs
lola: 16213304 markings, 30637440 edges, 802864 markings/sec, 15 secs
lola: 20155084 markings, 38665123 edges, 788356 markings/sec, 20 secs
lola: 24019672 markings, 46658920 edges, 772918 markings/sec, 25 secs
lola: 27850623 markings, 54585224 edges, 766190 markings/sec, 30 secs
lola: 31681199 markings, 62508244 edges, 766115 markings/sec, 35 secs
lola: 35563017 markings, 70538714 edges, 776364 markings/sec, 40 secs
lola: 39455273 markings, 78592000 edges, 778451 markings/sec, 45 secs
lola: 39934089 markings, 84408595 edges, 95763 markings/sec, 50 secs
lola: 40523522 markings, 89312004 edges, 117887 markings/sec, 55 secs
lola: 41192171 markings, 93828285 edges, 133730 markings/sec, 60 secs
lola: 41911174 markings, 98471133 edges, 143801 markings/sec, 65 secs
lola: 45413228 markings, 105804017 edges, 700411 markings/sec, 70 secs
lola: 48960904 markings, 112989084 edges, 709535 markings/sec, 75 secs
lola: 52623694 markings, 120406733 edges, 732558 markings/sec, 80 secs
lola: 55208904 markings, 127532043 edges, 517042 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 56831164 markings, 133099876 edges
lola: ========================================
lola: subprocess 13 will run for 888 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(move)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4432576 markings, 7340025 edges, 886515 markings/sec, 0 secs
lola: 9146578 markings, 15153939 edges, 942800 markings/sec, 5 secs
lola: 11984212 markings, 22450857 edges, 567527 markings/sec, 10 secs
lola: 15339450 markings, 27314124 edges, 671048 markings/sec, 15 secs
lola: 19160899 markings, 32854618 edges, 764290 markings/sec, 20 secs
lola: 21313999 markings, 37843501 edges, 430620 markings/sec, 25 secs
lola: 23022486 markings, 42401070 edges, 341697 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 23970020 markings, 44936036 edges
lola: ========================================
lola: subprocess 14 will run for 1313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4437124 markings, 7447248 edges, 887425 markings/sec, 0 secs
lola: 9080499 markings, 15257479 edges, 928675 markings/sec, 5 secs
lola: 12067117 markings, 21632135 edges, 597324 markings/sec, 10 secs
lola: 15542103 markings, 27011082 edges, 694997 markings/sec, 15 secs
lola: 18906658 markings, 32216878 edges, 672911 markings/sec, 20 secs
lola: 22178690 markings, 37277685 edges, 654406 markings/sec, 25 secs
lola: 25549653 markings, 42402188 edges, 674193 markings/sec, 30 secs
lola: 28230997 markings, 47731577 edges, 536269 markings/sec, 35 secs
lola: 29251366 markings, 51583962 edges, 204074 markings/sec, 40 secs
lola: 29835157 markings, 54903683 edges, 116758 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: 29944036 markings, 55886071 edges
lola: ========================================
lola: subprocess 15 will run for 2576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(r_stopped)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4785720 markings, 6204533 edges, 957144 markings/sec, 0 secs
lola: 8329553 markings, 13161108 edges, 708767 markings/sec, 5 secs
lola: 11375906 markings, 19825090 edges, 609271 markings/sec, 10 secs
lola: 14431667 markings, 26515043 edges, 611152 markings/sec, 15 secs
lola: 17769734 markings, 34007455 edges, 667613 markings/sec, 20 secs
lola: 21593358 markings, 40205110 edges, 764725 markings/sec, 25 secs
lola: 25157785 markings, 45865736 edges, 712885 markings/sec, 30 secs
lola: 27257464 markings, 51167299 edges, 419936 markings/sec, 35 secs
lola: 28769991 markings, 56442402 edges, 302505 markings/sec, 40 secs
lola: 30144390 markings, 62160588 edges, 274880 markings/sec, 45 secs
lola: 30571171 markings, 66473902 edges, 85356 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: 30952026 markings, 68882064 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1000 1001 unknown 1000 1001 1000 1000 1001 1001 1000 1000 1000 1000 1000 1001 1000
FORMULA RobotManipulation-PT-00500-UpperBounds-0 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-1 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-3 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-4 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-5 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-6 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-7 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-8 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-9 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-10 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-11 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-12 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-13 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-14 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-15 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS 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="RobotManipulation-PT-00500"
export BK_EXAMINATION="UpperBounds"
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/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 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 RobotManipulation-PT-00500, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-152685548800058"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;