fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r094-blw7-152650006400334
Last Updated
June 26, 2018

About the Execution of M4M.full for GPPP-PT-C0100N0000100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.300 625423.00 1245188.00 1671.80 ???????????????? 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 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is GPPP-PT-C0100N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006400334
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527535593863


BK_STOP 1527536219286

--------------------
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 GPPP-PT-C0100N0000100000 as instance name.
Using GPPP 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': False, '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': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 1078924, 'Memory': 15952.92, 'Tool': 'lola'}, {'Time': 1103104, 'Memory': 15950.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola GPPP-PT-C0100N0000100000...

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


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000100000: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ GPPP-PT-C0100N0000100000 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000100000-ReachabilityCardinality.task
lola: A (G (((S7P <= GSH) OR (1 <= NADPH) OR (F6P + 1 <= b1) OR (Lac <= b1) OR (1 <= NADPplus) OR (3 <= start) OR (G6P <= _3PG)))) : A (G (((NADPplus + 1 <= E4P) OR ((2 <= NADPH) AND (3 <= PEP)) OR (1 <= NADH) OR (Lac <= b2)))) : E (F ((3 <= S7P))) : A (G (((F6P <= b1) OR ((F6P <= a1) AND (R5P <= _2PG)) OR (c1 <= G6P)))) : E (F ((((b1 <= NADPplus) OR (Xu5P <= b2) OR ((3 <= S7P) AND (3 <= _1_3_BPG))) AND (NADplus + 1 <= Lac)))) : E (F (((S7P <= a1) AND (1 <= PEP) AND (1 <= Lac) AND (2 <= R5P)))) : A (G ((_1_3_BPG <= NADplus))) : E (F (((_3PG + 1 <= Pyr) AND (ATP <= 0) AND ((GSH + 1 <= GSSG) OR (Ru5P + 1 <= S7P))))) : A (G (((a1 <= ADP) OR (3 <= GAP) OR (GSH <= 0) OR (1 <= NADplus) OR (start <= 0)))) : E (F (((GSH <= 2) AND (Gluc <= 0) AND (1 <= a2)))) : E (F (((G6P <= 0) AND (Lac + 1 <= start) AND (GSSG <= 2) AND (F6P <= 0)))) : A (G ((start + 1 <= GSSG))) : A (G (((3 <= Xu5P) OR ((1 <= a1) AND (GSH <= a1)) OR (_2PG <= NADplus)))) : A (G (((NADPH + 1 <= a2) OR (Ru5P <= 1) OR (2 <= ATP) OR (1 <= Pyr) OR ((2 <= c2) AND (FBP <= _3PG))))) : A (G ((2 <= NADPplus))) : E (F ((1 <= Lac)))
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 (((S7P <= GSH) OR (1 <= NADPH) OR (F6P + 1 <= b1) OR (Lac <= b1) OR (1 <= NADPplus) OR (3 <= start) OR (G6P <= _3PG))))
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 84 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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NADPplus + 1 <= E4P) OR ((2 <= NADPH) AND (3 <= PEP)) OR (1 <= NADH) OR (Lac <= b2))))
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 84 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= S7P)))
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 84 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 GPPP-PT-C0100N0000100000-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-2.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F6P <= b1) OR ((F6P <= a1) AND (R5P <= _2PG)) OR (c1 <= G6P))))
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 84 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 607 markings, 606 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((b1 <= NADPplus) OR (Xu5P <= b2) OR ((3 <= S7P) AND (3 <= _1_3_BPG))) AND (NADplus + 1 <= Lac))))
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 84 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3524274 markings, 9378876 edges, 704855 markings/sec, 0 secs
lola: sara is running 5 secs || 7296035 markings, 19896685 edges, 754352 markings/sec, 5 secs
lola: sara is running 10 secs || 10966143 markings, 29028428 edges, 734022 markings/sec, 10 secs
lola: sara is running 15 secs || 14139573 markings, 36636427 edges, 634686 markings/sec, 15 secs
lola: sara is running 20 secs || 17160473 markings, 43884828 edges, 604180 markings/sec, 20 secs
lola: sara is running 25 secs || 19975601 markings, 50639533 edges, 563026 markings/sec, 25 secs
lola: sara is running 30 secs || 22698222 markings, 57172397 edges, 544524 markings/sec, 30 secs
lola: sara is running 35 secs || 25451873 markings, 63779564 edges, 550730 markings/sec, 35 secs
lola: sara is running 40 secs || 28320579 markings, 70662801 edges, 573741 markings/sec, 40 secs
lola: sara is running 45 secs || 31188163 markings, 77543593 edges, 573517 markings/sec, 45 secs
lola: sara is running 50 secs || 34035925 markings, 84376386 edges, 569552 markings/sec, 50 secs
lola: sara is running 55 secs || 36888703 markings, 91221444 edges, 570556 markings/sec, 55 secs
lola: sara is running 60 secs || 39724405 markings, 98025281 edges, 567140 markings/sec, 60 secs
lola: sara is running 65 secs || 42577402 markings, 104870748 edges, 570599 markings/sec, 65 secs
lola: sara is running 70 secs || 45419776 markings, 111690583 edges, 568475 markings/sec, 70 secs
lola: sara is running 75 secs || 48270760 markings, 118531291 edges, 570197 markings/sec, 75 secs
lola: sara is running 80 secs || 51131046 markings, 125394181 edges, 572057 markings/sec, 80 secs
lola: sara is running 85 secs || 53973961 markings, 132215362 edges, 568583 markings/sec, 85 secs
lola: sara is running 90 secs || 56791774 markings, 138976473 edges, 563563 markings/sec, 90 secs
lola: sara is running 95 secs || 59634471 markings, 145797232 edges, 568539 markings/sec, 95 secs
lola: sara is running 100 secs || 62487755 markings, 152643092 edges, 570657 markings/sec, 100 secs
lola: sara is running 105 secs || 65314408 markings, 159425197 edges, 565331 markings/sec, 105 secs
lola: sara is running 110 secs || 68141112 markings, 166207720 edges, 565341 markings/sec, 110 secs
lola: sara is running 115 secs || 70981922 markings, 173023520 edges, 568162 markings/sec, 115 secs
lola: sara is running 120 secs || 73794319 markings, 179772056 edges, 562479 markings/sec, 120 secs
lola: sara is running 125 secs || 76547312 markings, 186376789 edges, 550599 markings/sec, 125 secs
lola: sara is running 130 secs || 79406168 markings, 193236437 edges, 571771 markings/sec, 130 secs
lola: sara is running 135 secs || 82277410 markings, 200125325 edges, 574248 markings/sec, 135 secs
lola: sara is running 140 secs || 85173502 markings, 207073935 edges, 579218 markings/sec, 140 secs
lola: sara is running 145 secs || 88062436 markings, 214005321 edges, 577787 markings/sec, 145 secs
lola: sara is running 150 secs || 90938014 markings, 220904785 edges, 575116 markings/sec, 150 secs
lola: sara is running 155 secs || 93817303 markings, 227812889 edges, 575858 markings/sec, 155 secs
lola: sara is running 160 secs || 96711814 markings, 234758012 edges, 578902 markings/sec, 160 secs
lola: sara is running 165 secs || 99633006 markings, 241766326 edges, 584238 markings/sec, 165 secs
lola: sara is running 170 secs || 102560502 markings, 248790398 edges, 585499 markings/sec, 170 secs
lola: sara is running 175 secs || 105495040 markings, 255831041 edges, 586908 markings/sec, 175 secs
lola: sara is running 180 secs || 108450800 markings, 262922864 edges, 591152 markings/sec, 180 secs
lola: sara is running 185 secs || 111423232 markings, 270054431 edges, 594486 markings/sec, 185 secs
lola: sara is running 190 secs || 114430900 markings, 277270886 edges, 601534 markings/sec, 190 secs
lola: sara is running 195 secs || 117473131 markings, 284570465 edges, 608446 markings/sec, 195 secs
lola: sara is running 200 secs || 120622909 markings, 292196096 edges, 629956 markings/sec, 200 secs
lola: sara is running 205 secs || 123427982 markings, 298944134 edges, 561015 markings/sec, 205 secs
lola: sara is running 210 secs || 126207183 markings, 305683389 edges, 555840 markings/sec, 210 secs
lola: sara is running 215 secs || 129120725 markings, 312749397 edges, 582708 markings/sec, 215 secs
lola: sara is running 220 secs || 132141483 markings, 320073811 edges, 604152 markings/sec, 220 secs
lola: sara is running 225 secs || 135189425 markings, 327463844 edges, 609588 markings/sec, 225 secs
lola: sara is running 230 secs || 138216415 markings, 334803759 edges, 605398 markings/sec, 230 secs
lola: sara is running 235 secs || 141159927 markings, 341943330 edges, 588702 markings/sec, 235 secs
lola: sara is running 240 secs || 144070841 markings, 348942019 edges, 582183 markings/sec, 240 secs
lola: sara is running 245 secs || 147012126 markings, 356074208 edges, 588257 markings/sec, 245 secs
lola: sara is running 250 secs || 149961708 markings, 363227430 edges, 589916 markings/sec, 250 secs
lola: sara is running 255 secs || 152897206 markings, 370347323 edges, 587100 markings/sec, 255 secs
lola: sara is running 260 secs || 155825978 markings, 377451372 edges, 585754 markings/sec, 260 secs
lola: sara is running 265 secs || 158771358 markings, 384595614 edges, 589076 markings/sec, 265 secs
lola: sara is running 270 secs || 161602947 markings, 391403972 edges, 566318 markings/sec, 270 secs
lola: sara is running 275 secs || 164505650 markings, 398443476 edges, 580541 markings/sec, 275 secs
lola: sara is running 280 secs || 167395867 markings, 405454226 edges, 578043 markings/sec, 280 secs
lola: sara is running 285 secs || 170302567 markings, 412505214 edges, 581340 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((S7P <= a1) AND (1 <= PEP) AND (1 <= Lac) AND (2 <= R5P))))
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 84 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 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-5.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 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((_1_3_BPG <= NADplus)))
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 84 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 GPPP-PT-C0100N0000100000-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000100000-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3899470 markings, 10426213 edges, 779894 markings/sec, 0 secs
lola: sara is running 5 secs || 7711770 markings, 21057158 edges, 762460 markings/sec, 5 secs
lola: sara is running 10 secs || 11559138 markings, 30448627 edges, 769474 markings/sec, 10 secs
lola: sara is running 15 secs || 14915029 markings, 38496999 edges, 671178 markings/sec, 15 secs
lola: sara is running 20 secs || 18077402 markings, 46084942 edges, 632475 markings/sec, 20 secs
lola: sara is running 25 secs || 21158475 markings, 53477710 edges, 616215 markings/sec, 25 secs
lola: sara is running 30 secs || 24200929 markings, 60777936 edges, 608491 markings/sec, 30 secs
lola: sara is running 35 secs || 27210713 markings, 67999659 edges, 601957 markings/sec, 35 secs
lola: sara is running 40 secs || 30198756 markings, 75169174 edges, 597609 markings/sec, 40 secs
lola: sara is running 45 secs || 33157918 markings, 82269510 edges, 591832 markings/sec, 45 secs
lola: sara is running 50 secs || 36098353 markings, 89324859 edges, 588087 markings/sec, 50 secs
lola: sara is running 55 secs || 39058688 markings, 96427826 edges, 592067 markings/sec, 55 secs
lola: sara is running 60 secs || 41979023 markings, 103434890 edges, 584067 markings/sec, 60 secs
lola: sara is running 65 secs || 44878396 markings, 110391871 edges, 579875 markings/sec, 65 secs
lola: sara is running 70 secs || 47771886 markings, 117334308 edges, 578698 markings/sec, 70 secs
lola: sara is running 75 secs || 50634672 markings, 124203185 edges, 572557 markings/sec, 75 secs
lola: sara is running 80 secs || 53487129 markings, 131047251 edges, 570491 markings/sec, 80 secs
lola: sara is running 85 secs || 56323570 markings, 137852961 edges, 567288 markings/sec, 85 secs
lola: sara is running 90 secs || 59138716 markings, 144607472 edges, 563029 markings/sec, 90 secs
lola: sara is running 95 secs || 62020891 markings, 151523009 edges, 576435 markings/sec, 95 secs
lola: sara is running 100 secs || 64900388 markings, 158431932 edges, 575899 markings/sec, 100 secs
lola: sara is running 105 secs || 67757194 markings, 165286490 edges, 571361 markings/sec, 105 secs
lola: sara is running 110 secs || 70666199 markings, 172266069 edges, 581801 markings/sec, 110 secs
lola: sara is running 115 secs || 73532208 markings, 179142718 edges, 573202 markings/sec, 115 secs
lola: sara is running 120 secs || 76402041 markings, 186028256 edges, 573967 markings/sec, 120 secs
lola: sara is running 125 secs || 79252901 markings, 192868840 edges, 570172 markings/sec, 125 secs
lola: sara is running 130 secs || 82127080 markings, 199764510 edges, 574836 markings/sec, 130 secs
lola: sara is running 135 secs || 85006355 markings, 206672765 edges, 575855 markings/sec, 135 secs
lola: sara is running 140 secs || 87881128 markings, 213570371 edges, 574955 markings/sec, 140 secs
lola: sara is running 145 secs || 90767222 markings, 220494951 edges, 577219 markings/sec, 145 secs
lola: sara is running 150 secs || 93652660 markings, 227417959 edges, 577088 markings/sec, 150 secs
lola: sara is running 155 secs || 96547774 markings, 234364012 edges, 579023 markings/sec, 155 secs
lola: sara is running 160 secs || 99482018 markings, 241404087 edges, 586849 markings/sec, 160 secs
lola: sara is running 165 secs || 102286411 markings, 248132806 edges, 560879 markings/sec, 165 secs
lola: sara is running 170 secs || 105235106 markings, 255207404 edges, 589739 markings/sec, 170 secs
lola: sara is running 175 secs || 108199254 markings, 262319643 edges, 592830 markings/sec, 175 secs
lola: sara is running 180 secs || 111181140 markings, 269473679 edges, 596377 markings/sec, 180 secs
lola: sara is running 185 secs || 114193649 markings, 276701445 edges, 602502 markings/sec, 185 secs
lola: sara is running 190 secs || 117194878 markings, 283902929 edges, 600246 markings/sec, 190 secs
lola: sara is running 195 secs || 120261304 markings, 291327153 edges, 613285 markings/sec, 195 secs
lola: sara is running 200 secs || 122728393 markings, 297257944 edges, 493418 markings/sec, 200 secs
lola: sara is running 205 secs || 125335503 markings, 303587098 edges, 521422 markings/sec, 205 secs
lola: sara is running 210 secs || 128004978 markings, 310067316 edges, 533895 markings/sec, 210 secs
lola: sara is running 215 secs || 130718467 markings, 316653831 edges, 542698 markings/sec, 215 secs
lola: sara is running 220 secs || 133348010 markings, 322975414 edges, 525909 markings/sec, 220 secs
lola: sara is running 225 secs || 136095829 markings, 329642779 edges, 549564 markings/sec, 225 secs
lola: sara is running 230 secs || 138867707 markings, 336369048 edges, 554376 markings/sec, 230 secs
lola: sara is running 235 secs || 141611249 markings, 343027774 edges, 548708 markings/sec, 235 secs
lola: sara is running 240 secs || 144589431 markings, 350243914 edges, 595636 markings/sec, 240 secs
lola: sara is running 245 secs || 147501840 markings, 357252665 edges, 582482 markings/sec, 245 secs
lola: sara is running 250 secs || 150454735 markings, 364413026 edges, 590579 markings/sec, 250 secs
lola: sara is running 255 secs || 153109312 markings, 370857140 edges, 530915 markings/sec, 255 secs
lola: sara is running 260 secs || 156041112 markings, 377968402 edges, 586360 markings/sec, 260 secs
lola: sara is running 265 secs || 159020775 markings, 385194947 edges, 595933 markings/sec, 265 secs
lola: sara is running 270 secs || 161891322 markings, 392099912 edges, 574109 markings/sec, 270 secs
lola: sara is running 275 secs || 164785308 markings, 399116310 edges, 578797 markings/sec, 275 secs
lola: sara is running 280 secs || 167688494 markings, 406157836 edges, 580637 markings/sec, 280 secs
lola: sara is running 285 secs || 170607169 markings, 413237389 edges, 583735 markings/sec, 285 secs
lola: sara is running 290 secs || 173533650 markings, 420336103 edges, 585296 markings/sec, 290 secs
lola: sara is running 295 secs || 176409032 markings, 427312332 edges, 575076 markings/sec, 295 secs
lola: sara is running 300 secs || 179224333 markings, 434082423 edges, 563060 markings/sec, 300 secs
lola: sara is running 305 secs || 182010242 markings, 440840713 edges, 557182 markings/sec, 305 secs
lola: sara is running 310 secs || 184870974 markings, 447780832 edges, 572146 markings/sec, 310 secs
lola: sara is running 315 secs || 187095444 markings, 453192485 edges, 444894 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-15 CANNOT_COMPUTE 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="GPPP-PT-C0100N0000100000"
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/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 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 GPPP-PT-C0100N0000100000, 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 r094-blw7-152650006400334"
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 ;