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.6K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 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 irma4mcc-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 r091-blw7-152650003700334
=====================================================================

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


BK_STOP 1527200279149

--------------------
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 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
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
lola: 607 markings, 606 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000100000-ReachabilityCardinality-3.sara
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 || 3586277 markings, 9552114 edges, 717255 markings/sec, 0 secs
lola: sara is running 5 secs || 7026199 markings, 19143493 edges, 687984 markings/sec, 5 secs
lola: sara is running 10 secs || 10645996 markings, 28262238 edges, 723959 markings/sec, 10 secs
lola: sara is running 15 secs || 13849528 markings, 35940420 edges, 640706 markings/sec, 15 secs
lola: sara is running 20 secs || 16610632 markings, 42565451 edges, 552221 markings/sec, 20 secs
lola: sara is running 25 secs || 19435996 markings, 49344887 edges, 565073 markings/sec, 25 secs
lola: sara is running 30 secs || 22052891 markings, 55624229 edges, 523379 markings/sec, 30 secs
lola: sara is running 35 secs || 24793553 markings, 62200007 edges, 548132 markings/sec, 35 secs
lola: sara is running 40 secs || 27554925 markings, 68825640 edges, 552274 markings/sec, 40 secs
lola: sara is running 45 secs || 30289032 markings, 75385699 edges, 546821 markings/sec, 45 secs
lola: sara is running 50 secs || 33007116 markings, 81907710 edges, 543617 markings/sec, 50 secs
lola: sara is running 55 secs || 35720436 markings, 88418017 edges, 542664 markings/sec, 55 secs
lola: sara is running 60 secs || 38418819 markings, 94892464 edges, 539677 markings/sec, 60 secs
lola: sara is running 65 secs || 41048146 markings, 101201381 edges, 525865 markings/sec, 65 secs
lola: sara is running 70 secs || 43728009 markings, 107631376 edges, 535973 markings/sec, 70 secs
lola: sara is running 75 secs || 46401603 markings, 114046370 edges, 534719 markings/sec, 75 secs
lola: sara is running 80 secs || 49055384 markings, 120413765 edges, 530756 markings/sec, 80 secs
lola: sara is running 85 secs || 51713973 markings, 126792754 edges, 531718 markings/sec, 85 secs
lola: sara is running 90 secs || 54347879 markings, 133112651 edges, 526781 markings/sec, 90 secs
lola: sara is running 95 secs || 56980190 markings, 139428448 edges, 526462 markings/sec, 95 secs
lola: sara is running 100 secs || 59651763 markings, 145838661 edges, 534315 markings/sec, 100 secs
lola: sara is running 105 secs || 62291939 markings, 152173343 edges, 528035 markings/sec, 105 secs
lola: sara is running 110 secs || 64914906 markings, 158466622 edges, 524593 markings/sec, 110 secs
lola: sara is running 115 secs || 67537210 markings, 164758547 edges, 524461 markings/sec, 115 secs
lola: sara is running 120 secs || 70236387 markings, 171235001 edges, 539835 markings/sec, 120 secs
lola: sara is running 125 secs || 72912154 markings, 177654893 edges, 535153 markings/sec, 125 secs
lola: sara is running 130 secs || 75535465 markings, 183949221 edges, 524662 markings/sec, 130 secs
lola: sara is running 135 secs || 78230415 markings, 190415260 edges, 538990 markings/sec, 135 secs
lola: sara is running 140 secs || 80879643 markings, 196772049 edges, 529846 markings/sec, 140 secs
lola: sara is running 145 secs || 83574178 markings, 203236486 edges, 538907 markings/sec, 145 secs
lola: sara is running 150 secs || 86263457 markings, 209689054 edges, 537856 markings/sec, 150 secs
lola: sara is running 155 secs || 88922259 markings, 216068442 edges, 531760 markings/sec, 155 secs
lola: sara is running 160 secs || 91609126 markings, 222515210 edges, 537373 markings/sec, 160 secs
lola: sara is running 165 secs || 94325814 markings, 229033119 edges, 543338 markings/sec, 165 secs
lola: sara is running 170 secs || 97060663 markings, 235594776 edges, 546970 markings/sec, 170 secs
lola: sara is running 175 secs || 99772777 markings, 242101699 edges, 542423 markings/sec, 175 secs
lola: sara is running 180 secs || 102555858 markings, 248779220 edges, 556616 markings/sec, 180 secs
lola: sara is running 185 secs || 105364842 markings, 255518743 edges, 561797 markings/sec, 185 secs
lola: sara is running 190 secs || 108144253 markings, 262187260 edges, 555882 markings/sec, 190 secs
lola: sara is running 195 secs || 110991407 markings, 269018751 edges, 569431 markings/sec, 195 secs
lola: sara is running 200 secs || 113873340 markings, 275933126 edges, 576387 markings/sec, 200 secs
lola: sara is running 205 secs || 116809156 markings, 282977232 edges, 587163 markings/sec, 205 secs
lola: sara is running 210 secs || 119883152 markings, 290358425 edges, 614799 markings/sec, 210 secs
lola: sara is running 215 secs || 122498044 markings, 296703789 edges, 522978 markings/sec, 215 secs
lola: sara is running 220 secs || 125165158 markings, 303177596 edges, 533423 markings/sec, 220 secs
lola: sara is running 225 secs || 127863081 markings, 309726314 edges, 539585 markings/sec, 225 secs
lola: sara is running 230 secs || 130561437 markings, 316255342 edges, 539671 markings/sec, 230 secs
lola: sara is running 235 secs || 133292633 markings, 322842141 edges, 546239 markings/sec, 235 secs
lola: sara is running 240 secs || 136112588 markings, 329683085 edges, 563991 markings/sec, 240 secs
lola: sara is running 245 secs || 138932172 markings, 336524025 edges, 563917 markings/sec, 245 secs
lola: sara is running 250 secs || 141717353 markings, 343282784 edges, 557036 markings/sec, 250 secs
lola: sara is running 255 secs || 144404577 markings, 349747386 edges, 537445 markings/sec, 255 secs
lola: sara is running 260 secs || 147091625 markings, 356265434 edges, 537410 markings/sec, 260 secs
lola: sara is running 265 secs || 149857002 markings, 362975694 edges, 553075 markings/sec, 265 secs
lola: sara is running 270 secs || 152623995 markings, 369690627 edges, 553399 markings/sec, 270 secs
lola: sara is running 275 secs || 155331417 markings, 376262909 edges, 541484 markings/sec, 275 secs
lola: sara is running 280 secs || 157964312 markings, 382593072 edges, 526579 markings/sec, 280 secs
lola: sara is running 285 secs || 160708324 markings, 389251320 edges, 548802 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 || 3832233 markings, 10238810 edges, 766447 markings/sec, 0 secs
lola: sara is running 5 secs || 7526277 markings, 20539381 edges, 738809 markings/sec, 5 secs
lola: sara is running 10 secs || 11184802 markings, 29552020 edges, 731705 markings/sec, 10 secs
lola: sara is running 15 secs || 14393567 markings, 37245862 edges, 641753 markings/sec, 15 secs
lola: sara is running 20 secs || 17386902 markings, 44428071 edges, 598667 markings/sec, 20 secs
lola: sara is running 25 secs || 20293843 markings, 51403029 edges, 581388 markings/sec, 25 secs
lola: sara is running 30 secs || 23163849 markings, 58289442 edges, 574001 markings/sec, 30 secs
lola: sara is running 35 secs || 25982759 markings, 65053231 edges, 563782 markings/sec, 35 secs
lola: sara is running 40 secs || 28758535 markings, 71713559 edges, 555155 markings/sec, 40 secs
lola: sara is running 45 secs || 31521878 markings, 78344003 edges, 552669 markings/sec, 45 secs
lola: sara is running 50 secs || 34263047 markings, 84921168 edges, 548234 markings/sec, 50 secs
lola: sara is running 55 secs || 37011794 markings, 91516580 edges, 549749 markings/sec, 55 secs
lola: sara is running 60 secs || 39760370 markings, 98111495 edges, 549715 markings/sec, 60 secs
lola: sara is running 65 secs || 42506283 markings, 104700127 edges, 549183 markings/sec, 65 secs
lola: sara is running 70 secs || 45201060 markings, 111165881 edges, 538955 markings/sec, 70 secs
lola: sara is running 75 secs || 47889608 markings, 117616838 edges, 537710 markings/sec, 75 secs
lola: sara is running 80 secs || 50566035 markings, 124038478 edges, 535285 markings/sec, 80 secs
lola: sara is running 85 secs || 53239266 markings, 130452451 edges, 534646 markings/sec, 85 secs
lola: sara is running 90 secs || 55896380 markings, 136828044 edges, 531423 markings/sec, 90 secs
lola: sara is running 95 secs || 58549481 markings, 143193677 edges, 530620 markings/sec, 95 secs
lola: sara is running 100 secs || 61208635 markings, 149573958 edges, 531831 markings/sec, 100 secs
lola: sara is running 105 secs || 63877222 markings, 155977205 edges, 533717 markings/sec, 105 secs
lola: sara is running 110 secs || 66571589 markings, 162441720 edges, 538873 markings/sec, 110 secs
lola: sara is running 115 secs || 69234976 markings, 168832084 edges, 532677 markings/sec, 115 secs
lola: sara is running 120 secs || 71896245 markings, 175217853 edges, 532254 markings/sec, 120 secs
lola: sara is running 125 secs || 74628042 markings, 181771853 edges, 546359 markings/sec, 125 secs
lola: sara is running 130 secs || 77317965 markings, 188225928 edges, 537985 markings/sec, 130 secs
lola: sara is running 135 secs || 80051246 markings, 194783992 edges, 546656 markings/sec, 135 secs
lola: sara is running 140 secs || 82747761 markings, 201253981 edges, 539303 markings/sec, 140 secs
lola: sara is running 145 secs || 85427896 markings, 207684167 edges, 536027 markings/sec, 145 secs
lola: sara is running 150 secs || 88143908 markings, 214200877 edges, 543202 markings/sec, 150 secs
lola: sara is running 155 secs || 90859279 markings, 220715785 edges, 543074 markings/sec, 155 secs
lola: sara is running 160 secs || 93583028 markings, 227250881 edges, 544750 markings/sec, 160 secs
lola: sara is running 165 secs || 96309888 markings, 233793419 edges, 545372 markings/sec, 165 secs
lola: sara is running 170 secs || 99063546 markings, 240400391 edges, 550732 markings/sec, 170 secs
lola: sara is running 175 secs || 101832605 markings, 247043882 edges, 553812 markings/sec, 175 secs
lola: sara is running 180 secs || 104642241 markings, 253784913 edges, 561927 markings/sec, 180 secs
lola: sara is running 185 secs || 107452149 markings, 260526968 edges, 561982 markings/sec, 185 secs
lola: sara is running 190 secs || 110299110 markings, 267357343 edges, 569392 markings/sec, 190 secs
lola: sara is running 195 secs || 113188206 markings, 274289122 edges, 577819 markings/sec, 195 secs
lola: sara is running 200 secs || 116145321 markings, 281384311 edges, 591423 markings/sec, 200 secs
lola: sara is running 205 secs || 119219366 markings, 288762400 edges, 614809 markings/sec, 205 secs
lola: sara is running 210 secs || 122001589 markings, 295509926 edges, 556445 markings/sec, 210 secs
lola: sara is running 215 secs || 124713921 markings, 302092959 edges, 542466 markings/sec, 215 secs
lola: sara is running 220 secs || 127388625 markings, 308586150 edges, 534941 markings/sec, 220 secs
lola: sara is running 225 secs || 130019417 markings, 314911454 edges, 526158 markings/sec, 225 secs
lola: sara is running 230 secs || 132849372 markings, 321775842 edges, 565991 markings/sec, 230 secs
lola: sara is running 235 secs || 135690244 markings, 328667663 edges, 568174 markings/sec, 235 secs
lola: sara is running 240 secs || 138516130 markings, 335524057 edges, 565177 markings/sec, 240 secs
lola: sara is running 245 secs || 141274301 markings, 342218109 edges, 551634 markings/sec, 245 secs
lola: sara is running 250 secs || 143933197 markings, 348610591 edges, 531779 markings/sec, 250 secs
lola: sara is running 255 secs || 146712242 markings, 355352958 edges, 555809 markings/sec, 255 secs
lola: sara is running 260 secs || 149496644 markings, 362109404 edges, 556880 markings/sec, 260 secs
lola: sara is running 265 secs || 152254430 markings, 368802467 edges, 551557 markings/sec, 265 secs
lola: sara is running 270 secs || 154851979 markings, 375050644 edges, 519510 markings/sec, 270 secs
lola: sara is running 275 secs || 157561429 markings, 381623547 edges, 541890 markings/sec, 275 secs
lola: sara is running 280 secs || 160328215 markings, 388337373 edges, 553357 markings/sec, 280 secs
lola: sara is running 285 secs || 163084747 markings, 395027377 edges, 551306 markings/sec, 285 secs
lola: sara is running 290 secs || 165787262 markings, 401588024 edges, 540503 markings/sec, 290 secs
lola: sara is running 295 secs || 168325600 markings, 407690395 edges, 507668 markings/sec, 295 secs
lola: sara is running 300 secs || 171028604 markings, 414250571 edges, 540601 markings/sec, 300 secs
lola: sara is running 305 secs || 173726854 markings, 420800454 edges, 539650 markings/sec, 305 secs
lola: sara is running 310 secs || 176407894 markings, 427309606 edges, 536208 markings/sec, 310 secs
lola: sara is running 315 secs || 178942395 markings, 433403237 edges, 506900 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="irma4mcc-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 irma4mcc-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 r091-blw7-152650003700334"
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 ;