About the Execution of M4M.full for DLCshifumi-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1492.090 | 604449.00 | 1227804.00 | 1938.00 | FFFFFFTFFTTTTTFF | normal |
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 7.0M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 6.0K 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 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 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 15K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DLCshifumi-PT-6a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649743000215
=====================================================================
--------------------
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 DLCshifumi-PT-6a-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526737342448
BK_STOP 1526737946897
--------------------
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 DLCshifumi-PT-6a as instance name.
Using DLCshifumi as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 78462, 'Memory': 2442.74, 'Tool': 'marcie'}, {'Time': 81755, 'Memory': 2442.93, 'Tool': 'marcie'}, {'Time': 967119, 'Memory': 6124.36, 'Tool': 'itstools'}, {'Time': 1002034, 'Memory': 5762.93, 'Tool': 'itstools'}, {'Time': 1143801, 'Memory': 1096.9, 'Tool': 'lola'}, {'Time': 1161295, 'Memory': 1099.72, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 14.577770130763936x far from the best tool marcie.
ReachabilityCardinality lola DLCshifumi-PT-6a...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DLCshifumi-PT-6a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCshifumi-PT-6a: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ DLCshifumi-PT-6a @ 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: 29504/65536 symbol table entries, 13256 collisions
lola: preprocessing...
lola: finding significant places
lola: 3568 places, 25936 transitions, 1153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 22565 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-6a-ReachabilityCardinality.task
lola: E (F ((((1 <= p2317) OR (2 <= p3117) OR (p1891 <= 1)) AND (3 <= p78)))) : E (F (((3 <= p2767) AND (p69 <= p1574)))) : E (F ((2 <= p1663))) : E (F ((((p1753 + 1 <= p206) AND (p105 <= 0)) OR ((p625 + 1 <= p2638) AND (p2071 <= 0))))) : E (F ((3 <= p2241))) : E (F (((p2760 + 1 <= p1792) AND (p2832 <= p2066) AND ((p2427 <= p2521) OR (1 <= p846)) AND (p3019 + 1 <= p2894)))) : A (G (((2 <= p30) OR (p1014 <= p2115) OR (p467 <= 0) OR (1 <= p3361)))) : E (F (((p3361 <= 2) AND (p1955 <= 1) AND (3 <= p1662) AND (3 <= p3277) AND ((2 <= p2596) OR (p2037 <= p882))))) : E (F ((((2 <= p2135) AND (p3442 <= 1)) OR (2 <= p764)))) : E (F (((1 <= p1315) AND (1 <= p2093)))) : A (G ((((p2536 <= p2354) AND (p2735 <= p3299) AND ((2 <= p49) OR (p2401 <= p3083))) OR (p2698 <= 2)))) : A (G ((p1275 <= p2111))) : A (G ((p615 <= p2052))) : A (G (((p207 <= p1588) OR (p2959 <= p453)))) : E (F (((p2703 + 1 <= p2676) AND (p2893 <= 2) AND ((p623 + 1 <= p138) OR (p2152 <= 2))))) : E (F (((2 <= p1836) AND (1 <= p421))))
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 ((((1 <= p2317) OR (2 <= p3117) OR (p1891 <= 1)) AND (3 <= p78))))
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 148 bytes per marking, with 31 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 860 markings, 11508 edges, 172 markings/sec, 0 secs
lola: sara is running 5 secs || 1738 markings, 25149 edges, 176 markings/sec, 5 secs
lola: sara is running 10 secs || 2621 markings, 36152 edges, 177 markings/sec, 10 secs
lola: sara is running 15 secs || 3521 markings, 48344 edges, 180 markings/sec, 15 secs
lola: sara is running 20 secs || 4409 markings, 61395 edges, 178 markings/sec, 20 secs
lola: sara is running 25 secs || 5288 markings, 73137 edges, 176 markings/sec, 25 secs
lola: sara is running 30 secs || 6156 markings, 86128 edges, 174 markings/sec, 30 secs
lola: sara is running 35 secs || 7049 markings, 98295 edges, 179 markings/sec, 35 secs
lola: sara is running 40 secs || 7953 markings, 111594 edges, 181 markings/sec, 40 secs
lola: sara is running 45 secs || 8856 markings, 123968 edges, 181 markings/sec, 45 secs
lola: sara is running 50 secs || 9740 markings, 136249 edges, 177 markings/sec, 50 secs
lola: sara is running 55 secs || 10613 markings, 148884 edges, 175 markings/sec, 55 secs
lola: sara is running 60 secs || 11504 markings, 161420 edges, 178 markings/sec, 60 secs
lola: sara is running 65 secs || 12406 markings, 174328 edges, 180 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 13273 markings, 186220 edges, 173 markings/sec, 70 secs
lola: sara is running 75 secs || 14122 markings, 198215 edges, 170 markings/sec, 75 secs
lola: sara is running 80 secs || 14996 markings, 211023 edges, 175 markings/sec, 80 secs
lola: sara is running 85 secs || 15872 markings, 222803 edges, 175 markings/sec, 85 secs
lola: sara is running 90 secs || 16688 markings, 235586 edges, 163 markings/sec, 90 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p2767) AND (p69 <= p1574))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1663)))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1753 + 1 <= p206) AND (p105 <= 0)) OR ((p625 + 1 <= p2638) AND (p2071 <= 0)))))
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 148 bytes per marking, with 31 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 877 markings, 8355 edges, 175 markings/sec, 0 secs
lola: sara is running 5 secs || 1759 markings, 20489 edges, 176 markings/sec, 5 secs
lola: sara is running 10 secs || 2654 markings, 33702 edges, 179 markings/sec, 10 secs
lola: sara is running 15 secs || 3546 markings, 48031 edges, 178 markings/sec, 15 secs
lola: sara is running 20 secs || 4422 markings, 62309 edges, 175 markings/sec, 20 secs
lola: sara is running 25 secs || 5277 markings, 76513 edges, 171 markings/sec, 25 secs
lola: sara is running 30 secs || 6153 markings, 90791 edges, 175 markings/sec, 30 secs
lola: sara is running 35 secs || 7045 markings, 105116 edges, 178 markings/sec, 35 secs
lola: sara is running 40 secs || 7941 markings, 119460 edges, 179 markings/sec, 40 secs
lola: sara is running 45 secs || 8822 markings, 133759 edges, 176 markings/sec, 45 secs
lola: sara is running 50 secs || 9689 markings, 148001 edges, 173 markings/sec, 50 secs
lola: sara is running 55 secs || 10559 markings, 162262 edges, 174 markings/sec, 55 secs
lola: sara is running 60 secs || 11457 markings, 176606 edges, 180 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 12341 markings, 190910 edges, 177 markings/sec, 65 secs
lola: sara is running 70 secs || 13219 markings, 205198 edges, 176 markings/sec, 70 secs
lola: sara is running 75 secs || 14097 markings, 219476 edges, 176 markings/sec, 75 secs
lola: sara is running 80 secs || 14989 markings, 233804 edges, 178 markings/sec, 80 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p2241)))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2760 + 1 <= p1792) AND (p2832 <= p2066) AND ((p2427 <= p2521) OR (1 <= p846)) AND (p3019 + 1 <= p2894))))
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 148 bytes per marking, with 31 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p30) OR (p1014 <= p2115) OR (p467 <= 0) OR (1 <= p3361))))
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 148 bytes per marking, with 31 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3361 <= 2) AND (p1955 <= 1) AND (3 <= p1662) AND (3 <= p3277) AND ((2 <= p2596) OR (p2037 <= p882)))))
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 148 bytes per marking, with 31 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p2135) AND (p3442 <= 1)) OR (2 <= p764))))
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 148 bytes per marking, with 31 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 832 markings, 8184 edges, 166 markings/sec, 0 secs
lola: sara is running 5 secs || 1745 markings, 21690 edges, 183 markings/sec, 5 secs
lola: sara is running 10 secs || 2602 markings, 32668 edges, 171 markings/sec, 10 secs
lola: sara is running 15 secs || 3426 markings, 45623 edges, 165 markings/sec, 15 secs
lola: sara is running 20 secs || 4248 markings, 59324 edges, 164 markings/sec, 20 secs
lola: sara is running 25 secs || 5068 markings, 72080 edges, 164 markings/sec, 25 secs
lola: sara is running 30 secs || 5886 markings, 85020 edges, 164 markings/sec, 30 secs
lola: sara is running 35 secs || 6728 markings, 98973 edges, 168 markings/sec, 35 secs
lola: sara is running 40 secs || 7582 markings, 112214 edges, 171 markings/sec, 40 secs
lola: sara is running 45 secs || 8430 markings, 125626 edges, 170 markings/sec, 45 secs
lola: sara is running 50 secs || 9260 markings, 139157 edges, 166 markings/sec, 50 secs
lola: sara is running 55 secs || 10078 markings, 152479 edges, 164 markings/sec, 55 secs
lola: sara is running 60 secs || 10985 markings, 166643 edges, 181 markings/sec, 60 secs
lola: sara is running 65 secs || 11886 markings, 181156 edges, 180 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 12786 markings, 195669 edges, 180 markings/sec, 70 secs
lola: sara is running 75 secs || 13606 markings, 208802 edges, 164 markings/sec, 75 secs
lola: sara is running 80 secs || 14424 markings, 221363 edges, 164 markings/sec, 80 secs
lola: sara is running 85 secs || 15257 markings, 235107 edges, 167 markings/sec, 85 secs
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 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1315) AND (1 <= p2093))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2536 <= p2354) AND (p2735 <= p3299) AND ((2 <= p49) OR (p2401 <= p3083))) OR (p2698 <= 2))))
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 148 bytes per marking, with 31 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 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-10.sara
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1275 <= p2111)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: ========================================
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-10.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 829 markings, 8207 edges, 166 markings/sec, 0 secs
lola: sara is running 5 secs || 1597 markings, 19234 edges, 154 markings/sec, 5 secs
lola: sara is running 10 secs || 2328 markings, 28950 edges, 146 markings/sec, 10 secs
lola: sara is running 15 secs || 3086 markings, 40809 edges, 152 markings/sec, 15 secs
lola: sara is running 20 secs || 3898 markings, 54130 edges, 162 markings/sec, 20 secs
lola: sara is running 25 secs || 4669 markings, 66530 edges, 154 markings/sec, 25 secs
lola: sara is running 30 secs || 5393 markings, 78400 edges, 145 markings/sec, 30 secs
lola: sara is running 35 secs || 6102 markings, 89844 edges, 142 markings/sec, 35 secs
lola: sara is running 40 secs || 6925 markings, 103582 edges, 165 markings/sec, 40 secs
lola: sara is running 45 secs || 7749 markings, 116378 edges, 165 markings/sec, 45 secs
lola: sara is running 50 secs || 8570 markings, 129869 edges, 164 markings/sec, 50 secs
lola: sara is running 55 secs || 9334 markings, 142101 edges, 153 markings/sec, 55 secs
lola: sara is running 60 secs || 10066 markings, 154185 edges, 146 markings/sec, 60 secs
lola: sara is running 65 secs || 10818 markings, 166521 edges, 150 markings/sec, 65 secs
lola: sara is running 70 secs || 11637 markings, 179677 edges, 164 markings/sec, 70 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 75 secs || 12458 markings, 193219 edges, 164 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 13278 markings, 206521 edges, 164 markings/sec, 80 secs
lola: sara is running 85 secs || 14061 markings, 219191 edges, 157 markings/sec, 85 secs
lola: sara is running 90 secs || 14884 markings, 232309 edges, 165 markings/sec, 90 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 790 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p615 <= p2052)))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 1311 markings, 11231 edges, 262 markings/sec, 0 secs
lola: sara is running 5 secs || 2571 markings, 23862 edges, 252 markings/sec, 5 secs
lola: sara is running 10 secs || 3799 markings, 37113 edges, 246 markings/sec, 10 secs
lola: sara is running 15 secs || 5069 markings, 51621 edges, 254 markings/sec, 15 secs
lola: sara is running 20 secs || 6337 markings, 67151 edges, 254 markings/sec, 20 secs
lola: sara is running 25 secs || 7582 markings, 82591 edges, 249 markings/sec, 25 secs
lola: sara is running 30 secs || 8798 markings, 97618 edges, 243 markings/sec, 30 secs
lola: sara is running 35 secs || 10040 markings, 113325 edges, 248 markings/sec, 35 secs
lola: sara is running 40 secs || 11322 markings, 129355 edges, 256 markings/sec, 40 secs
lola: sara is running 45 secs || 12611 markings, 144774 edges, 258 markings/sec, 45 secs
lola: sara is running 50 secs || 13867 markings, 160832 edges, 251 markings/sec, 50 secs
lola: sara is running 55 secs || 15090 markings, 175719 edges, 245 markings/sec, 55 secs
lola: sara is running 60 secs || 16334 markings, 191047 edges, 249 markings/sec, 60 secs
lola: sara is running 65 secs || 17597 markings, 206987 edges, 253 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 18857 markings, 222290 edges, 252 markings/sec, 70 secs
lola: sara is running 75 secs || 20106 markings, 238313 edges, 250 markings/sec, 75 secs
lola: sara is running 80 secs || 21347 markings, 253275 edges, 248 markings/sec, 80 secs
lola: sara is running 85 secs || 22684 markings, 269986 edges, 267 markings/sec, 85 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1023 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p207 <= p1588) OR (p2959 <= p453))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 668 markings, 7047 edges, 134 markings/sec, 0 secs
lola: sara is running 5 secs || 1360 markings, 18720 edges, 138 markings/sec, 5 secs
lola: sara is running 10 secs || 2031 markings, 28628 edges, 134 markings/sec, 10 secs
lola: sara is running 15 secs || 2734 markings, 42124 edges, 141 markings/sec, 15 secs
lola: sara is running 20 secs || 3515 markings, 57244 edges, 156 markings/sec, 20 secs
lola: sara is running 25 secs || 4275 markings, 71145 edges, 152 markings/sec, 25 secs
lola: sara is running 30 secs || 5034 markings, 85426 edges, 152 markings/sec, 30 secs
lola: sara is running 35 secs || 5812 markings, 100154 edges, 156 markings/sec, 35 secs
lola: sara is running 40 secs || 6599 markings, 115295 edges, 157 markings/sec, 40 secs
lola: sara is running 45 secs || 7385 markings, 130054 edges, 157 markings/sec, 45 secs
lola: sara is running 50 secs || 8171 markings, 144627 edges, 157 markings/sec, 50 secs
lola: sara is running 55 secs || 8957 markings, 159203 edges, 157 markings/sec, 55 secs
lola: sara is running 60 secs || 9741 markings, 174142 edges, 157 markings/sec, 60 secs
lola: sara is running 65 secs || 10521 markings, 188873 edges, 156 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 11293 markings, 203580 edges, 154 markings/sec, 70 secs
lola: sara is running 75 secs || 12058 markings, 217886 edges, 153 markings/sec, 75 secs
lola: sara is running 80 secs || 12839 markings, 232676 edges, 156 markings/sec, 80 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2703 + 1 <= p2676) AND (p2893 <= 2) AND ((p623 + 1 <= p138) OR (p2152 <= 2)))))
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 148 bytes per marking, with 31 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2981 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1836) AND (1 <= p421))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no yes yes yes yes yes no no
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-15 FALSE 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="DLCshifumi-PT-6a"
export BK_EXAMINATION="ReachabilityCardinality"
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/DLCshifumi-PT-6a.tgz
mv DLCshifumi-PT-6a 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 DLCshifumi-PT-6a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-152649743000215"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;