Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 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-C0100N0000000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003600313
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527197212135


BK_STOP 1527197575720

--------------------
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-C0100N0000000100 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': 361329, 'Memory': 15952.84, 'Tool': 'lola'}, {'Time': 365457, 'Memory': 15952.63, 'Tool': 'lola'}, {'Time': 683540, 'Memory': 15934.82, 'Tool': 'marcie'}, {'Time': 808885, 'Memory': 15951.02, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola GPPP-PT-C0100N0000000100...

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


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000000100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ GPPP-PT-C0100N0000000100 @ 3539 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 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-C0100N0000000100-ReachabilityCardinality.task
lola: E (F (((((1 <= E4P) AND (2 <= G6P)) OR (ADP <= 0)) AND ((2 <= NADH) OR (Pi + 1 <= R5P))))) : E (F (((((FBP <= Ru5P) AND (3 <= start)) OR ((G6P <= R5P) AND (b2 <= NADplus))) AND (c1 <= ATP)))) : A (G (((Xu5P + 1 <= GSSG) OR (GSH <= 1) OR ((DHAP + 1 <= Lac) AND (ADP <= 2))))) : E (F ((((2 <= _3PG) AND (2 <= c2)) OR ((1 <= Pi) AND (2 <= R5P) AND (3 <= F6P) AND (1 <= b1))))) : E (F ((3 <= _1_3_BPG))) : A (G (((_2PG <= 1) OR (GSH <= 2) OR ((ADP <= 2) AND (NADPH <= 2))))) : E (F (((ATP + 1 <= FBP) AND (ADP <= 0) AND (c1 + 1 <= R5P)))) : E (F ((((ADP <= Xu5P) OR (2 <= GSH)) AND (b1 + 1 <= _3PG) AND ((b2 + 1 <= NADPplus) OR (b1 <= 2))))) : E (F (((_2PG <= 0) AND (start + 1 <= FBP) AND (NADplus + 1 <= _2PG)))) : E (F ((1 <= _2PG))) : A (G ((_1_3_BPG <= 1))) : A (G ((3 <= NADPplus))) : A (G ((Xu5P <= ADP))) : E (F (((GSSG <= 0) AND (a2 + 1 <= GSH) AND ((FBP <= 0) OR (NADPH + 1 <= Gluc))))) : A (G ((((1 <= _3PG) AND (ATP <= NADPplus)) OR (Lac <= ADP) OR (a2 <= Pi)))) : E (F ((((R5P + 1 <= start) AND (NADplus <= 1)) OR (2 <= Pyr))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= E4P) AND (2 <= G6P)) OR (ADP <= 0)) AND ((2 <= NADH) OR (Pi + 1 <= 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 10 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FBP <= Ru5P) AND (3 <= start)) OR ((G6P <= R5P) AND (b2 <= NADplus))) AND (c1 <= ATP))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 208 markings, 207 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Xu5P + 1 <= GSSG) OR (GSH <= 1) OR ((DHAP + 1 <= Lac) AND (ADP <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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-C0100N0000000100-ReachabilityCardinality-2.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: 173 markings, 172 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= _3PG) AND (2 <= c2)) OR ((1 <= Pi) AND (2 <= R5P) AND (3 <= F6P) AND (1 <= b1)))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 314 markings, 313 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= _1_3_BPG)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-4.sara
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((_2PG <= 1) OR (GSH <= 2) OR ((ADP <= 2) AND (NADPH <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: ========================================
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATP + 1 <= FBP) AND (ADP <= 0) AND (c1 + 1 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3741988 markings, 10353539 edges, 748398 markings/sec, 0 secs
lola: sara is running 5 secs || 7429123 markings, 20211836 edges, 737427 markings/sec, 5 secs
lola: sara is running 10 secs || 10841521 markings, 29293268 edges, 682480 markings/sec, 10 secs
lola: sara is running 15 secs || 14146871 markings, 38114290 edges, 661070 markings/sec, 15 secs
lola: sara is running 20 secs || 17410137 markings, 46792955 edges, 652653 markings/sec, 20 secs
lola: sara is running 25 secs || 20507983 markings, 55081355 edges, 619569 markings/sec, 25 secs
lola: sara is running 30 secs || 23676409 markings, 63525540 edges, 633685 markings/sec, 30 secs
lola: sara is running 35 secs || 26711553 markings, 71649507 edges, 607029 markings/sec, 35 secs
lola: sara is running 40 secs || 29545277 markings, 79242592 edges, 566745 markings/sec, 40 secs
lola: sara is running 45 secs || 32140444 markings, 86168424 edges, 519033 markings/sec, 45 secs
lola: sara is running 50 secs || 34567521 markings, 92640047 edges, 485415 markings/sec, 50 secs
lola: sara is running 55 secs || 37227218 markings, 99711924 edges, 531939 markings/sec, 55 secs
lola: sara is running 60 secs || 39838234 markings, 106699044 edges, 522203 markings/sec, 60 secs
lola: sara is running 65 secs || 42535543 markings, 113899754 edges, 539462 markings/sec, 65 secs
lola: sara is running 70 secs || 45206033 markings, 121037720 edges, 534098 markings/sec, 70 secs
lola: sara is running 75 secs || 47812510 markings, 127997526 edges, 521295 markings/sec, 75 secs
lola: sara is running 80 secs || 50336705 markings, 134741991 edges, 504839 markings/sec, 80 secs
lola: sara is running 85 secs || 52942752 markings, 141704019 edges, 521209 markings/sec, 85 secs
lola: sara is running 90 secs || 55598119 markings, 148808926 edges, 531073 markings/sec, 90 secs
lola: sara is running 95 secs || 58250161 markings, 155893577 edges, 530408 markings/sec, 95 secs
lola: sara is running 100 secs || 60927548 markings, 163008870 edges, 535477 markings/sec, 100 secs
lola: sara is running 105 secs || 63660923 markings, 170332840 edges, 546675 markings/sec, 105 secs
lola: sara is running 110 secs || 66430132 markings, 177715403 edges, 553842 markings/sec, 110 secs
lola: sara is running 115 secs || 69185377 markings, 185092634 edges, 551049 markings/sec, 115 secs
lola: sara is running 120 secs || 71980115 markings, 192549676 edges, 558948 markings/sec, 120 secs
lola: sara is running 125 secs || 74732981 markings, 199899830 edges, 550573 markings/sec, 125 secs
lola: sara is running 130 secs || 77536265 markings, 207363698 edges, 560657 markings/sec, 130 secs
lola: sara is running 135 secs || 80305354 markings, 214772676 edges, 553818 markings/sec, 135 secs
lola: sara is running 140 secs || 83083257 markings, 222162941 edges, 555581 markings/sec, 140 secs
lola: sara is running 145 secs || 85706474 markings, 229200854 edges, 524643 markings/sec, 145 secs
lola: sara is running 150 secs || 88460074 markings, 236532473 edges, 550720 markings/sec, 150 secs
lola: sara is running 155 secs || 91342144 markings, 244208120 edges, 576414 markings/sec, 155 secs
lola: sara is running 160 secs || 94193117 markings, 251830023 edges, 570195 markings/sec, 160 secs
lola: sara is running 165 secs || 97045577 markings, 259435523 edges, 570492 markings/sec, 165 secs
lola: sara is running 170 secs || 99933135 markings, 267148936 edges, 577512 markings/sec, 170 secs
lola: sara is running 175 secs || 102795369 markings, 274788618 edges, 572447 markings/sec, 175 secs
lola: sara is running 180 secs || 105658631 markings, 282434134 edges, 572652 markings/sec, 180 secs
lola: sara is running 185 secs || 108540930 markings, 290131262 edges, 576460 markings/sec, 185 secs
lola: sara is running 190 secs || 111426164 markings, 297819521 edges, 577047 markings/sec, 190 secs
lola: sara is running 195 secs || 114326808 markings, 305553110 edges, 580129 markings/sec, 195 secs
lola: sara is running 200 secs || 117166224 markings, 313120337 edges, 567883 markings/sec, 200 secs
lola: sara is running 205 secs || 119949837 markings, 320559437 edges, 556723 markings/sec, 205 secs
lola: sara is running 210 secs || 122802767 markings, 328145506 edges, 570586 markings/sec, 210 secs
lola: sara is running 215 secs || 125691376 markings, 335847989 edges, 577722 markings/sec, 215 secs
lola: sara is running 220 secs || 128527721 markings, 343405508 edges, 567269 markings/sec, 220 secs
lola: sara is running 225 secs || 131375066 markings, 351011326 edges, 569469 markings/sec, 225 secs
lola: sara is running 230 secs || 134239611 markings, 358629079 edges, 572909 markings/sec, 230 secs
lola: sara is running 235 secs || 137063526 markings, 366161294 edges, 564783 markings/sec, 235 secs
lola: sara is running 240 secs || 139750559 markings, 373324666 edges, 537407 markings/sec, 240 secs
lola: sara is running 245 secs || 142647145 markings, 381031212 edges, 579317 markings/sec, 245 secs
lola: sara is running 250 secs || 145546469 markings, 388748997 edges, 579865 markings/sec, 250 secs
lola: sara is running 255 secs || 148497466 markings, 396590081 edges, 590199 markings/sec, 255 secs
lola: sara is running 260 secs || 151373913 markings, 404242532 edges, 575289 markings/sec, 260 secs
lola: sara is running 265 secs || 154247750 markings, 411882399 edges, 574767 markings/sec, 265 secs
lola: sara is running 270 secs || 157310779 markings, 420003401 edges, 612606 markings/sec, 270 secs
lola: sara is running 275 secs || 160506730 markings, 428455287 edges, 639190 markings/sec, 275 secs
lola: sara is running 280 secs || 163576093 markings, 436603672 edges, 613873 markings/sec, 280 secs
lola: sara is running 285 secs || 166648052 markings, 444842345 edges, 614392 markings/sec, 285 secs
lola: sara is running 290 secs || 169755973 markings, 453185650 edges, 621584 markings/sec, 290 secs
lola: sara is running 295 secs || 172962550 markings, 461794179 edges, 641315 markings/sec, 295 secs
lola: sara is running 300 secs || 176165016 markings, 470383028 edges, 640493 markings/sec, 300 secs
lola: sara is running 305 secs || 179438685 markings, 479170695 edges, 654734 markings/sec, 305 secs
lola: sara is running 310 secs || 182739811 markings, 488032709 edges, 660225 markings/sec, 310 secs
lola: sara is running 315 secs || 185900246 markings, 496508632 edges, 632087 markings/sec, 315 secs
lola: sara is running 320 secs || 187400325 markings, 500540208 edges, 300016 markings/sec, 320 secs
lola: sara is running 325 secs || 187424888 markings, 500606336 edges, 4913 markings/sec, 325 secs
lola: sara is running 330 secs || 187428818 markings, 500616335 edges, 786 markings/sec, 330 secs
lola: sara is running 335 secs || 187446632 markings, 500664798 edges, 3563 markings/sec, 335 secs
lola: sara is running 340 secs || 187456660 markings, 500691455 edges, 2006 markings/sec, 340 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: '`'
Aborted (core dumped)
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000000100-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-C0100N0000000100"
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-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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-C0100N0000000100, 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-152650003600313"
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 ;