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 252K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K 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.7K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 77K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Solitaire-PT-EngCT7x7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r163-smll-152705514800136
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527060553830


BK_STOP 1527061304002

--------------------
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 Solitaire-PT-EngCT7x7 as instance name.
Using Solitaire as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': None, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': None, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1327148, 'Memory': 4881.48, 'Tool': 'lola'}, {'Time': 1327234, 'Memory': 5171.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola Solitaire-PT-EngCT7x7...

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


checking for too many tokens
===========================================================================================
Solitaire-PT-EngCT7x7: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Solitaire-PT-EngCT7x7 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- 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: 143/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 67 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 77 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: (((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65)) OR A (F ((2 <= T32)))) : A (F (E (G ((T32 + 1 <= T44))))) : E (X ((A (F ((2 <= F44))) OR (3 <= T42)))) : (E (((F32 <= F24) U (2 <= F54))) OR ((T55 <= T37) AND A (((3 <= F63) U (2 <= T41))))) : E (G ((((F37 <= 2) OR (F65 <= 2)) OR A (G ((F52 <= T43)))))) : (((A (G ((3 <= T31))) OR (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))) AND (3 <= F33)) OR (((((F47 <= F75) AND (1 <= F24)) OR (2 <= T24)) OR E (G ((F53 <= T15)))) OR A (X ((T37 <= F54))))) : A (F (((2 <= p23) OR (3 <= p23)))) : A (F (E (G ((T55 <= 2))))) : (A (F (((T42 <= F63) OR (T47 <= F55)))) AND A (((T75 <= counter) U (T56 + 1 <= T47)))) : A (X (E (F ((2 <= F75))))) : (E (G (((F15 <= T13) OR (2 <= F34) OR (2 <= F14)))) AND (T44 <= p23)) : (((1 <= F41) OR (((T33 + 1 <= T43) OR ((3 <= F54) AND (1 <= F34))) AND (T52 <= F74))) OR (A (((2 <= counter) U (3 <= F36))) AND A (X ((T35 <= 2))))) : (A (F (A (G ((1 <= F37))))) AND E (((F45 + 1 <= T33) U TRUE))) : A (F (())) : (E (F (A (F ((2 <= F74))))) AND (A (X ((1 <= T15))) OR A (F (((1 <= T37) AND (1 <= F65)))))) : A (F (E (((F57 <= F31) U (2 <= F25)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65)) OR A (F ((2 <= T32))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: processed formula with 4 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= T32)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= T32)))
lola: processed formula: A (F ((2 <= T32)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 29 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((T32 + 1 <= T44)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (T44 <= T32))))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 95 markings, 131 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((2 <= F44))) OR (3 <= T42))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((2 <= F44)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (2 <= F44)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 88 markings, 87 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= T42)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= T42))
lola: processed formula length: 14
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((F32 <= F24) U (2 <= F54))) OR ((T55 <= T37) AND A (((3 <= F63) U (2 <= T41)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((F32 <= F24) U (2 <= F54)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((F32 <= F24) U (2 <= F54))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 852675 markings, 3654699 edges, 2169638807299686400 markings/sec, 0 secs
lola: 1580669 markings, 6797679 edges, 145599 markings/sec, 5 secs
lola: 2234703 markings, 9846515 edges, 130807 markings/sec, 10 secs
lola: 2890694 markings, 12954984 edges, 131198 markings/sec, 15 secs
lola: 3542868 markings, 16026866 edges, 130435 markings/sec, 20 secs
lola: 4111154 markings, 19042316 edges, 113657 markings/sec, 25 secs
lola: 4660504 markings, 22194092 edges, 109870 markings/sec, 30 secs
lola: 5234014 markings, 25199047 edges, 114702 markings/sec, 35 secs
lola: 5888270 markings, 28233696 edges, 130851 markings/sec, 40 secs
lola: 6491370 markings, 31240350 edges, 120620 markings/sec, 45 secs
lola: 7063651 markings, 34190792 edges, 114456 markings/sec, 50 secs
lola: 7632886 markings, 37335427 edges, 113847 markings/sec, 55 secs
lola: 8159838 markings, 40290964 edges, 105390 markings/sec, 60 secs
lola: 8705150 markings, 43236115 edges, 109062 markings/sec, 65 secs
lola: 9200616 markings, 46051882 edges, 99093 markings/sec, 70 secs
lola: 9720614 markings, 49014005 edges, 104000 markings/sec, 75 secs
lola: 10201295 markings, 52004844 edges, 96136 markings/sec, 80 secs
lola: 10635904 markings, 54865327 edges, 86922 markings/sec, 85 secs
lola: 11153945 markings, 57535888 edges, 103608 markings/sec, 90 secs
lola: 11604611 markings, 60204143 edges, 90133 markings/sec, 95 secs
lola: 12113967 markings, 62899939 edges, 101871 markings/sec, 100 secs
lola: 12646172 markings, 65508950 edges, 106441 markings/sec, 105 secs
lola: 13183543 markings, 68124491 edges, 107474 markings/sec, 110 secs
lola: 13727276 markings, 71011365 edges, 108747 markings/sec, 115 secs
lola: 14228871 markings, 73811449 edges, 100319 markings/sec, 120 secs
lola: 14730425 markings, 76416293 edges, 100311 markings/sec, 125 secs
lola: 15190655 markings, 79088388 edges, 92046 markings/sec, 130 secs
lola: 15687697 markings, 81622924 edges, 99408 markings/sec, 135 secs
lola: 16154178 markings, 84179608 edges, 93296 markings/sec, 140 secs
lola: 16641651 markings, 86826621 edges, 97495 markings/sec, 145 secs
lola: 17097450 markings, 89182222 edges, 91160 markings/sec, 150 secs
lola: 17565241 markings, 91580644 edges, 93558 markings/sec, 155 secs
lola: 17966815 markings, 93973023 edges, 80315 markings/sec, 160 secs
lola: 18378659 markings, 96386718 edges, 82369 markings/sec, 165 secs
lola: 18775932 markings, 98854211 edges, 79455 markings/sec, 170 secs
lola: 19199271 markings, 101230450 edges, 84668 markings/sec, 175 secs
lola: 19687219 markings, 103852207 edges, 97590 markings/sec, 180 secs
lola: 20190134 markings, 106465033 edges, 100583 markings/sec, 185 secs
lola: 20654036 markings, 109026997 edges, 92780 markings/sec, 190 secs
lola: 21121741 markings, 111693521 edges, 93541 markings/sec, 195 secs
lola: 21564218 markings, 114176958 edges, 88495 markings/sec, 200 secs
lola: 22014414 markings, 116740259 edges, 90039 markings/sec, 205 secs
lola: 22449983 markings, 119446224 edges, 87114 markings/sec, 210 secs
lola: 22877501 markings, 122169057 edges, 85504 markings/sec, 215 secs
lola: 23271829 markings, 124522429 edges, 78866 markings/sec, 220 secs
lola: 23674559 markings, 126876602 edges, 80546 markings/sec, 225 secs
lola: 24092635 markings, 129366573 edges, 83615 markings/sec, 230 secs
lola: 24505085 markings, 131946751 edges, 82490 markings/sec, 235 secs
lola: 24922278 markings, 134482290 edges, 83439 markings/sec, 240 secs
lola: 25375607 markings, 137271319 edges, 90666 markings/sec, 245 secs
lola: 25802565 markings, 139926793 edges, 85392 markings/sec, 250 secs
lola: 26207457 markings, 142537638 edges, 80978 markings/sec, 255 secs
lola: 26606329 markings, 145094937 edges, 79774 markings/sec, 260 secs
lola: 26972089 markings, 147509831 edges, 73152 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((F37 <= 2) OR (F65 <= 2)) OR A (G ((F52 <= T43))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((3 <= F37) AND (3 <= F65)) AND E(TRUE U (T43 + 1 <= F52)))))
lola: processed formula length: 75
lola: 6 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((3 <= T31))) OR (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))) AND (3 <= F33)) OR (((((F47 <= F75) AND (1 <= F24)) OR (2 <= T24)) OR E (G ((F53 <= T15)))) OR A (X ((T37 <= F54)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= T31)))
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 132 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: processed formula with 3 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 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= F33)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= F33)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.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 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((F47 <= F75) AND (1 <= F24)) OR (2 <= T24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((F47 <= F75) AND (1 <= F24)) OR (2 <= T24))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((F53 <= T15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (T15 + 1 <= F53)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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 1 significant temporal operators and needs 5 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: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p23) OR (3 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p23) OR (3 <= p23))))
lola: processed formula: A (F (((2 <= p23) OR (3 <= p23))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((T55 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (3 <= T55))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((T42 <= F63) OR (T47 <= F55)))) AND A (((T75 <= counter) U (T56 + 1 <= T47))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((T42 <= F63) OR (T47 <= F55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((T42 <= F63) OR (T47 <= F55))))
lola: processed formula: A (F (((T42 <= F63) OR (T47 <= F55))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 1025772 markings, 1720968 edges, 205154 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1392222 markings, 2407655 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((T75 <= counter) U (T56 + 1 <= T47)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((T75 <= counter) U (T56 + 1 <= T47)))
lola: processed formula: A (((T75 <= counter) U (T56 + 1 <= T47)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 28 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((2 <= F75)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= F75)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: 841529 markings, 3775354 edges, 3689320832170983424 markings/sec, 0 secs
lola: 1546046 markings, 7176506 edges, 140903 markings/sec, 5 secs
lola: 2126804 markings, 10385620 edges, 116152 markings/sec, 10 secs
lola: 2683789 markings, 13480086 edges, 111397 markings/sec, 15 secs
lola: 3271417 markings, 16705695 edges, 117526 markings/sec, 20 secs
lola: 3824513 markings, 19901771 edges, 110619 markings/sec, 25 secs
lola: 4330701 markings, 23039555 edges, 101238 markings/sec, 30 secs
lola: 4811046 markings, 26134765 edges, 96069 markings/sec, 35 secs
lola: 5284943 markings, 29110492 edges, 94779 markings/sec, 40 secs
lola: 5772297 markings, 32277313 edges, 97471 markings/sec, 45 secs
lola: 6199232 markings, 35099140 edges, 85387 markings/sec, 50 secs
lola: 6746578 markings, 38079416 edges, 109469 markings/sec, 55 secs
lola: 7276465 markings, 41060271 edges, 105977 markings/sec, 60 secs
lola: 7786203 markings, 44065079 edges, 101948 markings/sec, 65 secs
lola: 8244266 markings, 46800171 edges, 91613 markings/sec, 70 secs
lola: 8713977 markings, 49579439 edges, 93942 markings/sec, 75 secs
lola: 9193185 markings, 52507966 edges, 95842 markings/sec, 80 secs
lola: 9695179 markings, 55481232 edges, 100399 markings/sec, 85 secs
lola: 10177574 markings, 58533830 edges, 96479 markings/sec, 90 secs
lola: 10633160 markings, 61459338 edges, 91117 markings/sec, 95 secs
lola: 11032460 markings, 64269758 edges, 79860 markings/sec, 100 secs
lola: 11462520 markings, 67024500 edges, 86012 markings/sec, 105 secs
lola: 11857583 markings, 69712720 edges, 79013 markings/sec, 110 secs
lola: 12310186 markings, 72606847 edges, 90521 markings/sec, 115 secs
lola: 12721699 markings, 75519917 edges, 82303 markings/sec, 120 secs
lola: 13092085 markings, 78168203 edges, 74077 markings/sec, 125 secs
lola: 13468541 markings, 80795284 edges, 75291 markings/sec, 130 secs
lola: 13810765 markings, 83335122 edges, 68445 markings/sec, 135 secs
lola: 14155572 markings, 85954527 edges, 68961 markings/sec, 140 secs
lola: 14469334 markings, 88365755 edges, 62752 markings/sec, 145 secs
lola: 14935469 markings, 90995045 edges, 93227 markings/sec, 150 secs
lola: 15384612 markings, 93561941 edges, 89829 markings/sec, 155 secs
lola: 15798186 markings, 96078020 edges, 82715 markings/sec, 160 secs
lola: 16272578 markings, 98799459 edges, 94878 markings/sec, 165 secs
lola: 16744927 markings, 101473676 edges, 94470 markings/sec, 170 secs
lola: 17176657 markings, 104092525 edges, 86346 markings/sec, 175 secs
lola: 17582288 markings, 106726234 edges, 81126 markings/sec, 180 secs
lola: 18050722 markings, 109468949 edges, 93687 markings/sec, 185 secs
lola: 18451420 markings, 112100886 edges, 80140 markings/sec, 190 secs
lola: 18852593 markings, 114680881 edges, 80235 markings/sec, 195 secs
lola: 19231098 markings, 117148298 edges, 75701 markings/sec, 200 secs
lola: 19597674 markings, 119536292 edges, 73315 markings/sec, 205 secs
lola: 19992170 markings, 121983145 edges, 78899 markings/sec, 210 secs
lola: 20371858 markings, 124477402 edges, 75938 markings/sec, 215 secs
lola: 20736242 markings, 126813736 edges, 72877 markings/sec, 220 secs
lola: 21072401 markings, 129212198 edges, 67232 markings/sec, 225 secs
lola: 21393054 markings, 131609796 edges, 64131 markings/sec, 230 secs
lola: 21714487 markings, 133875084 edges, 64287 markings/sec, 235 secs
lola: 22044040 markings, 136247171 edges, 65911 markings/sec, 240 secs
lola: 22402874 markings, 138539219 edges, 71767 markings/sec, 245 secs
lola: 22736745 markings, 140793085 edges, 66774 markings/sec, 250 secs
lola: 23048038 markings, 143131477 edges, 62259 markings/sec, 255 secs
lola: 23381458 markings, 145368291 edges, 66684 markings/sec, 260 secs
lola: 23697574 markings, 147594058 edges, 63223 markings/sec, 265 secs
lola: 24056830 markings, 149997121 edges, 71851 markings/sec, 270 secs
lola: 24441221 markings, 152477859 edges, 76878 markings/sec, 275 secs
lola: 24861069 markings, 155037173 edges, 83970 markings/sec, 280 secs
lola: 25237683 markings, 157493706 edges, 75323 markings/sec, 285 secs
lola: 25569404 markings, 159823285 edges, 66344 markings/sec, 290 secs
lola: 25982855 markings, 162418841 edges, 82690 markings/sec, 295 secs
lola: 26337986 markings, 164738722 edges, 71026 markings/sec, 300 secs
lola: 26655458 markings, 166891835 edges, 63494 markings/sec, 305 secs
lola: 26981552 markings, 169125490 edges, 65219 markings/sec, 310 secs
lola: 27318413 markings, 171388609 edges, 67372 markings/sec, 315 secs
lola: 27651054 markings, 173755688 edges, 66528 markings/sec, 320 secs
lola: 27990884 markings, 176139193 edges, 67966 markings/sec, 325 secs
lola: 28350109 markings, 178596981 edges, 71845 markings/sec, 330 secs
lola: 28711422 markings, 181029533 edges, 72263 markings/sec, 335 secs
lola: 29112031 markings, 183673199 edges, 80122 markings/sec, 340 secs
lola: 29462848 markings, 186076998 edges, 70163 markings/sec, 345 secs
lola: 29818173 markings, 188478785 edges, 71065 markings/sec, 350 secs
lola: 30128994 markings, 190853725 edges, 62164 markings/sec, 355 secs
lola: 30419958 markings, 193152834 edges, 58193 markings/sec, 360 secs
lola: 30716308 markings, 195446617 edges, 59270 markings/sec, 365 secs
lola: 31013524 markings, 197628456 edges, 59443 markings/sec, 370 secs
lola: 31353377 markings, 199946302 edges, 67971 markings/sec, 375 secs
lola: 31668276 markings, 202204792 edges, 62980 markings/sec, 380 secs
lola: 32008780 markings, 204483278 edges, 68101 markings/sec, 385 secs
lola: 32338430 markings, 206746998 edges, 65930 markings/sec, 390 secs
lola: 32646878 markings, 208918518 edges, 61690 markings/sec, 395 secs
lola: 32976444 markings, 211044843 edges, 65913 markings/sec, 400 secs
lola: 33231279 markings, 212976360 edges, 50967 markings/sec, 405 secs
lola: 33498316 markings, 215175200 edges, 53407 markings/sec, 410 secs
lola: 33853320 markings, 217577425 edges, 71001 markings/sec, 415 secs
lola: 34207036 markings, 220037765 edges, 70743 markings/sec, 420 secs
lola: 34519000 markings, 222335781 edges, 62393 markings/sec, 425 secs
lola: 34819054 markings, 224447649 edges, 60011 markings/sec, 430 secs
lola: 35100765 markings, 226555133 edges, 56342 markings/sec, 435 secs
lola: 35394038 markings, 228599713 edges, 58655 markings/sec, 440 secs
lola: 35674038 markings, 230697534 edges, 56000 markings/sec, 445 secs
lola: 35930911 markings, 232752280 edges, 51375 markings/sec, 450 secs
lola: 36244856 markings, 234848537 edges, 62789 markings/sec, 455 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 Solitaire-PT-EngCT7x7-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Solitaire-PT-EngCT7x7"
export BK_EXAMINATION="CTLCardinality"
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/Solitaire-PT-EngCT7x7.tgz
mv Solitaire-PT-EngCT7x7 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 Solitaire-PT-EngCT7x7, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r163-smll-152705514800136"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;