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 364K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 207K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748600427
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527221241527


BK_STOP 1527221306349

--------------------
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 Vasy2003-PT-none as instance name.
Using Vasy2003 as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 12415, 'Memory': 478.56, 'Tool': 'itstools'}, {'Time': 15685, 'Memory': 533.81, 'Tool': 'itstools'}, {'Time': 29497, 'Memory': 591.44, 'Tool': 'gspn'}, {'Time': 29677, 'Memory': 2352.15, 'Tool': 'marcie'}, {'Time': 30381, 'Memory': 2352, 'Tool': 'marcie'}, {'Time': 40592, 'Memory': 324.91, 'Tool': 'lola'}, {'Time': 40694, 'Memory': 619.41, 'Tool': 'gspn'}, {'Time': 41761, 'Memory': 328.43, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 3.2695932339911398x far from the best tool itstools.
ReachabilityFireability lola Vasy2003-PT-none...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Vasy2003-PT-none: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ Vasy2003-PT-none @ 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: 1261/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 485 places, 776 transitions, 419 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 962 transition conflict sets
lola: TASK
lola: reading formula from Vasy2003-PT-none-ReachabilityFireability.task
lola: E (F (FIREABLE(t108))) : A (G ((FIREABLE(t277) OR (FIREABLE(t231) AND FIREABLE(t59)) OR NOT FIREABLE(t666) OR ((FIREABLE(t329) OR FIREABLE(t626) OR FIREABLE(t691) OR FIREABLE(t214)) AND FIREABLE(t194))))) : E (F ((FIREABLE(t254) AND FIREABLE(t697) AND (FIREABLE(t564) OR FIREABLE(t379) OR NOT FIREABLE(t148) OR FIREABLE(t574))))) : E (F (FIREABLE(t391))) : E (F (FIREABLE(t230))) : A (G ((FIREABLE(t446) OR NOT FIREABLE(t251) OR NOT FIREABLE(t261) OR NOT FIREABLE(t466) OR FIREABLE(t621)))) : E (F ((FIREABLE(t114) AND FIREABLE(t737) AND (FIREABLE(t261) OR FIREABLE(t348))))) : A (G ((NOT FIREABLE(t48) OR NOT FIREABLE(t233) OR NOT FIREABLE(t52) OR NOT FIREABLE(t698) OR (NOT FIREABLE(t250) AND NOT FIREABLE(t540) AND FIREABLE(t27))))) : E (F ((((FIREABLE(t50) AND FIREABLE(t206)) OR FIREABLE(t682)) AND FIREABLE(t208) AND (NOT FIREABLE(t742) OR FIREABLE(t514))))) : E (F ((FIREABLE(t457) AND ((FIREABLE(t754) AND (FIREABLE(t62) OR FIREABLE(t331))) OR FIREABLE(t734))))) : E (F ((FIREABLE(t44) AND ((FIREABLE(t525) AND FIREABLE(t488)) OR FIREABLE(t233)) AND NOT FIREABLE(t447) AND NOT FIREABLE(t351) AND (NOT FIREABLE(t381) OR NOT FIREABLE(t619))))) : E (F ((NOT FIREABLE(t6) AND FIREABLE(t624) AND FIREABLE(t464) AND NOT FIREABLE(t196) AND NOT FIREABLE(t13) AND (NOT FIREABLE(t683) OR NOT FIREABLE(t749))))) : E (F (FIREABLE(t321))) : E (F ((FIREABLE(t746) AND FIREABLE(t105) AND (FIREABLE(t399) OR (NOT FIREABLE(t266) AND FIREABLE(t227)))))) : E (F (FIREABLE(t106))) : E (F (FIREABLE(t275)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t108)))
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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t277) OR (FIREABLE(t231) AND FIREABLE(t59)) OR NOT FIREABLE(t666) OR ((FIREABLE(t329) OR FIREABLE(t626) OR FIREABLE(t691) OR FIREABLE(t214)) AND FIREABLE(t194)))))
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 56 bytes per marking, with 29 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 216 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 270758 markings, 410220 edges, 54152 markings/sec, 0 secs
lola: sara is running 5 secs || 532390 markings, 815923 edges, 52326 markings/sec, 5 secs
lola: sara is running 10 secs || 789642 markings, 1217092 edges, 51450 markings/sec, 10 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t254) AND FIREABLE(t697) AND (FIREABLE(t564) OR FIREABLE(t379) OR NOT FIREABLE(t148) OR FIREABLE(t574)))))
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 56 bytes per marking, with 29 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 26 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t391)))
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 56 bytes per marking, with 29 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: ========================================
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t230)))
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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: lola: result: yes
lola: state equation: calling and running sara
produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t446) OR NOT FIREABLE(t251) OR NOT FIREABLE(t261) OR NOT FIREABLE(t466) OR FIREABLE(t621))))
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 56 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-4.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t114) AND FIREABLE(t737) AND (FIREABLE(t261) OR FIREABLE(t348)))))
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 56 bytes per marking, with 29 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 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t48) OR NOT FIREABLE(t233) OR NOT FIREABLE(t52) OR NOT FIREABLE(t698) OR (NOT FIREABLE(t250) AND NOT FIREABLE(t540) AND FIREABLE(t27)))))
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 56 bytes per marking, with 29 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 34 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t50) AND FIREABLE(t206)) OR FIREABLE(t682)) AND FIREABLE(t208) AND (NOT FIREABLE(t742) OR FIREABLE(t514)))))
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 56 bytes per marking, with 29 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 35 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t457) AND ((FIREABLE(t754) AND (FIREABLE(t62) OR FIREABLE(t331))) OR FIREABLE(t734)))))
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 56 bytes per marking, with 29 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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t44) AND ((FIREABLE(t525) AND FIREABLE(t488)) OR FIREABLE(t233)) AND NOT FIREABLE(t447) AND NOT FIREABLE(t351) AND (NOT FIREABLE(t381) OR NOT FIREABLE(t619)))))
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 56 bytes per marking, with 29 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 192 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t6) AND FIREABLE(t624) AND FIREABLE(t464) AND NOT FIREABLE(t196) AND NOT FIREABLE(t13) AND (NOT FIREABLE(t683) OR NOT FIREABLE(t749)))))
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 56 bytes per marking, with 29 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 42 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t321)))
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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 1173 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t746) AND FIREABLE(t105) AND (FIREABLE(t399) OR (NOT FIREABLE(t266) AND FIREABLE(t227))))))
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 56 bytes per marking, with 29 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 13 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Vasy2003-PT-none-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1760 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t106)))
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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t275)))
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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no no no yes yes no yes no yes yes
FORMULA Vasy2003-PT-none-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
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/Vasy2003-PT-none.tgz
mv Vasy2003-PT-none 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 Vasy2003-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-smll-152708748600427"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;