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 732K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.7K 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.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 566K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900271
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526835875211

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ JoinFreeModules-PT-0100 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1302/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16032
lola: finding significant places
lola: 501 places, 801 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 901 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: E (F ((((p53 <= 0) OR (p141 + 1 <= p329)) AND (p108 <= p488)))) : A (G ((2 <= p456))) : E (F (((p203 <= 1) AND (p81 + 1 <= p160) AND (p350 + 1 <= p115) AND (p457 + 1 <= p318)))) : A (G ((p32 + 1 <= p308))) : A (G (((p287 <= p366) OR (3 <= p368) OR (p369 <= p386) OR (1 <= p383) OR (p424 <= p149)))) : A (G ((((p235 + 1 <= p491) OR (p319 <= 1)) AND (1 <= p477)))) : A (G ((2 <= p288))) : A (G (((((2 <= p396) AND (p350 <= p396)) OR (p178 + 1 <= p165)) AND (p380 <= p68)))) : A (G ((2 <= p76))) : A (G (((2 <= p107) OR (p242 <= p145) OR (p334 <= 1)))) : E (F (((p73 + 1 <= p227) AND ((p141 <= 1) OR (p195 <= 0))))) : A (G ((1 <= p7))) : A (G (((p426 <= 1) OR (p366 + 1 <= p163) OR (p431 <= 1)))) : A (G ((3 <= p393))) : E (F (((p263 <= 2) AND (p471 + 1 <= p433) AND (p265 + 1 <= p257)))) : A (G (((3 <= p353) AND ((1 <= p495) OR (1 <= p448) OR (1 <= p194)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p456)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= p456)))
lola: processed formula length: 19
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p456 <= 1)
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: 4 markings, 3 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-0.sara
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p288)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= p288)))
lola: processed formula length: 19
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p288 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= p76)))
lola: processed formula length: 18
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p76 <= 1)
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: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityCardinality-0.sara.
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p7)))
lola: processed formula length: 17
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p7 <= 0)
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 JoinFreeModules-PT-0100-ReachabilityCardinality-3-0.sara
lola: 3 markings, 2 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p393)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= p393)))
lola: processed formula length: 19
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityCardinality-3-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p393 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p32 + 1 <= p308)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p32 + 1 <= p308)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p73 + 1 <= p227) AND ((p141 <= 1) OR (p195 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p73 + 1 <= p227) AND ((p141 <= 1) OR (p195 <= 0)))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p73 + 1 <= p227) AND ((p141 <= 1) OR (p195 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p235 + 1 <= p491) OR (p319 <= 1)) AND (1 <= p477))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p235 + 1 <= p491) OR (p319 <= 1)) AND (1 <= p477))))
lola: processed formula length: 62
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p491 <= p235) AND (2 <= p319)) OR (p477 <= 0))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p426 <= 1) OR (p366 + 1 <= p163) OR (p431 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p426 <= 1) OR (p366 + 1 <= p163) OR (p431 <= 1))))
lola: processed formula length: 60
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= p426) AND (p163 <= p366) AND (2 <= p431))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-8-0.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: 99 markings, 98 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p107) OR (p242 <= p145) OR (p334 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((2 <= p107) OR (p242 <= p145) OR (p334 <= 1))))
lola: processed formula length: 56
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p107 <= 1) AND (p145 + 1 <= p242) AND (2 <= p334))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p353) AND ((1 <= p495) OR (1 <= p448) OR (1 <= p194)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= p353) AND ((1 <= p495) OR (1 <= p448) OR (1 <= p194)))))
lola: processed formula length: 71
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityCardinality-9-0.sara.rewrite Frontend/Parser/formula_rewrite.k:631

lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p353 <= 2) OR ((p495 <= 0) AND (p448 <= 0) AND (p194 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-10-0.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: 99 markings, 98 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p263 <= 2) AND (p471 + 1 <= p433) AND (p265 + 1 <= p257))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p263 <= 2) AND (p471 + 1 <= p433) AND (p265 + 1 <= p257))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p263 <= 2) AND (p471 + 1 <= p433) AND (p265 + 1 <= p257))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 99 markings, 98 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p53 <= 0) OR (p141 + 1 <= p329)) AND (p108 <= p488))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((p53 <= 0) OR (p141 + 1 <= p329)) AND (p108 <= p488))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((p53 <= 0) OR (p141 + 1 <= p329)) AND (p108 <= p488))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((2 <= p396) AND (p350 <= p396)) OR (p178 + 1 <= p165)) AND (p380 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((((2 <= p396) AND (p350 <= p396)) OR (p178 + 1 <= p165)) AND (p380 <= p68))))
lola: processed formula length: 85
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((((p396 <= 1) OR (p396 + 1 <= p350)) AND (p165 <= p178)) OR (p68 + 1 <= p380))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0100-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p203 <= 1) AND (p81 + 1 <= p160) AND (p350 + 1 <= p115) AND (p457 + 1 <= p318))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p203 <= 1) AND (p81 + 1 <= p160) AND (p350 + 1 <= p115) AND (p457 + 1 <= p318))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p203 <= 1) AND (p81 + 1 <= p160) AND (p350 + 1 <= p115) AND (p457 + 1 <= p318))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 104 markings, 103 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p287 <= p366) OR (3 <= p368) OR (p369 <= p386) OR (1 <= p383) OR (p424 <= p149))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p287 <= p366) OR (3 <= p368) OR (p369 <= p386) OR (1 <= p383) OR (p424 <= p149))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p366 + 1 <= p287) AND (p368 <= 2) AND (p386 + 1 <= p369) AND (p383 <= 0) AND (p149 + 1 <= p424))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0100-ReachabilityCardinality-15-0.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: 206 markings, 205 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no no no no yes no no no yes no
lola:
preliminary result: yes no yes no no no no no no no yes no no no yes no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 24520 KB
lola: time consumption: 11 seconds

sara: place or transition ordering is non-deterministic


BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 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 lola"
echo " Input is JoinFreeModules-PT-0100, 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 r100-smll-152658630900271"
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 ;