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 13M
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K 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 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 4.3K 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.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 13M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PhaseVariation-PT-D20CS100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472900649
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527143922281


BK_STOP 1527144318886

--------------------
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 PhaseVariation-PT-D20CS100 as instance name.
Using PhaseVariation 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': False, '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': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 358407, 'Memory': 7168.57, 'Tool': 'lola'}, {'Time': 361343, 'Memory': 7199.93, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
ReachabilityCardinality lola PhaseVariation-PT-D20CS100...

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


checking for too many tokens
===========================================================================================
PhaseVariation-PT-D20CS100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PhaseVariation-PT-D20CS100 @ 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: 14659/65536 symbol table entries, 2626 collisions
lola: preprocessing...
lola: finding significant places
lola: 1202 places, 13457 transitions, 801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D20CS100-ReachabilityCardinality.task
lola: A (G (((cell___5_18__B_ <= 2) OR (pool__11_8_ + 1 <= cell___8_13__A_) OR ((cell___7_19__B_ <= 0) AND (pool__17_14_ + 1 <= pool__7_7_))))) : A (G ((cell___13_19__B_ <= cell___1_4__A_))) : E (F ((3 <= pool__4_12_))) : E (F (((3 <= pool__1_8_) OR (pool__1_20_ <= cell___18_19__A_) OR ((3 <= cell___3_4__B_) AND (cell___18_15__B_ <= pool__15_9_)) OR ((1 <= cell___3_6__A_) AND (1 <= cell___19_9__B_) AND (pool__13_15_ <= pool__4_20_))))) : E (F ((pool__19_9_ + 1 <= cell___5_10__B_))) : E (F ((((2 <= cell___10_1__B_) AND (3 <= cell___19_17__B_) AND ((2 <= cell___6_4__B_) OR (1 <= cell___17_10__A_))) OR ((pool__11_18_ + 1 <= pool__14_6_) AND (cell___3_2__B_ + 1 <= cell___11_5__A_))))) : E (F (((2 <= pool__15_18_) OR (3 <= cell___1_20__A_)))) : A (G ((((pool__14_16_ <= 1) OR (cell___7_18__A_ <= 2)) AND ((cell___16_5__A_ <= 1) OR (cell___9_4__B_ <= 2))))) : E (F ((2 <= cell___10_13__B_))) : E (F (((pool__17_20_ <= pool__16_20_) AND ((1 <= pool__16_3_) OR (2 <= cell___4_11__A_)) AND (3 <= cell___13_2__A_)))) : E (F ((3 <= cell___6_14__B_))) : A (G ((1 <= pool__5_7_))) : E (F ((2 <= pool__13_16_))) : E (F (((3 <= cell___2_9__B_) AND (pool__12_7_ <= cell___11_18__B_)))) : A (G ((((cell___9_2__A_ <= cell___16_10__A_) OR ((pool__9_17_ <= cell___8_8__B_) AND (cell___8_10__A_ <= pool__1_7_))) AND ((cell___7_4__B_ + 1 <= cell___7_13__A_) OR (cell___6_8__A_ <= 1))))) : A (G ((pool__11_9_ <= pool__5_11_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___5_18__B_ <= 2) OR (pool__11_8_ + 1 <= cell___8_13__A_) OR ((cell___7_19__B_ <= 0) AND (pool__17_14_ + 1 <= pool__7_7_)))))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 5813 markings, 45993 edges, 1163 markings/sec, 0 secs
lola: sara is running 5 secs || 16444 markings, 154502 edges, 2126 markings/sec, 5 secs
lola: sara is running 10 secs || 26637 markings, 258297 edges, 2039 markings/sec, 10 secs
lola: sara is running 15 secs || 36317 markings, 377787 edges, 1936 markings/sec, 15 secs
lola: sara is running 20 secs || 46546 markings, 490818 edges, 2046 markings/sec, 20 secs
lola: sara is running 25 secs || 56700 markings, 603571 edges, 2031 markings/sec, 25 secs
lola: sara is running 30 secs || 66351 markings, 729612 edges, 1930 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 76510 markings, 829639 edges, 2032 markings/sec, 35 secs
lola: sara is running 40 secs || 86549 markings, 947497 edges, 2008 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___13_19__B_ <= cell___1_4__A_)))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pool__4_12_)))
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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pool__1_8_) OR (pool__1_20_ <= cell___18_19__A_) OR ((3 <= cell___3_4__B_) AND (cell___18_15__B_ <= pool__15_9_)) OR ((1 <= cell___3_6__A_) AND (1 <= cell___19_9__B_) AND (pool__13_15_ <= pool__4_20_)))))
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 3204 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 equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-2.sara.
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 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pool__19_9_ + 1 <= cell___5_10__B_)))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= cell___10_1__B_) AND (3 <= cell___19_17__B_) AND ((2 <= cell___6_4__B_) OR (1 <= cell___17_10__A_))) OR ((pool__11_18_ + 1 <= pool__14_6_) AND (cell___3_2__B_ + 1 <= cell___11_5__A_)))))
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 3204 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 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pool__15_18_) OR (3 <= cell___1_20__A_))))
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 3204 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 1066 markings, 1323 edges, 213 markings/sec, 0 secs
lola: sara is running 5 secs || 9334 markings, 68644 edges, 1654 markings/sec, 5 secs
lola: sara is running 10 secs || 16631 markings, 129717 edges, 1459 markings/sec, 10 secs
lola: sara is running 15 secs || 23720 markings, 210544 edges, 1418 markings/sec, 15 secs
lola: sara is running 20 secs || 33637 markings, 312664 edges, 1983 markings/sec, 20 secs
lola: sara is running 25 secs || 43356 markings, 424026 edges, 1944 markings/sec, 25 secs
lola: sara is running 30 secs || 49618 markings, 484129 edges, 1252 markings/sec, 30 secs
lola: sara is running 35 secs || 54630 markings, 534402 edges, 1002 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 59497 markings, 592967 edges, 973 markings/sec, 40 secs
lola: sara is running 45 secs || 64249 markings, 654528 edges, 950 markings/sec, 45 secs
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 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pool__14_16_ <= 1) OR (cell___7_18__A_ <= 2)) AND ((cell___16_5__A_ <= 1) OR (cell___9_4__B_ <= 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 3204 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 5803 markings, 50866 edges, 1161 markings/sec, 0 secs
lola: sara is running 5 secs || 15606 markings, 160297 edges, 1961 markings/sec, 5 secs
lola: sara is running 10 secs || 24806 markings, 288749 edges, 1840 markings/sec, 10 secs
lola: sara is running 15 secs || 33814 markings, 399128 edges, 1802 markings/sec, 15 secs
lola: sara is running 20 secs || 42428 markings, 520436 edges, 1723 markings/sec, 20 secs
lola: sara is running 25 secs || 51550 markings, 631607 edges, 1824 markings/sec, 25 secs
lola: sara is running 30 secs || 60119 markings, 752747 edges, 1714 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 68538 markings, 880767 edges, 1684 markings/sec, 35 secs
lola: sara is running 40 secs || 76603 markings, 1022738 edges, 1613 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cell___10_13__B_)))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 5392 markings, 45021 edges, 1078 markings/sec, 0 secs
lola: sara is running 5 secs || 14848 markings, 151211 edges, 1891 markings/sec, 5 secs
lola: sara is running 10 secs || 23820 markings, 271083 edges, 1794 markings/sec, 10 secs
lola: sara is running 15 secs || 32933 markings, 386984 edges, 1823 markings/sec, 15 secs
lola: sara is running 20 secs || 41821 markings, 508608 edges, 1778 markings/sec, 20 secs
lola: sara is running 25 secs || 50940 markings, 623548 edges, 1824 markings/sec, 25 secs
lola: sara is running 30 secs || 59764 markings, 746583 edges, 1765 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 68351 markings, 875890 edges, 1717 markings/sec, 35 secs
lola: sara is running 40 secs || 76501 markings, 1019539 edges, 1630 markings/sec, 40 secs
lola: sara is running 45 secs || 85246 markings, 1146454 edges, 1749 markings/sec, 45 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 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pool__17_20_ <= pool__16_20_) AND ((1 <= pool__16_3_) OR (2 <= cell___4_11__A_)) AND (3 <= cell___13_2__A_))))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 6091 markings, 48708 edges, 1218 markings/sec, 0 secs
lola: sara is running 5 secs || 16410 markings, 154123 edges, 2064 markings/sec, 5 secs
lola: sara is running 10 secs || 26694 markings, 258883 edges, 2057 markings/sec, 10 secs
lola: sara is running 15 secs || 36232 markings, 376311 edges, 1908 markings/sec, 15 secs
lola: sara is running 20 secs || 45869 markings, 485402 edges, 1927 markings/sec, 20 secs
lola: sara is running 25 secs || 55760 markings, 592029 edges, 1978 markings/sec, 25 secs
lola: sara is running 30 secs || 65203 markings, 711839 edges, 1889 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 75448 markings, 818049 edges, 2049 markings/sec, 35 secs
lola: sara is running 40 secs || 85418 markings, 933954 edges, 1994 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cell___6_14__B_)))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 5671 markings, 49156 edges, 1134 markings/sec, 0 secs
lola: sara is running 5 secs || 14710 markings, 149988 edges, 1808 markings/sec, 5 secs
lola: sara is running 10 secs || 23577 markings, 269065 edges, 1773 markings/sec, 10 secs
lola: sara is running 15 secs || 32543 markings, 383015 edges, 1793 markings/sec, 15 secs
lola: sara is running 20 secs || 41554 markings, 505904 edges, 1802 markings/sec, 20 secs
lola: sara is running 25 secs || 50664 markings, 620822 edges, 1822 markings/sec, 25 secs
lola: sara is running 30 secs || 59510 markings, 743798 edges, 1769 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 68101 markings, 873275 edges, 1718 markings/sec, 35 secs

lola: sara is running 40 secs || 76298 markings, 1017880 edges, 1639 markings/sec, 40 secs
lola: sara is running 45 secs || 85071 markings, 1145221 edges, 1755 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pool__5_7_)))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pool__13_16_)))
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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-12.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cell___2_9__B_) AND (pool__12_7_ <= cell___11_18__B_))))
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 3204 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)
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-12.sara.
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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 5684 markings, 48120 edges, 1137 markings/sec, 0 secs
lola: sara is running 5 secs || 15112 markings, 152933 edges, 1886 markings/sec, 5 secs
lola: sara is running 10 secs || 24000 markings, 273657 edges, 1778 markings/sec, 10 secs
lola: sara is running 15 secs || 33000 markings, 387628 edges, 1800 markings/sec, 15 secs
lola: sara is running 20 secs || 41896 markings, 510202 edges, 1779 markings/sec, 20 secs
lola: sara is running 25 secs || 51171 markings, 626102 edges, 1855 markings/sec, 25 secs
lola: sara is running 30 secs || 59054 markings, 734533 edges, 1577 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 66512 markings, 847298 edges, 1492 markings/sec, 35 secs
lola: sara is running 40 secs || 74723 markings, 987354 edges, 1642 markings/sec, 40 secs
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 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cell___9_2__A_ <= cell___16_10__A_) OR ((pool__9_17_ <= cell___8_8__B_) AND (cell___8_10__A_ <= pool__1_7_))) AND ((cell___7_4__B_ + 1 <= cell___7_13__A_) OR (cell___6_8__A_ <= 1)))))
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 3204 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 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3187 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pool__11_9_ <= pool__5_11_)))
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 3204 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 PhaseVariation-PT-D20CS100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS100-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no yes no no no no no no no no
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS100-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="PhaseVariation-PT-D20CS100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D20CS100.tgz
mv PhaseVariation-PT-D20CS100 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PhaseVariation-PT-D20CS100, 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 r114-csrt-152666472900649"
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 '' ReachabilityCardinality.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 ;