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-structural
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 r095-blw7-152650007300334
=====================================================================

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


BK_STOP 1527622553115

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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 stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 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 235 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: state equation: calling and running 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 || 3830888 markings, 10235040 edges, 766178 markings/sec, 0 secs
lola: sara is running 5 secs || 7650083 markings, 20885258 edges, 763839 markings/sec, 5 secs
lola: sara is running 10 secs || 11281074 markings, 29782798 edges, 726198 markings/sec, 10 secs
lola: sara is running 15 secs || 14442622 markings, 37363546 edges, 632310 markings/sec, 15 secs
lola: sara is running 20 secs || 17364370 markings, 44373911 edges, 584350 markings/sec, 20 secs
lola: sara is running 25 secs || 20236908 markings, 51266577 edges, 574508 markings/sec, 25 secs
lola: sara is running 30 secs || 23132682 markings, 58214616 edges, 579155 markings/sec, 30 secs
lola: sara is running 35 secs || 25844892 markings, 64722438 edges, 542442 markings/sec, 35 secs
lola: sara is running 40 secs || 28559052 markings, 71234994 edges, 542832 markings/sec, 40 secs
lola: sara is running 45 secs || 31421368 markings, 78102891 edges, 572463 markings/sec, 45 secs
lola: sara is running 50 secs || 34246310 markings, 84881070 edges, 564988 markings/sec, 50 secs
lola: sara is running 55 secs || 36958280 markings, 91388299 edges, 542394 markings/sec, 55 secs
lola: sara is running 60 secs || 39605042 markings, 97739019 edges, 529352 markings/sec, 60 secs
lola: sara is running 65 secs || 42443091 markings, 104548576 edges, 567610 markings/sec, 65 secs
lola: sara is running 70 secs || 45241141 markings, 111262002 edges, 559610 markings/sec, 70 secs
lola: sara is running 75 secs || 48009183 markings, 117903517 edges, 553608 markings/sec, 75 secs
lola: sara is running 80 secs || 50749948 markings, 124479619 edges, 548153 markings/sec, 80 secs
lola: sara is running 85 secs || 53225946 markings, 130420637 edges, 495200 markings/sec, 85 secs
lola: sara is running 90 secs || 55928323 markings, 136904624 edges, 540475 markings/sec, 90 secs
lola: sara is running 95 secs || 58488753 markings, 143048105 edges, 512086 markings/sec, 95 secs
lola: sara is running 100 secs || 61228296 markings, 149621197 edges, 547909 markings/sec, 100 secs
lola: sara is running 105 secs || 64073499 markings, 156448054 edges, 569041 markings/sec, 105 secs
lola: sara is running 110 secs || 66949583 markings, 163348520 edges, 575217 markings/sec, 110 secs
lola: sara is running 115 secs || 69806380 markings, 170203134 edges, 571359 markings/sec, 115 secs
lola: sara is running 120 secs || 72715575 markings, 177183150 edges, 581839 markings/sec, 120 secs
lola: sara is running 125 secs || 75565544 markings, 184021301 edges, 569994 markings/sec, 125 secs
lola: sara is running 130 secs || 78456863 markings, 190958403 edges, 578264 markings/sec, 130 secs
lola: sara is running 135 secs || 81365382 markings, 197937009 edges, 581704 markings/sec, 135 secs
lola: sara is running 140 secs || 84268417 markings, 204902466 edges, 580607 markings/sec, 140 secs
lola: sara is running 145 secs || 87152522 markings, 211822248 edges, 576821 markings/sec, 145 secs
lola: sara is running 150 secs || 90081955 markings, 218850773 edges, 585887 markings/sec, 150 secs
lola: sara is running 155 secs || 93008489 markings, 225872658 edges, 585307 markings/sec, 155 secs
lola: sara is running 160 secs || 95945009 markings, 232917911 edges, 587304 markings/sec, 160 secs
lola: sara is running 165 secs || 98893367 markings, 239992457 edges, 589672 markings/sec, 165 secs
lola: sara is running 170 secs || 101868539 markings, 247130102 edges, 595034 markings/sec, 170 secs
lola: sara is running 175 secs || 104849093 markings, 254281279 edges, 596111 markings/sec, 175 secs
lola: sara is running 180 secs || 107787373 markings, 261331099 edges, 587656 markings/sec, 180 secs
lola: sara is running 185 secs || 110712179 markings, 268348304 edges, 584961 markings/sec, 185 secs
lola: sara is running 190 secs || 113659908 markings, 275420789 edges, 589546 markings/sec, 190 secs
lola: sara is running 195 secs || 116660634 markings, 282621195 edges, 600145 markings/sec, 195 secs
lola: sara is running 200 secs || 119765271 markings, 290073790 edges, 620927 markings/sec, 200 secs
lola: sara is running 205 secs || 122494807 markings, 296696002 edges, 545907 markings/sec, 205 secs
lola: sara is running 210 secs || 125247612 markings, 303375799 edges, 550561 markings/sec, 210 secs
lola: sara is running 215 secs || 128038596 markings, 310148116 edges, 558197 markings/sec, 215 secs
lola: sara is running 220 secs || 130896785 markings, 317082335 edges, 571638 markings/sec, 220 secs
lola: sara is running 225 secs || 133712431 markings, 323853061 edges, 563129 markings/sec, 225 secs
lola: sara is running 230 secs || 136568700 markings, 330780017 edges, 571254 markings/sec, 230 secs
lola: sara is running 235 secs || 139430586 markings, 337722174 edges, 572377 markings/sec, 235 secs
lola: sara is running 240 secs || 142153326 markings, 344330540 edges, 544548 markings/sec, 240 secs
lola: sara is running 245 secs || 144991577 markings, 351216998 edges, 567650 markings/sec, 245 secs
lola: sara is running 250 secs || 147672090 markings, 357662777 edges, 536103 markings/sec, 250 secs
lola: sara is running 255 secs || 150462408 markings, 364431487 edges, 558064 markings/sec, 255 secs
lola: sara is running 260 secs || 153273495 markings, 371251835 edges, 562217 markings/sec, 260 secs
lola: sara is running 265 secs || 156102461 markings, 378115862 edges, 565793 markings/sec, 265 secs
lola: sara is running 270 secs || 158944875 markings, 385012553 edges, 568483 markings/sec, 270 secs
lola: sara is running 275 secs || 161647922 markings, 391512323 edges, 540609 markings/sec, 275 secs
lola: sara is running 280 secs || 164621669 markings, 398722562 edges, 594749 markings/sec, 280 secs
lola: sara is running 285 secs || 167551237 markings, 405827786 edges, 585914 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 || 3909859 markings, 10455325 edges, 781972 markings/sec, 0 secs
lola: sara is running 5 secs || 7575079 markings, 20675629 edges, 733044 markings/sec, 5 secs
lola: sara is running 10 secs || 11387111 markings, 30036664 edges, 762406 markings/sec, 10 secs
lola: sara is running 15 secs || 14670203 markings, 37909686 edges, 656618 markings/sec, 15 secs
lola: sara is running 20 secs || 17735102 markings, 45263542 edges, 612980 markings/sec, 20 secs
lola: sara is running 25 secs || 20718627 markings, 52422249 edges, 596705 markings/sec, 25 secs
lola: sara is running 30 secs || 23662923 markings, 59486888 edges, 588859 markings/sec, 30 secs
lola: sara is running 35 secs || 26593110 markings, 66517656 edges, 586037 markings/sec, 35 secs
lola: sara is running 40 secs || 29491481 markings, 73472001 edges, 579674 markings/sec, 40 secs
lola: sara is running 45 secs || 32367055 markings, 80371823 edges, 575115 markings/sec, 45 secs
lola: sara is running 50 secs || 35220938 markings, 87219349 edges, 570777 markings/sec, 50 secs
lola: sara is running 55 secs || 38055923 markings, 94021745 edges, 566997 markings/sec, 55 secs
lola: sara is running 60 secs || 40875951 markings, 100788025 edges, 564006 markings/sec, 60 secs
lola: sara is running 65 secs || 43679142 markings, 107514116 edges, 560638 markings/sec, 65 secs
lola: sara is running 70 secs || 46465947 markings, 114200733 edges, 557361 markings/sec, 70 secs
lola: sara is running 75 secs || 49235263 markings, 120845349 edges, 553863 markings/sec, 75 secs
lola: sara is running 80 secs || 51979530 markings, 127429969 edges, 548853 markings/sec, 80 secs
lola: sara is running 85 secs || 54719861 markings, 134005596 edges, 548066 markings/sec, 85 secs
lola: sara is running 90 secs || 57548925 markings, 140793165 edges, 565813 markings/sec, 90 secs
lola: sara is running 95 secs || 60348347 markings, 147509912 edges, 559884 markings/sec, 95 secs
lola: sara is running 100 secs || 63134314 markings, 154194528 edges, 557193 markings/sec, 100 secs
lola: sara is running 105 secs || 65896460 markings, 160822148 edges, 552429 markings/sec, 105 secs
lola: sara is running 110 secs || 68640288 markings, 167405305 edges, 548766 markings/sec, 110 secs
lola: sara is running 115 secs || 71325493 markings, 173847934 edges, 537041 markings/sec, 115 secs
lola: sara is running 120 secs || 74123025 markings, 180560400 edges, 559506 markings/sec, 120 secs
lola: sara is running 125 secs || 76930846 markings, 187297194 edges, 561564 markings/sec, 125 secs
lola: sara is running 130 secs || 79754514 markings, 194072025 edges, 564734 markings/sec, 130 secs
lola: sara is running 135 secs || 82539143 markings, 200753838 edges, 556926 markings/sec, 135 secs
lola: sara is running 140 secs || 85354048 markings, 207507038 edges, 562981 markings/sec, 140 secs
lola: sara is running 145 secs || 88090871 markings, 214073505 edges, 547365 markings/sec, 145 secs
lola: sara is running 150 secs || 90860847 markings, 220719567 edges, 553995 markings/sec, 150 secs
lola: sara is running 155 secs || 93699004 markings, 227529006 edges, 567631 markings/sec, 155 secs
lola: sara is running 160 secs || 96570357 markings, 234418321 edges, 574271 markings/sec, 160 secs
lola: sara is running 165 secs || 99494568 markings, 241434292 edges, 584842 markings/sec, 165 secs
lola: sara is running 170 secs || 102418622 markings, 248449851 edges, 584811 markings/sec, 170 secs
lola: sara is running 175 secs || 105342757 markings, 255465794 edges, 584827 markings/sec, 175 secs
lola: sara is running 180 secs || 108299696 markings, 262560374 edges, 591388 markings/sec, 180 secs
lola: sara is running 185 secs || 111306776 markings, 269775109 edges, 601416 markings/sec, 185 secs
lola: sara is running 190 secs || 114327554 markings, 277022953 edges, 604156 markings/sec, 190 secs
lola: sara is running 195 secs || 117422174 markings, 284448246 edges, 618924 markings/sec, 195 secs
lola: sara is running 200 secs || 120454975 markings, 291792557 edges, 606560 markings/sec, 200 secs
lola: sara is running 205 secs || 122999168 markings, 297909641 edges, 508839 markings/sec, 205 secs
lola: sara is running 210 secs || 125740882 markings, 304561796 edges, 548343 markings/sec, 210 secs
lola: sara is running 215 secs || 128580985 markings, 311451770 edges, 568021 markings/sec, 215 secs
lola: sara is running 220 secs || 131505475 markings, 318545102 edges, 584898 markings/sec, 220 secs
lola: sara is running 225 secs || 134458487 markings, 325707236 edges, 590602 markings/sec, 225 secs
lola: sara is running 230 secs || 137289779 markings, 332516288 edges, 566258 markings/sec, 230 secs
lola: sara is running 235 secs || 140102400 markings, 339337794 edges, 562524 markings/sec, 235 secs
lola: sara is running 240 secs || 142987669 markings, 346336180 edges, 577054 markings/sec, 240 secs
lola: sara is running 245 secs || 145895471 markings, 353389356 edges, 581560 markings/sec, 245 secs
lola: sara is running 250 secs || 148787718 markings, 360405517 edges, 578449 markings/sec, 250 secs
lola: sara is running 255 secs || 151601513 markings, 367232497 edges, 562759 markings/sec, 255 secs
lola: sara is running 260 secs || 154302100 markings, 373725642 edges, 540117 markings/sec, 260 secs
lola: sara is running 265 secs || 157148984 markings, 380631597 edges, 569377 markings/sec, 265 secs
lola: sara is running 270 secs || 160021179 markings, 387599283 edges, 574439 markings/sec, 270 secs
lola: sara is running 275 secs || 162884767 markings, 394546765 edges, 572718 markings/sec, 275 secs
lola: sara is running 280 secs || 165693068 markings, 401361690 edges, 561660 markings/sec, 280 secs
lola: sara is running 285 secs || 168339154 markings, 407723014 edges, 529217 markings/sec, 285 secs
lola: sara is running 290 secs || 171132357 markings, 414500027 edges, 558641 markings/sec, 290 secs
lola: sara is running 295 secs || 173940804 markings, 421314726 edges, 561689 markings/sec, 295 secs
lola: sara is running 300 secs || 176791312 markings, 428230986 edges, 570102 markings/sec, 300 secs
lola: sara is running 305 secs || 179566488 markings, 434951113 edges, 555035 markings/sec, 305 secs
lola: sara is running 310 secs || 182232664 markings, 441375801 edges, 533235 markings/sec, 310 secs
lola: sara is running 315 secs || 184943477 markings, 447955165 edges, 542163 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r095-blw7-152650007300334"
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 ;