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 168K
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:26 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 16K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FMS-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007000080
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527577480929


BK_STOP 1527578159184

--------------------
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 FMS-PT-100 as instance name.
Using FMS 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 60239, 'Memory': 3565.97, 'Tool': 'lola'}, {'Time': 61386, 'Memory': 3565.17, 'Tool': 'lola'}, {'Time': 1016091, 'Memory': 15952.93, 'Tool': 'marcie'}, {'Time': 1050720, 'Memory': 15953.21, 'Tool': 'marcie'}, {'Time': 1732445, 'Memory': 15947.27, 'Tool': 'itstools'}, {'Time': 1891074, 'Memory': 15952.89, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FMS-PT-100...

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


checking for too many tokens
===========================================================================================
FMS-PT-100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ FMS-PT-100 @ 3540 seconds
----- 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-100-CTLCardinality.task
lola: A (G (((P2s <= 2) OR (P12wM3 + 1 <= P1wM1) OR (P3M2 <= P1)))) : A (G (NOT(E (G ((2 <= P2wP1)))))) : A (X (E (F ((3 <= P12s))))) : A (G (E (X ((P1s <= 0))))) : E (F ((P2 + 1 <= P2d))) : (((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d)) OR E (F (E (X ((3 <= P2wP1)))))) : NOT((E (F (((P2M2 <= P3s) AND (1 <= P1d)))) AND NOT(A (G ((3 <= P3)))))) : A (G (E (X (((P1d <= P12) OR (P2s <= M1)))))) : A (G (NOT(A (G ((P2M2 <= P12s)))))) : A (F (E (((P2d <= P1wM1) U (2 <= P12M3))))) : A (G (E (F (TRUE)))) : A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0))))) : NOT(E (F ((3 <= P2wP1)))) : ((2 <= P12) OR A (G (E (F ((1 <= P1d)))))) : NOT(E (F ((P1 <= P2wP1)))) : (E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))) AND (1 <= P3))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P2s <= 2) OR (P12wM3 + 1 <= P1wM1) OR (P3M2 <= P1))))
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 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 311 markings, 310 edges
lola: ========================================
lola: lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((2 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (P2wP1 <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 621 markings, 1243 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= P12s)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2905055 markings, 5096475 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((P1s <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((P1s <= 0)))))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 4233222 markings, 7944902 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4339895 markings, 8208078 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P2 + 1 <= P2d)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 103 markings, 102 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d)) OR E (F (E (X ((3 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P12s <= P2wM2) AND ((1 <= P1wM1) OR (M1 <= P1s)) AND (P2M2 <= P1s) AND (P1wP2 + 1 <= P2d))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: processed formula with 5 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((3 <= P2wP1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= P2wP1)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 41009 markings, 74705 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((P2M2 <= P3s) AND (1 <= P1d)))) AND NOT(A (G ((3 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P3s + 1 <= P2M2) OR (P1d <= 0))))
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 64 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= P3)))
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 64 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((P1d <= P12) OR (P2s <= M1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((P1d <= P12) OR (P2s <= M1))))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 4230926 markings, 7939775 edges, 2039898496806420480 markings/sec, 0 secs
lola: 6825151 markings, 14177598 edges, 518845 markings/sec, 5 secs
lola: 9201013 markings, 20050228 edges, 475172 markings/sec, 10 secs
lola: 11127089 markings, 25062113 edges, 385215 markings/sec, 15 secs
lola: 13122845 markings, 30273367 edges, 399151 markings/sec, 20 secs
lola: 15099557 markings, 35543434 edges, 395342 markings/sec, 25 secs
lola: 17053821 markings, 40745965 edges, 390853 markings/sec, 30 secs
lola: 19021370 markings, 46008845 edges, 393510 markings/sec, 35 secs
lola: 20936422 markings, 51145232 edges, 383010 markings/sec, 40 secs
lola: 22592306 markings, 55544851 edges, 331177 markings/sec, 45 secs
lola: 24444490 markings, 60489048 edges, 370437 markings/sec, 50 secs
lola: 26539786 markings, 65811658 edges, 419059 markings/sec, 55 secs
lola: 28427671 markings, 70891825 edges, 377577 markings/sec, 60 secs
lola: 30274404 markings, 75886078 edges, 369347 markings/sec, 65 secs
lola: 32101279 markings, 80909055 edges, 365375 markings/sec, 70 secs
lola: 33973238 markings, 85931386 edges, 374392 markings/sec, 75 secs
lola: 35783548 markings, 90879306 edges, 362062 markings/sec, 80 secs
lola: 37601090 markings, 95805146 edges, 363508 markings/sec, 85 secs
lola: 39415867 markings, 100731743 edges, 362955 markings/sec, 90 secs
lola: 41190444 markings, 105644453 edges, 354915 markings/sec, 95 secs
lola: 42979444 markings, 110554962 edges, 357800 markings/sec, 100 secs
lola: 44653425 markings, 115249821 edges, 334796 markings/sec, 105 secs
lola: 46379354 markings, 120017196 edges, 345186 markings/sec, 110 secs
lola: 48105598 markings, 124690323 edges, 345249 markings/sec, 115 secs
lola: 49837212 markings, 129464797 edges, 346323 markings/sec, 120 secs
lola: 51623233 markings, 134352901 edges, 357204 markings/sec, 125 secs
lola: 53366398 markings, 139108556 edges, 348633 markings/sec, 130 secs
lola: 55072057 markings, 143808244 edges, 341132 markings/sec, 135 secs
lola: 56737963 markings, 148452287 edges, 333181 markings/sec, 140 secs
lola: 58456250 markings, 153204884 edges, 343657 markings/sec, 145 secs
lola: 60177613 markings, 158001096 edges, 344273 markings/sec, 150 secs
lola: 61910690 markings, 162736400 edges, 346615 markings/sec, 155 secs
lola: 63536520 markings, 167325132 edges, 325166 markings/sec, 160 secs
lola: 65247460 markings, 172075419 edges, 342188 markings/sec, 165 secs
lola: 66931601 markings, 176714611 edges, 336828 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((P2M2 <= P12s))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (P12s + 1 <= P2M2)))))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 1701565 markings, 5767621 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3309861 markings, 11239494 edges, 321659 markings/sec, 5 secs
lola: 4844441 markings, 16464826 edges, 306916 markings/sec, 10 secs
lola: 6370994 markings, 21663346 edges, 305311 markings/sec, 15 secs
lola: 7897788 markings, 26865113 edges, 305359 markings/sec, 20 secs
lola: 9413919 markings, 32033973 edges, 303226 markings/sec, 25 secs
lola: 10902238 markings, 37106411 edges, 297664 markings/sec, 30 secs
lola: 12423042 markings, 42291647 edges, 304161 markings/sec, 35 secs
lola: 13929953 markings, 47431087 edges, 301382 markings/sec, 40 secs
lola: 15414352 markings, 52495092 edges, 296880 markings/sec, 45 secs
lola: 16939207 markings, 57699276 edges, 304971 markings/sec, 50 secs
lola: 18444698 markings, 62835685 edges, 301098 markings/sec, 55 secs
lola: 19941996 markings, 67945377 edges, 299460 markings/sec, 60 secs
lola: 21456029 markings, 73111612 edges, 302807 markings/sec, 65 secs
lola: 22958630 markings, 78237756 edges, 300520 markings/sec, 70 secs
lola: 24464014 markings, 83378247 edges, 301077 markings/sec, 75 secs
lola: 25971046 markings, 88522107 edges, 301406 markings/sec, 80 secs
lola: 27452073 markings, 93577795 edges, 296205 markings/sec, 85 secs
lola: 28941862 markings, 98661152 edges, 297958 markings/sec, 90 secs
lola: 30429386 markings, 103741307 edges, 297505 markings/sec, 95 secs
lola: 31930688 markings, 108870603 edges, 300260 markings/sec, 100 secs
lola: 33424217 markings, 113967765 edges, 298706 markings/sec, 105 secs
lola: 34906837 markings, 119032149 edges, 296524 markings/sec, 110 secs
lola: 36391814 markings, 124100468 edges, 296995 markings/sec, 115 secs
lola: 37883883 markings, 129196460 edges, 298414 markings/sec, 120 secs
lola: 39376652 markings, 134295552 edges, 298554 markings/sec, 125 secs
lola: 40848043 markings, 139322788 edges, 294278 markings/sec, 130 secs
lola: 42317993 markings, 144341657 edges, 293990 markings/sec, 135 secs
lola: 43789574 markings, 149366990 edges, 294316 markings/sec, 140 secs
lola: 45229258 markings, 154286162 edges, 287937 markings/sec, 145 secs
lola: 46663278 markings, 159184637 edges, 286804 markings/sec, 150 secs
lola: 48120900 markings, 164166003 edges, 291524 markings/sec, 155 secs
lola: 49579988 markings, 169153437 edges, 291818 markings/sec, 160 secs
lola: 51022167 markings, 174078106 edges, 288436 markings/sec, 165 secs
lola: 52490587 markings, 179095537 edges, 293684 markings/sec, 170 secs
lola: 53935405 markings, 184029478 edges, 288964 markings/sec, 175 secs
lola: 55373877 markings, 188944472 edges, 287694 markings/sec, 180 secs
lola: 56811652 markings, 193859737 edges, 287555 markings/sec, 185 secs
lola: 58233983 markings, 198720148 edges, 284466 markings/sec, 190 secs
lola: 59656525 markings, 203581261 edges, 284508 markings/sec, 195 secs
lola: 61089403 markings, 208479134 edges, 286576 markings/sec, 200 secs
lola: 62547909 markings, 213462643 edges, 291701 markings/sec, 205 secs
lola: 63976176 markings, 218343223 edges, 285653 markings/sec, 210 secs
lola: 65414758 markings, 223261569 edges, 287716 markings/sec, 215 secs
lola: 66841426 markings, 228140171 edges, 285334 markings/sec, 220 secs
lola: 68273636 markings, 233035013 edges, 286442 markings/sec, 225 secs
lola: 69708483 markings, 237939447 edges, 286969 markings/sec, 230 secs
lola: 71143435 markings, 242846527 edges, 286990 markings/sec, 235 secs
lola: 72578204 markings, 247749902 edges, 286954 markings/sec, 240 secs
lola: 74020416 markings, 252678870 edges, 288442 markings/sec, 245 secs
lola: 75465224 markings, 257620537 edges, 288962 markings/sec, 250 secs
lola: 76884438 markings, 262475637 edges, 283843 markings/sec, 255 secs
lola: 78306276 markings, 267329012 edges, 284368 markings/sec, 260 secs
lola: 79724962 markings, 272179659 edges, 283737 markings/sec, 265 secs
lola: 81139035 markings, 277015857 edges, 282815 markings/sec, 270 secs
lola: 82561046 markings, 281876828 edges, 284402 markings/sec, 275 secs
lola: 83982205 markings, 286738288 edges, 284232 markings/sec, 280 secs
lola: 85409443 markings, 291616160 edges, 285448 markings/sec, 285 secs
lola: 86849050 markings, 296539974 edges, 287921 markings/sec, 290 secs
lola: 88287284 markings, 301461688 edges, 287647 markings/sec, 295 secs
lola: 89715990 markings, 306346077 edges, 285741 markings/sec, 300 secs
lola: 91152927 markings, 311259468 edges, 287387 markings/sec, 305 secs
lola: 92579040 markings, 316132756 edges, 285223 markings/sec, 310 secs
lola: 94011511 markings, 321031147 edges, 286494 markings/sec, 315 secs
lola: 95451481 markings, 325955047 edges, 287994 markings/sec, 320 secs
lola: 96858557 markings, 330766336 edges, 281415 markings/sec, 325 secs
lola: 98246023 markings, 335513030 edges, 277493 markings/sec, 330 secs
lola: 99668508 markings, 340374162 edges, 284497 markings/sec, 335 secs
lola: 101104826 markings, 345284112 edges, 287264 markings/sec, 340 secs
lola: 102547479 markings, 350218910 edges, 288531 markings/sec, 345 secs
lola: 103973249 markings, 355093123 edges, 285154 markings/sec, 350 secs
lola: 105387314 markings, 359930566 edges, 282813 markings/sec, 355 secs
lola: 106823943 markings, 364846463 edges, 287326 markings/sec, 360 secs
lola: 108255297 markings, 369743029 edges, 286271 markings/sec, 365 secs
lola: 109682852 markings, 374623249 edges, 285511 markings/sec, 370 secs
lola: 111125592 markings, 379558976 edges, 288548 markings/sec, 375 secs
lola: 112559677 markings, 384465215 edges, 286817 markings/sec, 380 secs
lola: 113988755 markings, 389350479 edges, 285816 markings/sec, 385 secs
lola: 115412396 markings, 394218761 edges, 284728 markings/sec, 390 secs
lola: 116843753 markings, 399116707 edges, 286271 markings/sec, 395 secs
lola: 118273555 markings, 404005865 edges, 285960 markings/sec, 400 secs
lola: 119691093 markings, 408858374 edges, 283508 markings/sec, 405 secs
lola: 121075140 markings, 413589657 edges, 276809 markings/sec, 410 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((P2d <= P1wM1) U (2 <= P12M3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((P2d <= P1wM1) U (2 <= P12M3)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 13186 markings, 18676 edges
lola: subprocess 10 will run for 488 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: processed formula with 0 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: subprocess 11 will run for 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0)))))
lola: processed formula: A (X ((A (G ((P1wM1 <= P1))) OR ((2 <= P1s) OR (P3M2 <= 0)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
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: 30456 markings, 55505 edges
lola: ========================================
lola: subprocess 12 will run for 733 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((3 <= P2wP1))))
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 64 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: state equation: write sara problem file to FMS-PT-100-CTLCardinality-12.sara
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 13 will run for 977 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= P12) OR A (G (E (F ((1 <= P1d))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 977 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P12)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-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 14 will run for 1466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= P1d)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (1 <= P1d)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 3341446 markings, 7778538 edges, 2011398055902838784 markings/sec, 0 secs
lola: 6580171 markings, 15322089 edges, 647745 markings/sec, 5 secs
lola: 9730935 markings, 22649626 edges, 630153 markings/sec, 10 secs
lola: 12618506 markings, 29757814 edges, 577514 markings/sec, 15 secs
lola: 14909542 markings, 35879542 edges, 458207 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15211208 markings, 36724725 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((P1 <= P2wP1))))
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 64 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: 101 markings, 100 edges
lola: ========================================
lola: subprocess 15 will run for 2905 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))) AND (1 <= P3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2905 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P1wP2 <= P1d) OR (1 <= P1wP2)) U ((1 <= P12s) OR (1 <= P12wM3)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 809 markings, 910 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no unknown unknown yes yes no no yes no unknown
----- Kill lola and sara stderr -----
FORMULA FMS-PT-100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-100-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="FMS-PT-100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/FMS-PT-100.tgz
mv FMS-PT-100 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is FMS-PT-100, 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 r095-blw7-152650007000080"
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 ;