Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is RobotManipulation-PT-01000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-smll-152685551600066
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526942704410


BK_STOP 1526943351608

--------------------
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 RobotManipulation-PT-01000 as instance name.
Using RobotManipulation 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': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 637163, 'Memory': 15952.7, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola RobotManipulation-PT-01000...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-01000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ RobotManipulation-PT-01000 @ 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-01000-CTLCardinality.task
lola: NOT((NOT(A (X ((move <= p_m)))) OR A (G (())))) : A (G (((1 <= access) OR (2 <= access) OR ((1 <= p_rel) AND (p_i2 <= r_active)) OR (access <= r_moving)))) : A (G (E (F (((3 <= initialized) OR (p_rdy <= off)))))) : (A (G (E (X ((3 <= r_stopped))))) AND E (G ((off <= 2)))) : E (F (E (F ((p_i1 <= p_sc))))) : E ((A (X (TRUE)) U A (G (TRUE)))) : A (F ((A (G ((p_rdy <= p_i1))) AND A (F ((p_rel <= initialized)))))) : NOT(A (G (((r_stopped <= moved) OR (p_i2 <= r_stopped) OR ((p_rel <= r_active) AND (p_sc <= p_rdy)))))) : A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel)))) : NOT(E (F (A (G ((1 <= p_i2)))))) : A (G (E (X (TRUE)))) : (E ((((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active)))) AND NOT(E (X (((access <= r_active) OR (1 <= moved)))))) : NOT((A (G (((p_sc <= off) OR (moved <= p_m)))) OR (((1 <= p_m) AND (p_rel <= r_active)) OR ((access <= move) AND (off <= p_rel)) OR (3 <= p_rdy)))) : A ((A (G ((1 <= p_i1))) U E (F ((p_i1 <= p_rel))))) : E (F (A (X (FALSE)))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(A (X ((move <= p_m)))) OR A (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 8 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= access) OR (2 <= access) OR ((1 <= p_rel) AND (p_i2 <= r_active)) OR (access <= r_moving))))
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 36 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-CTLCardinality.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= initialized) OR (p_rdy <= off))))))
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 ((3 <= initialized) OR (p_rdy <= off))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 3266446 markings, 8184246 edges, 3689329903141912576 markings/sec, 0 secs
lola: 6976363 markings, 17467905 edges, 741983 markings/sec, 5 secs
lola: 10616894 markings, 26575213 edges, 728106 markings/sec, 10 secs
lola: 13812656 markings, 35392048 edges, 639152 markings/sec, 15 secs
lola: 16575860 markings, 43465028 edges, 552641 markings/sec, 20 secs
lola: 19002002 markings, 50549203 edges, 485228 markings/sec, 25 secs
lola: 21475871 markings, 57773643 edges, 494774 markings/sec, 30 secs
lola: 23867886 markings, 64755175 edges, 478403 markings/sec, 35 secs
lola: 26219860 markings, 71621909 edges, 470395 markings/sec, 40 secs
lola: 28648016 markings, 78707402 edges, 485631 markings/sec, 45 secs
lola: 31045128 markings, 85704933 edges, 479422 markings/sec, 50 secs
lola: 33435741 markings, 92680598 edges, 478123 markings/sec, 55 secs
lola: 35844540 markings, 99712492 edges, 481760 markings/sec, 60 secs
lola: 38671749 markings, 107807323 edges, 565442 markings/sec, 65 secs
lola: 41399074 markings, 115543785 edges, 545465 markings/sec, 70 secs
lola: 44113482 markings, 123241740 edges, 542882 markings/sec, 75 secs
lola: 46864785 markings, 131042823 edges, 550261 markings/sec, 80 secs
lola: 49427206 markings, 138977165 edges, 512484 markings/sec, 85 secs
lola: 51264206 markings, 145112793 edges, 367400 markings/sec, 90 secs
lola: 53185587 markings, 151526048 edges, 384276 markings/sec, 95 secs
lola: 55036177 markings, 157701975 edges, 370118 markings/sec, 100 secs
lola: 56829713 markings, 163686528 edges, 358707 markings/sec, 105 secs
lola: 58576698 markings, 169514265 edges, 349397 markings/sec, 110 secs
lola: 60283931 markings, 175209902 edges, 341447 markings/sec, 115 secs
lola: 61956809 markings, 180791337 edges, 334576 markings/sec, 120 secs
lola: 63538867 markings, 186067446 edges, 316412 markings/sec, 125 secs
lola: 65410546 markings, 192310046 edges, 374336 markings/sec, 130 secs
lola: 67269853 markings, 198512201 edges, 371861 markings/sec, 135 secs
lola: 69131438 markings, 204721297 edges, 372317 markings/sec, 140 secs
lola: 70997919 markings, 210947115 edges, 373296 markings/sec, 145 secs
lola: 73108494 markings, 217650266 edges, 422115 markings/sec, 150 secs
lola: 75421893 markings, 224221926 edges, 462680 markings/sec, 155 secs
lola: 77557481 markings, 230282577 edges, 427118 markings/sec, 160 secs
lola: 79596269 markings, 236067286 edges, 407758 markings/sec, 165 secs
lola: 81665609 markings, 241938804 edges, 413868 markings/sec, 170 secs
lola: 83505602 markings, 247157427 edges, 367999 markings/sec, 175 secs
lola: 85281099 markings, 252974653 edges, 355099 markings/sec, 180 secs
lola: 87071468 markings, 259349073 edges, 358074 markings/sec, 185 secs
lola: 89486720 markings, 267022326 edges, 483050 markings/sec, 190 secs
lola: 91752013 markings, 274210533 edges, 453059 markings/sec, 195 secs
lola: 93932528 markings, 281124436 edges, 436103 markings/sec, 200 secs
lola: 95715278 markings, 286778212 edges, 356550 markings/sec, 205 secs
lola: 95719098 markings, 286791222 edges, 764 markings/sec, 210 secs
lola: 95727416 markings, 286815572 edges, 1664 markings/sec, 215 secs
lola: 95729978 markings, 286824072 edges, 512 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((3 <= r_stopped))))) AND E (G ((off <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((3 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((3 <= r_stopped)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4000 markings, 3999 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((p_i1 <= p_sc)))))
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 36 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: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2002 markings, 2001 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X (TRUE)) U A (G (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p_rdy <= p_i1))) AND A (F ((p_rel <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (p_i1 + 1 <= p_rdy))) AND A(TRUE U (p_rel <= initialized))))
lola: processed formula length: 83
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10005 markings, 24017 edges
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((r_stopped <= moved) OR (p_i2 <= r_stopped) OR ((p_rel <= r_active) AND (p_sc <= p_rdy))))))
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 36 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2015 markings, 2019 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel))))
lola: processed formula: A (F (((2 <= initialized) OR (1 <= p_sc) OR (1 <= initialized) OR (2 <= p_rel))))
lola: processed formula length: 84
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2003 markings, 2002 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((1 <= p_i2))))))
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 (p_i2 <= 0)))))
lola: processed formula length: 41
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4686931 markings, 6688548 edges, 937386 markings/sec, 0 secs
lola: 9701765 markings, 13850951 edges, 1002967 markings/sec, 5 secs
lola: 14027000 markings, 20032004 edges, 865047 markings/sec, 10 secs
lola: 14027000 markings, 27156719 edges, 0 markings/sec, 15 secs
lola: 14027000 markings, 36609742 edges, 0 markings/sec, 20 secs
lola: 14027000 markings, 46140276 edges, 0 markings/sec, 25 secs
lola: 14292979 markings, 55107854 edges, 53196 markings/sec, 30 secs
lola: 15956284 markings, 61517207 edges, 332661 markings/sec, 35 secs
lola: 17587454 markings, 67805247 edges, 326234 markings/sec, 40 secs
lola: 19198701 markings, 74017313 edges, 322249 markings/sec, 45 secs
lola: 20796832 markings, 80179288 edges, 319626 markings/sec, 50 secs
lola: 22380157 markings, 86284313 edges, 316665 markings/sec, 55 secs
lola: 23954820 markings, 92356064 edges, 314933 markings/sec, 60 secs
lola: 25509417 markings, 98350632 edges, 310919 markings/sec, 65 secs
lola: 27055636 markings, 104313006 edges, 309244 markings/sec, 70 secs
lola: 28525919 markings, 109808854 edges, 294057 markings/sec, 75 secs
lola: 29743148 markings, 114068395 edges, 243446 markings/sec, 80 secs
lola: 31099577 markings, 118815348 edges, 271286 markings/sec, 85 secs
lola: 32420367 markings, 123437682 edges, 264158 markings/sec, 90 secs
lola: 33730702 markings, 128023484 edges, 262067 markings/sec, 95 secs
lola: 35018096 markings, 132529043 edges, 257479 markings/sec, 100 secs
lola: 36321486 markings, 137090613 edges, 260678 markings/sec, 105 secs
lola: 37582173 markings, 141502760 edges, 252137 markings/sec, 110 secs
lola: 38852511 markings, 145948686 edges, 254068 markings/sec, 115 secs
lola: 40129303 markings, 150417229 edges, 255358 markings/sec, 120 secs
lola: 41394281 markings, 154844422 edges, 252996 markings/sec, 125 secs
lola: 42664520 markings, 159290050 edges, 254048 markings/sec, 130 secs
lola: 43973793 markings, 163872295 edges, 261855 markings/sec, 135 secs
lola: 45568160 markings, 170039438 edges, 318873 markings/sec, 140 secs
lola: 47130293 markings, 176092235 edges, 312427 markings/sec, 145 secs
lola: 48645554 markings, 181963666 edges, 303052 markings/sec, 150 secs
lola: 50152526 markings, 187802781 edges, 301394 markings/sec, 155 secs
lola: 51636844 markings, 193554432 edges, 296864 markings/sec, 160 secs
lola: 53101162 markings, 199228587 edges, 292864 markings/sec, 165 secs
lola: 54538770 markings, 204799157 edges, 287522 markings/sec, 170 secs
lola: 55986074 markings, 210407201 edges, 289461 markings/sec, 175 secs
lola: 57344667 markings, 215671530 edges, 271719 markings/sec, 180 secs
lola: 58710716 markings, 220964672 edges, 273210 markings/sec, 185 secs
lola: 60123277 markings, 226371001 edges, 282512 markings/sec, 190 secs
lola: 61515840 markings, 231243930 edges, 278513 markings/sec, 195 secs
lola: 62884438 markings, 236033451 edges, 273720 markings/sec, 200 secs
lola: 64222149 markings, 240714994 edges, 267542 markings/sec, 205 secs
lola: 65544350 markings, 245342325 edges, 264440 markings/sec, 210 secs
lola: 66848806 markings, 249907593 edges, 260891 markings/sec, 215 secs
lola: 68153423 markings, 254473458 edges, 260923 markings/sec, 220 secs
lola: 69428291 markings, 258935229 edges, 254974 markings/sec, 225 secs
lola: 70701137 markings, 263389939 edges, 254569 markings/sec, 230 secs
lola: 71976435 markings, 267853245 edges, 255060 markings/sec, 235 secs
lola: 73193199 markings, 272111707 edges, 243353 markings/sec, 240 secs
lola: 74416858 markings, 276394304 edges, 244732 markings/sec, 245 secs
lola: 75671021 markings, 280783677 edges, 250833 markings/sec, 250 secs
lola: 77166557 markings, 286508288 edges, 299107 markings/sec, 255 secs
lola: 78661441 markings, 292300566 edges, 298977 markings/sec, 260 secs
lola: 80098488 markings, 297868919 edges, 287409 markings/sec, 265 secs
lola: 81509732 markings, 303337173 edges, 282249 markings/sec, 270 secs
lola: 82887994 markings, 308677659 edges, 275652 markings/sec, 275 secs
lola: 84268754 markings, 314027943 edges, 276152 markings/sec, 280 secs
lola: 85608178 markings, 319218158 edges, 267885 markings/sec, 285 secs
lola: 86955730 markings, 324439515 edges, 269510 markings/sec, 290 secs
lola: 88287680 markings, 329600657 edges, 266390 markings/sec, 295 secs
lola: 89568975 markings, 334565639 edges, 256259 markings/sec, 300 secs
lola: 90873485 markings, 339620414 edges, 260902 markings/sec, 305 secs
lola: 92227939 markings, 344690170 edges, 270891 markings/sec, 310 secs
lola: 93595494 markings, 349475777 edges, 273511 markings/sec, 315 secs
lola: 94933111 markings, 354156905 edges, 267523 markings/sec, 320 secs
lola: 96237834 markings, 358723017 edges, 260945 markings/sec, 325 secs
lola: 97533038 markings, 363255879 edges, 259041 markings/sec, 330 secs
lola: 98805401 markings, 367708829 edges, 254473 markings/sec, 335 secs
lola: 100080646 markings, 372171899 edges, 255049 markings/sec, 340 secs
lola: 101324248 markings, 376524246 edges, 248720 markings/sec, 345 secs
lola: 102570802 markings, 380886943 edges, 249311 markings/sec, 350 secs
lola: 103816653 markings, 385247195 edges, 249170 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (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 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: ========================================
lola: subprocess 11 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active)))) AND NOT(E (X (((access <= r_active) OR (1 <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p_m <= p_i2) AND (1 <= access)) U ((2 <= off) AND (p_i1 <= r_active)))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 25032 markings, 27051 edges
lola: ========================================
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((r_active + 1 <= access) AND (moved <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((r_active + 1 <= access) AND (moved <= 0))))
lola: processed formula: A (X (((r_active + 1 <= access) AND (moved <= 0))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((p_sc <= off) OR (moved <= p_m)))) OR (((1 <= p_m) AND (p_rel <= r_active)) OR ((access <= move) AND (off <= p_rel)) OR (3 <= p_rdy))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((off + 1 <= p_sc) AND (p_m + 1 <= moved))))
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 36 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: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-CTLCardinality-12.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((1 <= p_i1))) U E (F ((p_i1 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (p_i1 <= 0))) U E(TRUE U (p_i1 <= p_rel)))
lola: processed formula length: 57
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6002 markings, 6002 edges
lola: ========================================
lola: subprocess 14 will run for 1469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2939 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-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: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no yes yes no yes yes unknown yes yes no yes no yes
----- Kill lola and sara stderr -----
FORMULA RobotManipulation-PT-01000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-15 TRUE 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="RobotManipulation-PT-01000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/RobotManipulation-PT-01000.tgz
mv RobotManipulation-PT-01000 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-full"
echo " Input is RobotManipulation-PT-01000, 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 r154-smll-152685551600066"
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 ;