fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r103-smll-152658633600159
Last Updated
June 26, 2018

About the Execution of Irma.struct for HypertorusGrid-PT-d4k3p2b08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
747.290 94501.00 103139.00 806.90 FFTFTFFTTTFFTTTF 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 3.0M
-rw-r--r-- 1 mcc users 4.7K 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 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K 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 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 2.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is HypertorusGrid-PT-d4k3p2b08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-smll-152658633600159
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526730813752


BK_STOP 1526730908253

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using HypertorusGrid-PT-d4k3p2b08 as instance name.
Using HypertorusGrid 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 26712, 'Memory': 602.09, 'Tool': 'lola'}, {'Time': 27843, 'Memory': 605.57, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola HypertorusGrid-PT-d4k3p2b08...

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


checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d4k3p2b08: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ HypertorusGrid-PT-d4k3p2b08 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7209/65536 symbol table entries, 1791 collisions
lola: preprocessing...
lola: finding significant places
lola: 2025 places, 5184 transitions, 1295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5913 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality.task
lola: E (F ((3 <= po_d3_n1_3_1_2_1))) : E (F (((pbl_3_3_1_2 <= 2) AND (3 <= pi_d4_n1_1_3_1_1)))) : A (G (((pb_d1_n1_2_3_1_3 + 1 <= pb_d1_n1_1_1_2_3) OR (po_d1_n1_1_2_1_2 <= 1) OR (pil_d4_n1_1_2_1_1 <= pol_d3_n1_1_2_1_2)))) : A (G ((((pil_d4_n1_1_3_3_3 <= pb_d4_n2_2_1_2_3) AND (1 <= po_d3_n1_2_1_3_1) AND (pil_d4_n1_1_3_2_3 <= pb_d2_n2_1_1_2_3)) OR (1 <= pbl_2_1_1_1)))) : E (F ((((pol_d2_n1_1_3_2_1 + 1 <= pi_d3_n1_2_1_1_1) OR (po_d4_n1_2_1_1_1 <= 1)) AND ((2 <= pol_d1_n1_1_2_3_2) OR (pil_d1_n1_3_2_1_1 + 1 <= pi_d1_n1_1_2_3_3))))) : A (G (((po_d2_n1_1_2_1_3 <= pil_d4_n1_1_3_3_2) OR ((1 <= pbl_2_2_1_2) AND ((pol_d2_n1_1_2_1_1 <= pol_d2_n1_3_1_1_3) OR (pb_d3_n2_2_2_2_3 <= pb_d1_n1_2_1_2_3)))))) : E (F ((2 <= po_d2_n1_2_1_1_2))) : A (G (((pol_d4_n1_1_3_1_1 <= 2) OR (po_d2_n1_1_3_2_2 <= 2)))) : E (F ((pbl_2_2_1_1 <= 2))) : A (G (((pi_d3_n1_3_2_1_1 <= pb_d2_n1_3_2_2_1) OR (po_d4_n1_3_3_2_2 <= 2)))) : A (G (((2 <= pb_d1_n2_1_3_1_2) OR (pb_d4_n1_2_3_3_1 <= pol_d1_n1_1_3_1_1) OR ((3 <= pol_d2_n1_2_2_1_1) AND (2 <= pol_d1_n1_2_1_1_3)) OR ((pil_d3_n1_1_3_1_3 <= pol_d2_n1_3_3_3_1) AND ((pil_d3_n1_3_1_3_2 <= pb_d2_n2_2_2_1_1) OR (pb_d3_n1_2_1_3_2 <= pol_d2_n1_1_3_2_3)))))) : A (G ((po_d1_n1_1_3_2_1 <= pol_d4_n1_1_1_1_1))) : A (G ((pil_d1_n1_1_1_1_2 <= 2))) : E (F (((pb_d1_n1_1_3_3_1 <= 0) AND (pb_d3_n1_2_1_3_1 + 1 <= pol_d1_n1_2_3_2_2) AND (po_d2_n1_3_1_1_1 <= pb_d1_n2_2_1_3_3)))) : E (F ((pb_d3_n2_2_1_1_1 <= pi_d3_n1_3_2_3_1))) : E (F (((pol_d4_n1_3_2_3_1 <= pol_d3_n1_3_2_3_1) AND (pol_d3_n1_3_2_2_3 <= pol_d3_n1_2_2_3_2) AND (pb_d1_n1_2_3_1_3 + 1 <= pb_d1_n2_3_3_1_1) AND (2 <= pol_d3_n1_3_2_1_1))))
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 ((3 <= po_d3_n1_3_1_2_1)))
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 5180 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 HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 75973 markings, 77089 edges, 15195 markings/sec, 0 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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pbl_3_3_1_2 <= 2) AND (3 <= pi_d4_n1_1_3_1_1))))
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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 72399 markings, 73121 edges, 14480 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d1_n1_2_3_1_3 + 1 <= pb_d1_n1_1_1_2_3) OR (po_d1_n1_1_2_1_2 <= 1) OR (pil_d4_n1_1_2_1_1 <= pol_d3_n1_1_2_1_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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 58708 markings, 59297 edges, 11742 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pil_d4_n1_1_3_3_3 <= pb_d4_n2_2_1_2_3) AND (1 <= po_d3_n1_2_1_3_1) AND (pil_d4_n1_1_3_2_3 <= pb_d2_n2_1_1_2_3)) OR (1 <= pbl_2_1_1_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 5180 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 HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d2_n1_1_3_2_1 + 1 <= pi_d3_n1_2_1_1_1) OR (po_d4_n1_2_1_1_1 <= 1)) AND ((2 <= pol_d1_n1_1_2_3_2) OR (pil_d1_n1_3_2_1_1 + 1 <= pi_d1_n1_1_2_3_3)))))
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 5180 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 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d2_n1_1_2_1_3 <= pil_d4_n1_1_3_3_2) OR ((1 <= pbl_2_2_1_2) AND ((pol_d2_n1_1_2_1_1 <= pol_d2_n1_3_1_1_3) OR (pb_d3_n2_2_2_2_3 <= pb_d1_n1_2_1_2_3))))))
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 5180 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= po_d2_n1_2_1_1_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 5180 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 HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 89339 markings, 96660 edges, 17868 markings/sec, 0 secs

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 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d4_n1_1_3_1_1 <= 2) OR (po_d2_n1_1_3_2_2 <= 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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 61555 markings, 67928 edges, 12311 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((pbl_2_2_1_1 <= 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 5180 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 HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d3_n1_3_2_1_1 <= pb_d2_n1_3_2_2_1) OR (po_d4_n1_3_3_2_2 <= 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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 53682 markings, 54247 edges, 10736 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= pb_d1_n2_1_3_1_2) OR (pb_d4_n1_2_3_3_1 <= pol_d1_n1_1_3_1_1) OR ((3 <= pol_d2_n1_2_2_1_1) AND (2 <= pol_d1_n1_2_1_1_3)) OR ((pil_d3_n1_1_3_1_3 <= pol_d2_n1_3_3_3_1) AND ((pil_d3_n1_3_1_3_2 <= pb_d2_n2_2_2_1_1) OR (pb_d3_n1_2_1_3_2 <= pol_d2_n1_1_3_2_3))))))
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 5180 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 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((po_d1_n1_1_3_2_1 <= pol_d4_n1_1_1_1_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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-11.sara
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 876 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pil_d1_n1_1_1_1_2 <= 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 5180 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 HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 77963 markings, 79367 edges, 15593 markings/sec, 0 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 1166 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d1_n1_1_3_3_1 <= 0) AND (pb_d3_n1_2_1_3_1 + 1 <= pol_d1_n1_2_3_2_2) AND (po_d2_n1_3_1_1_1 <= pb_d1_n2_2_1_3_3))))
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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1748 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d3_n2_2_1_1_1 <= pi_d3_n1_3_2_3_1)))
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 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-14.sara
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d4_n1_3_2_3_1 <= pol_d3_n1_3_2_3_1) AND (pol_d3_n1_3_2_2_3 <= pol_d3_n1_2_2_3_2) AND (pb_d1_n1_2_3_1_3 + 1 <= pb_d1_n2_3_3_1_1) AND (2 <= pol_d3_n1_3_2_1_1))))
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 5180 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 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 87964 markings, 91064 edges, 17593 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no yes yes yes no no yes yes yes no
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-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="HypertorusGrid-PT-d4k3p2b08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d4k3p2b08.tgz
mv HypertorusGrid-PT-d4k3p2b08 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-structural"
echo " Input is HypertorusGrid-PT-d4k3p2b08, 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 r103-smll-152658633600159"
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 ;