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.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ClientsAndServers-PT-N0020P1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359400116
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526473233461


BK_STOP 1526473645492

--------------------
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 ClientsAndServers-PT-N0020P1 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, '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': 452204, 'Memory': 7792.72, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLFireability lola ClientsAndServers-PT-N0020P1...

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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0020P1: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ ClientsAndServers-PT-N0020P1 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: E ((E (F (NOT FIREABLE(mfU))) U A (G (FIREABLE(mfU))))) : (NOT(E (F (A (X (FIREABLE(srA)))))) AND E (F (A ((FIREABLE(srF) U FIREABLE(crG)))))) : E (((E (F (FIREABLE(csR))) AND NOT FIREABLE(ssR)) U (A (G (FIREABLE(srG))) AND FIREABLE(msG)))) : (((E (F (FIREABLE(msA))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(maU) AND FIREABLE(csF))) OR (E ((FIREABLE(ssR) U FIREABLE(ssG))) OR A (G (FIREABLE(mrF))))) AND A (F ((A (F (FIREABLE(ssA))) OR A (F (FIREABLE(mrF))))))) : A (F (E (((FIREABLE(mrF) OR FIREABLE(msG)) U FIREABLE(ssG))))) : ((A (F (E (X (FIREABLE(ssA))))) OR FIREABLE(srF)) OR NOT(NOT(A ((FIREABLE(srG) U FIREABLE(srR)))))) : A (F (E (G ((NOT FIREABLE(ssF) AND (FIREABLE(csF) OR FIREABLE(ssF))))))) : NOT((NOT FIREABLE(msA) AND NOT((A (G (FIREABLE(csR))) AND (FIREABLE(csR) OR NOT FIREABLE(msG)))))) : NOT(((A (F (FIREABLE(msG))) OR (FIREABLE(csF) OR FIREABLE(ssF) OR FIREABLE(ssG))) AND E (X ((NOT FIREABLE(ssR) AND NOT FIREABLE(csF)))))) : NOT(E (X ((FIREABLE(maU) OR A (F (FIREABLE(ssF))))))) : A ((A (F (NOT FIREABLE(mrF))) U (A (F (FIREABLE(ssA))) OR FIREABLE(crG)))) : A (F ((A (F (NOT FIREABLE(srA))) AND A (F ((FIREABLE(srG) OR FIREABLE(msG))))))) : E (((FIREABLE(ssG) OR A (G (FIREABLE(csR)))) U E ((FIREABLE(mrR) U FIREABLE(srG))))) : A (F (FIREABLE(ssF))) : (((FIREABLE(mrF) OR FIREABLE(srG) OR FIREABLE(maU)) OR E (G (NOT FIREABLE(ssA)))) OR A ((((FIREABLE(ssG) OR FIREABLE(ssA)) AND (FIREABLE(mfU) OR FIREABLE(crA))) U E (X (FIREABLE(crG)))))) : ((NOT(NOT(E (G (FIREABLE(msG))))) OR NOT(((NOT FIREABLE(msG) OR NOT FIREABLE(crA)) AND E (X (FIREABLE(ssG)))))) AND E (((NOT FIREABLE(srA) AND NOT FIREABLE(ssA)) U E (G (FIREABLE(srR))))))
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 ((E (F (NOT FIREABLE(mfU))) U A (G (FIREABLE(mfU)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U NOT FIREABLE(mfU)) U NOT(E(TRUE U NOT FIREABLE(mfU))))
lola: processed formula length: 65
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1184702 markings, 5854341 edges, 231439 markings/sec, 0 secs
lola: 2322682 markings, 11584884 edges, 227596 markings/sec, 5 secs
lola: 3448956 markings, 17269657 edges, 225255 markings/sec, 10 secs
lola: 4582317 markings, 22989204 edges, 226672 markings/sec, 15 secs
lola: 5713679 markings, 28704511 edges, 226272 markings/sec, 20 secs
lola: 6850698 markings, 34444215 edges, 227404 markings/sec, 25 secs
lola: 7985867 markings, 40185441 edges, 227034 markings/sec, 30 secs
lola: 9113049 markings, 45874091 edges, 225436 markings/sec, 35 secs
lola: 10100429 markings, 51084248 edges, 197476 markings/sec, 40 secs
lola: 11019388 markings, 56085337 edges, 183792 markings/sec, 45 secs
lola: 11957995 markings, 61167116 edges, 187721 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12600648 markings, 64520795 edges
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (A (X (FIREABLE(srA)))))) AND E (F (A ((FIREABLE(srF) U FIREABLE(crG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(srA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(srA)))))
lola: processed formula length: 41
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1073 markings, 1072 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((E (F (FIREABLE(csR))) AND NOT FIREABLE(ssR)) U (A (G (FIREABLE(srG))) AND FIREABLE(msG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((E(TRUE U FIREABLE(csR)) AND NOT FIREABLE(ssR)) U (NOT(E(TRUE U NOT FIREABLE(srG))) AND FIREABLE(msG)))
lola: processed formula length: 105
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1242 markings, 1884 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F (FIREABLE(msA))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(maU) AND FIREABLE(csF))) OR (E ((FIREABLE(ssR) U FIREABLE(ssG))) OR A (G (FIREABLE(mrF))))) AND A (F ((A (F (FIREABLE(ssA))) OR A (F (FIREABLE(mrF)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(msA)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (FIREABLE(ssA))) OR A (F (FIREABLE(mrF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U FIREABLE(ssA)) OR A(TRUE U FIREABLE(mrF))))
lola: processed formula length: 62
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1073 markings, 5362 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((FIREABLE(mrF) OR FIREABLE(msG)) U FIREABLE(ssG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((FIREABLE(mrF) OR FIREABLE(msG)) U FIREABLE(ssG)))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5937 markings, 10196 edges
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (E (X (FIREABLE(ssA))))) OR FIREABLE(srF)) OR NOT(NOT(A ((FIREABLE(srG) U FIREABLE(srR))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (FIREABLE(ssA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(FIREABLE(ssA)))
lola: processed formula length: 27
lola: 11 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1073 markings, 1072 edges
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(srF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(srF)
lola: processed formula length: 13
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: processed formula with 0 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 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(srG) U FIREABLE(srR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(srG) U FIREABLE(srR)))
lola: processed formula: A ((FIREABLE(srG) U FIREABLE(srR)))
lola: processed formula length: 35
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 1073 markings, 1073 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((NOT FIREABLE(ssF) AND (FIREABLE(csF) OR FIREABLE(ssF)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (FIREABLE(ssF) OR (NOT FIREABLE(csF) AND NOT FIREABLE(ssF))))))
lola: processed formula length: 86
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2181627 markings, 5326348 edges, 430824 markings/sec, 0 secs
lola: 3856771 markings, 10383027 edges, 335029 markings/sec, 5 secs
lola: 5609369 markings, 14712704 edges, 350520 markings/sec, 10 secs
lola: 7101353 markings, 19835672 edges, 298397 markings/sec, 15 secs
lola: 8432842 markings, 24335096 edges, 266298 markings/sec, 20 secs
lola: 9998045 markings, 28521271 edges, 313041 markings/sec, 25 secs
lola: 11643524 markings, 32591954 edges, 329096 markings/sec, 30 secs
lola: 13170750 markings, 37643712 edges, 305445 markings/sec, 35 secs
lola: 14374369 markings, 42076557 edges, 240724 markings/sec, 40 secs
lola: 15423974 markings, 46271991 edges, 209921 markings/sec, 45 secs
lola: 16478590 markings, 50278317 edges, 210923 markings/sec, 50 secs
lola: 18074157 markings, 54554266 edges, 319113 markings/sec, 55 secs
lola: 19430080 markings, 58316601 edges, 271185 markings/sec, 60 secs
lola: 20857768 markings, 62059649 edges, 285538 markings/sec, 65 secs
lola: 22384309 markings, 65919336 edges, 305308 markings/sec, 70 secs
lola: 23881461 markings, 70894809 edges, 299430 markings/sec, 75 secs
lola: 24888987 markings, 74689111 edges, 201505 markings/sec, 80 secs
lola: 25939714 markings, 78717901 edges, 210145 markings/sec, 85 secs
lola: 26931242 markings, 82614863 edges, 198306 markings/sec, 90 secs
lola: 28113704 markings, 86983250 edges, 236492 markings/sec, 95 secs
lola: 29030535 markings, 90804487 edges, 183366 markings/sec, 100 secs
lola: 29950327 markings, 94557500 edges, 183958 markings/sec, 105 secs
lola: 30931199 markings, 98367397 edges, 196174 markings/sec, 110 secs
lola: 32501286 markings, 102632203 edges, 314017 markings/sec, 115 secs
lola: 33842629 markings, 106326282 edges, 268269 markings/sec, 120 secs
lola: 35035766 markings, 109613712 edges, 238627 markings/sec, 125 secs
lola: 36042494 markings, 112615887 edges, 201346 markings/sec, 130 secs
lola: 37411038 markings, 116199589 edges, 273709 markings/sec, 135 secs
lola: 38749178 markings, 119795758 edges, 267628 markings/sec, 140 secs
lola: 40379192 markings, 124068970 edges, 326003 markings/sec, 145 secs
lola: 41637140 markings, 128660781 edges, 251590 markings/sec, 150 secs
lola: 42823041 markings, 132968505 edges, 237180 markings/sec, 155 secs
lola: 43753379 markings, 136763054 edges, 186068 markings/sec, 160 secs
lola: 44741228 markings, 140443533 edges, 197570 markings/sec, 165 secs
lola: 45780630 markings, 144474333 edges, 207880 markings/sec, 170 secs
lola: 46622867 markings, 147992402 edges, 168447 markings/sec, 175 secs
lola: 47517488 markings, 151555489 edges, 178924 markings/sec, 180 secs
lola: 48489650 markings, 155326383 edges, 194432 markings/sec, 185 secs
lola: 49572878 markings, 159476663 edges, 216646 markings/sec, 190 secs
lola: 50446896 markings, 163148081 edges, 174804 markings/sec, 195 secs
lola: 51287847 markings, 166664661 edges, 168190 markings/sec, 200 secs
lola: 52066787 markings, 170108853 edges, 155788 markings/sec, 205 secs
lola: 52966590 markings, 173643927 edges, 179961 markings/sec, 210 secs
lola: 53869496 markings, 177237489 edges, 180581 markings/sec, 215 secs
lola: 55284061 markings, 181342979 edges, 282913 markings/sec, 220 secs
lola: 56698481 markings, 185149950 edges, 282884 markings/sec, 225 secs
lola: 57980420 markings, 188723793 edges, 256388 markings/sec, 230 secs
lola: 59102113 markings, 192022983 edges, 224339 markings/sec, 235 secs
lola: 60337512 markings, 195402001 edges, 247080 markings/sec, 240 secs
lola: 61358585 markings, 198439927 edges, 204215 markings/sec, 245 secs
lola: 62360856 markings, 201366156 edges, 200454 markings/sec, 250 secs
lola: 63545314 markings, 204472854 edges, 236892 markings/sec, 255 secs
lola: 64684526 markings, 207530364 edges, 227842 markings/sec, 260 secs
lola: 65916301 markings, 210769026 edges, 246355 markings/sec, 265 secs
lola: 67314777 markings, 214504701 edges, 279695 markings/sec, 270 secs
lola: 68607007 markings, 219231240 edges, 258446 markings/sec, 275 secs
lola: 69823969 markings, 223696788 edges, 243392 markings/sec, 280 secs
lola: 70808610 markings, 227616809 edges, 196928 markings/sec, 285 secs
lola: 71707977 markings, 230987749 edges, 179873 markings/sec, 290 secs
lola: 72758540 markings, 235103866 edges, 210113 markings/sec, 295 secs
lola: 73624206 markings, 238748184 edges, 173133 markings/sec, 300 secs
lola: 74565202 markings, 242470283 edges, 188199 markings/sec, 305 secs
lola: 75635381 markings, 246452750 edges, 214036 markings/sec, 310 secs
lola: 76707752 markings, 250743721 edges, 214474 markings/sec, 315 secs
lola: 77600407 markings, 254510875 edges, 178531 markings/sec, 320 secs
lola: 78429371 markings, 258045522 edges, 165793 markings/sec, 325 secs
lola: 79268685 markings, 261665460 edges, 167863 markings/sec, 330 secs
lola: 80205148 markings, 265313662 edges, 187293 markings/sec, 335 secs
lola: 81187401 markings, 269100993 edges, 196451 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: '\ufffd'
Aborted (core dumped)
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-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 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="ClientsAndServers-PT-N0020P1"
export BK_EXAMINATION="CTLFireability"
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/ClientsAndServers-PT-N0020P1.tgz
mv ClientsAndServers-PT-N0020P1 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 ClientsAndServers-PT-N0020P1, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-152646359400116"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;