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-full
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 r162-smll-152705514000136
=====================================================================

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


BK_STOP 1527061444206

--------------------
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 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': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Solitaire-PT-EngCT7x7...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ Solitaire-PT-EngCT7x7 @ 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: 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: 769066 markings, 3259937 edges, 2169638807299686400 markings/sec, 0 secs
lola: 1487883 markings, 6400611 edges, 143763 markings/sec, 5 secs
lola: 2174823 markings, 9555383 edges, 137388 markings/sec, 10 secs
lola: 2848669 markings, 12752749 edges, 134769 markings/sec, 15 secs
lola: 3526802 markings, 15944524 edges, 135627 markings/sec, 20 secs
lola: 4113209 markings, 19052674 edges, 117281 markings/sec, 25 secs
lola: 4679348 markings, 22281937 edges, 113228 markings/sec, 30 secs
lola: 5273671 markings, 25378634 edges, 118865 markings/sec, 35 secs
lola: 5939490 markings, 28494081 edges, 133164 markings/sec, 40 secs
lola: 6554311 markings, 31582188 edges, 122964 markings/sec, 45 secs
lola: 7165084 markings, 34718093 edges, 122155 markings/sec, 50 secs
lola: 7746877 markings, 37971704 edges, 116359 markings/sec, 55 secs
lola: 8282748 markings, 40949852 edges, 107174 markings/sec, 60 secs
lola: 8842095 markings, 43962372 edges, 111869 markings/sec, 65 secs
lola: 9356514 markings, 46930842 edges, 102884 markings/sec, 70 secs
lola: 9883223 markings, 50031836 edges, 105342 markings/sec, 75 secs
lola: 10361144 markings, 53033258 edges, 95584 markings/sec, 80 secs
lola: 10846969 markings, 55882607 edges, 97165 markings/sec, 85 secs
lola: 11347072 markings, 58628655 edges, 100021 markings/sec, 90 secs
lola: 11806888 markings, 61380026 edges, 91963 markings/sec, 95 secs
lola: 12388146 markings, 64211903 edges, 116252 markings/sec, 100 secs
lola: 12915192 markings, 66844298 edges, 105409 markings/sec, 105 secs
lola: 13490015 markings, 69770000 edges, 114965 markings/sec, 110 secs
lola: 14013501 markings, 72621542 edges, 104697 markings/sec, 115 secs
lola: 14515928 markings, 75290982 edges, 100485 markings/sec, 120 secs
lola: 15008164 markings, 78052141 edges, 98447 markings/sec, 125 secs
lola: 15527359 markings, 80769081 edges, 103839 markings/sec, 130 secs
lola: 16026011 markings, 83431739 edges, 99730 markings/sec, 135 secs
lola: 16514845 markings, 86099886 edges, 97767 markings/sec, 140 secs
lola: 16993787 markings, 88619507 edges, 95788 markings/sec, 145 secs
lola: 17471871 markings, 91140405 edges, 95617 markings/sec, 150 secs
lola: 17912356 markings, 93620061 edges, 88097 markings/sec, 155 secs
lola: 18342627 markings, 96126649 edges, 86054 markings/sec, 160 secs
lola: 18747827 markings, 98700334 edges, 81040 markings/sec, 165 secs
lola: 19192892 markings, 101193043 edges, 89013 markings/sec, 170 secs
lola: 19697987 markings, 103907479 edges, 101019 markings/sec, 175 secs
lola: 20218492 markings, 106620377 edges, 104101 markings/sec, 180 secs
lola: 20685019 markings, 109176461 edges, 93305 markings/sec, 185 secs
lola: 21115785 markings, 111655179 edges, 86153 markings/sec, 190 secs
lola: 21562505 markings, 114169251 edges, 89344 markings/sec, 195 secs
lola: 22024559 markings, 116794991 edges, 92411 markings/sec, 200 secs
lola: 22476062 markings, 119608637 edges, 90301 markings/sec, 205 secs
lola: 22893953 markings, 122289562 edges, 83578 markings/sec, 210 secs
lola: 23331772 markings, 124869750 edges, 87564 markings/sec, 215 secs
lola: 23774937 markings, 127409581 edges, 88633 markings/sec, 220 secs
lola: 24194310 markings, 130033726 edges, 83875 markings/sec, 225 secs
lola: 24620620 markings, 132603781 edges, 85262 markings/sec, 230 secs
lola: 25047886 markings, 135258150 edges, 85453 markings/sec, 235 secs
lola: 25489488 markings, 138079033 edges, 88320 markings/sec, 240 secs
lola: 25922236 markings, 140632653 edges, 86550 markings/sec, 245 secs
lola: 26309888 markings, 143170755 edges, 77530 markings/sec, 250 secs
lola: 26689469 markings, 145627517 edges, 75916 markings/sec, 255 secs
lola: 27032608 markings, 147984155 edges, 68628 markings/sec, 260 secs
lola: 27453799 markings, 150335023 edges, 84238 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: 1063451 markings, 1785897 edges, 212690 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)
----- Kill lola and sara stderr -----
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: 822162 markings, 3673304 edges, 3689320832170983424 markings/sec, 0 secs
lola: 1513554 markings, 7007727 edges, 138278 markings/sec, 5 secs
lola: 2093910 markings, 10209689 edges, 116071 markings/sec, 10 secs
lola: 2661414 markings, 13362508 edges, 113501 markings/sec, 15 secs
lola: 3251236 markings, 16577234 edges, 117964 markings/sec, 20 secs
lola: 3799465 markings, 19748677 edges, 109646 markings/sec, 25 secs
lola: 4311089 markings, 22923735 edges, 102325 markings/sec, 30 secs
lola: 4802836 markings, 26076021 edges, 98349 markings/sec, 35 secs
lola: 5286562 markings, 29121579 edges, 96745 markings/sec, 40 secs
lola: 5780443 markings, 32327563 edges, 98776 markings/sec, 45 secs
lola: 6216956 markings, 35221572 edges, 87303 markings/sec, 50 secs
lola: 6772080 markings, 38206654 edges, 111025 markings/sec, 55 secs
lola: 7300820 markings, 41201024 edges, 105748 markings/sec, 60 secs
lola: 7809322 markings, 44198892 edges, 101700 markings/sec, 65 secs
lola: 8278496 markings, 47012944 edges, 93835 markings/sec, 70 secs
lola: 8760770 markings, 49891090 edges, 96455 markings/sec, 75 secs
lola: 9250934 markings, 52876546 edges, 98033 markings/sec, 80 secs
lola: 9776798 markings, 55994356 edges, 105173 markings/sec, 85 secs
lola: 10273701 markings, 59079760 edges, 99381 markings/sec, 90 secs
lola: 10720354 markings, 62058580 edges, 89331 markings/sec, 95 secs
lola: 11124763 markings, 64944198 edges, 80882 markings/sec, 100 secs
lola: 11572017 markings, 67789246 edges, 89451 markings/sec, 105 secs
lola: 12005310 markings, 70683502 edges, 86659 markings/sec, 110 secs
lola: 12473331 markings, 73676108 edges, 93604 markings/sec, 115 secs
lola: 12887900 markings, 76622909 edges, 82914 markings/sec, 120 secs
lola: 13284465 markings, 79432250 edges, 79313 markings/sec, 125 secs
lola: 13659265 markings, 82203609 edges, 74960 markings/sec, 130 secs
lola: 14021623 markings, 84909117 edges, 72472 markings/sec, 135 secs
lola: 14372438 markings, 87615339 edges, 70163 markings/sec, 140 secs
lola: 14811003 markings, 90361411 edges, 87713 markings/sec, 145 secs
lola: 15278600 markings, 92991932 edges, 93519 markings/sec, 150 secs
lola: 15736274 markings, 95698483 edges, 91535 markings/sec, 155 secs
lola: 16218903 markings, 98473278 edges, 96526 markings/sec, 160 secs
lola: 16717040 markings, 101290397 edges, 99627 markings/sec, 165 secs
lola: 17166055 markings, 104023816 edges, 89803 markings/sec, 170 secs
lola: 17599377 markings, 106815586 edges, 86664 markings/sec, 175 secs
lola: 18072621 markings, 109623704 edges, 94649 markings/sec, 180 secs
lola: 18496320 markings, 112379904 edges, 84740 markings/sec, 185 secs
lola: 18917860 markings, 115113014 edges, 84308 markings/sec, 190 secs
lola: 19316746 markings, 117727204 edges, 79777 markings/sec, 195 secs
lola: 19715488 markings, 120285940 edges, 79748 markings/sec, 200 secs
lola: 20134267 markings, 122941482 edges, 83756 markings/sec, 205 secs
lola: 20544840 markings, 125562039 edges, 82115 markings/sec, 210 secs
lola: 20911840 markings, 128104735 edges, 73400 markings/sec, 215 secs
lola: 21269938 markings, 130699565 edges, 71620 markings/sec, 220 secs
lola: 21626574 markings, 133244748 edges, 71327 markings/sec, 225 secs
lola: 21972167 markings, 135773474 edges, 69119 markings/sec, 230 secs
lola: 22361520 markings, 138278913 edges, 77871 markings/sec, 235 secs
lola: 22731778 markings, 140754816 edges, 74052 markings/sec, 240 secs
lola: 23075953 markings, 143302423 edges, 68835 markings/sec, 245 secs
lola: 23441271 markings, 145817203 edges, 73064 markings/sec, 250 secs
lola: 23797970 markings, 148414816 edges, 71340 markings/sec, 255 secs
lola: 24242943 markings, 151191069 edges, 88995 markings/sec, 260 secs
lola: 24695287 markings, 153977344 edges, 90469 markings/sec, 265 secs
lola: 25124976 markings, 156753438 edges, 85938 markings/sec, 270 secs
lola: 25526161 markings, 159460810 edges, 80237 markings/sec, 275 secs
lola: 25969207 markings, 162329655 edges, 88609 markings/sec, 280 secs
lola: 26373263 markings, 164993307 edges, 80811 markings/sec, 285 secs
lola: 26736481 markings, 167489817 edges, 72644 markings/sec, 290 secs
lola: 27111465 markings, 170075158 edges, 74997 markings/sec, 295 secs
lola: 27522958 markings, 172806173 edges, 82299 markings/sec, 300 secs
lola: 27891479 markings, 175496712 edges, 73704 markings/sec, 305 secs
lola: 28313972 markings, 178338915 edges, 84499 markings/sec, 310 secs
lola: 28722863 markings, 181103357 edges, 81778 markings/sec, 315 secs
lola: 29140350 markings, 183885487 edges, 83497 markings/sec, 320 secs
lola: 29539966 markings, 186581929 edges, 79923 markings/sec, 325 secs
lola: 29916693 markings, 189224115 edges, 75345 markings/sec, 330 secs
lola: 30260464 markings, 191870110 edges, 68754 markings/sec, 335 secs
lola: 30587369 markings, 194444541 edges, 65381 markings/sec, 340 secs
lola: 30910346 markings, 196946238 edges, 64595 markings/sec, 345 secs
lola: 31292908 markings, 199553378 edges, 76512 markings/sec, 350 secs
lola: 31659766 markings, 202134624 edges, 73372 markings/sec, 355 secs
lola: 32042761 markings, 204699083 edges, 76599 markings/sec, 360 secs
lola: 32412307 markings, 207211738 edges, 73909 markings/sec, 365 secs
lola: 32734379 markings, 209453715 edges, 64414 markings/sec, 370 secs
lola: 33073813 markings, 211799963 edges, 67887 markings/sec, 375 secs
lola: 33380903 markings, 214250103 edges, 61418 markings/sec, 380 secs
lola: 33763143 markings, 216939771 edges, 76448 markings/sec, 385 secs
lola: 34144155 markings, 219590021 edges, 76202 markings/sec, 390 secs
lola: 34504014 markings, 222221739 edges, 71972 markings/sec, 395 secs
lola: 34848063 markings, 224679688 edges, 68810 markings/sec, 400 secs
lola: 35182094 markings, 227112006 edges, 66806 markings/sec, 405 secs
lola: 35520552 markings, 229547356 edges, 67692 markings/sec, 410 secs
lola: 35833780 markings, 231978762 edges, 62646 markings/sec, 415 secs
lola: 36179926 markings, 234400521 edges, 69229 markings/sec, 420 secs
lola: 36491250 markings, 236813175 edges, 62265 markings/sec, 425 secs
lola: 36797277 markings, 239173701 edges, 61205 markings/sec, 430 secs
lola: 37099108 markings, 241634727 edges, 60366 markings/sec, 435 secs
lola: 37367085 markings, 244125871 edges, 53595 markings/sec, 440 secs
lola: 37761234 markings, 246837842 edges, 78830 markings/sec, 445 secs
lola: 38176651 markings, 249594087 edges, 83083 markings/sec, 450 secs
lola: 38552037 markings, 252211140 edges, 75077 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 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="Solitaire-PT-EngCT7x7"
export BK_EXAMINATION="CTLCardinality"
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/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-full"
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 r162-smll-152705514000136"
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 ;