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 180K
-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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 26 09:26 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 mcc4mcc-full
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 r094-blw7-152650006400313
=====================================================================

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


BK_STOP 1527523405964

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-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 stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ GPPP-PT-C0100N0000000100 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-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 236 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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GPPP-PT-C0100N0000000100-ReachabilityCardinality.sara
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 295 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: ========================================
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: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 354 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: try reading problem file GPPP-PT-C0100N0000000100-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 3799756 markings, 10529275 edges, 759951 markings/sec, 0 secs
lola: sara is running 5 secs || 7589490 markings, 20638951 edges, 757947 markings/sec, 5 secs
lola: sara is running 10 secs || 11060598 markings, 29874429 edges, 694222 markings/sec, 10 secs
lola: sara is running 15 secs || 14374572 markings, 38712292 edges, 662795 markings/sec, 15 secs
lola: sara is running 20 secs || 17560020 markings, 47192899 edges, 637090 markings/sec, 20 secs
lola: sara is running 25 secs || 20726030 markings, 55669027 edges, 633202 markings/sec, 25 secs
lola: sara is running 30 secs || 23896704 markings, 64127869 edges, 634135 markings/sec, 30 secs
lola: sara is running 35 secs || 26876312 markings, 72088185 edges, 595922 markings/sec, 35 secs
lola: sara is running 40 secs || 29727861 markings, 79693700 edges, 570310 markings/sec, 40 secs
lola: sara is running 45 secs || 32535429 markings, 87207805 edges, 561514 markings/sec, 45 secs
lola: sara is running 50 secs || 35263861 markings, 94469568 edges, 545686 markings/sec, 50 secs
lola: sara is running 55 secs || 38027050 markings, 101878218 edges, 552638 markings/sec, 55 secs
lola: sara is running 60 secs || 40884414 markings, 109489105 edges, 571473 markings/sec, 60 secs
lola: sara is running 65 secs || 43669444 markings, 116946313 edges, 557006 markings/sec, 65 secs
lola: sara is running 70 secs || 46458052 markings, 124392419 edges, 557722 markings/sec, 70 secs
lola: sara is running 75 secs || 49248571 markings, 131847276 edges, 558104 markings/sec, 75 secs
lola: sara is running 80 secs || 51955143 markings, 139064201 edges, 541314 markings/sec, 80 secs
lola: sara is running 85 secs || 54588917 markings, 146092883 edges, 526755 markings/sec, 85 secs
lola: sara is running 90 secs || 57276340 markings, 153261126 edges, 537485 markings/sec, 90 secs
lola: sara is running 95 secs || 59966135 markings, 160469978 edges, 537959 markings/sec, 95 secs
lola: sara is running 100 secs || 62643817 markings, 167598601 edges, 535536 markings/sec, 100 secs
lola: sara is running 105 secs || 65414556 markings, 175000582 edges, 554148 markings/sec, 105 secs
lola: sara is running 110 secs || 68136173 markings, 182286467 edges, 544323 markings/sec, 110 secs
lola: sara is running 115 secs || 70925235 markings, 189721922 edges, 557812 markings/sec, 115 secs
lola: sara is running 120 secs || 73694418 markings, 197115810 edges, 553837 markings/sec, 120 secs
lola: sara is running 125 secs || 76423500 markings, 204407452 edges, 545816 markings/sec, 125 secs
lola: sara is running 130 secs || 79194117 markings, 211799298 edges, 554123 markings/sec, 130 secs
lola: sara is running 135 secs || 81974570 markings, 219201610 edges, 556091 markings/sec, 135 secs
lola: sara is running 140 secs || 84742642 markings, 226598470 edges, 553614 markings/sec, 140 secs
lola: sara is running 145 secs || 87521844 markings, 234037379 edges, 555840 markings/sec, 145 secs
lola: sara is running 150 secs || 90324065 markings, 241492845 edges, 560444 markings/sec, 150 secs
lola: sara is running 155 secs || 93094981 markings, 248912407 edges, 554183 markings/sec, 155 secs
lola: sara is running 160 secs || 95858624 markings, 256289223 edges, 552729 markings/sec, 160 secs
lola: sara is running 165 secs || 98619656 markings, 263641254 edges, 552206 markings/sec, 165 secs
lola: sara is running 170 secs || 101388704 markings, 271040368 edges, 553810 markings/sec, 170 secs
lola: sara is running 175 secs || 104169329 markings, 278450009 edges, 556125 markings/sec, 175 secs
lola: sara is running 180 secs || 106941742 markings, 285845615 edges, 554483 markings/sec, 180 secs
lola: sara is running 185 secs || 109751229 markings, 293341556 edges, 561897 markings/sec, 185 secs
lola: sara is running 190 secs || 112527773 markings, 300749256 edges, 555309 markings/sec, 190 secs
lola: sara is running 195 secs || 115292760 markings, 308127800 edges, 552997 markings/sec, 195 secs
lola: sara is running 200 secs || 118115579 markings, 315657033 edges, 564564 markings/sec, 200 secs
lola: sara is running 205 secs || 120920072 markings, 323146710 edges, 560899 markings/sec, 205 secs
lola: sara is running 210 secs || 123783648 markings, 330771410 edges, 572715 markings/sec, 210 secs
lola: sara is running 215 secs || 126674400 markings, 338470492 edges, 578150 markings/sec, 215 secs
lola: sara is running 220 secs || 129641785 markings, 346383041 edges, 593477 markings/sec, 220 secs
lola: sara is running 225 secs || 132409559 markings, 353759792 edges, 553555 markings/sec, 225 secs
lola: sara is running 230 secs || 135180532 markings, 361143929 edges, 554195 markings/sec, 230 secs
lola: sara is running 235 secs || 138133284 markings, 369013001 edges, 590550 markings/sec, 235 secs
lola: sara is running 240 secs || 141157385 markings, 377059538 edges, 604820 markings/sec, 240 secs
lola: sara is running 245 secs || 144209332 markings, 385183286 edges, 610389 markings/sec, 245 secs
lola: sara is running 250 secs || 147271862 markings, 393342525 edges, 612506 markings/sec, 250 secs
lola: sara is running 255 secs || 150350926 markings, 401528215 edges, 615813 markings/sec, 255 secs
lola: sara is running 260 secs || 153456971 markings, 409780954 edges, 621209 markings/sec, 260 secs
lola: sara is running 265 secs || 156650089 markings, 418250019 edges, 638624 markings/sec, 265 secs
lola: sara is running 270 secs || 159946715 markings, 426980129 edges, 659325 markings/sec, 270 secs
lola: sara is running 275 secs || 163263346 markings, 435765591 edges, 663326 markings/sec, 275 secs
lola: sara is running 280 secs || 166382324 markings, 444129653 edges, 623796 markings/sec, 280 secs
lola: sara is running 285 secs || 169567075 markings, 452679409 edges, 636950 markings/sec, 285 secs
lola: sara is running 290 secs || 172832853 markings, 461446589 edges, 653156 markings/sec, 290 secs
lola: sara is running 295 secs || 176130179 markings, 470289360 edges, 659465 markings/sec, 295 secs
lola: sara is running 300 secs || 179498002 markings, 479330006 edges, 673565 markings/sec, 300 secs
lola: sara is running 305 secs || 182863777 markings, 488365480 edges, 673155 markings/sec, 305 secs
lola: sara is running 310 secs || 186155251 markings, 497208543 edges, 658295 markings/sec, 310 secs
lola: sara is running 315 secs || 187322916 markings, 500333036 edges, 233533 markings/sec, 315 secs
lola: sara is running 320 secs || 187386635 markings, 500504039 edges, 12744 markings/sec, 320 secs
lola: sara is running 325 secs || 187390540 markings, 500513968 edges, 781 markings/sec, 325 secs
lola: sara is running 330 secs || 187398964 markings, 500536142 edges, 1685 markings/sec, 330 secs
lola: sara is running 335 secs || 187422177 markings, 500598599 edges, 4643 markings/sec, 335 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="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-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 mcc4mcc-full"
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 r094-blw7-152650006400313"
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 ;