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 188K
-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 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 7.8K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-full
Input is GPPP-PT-C1000N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-blw7-152732548200097
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527930428832


BK_STOP 1527930863311

--------------------
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-C1000N0000000010 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 16889, 'Memory': 1671.35, 'Tool': 'lola'}, {'Time': 17587, 'Memory': 738.11, 'Tool': 'itstools'}, {'Time': 17854, 'Memory': 1673.1, 'Tool': 'lola'}, {'Time': 18155, 'Memory': 791.02, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola GPPP-PT-C1000N0000000010...

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


checking for too many tokens
===========================================================================================
GPPP-PT-C1000N0000000010: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ GPPP-PT-C1000N0000000010 @ 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-C1000N0000000010-LTLCardinality.task
lola: A ((ATP <= R5P)) : A ((S7P <= PEP)) : A (G (G (F (X ((3 <= Xu5P)))))) : A (F (G (X (G ((1 <= b1)))))) : A (G (G (F (F ((3 <= GSSG)))))) : A (F (F (F ((a1 <= R5P))))) : A (X (G (F (F ((1 <= ATP)))))) : A (G (F (((a2 <= b2) U (GAP <= NADPH))))) : A (F (G ((2 <= _1_3_BPG)))) : A (X (F (G (X ((3 <= GSSG)))))) : A ((a1 <= NADH)) : A (G (X (G (X ((G6P <= ADP)))))) : A (G (F (((2 <= Pyr) U (1 <= GSSG))))) : A (F ((G ((_3PG <= GSSG)) U X ((Gluc <= NADPplus))))) : A (G (G (X (F ((Pi <= GSH)))))) : A (G ((Pyr <= ADP)))
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 ((ATP <= R5P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ATP <= R5P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((S7P <= PEP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (S7P <= PEP)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (X ((3 <= Xu5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F (X ((3 <= Xu5P))))))
lola: processed formula: A (G (G (F (X ((3 <= Xu5P))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((1 <= b1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G ((1 <= b1))))))
lola: processed formula: A (F (G (X (G ((1 <= b1))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 47 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (F ((3 <= GSSG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((3 <= GSSG)))))
lola: processed formula: A (G (G (F ((3 <= GSSG)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 207957 markings, 461697 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F ((a1 <= R5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((a1 <= R5P)))
lola: processed formula: A (F ((a1 <= R5P)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 236 markings, 236 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((1 <= ATP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((1 <= ATP)))))
lola: processed formula: A (X (G (F ((1 <= ATP)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((a2 <= b2) U (GAP <= NADPH)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((a2 <= b2) U (GAP <= NADPH)))))
lola: processed formula: A (G (F (((a2 <= b2) U (GAP <= NADPH)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= _1_3_BPG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((2 <= _1_3_BPG))))
lola: processed formula: A (F (G ((2 <= _1_3_BPG))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((3 <= GSSG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X ((3 <= GSSG))))))
lola: processed formula: A (X (F (G (X ((3 <= GSSG))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 485322 markings, 2629709 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((a1 <= NADH))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a1 <= NADH)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((G6P <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((G6P <= ADP))))))
lola: processed formula: A (G (X (G (X ((G6P <= ADP))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1618358 markings, 9418026 edges, 323672 markings/sec, 0 secs
lola: 3069538 markings, 18598014 edges, 290236 markings/sec, 5 secs
lola: 4406876 markings, 27280708 edges, 267468 markings/sec, 10 secs
lola: 5746998 markings, 36288077 edges, 268024 markings/sec, 15 secs
lola: 7034688 markings, 44988093 edges, 257538 markings/sec, 20 secs
lola: 8343716 markings, 53728743 edges, 261806 markings/sec, 25 secs
lola: 9524496 markings, 62055099 edges, 236156 markings/sec, 30 secs
lola: 10814148 markings, 70763998 edges, 257930 markings/sec, 35 secs
lola: 11999850 markings, 79134931 edges, 237140 markings/sec, 40 secs
lola: 13217952 markings, 87601514 edges, 243620 markings/sec, 45 secs
lola: 14451180 markings, 96081678 edges, 246646 markings/sec, 50 secs
lola: 15686716 markings, 104700553 edges, 247107 markings/sec, 55 secs
lola: 16840570 markings, 113147734 edges, 230771 markings/sec, 60 secs
lola: 18000122 markings, 120999797 edges, 231910 markings/sec, 65 secs
lola: 19255684 markings, 128878826 edges, 251112 markings/sec, 70 secs
lola: 20497584 markings, 136689184 edges, 248380 markings/sec, 75 secs
lola: 21722232 markings, 145149190 edges, 244930 markings/sec, 80 secs
lola: 22846160 markings, 153324029 edges, 224786 markings/sec, 85 secs
lola: 23920734 markings, 161013838 edges, 214915 markings/sec, 90 secs
lola: 25236990 markings, 169804666 edges, 263251 markings/sec, 95 secs
lola: 26395742 markings, 178235711 edges, 231750 markings/sec, 100 secs
lola: 27508532 markings, 186217690 edges, 222558 markings/sec, 105 secs
lola: 28770498 markings, 194641236 edges, 252393 markings/sec, 110 secs
lola: 29869194 markings, 202521046 edges, 219739 markings/sec, 115 secs
lola: 30939922 markings, 210392602 edges, 214146 markings/sec, 120 secs
lola: 32152806 markings, 218367592 edges, 242577 markings/sec, 125 secs
lola: 33345626 markings, 226881880 edges, 238564 markings/sec, 130 secs
lola: 34475976 markings, 235245921 edges, 226070 markings/sec, 135 secs
lola: 35686134 markings, 243246417 edges, 242032 markings/sec, 140 secs
lola: 36854728 markings, 251538232 edges, 233719 markings/sec, 145 secs
lola: 37965565 markings, 259681901 edges, 222167 markings/sec, 150 secs
lola: 39132271 markings, 267543275 edges, 233341 markings/sec, 155 secs
lola: 40385650 markings, 276250682 edges, 250676 markings/sec, 160 secs
lola: 41544622 markings, 284723109 edges, 231794 markings/sec, 165 secs
lola: 42697156 markings, 292702143 edges, 230507 markings/sec, 170 secs
lola: 43924746 markings, 301118988 edges, 245518 markings/sec, 175 secs
lola: 45044610 markings, 309216317 edges, 223973 markings/sec, 180 secs
lola: 46103332 markings, 316820390 edges, 211744 markings/sec, 185 secs
lola: 47354350 markings, 325167127 edges, 250204 markings/sec, 190 secs
lola: 48493416 markings, 333355782 edges, 227813 markings/sec, 195 secs
lola: 49570171 markings, 341235059 edges, 215351 markings/sec, 200 secs
lola: 50792256 markings, 349298522 edges, 244417 markings/sec, 205 secs
lola: 51937082 markings, 357466072 edges, 228965 markings/sec, 210 secs
lola: 52992140 markings, 365307088 edges, 211012 markings/sec, 215 secs
lola: 54156508 markings, 373002168 edges, 232874 markings/sec, 220 secs
lola: 55351978 markings, 381425181 edges, 239094 markings/sec, 225 secs
lola: 56489378 markings, 389757699 edges, 227480 markings/sec, 230 secs
lola: 57647710 markings, 397636260 edges, 231666 markings/sec, 235 secs
lola: 58851908 markings, 405942506 edges, 240840 markings/sec, 240 secs
lola: 59955682 markings, 413956118 edges, 220755 markings/sec, 245 secs
lola: 61007662 markings, 421507099 edges, 210396 markings/sec, 250 secs
lola: 62295424 markings, 430076293 edges, 257552 markings/sec, 255 secs
lola: 63461337 markings, 438556427 edges, 233183 markings/sec, 260 secs
lola: 64579237 markings, 446580853 edges, 223580 markings/sec, 265 secs
lola: 65800812 markings, 454695197 edges, 244315 markings/sec, 270 secs
lola: 66905464 markings, 462591674 edges, 220930 markings/sec, 275 secs
lola: 67985598 markings, 470576762 edges, 216027 markings/sec, 280 secs
lola: 69191090 markings, 478548007 edges, 241098 markings/sec, 285 secs
lola: 70375522 markings, 486952041 edges, 236886 markings/sec, 290 secs
lola: 71487572 markings, 495186930 edges, 222410 markings/sec, 295 secs
lola: 72678921 markings, 503109339 edges, 238270 markings/sec, 300 secs
lola: 73831524 markings, 511165348 edges, 230521 markings/sec, 305 secs
lola: 74911242 markings, 519038623 edges, 215944 markings/sec, 310 secs
lola: 75948820 markings, 526444967 edges, 207516 markings/sec, 315 secs
lola: 77210426 markings, 534838078 edges, 252321 markings/sec, 320 secs
lola: 78321202 markings, 542923538 edges, 222155 markings/sec, 325 secs
lola: 79410784 markings, 550761417 edges, 217916 markings/sec, 330 secs
lola: 80639046 markings, 558911964 edges, 245652 markings/sec, 335 secs
lola: 81761330 markings, 566931664 edges, 224457 markings/sec, 340 secs
lola: 82776540 markings, 574502695 edges, 203042 markings/sec, 345 secs
lola: 83952830 markings, 582260740 edges, 235258 markings/sec, 350 secs
lola: 85094082 markings, 590329845 edges, 228250 markings/sec, 355 secs
lola: 86208667 markings, 598485483 edges, 222917 markings/sec, 360 secs
lola: 87333158 markings, 606166549 edges, 224898 markings/sec, 365 secs
lola: 88527308 markings, 614386667 edges, 238830 markings/sec, 370 secs
lola: 89622688 markings, 622320294 edges, 219076 markings/sec, 375 secs
lola: 90669468 markings, 629833728 edges, 209356 markings/sec, 380 secs
lola: 91918222 markings, 638162781 edges, 249751 markings/sec, 385 secs
lola: 93070114 markings, 646433749 edges, 230378 markings/sec, 390 secs
lola: 94144699 markings, 654333983 edges, 214917 markings/sec, 395 secs
lola: 95371576 markings, 662404434 edges, 245375 markings/sec, 400 secs
lola: 96509502 markings, 670523130 edges, 227585 markings/sec, 405 secs
lola: 97583402 markings, 678505584 edges, 214780 markings/sec, 410 secs
lola: 98706324 markings, 685918092 edges, 224584 markings/sec, 415 secs
lola: 99793900 markings, 693502472 edges, 217515 markings/sec, 420 secs
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-C1000N0000000010-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-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-C1000N0000000010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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-full"
echo " Input is GPPP-PT-C1000N0000000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-blw7-152732548200097"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;