Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r105-oct2-158940199700115.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is JoinFreeModules-PT-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199700115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 3.9K Apr 7 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 7 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 6 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 5 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 5 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 24 05:37 model.pnml

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

=== Now, execution of the tool begins

BK_START 1589723285293

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-1000 @ 3570 seconds
check_solution: Constraint R4 = 1e+30 is above its equality of -1000
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of -1
check_solution: Constraint R7 = 1e+30 is above its equality of -2
check_solution: Constraint R8 = 1e+30 is above its equality of -1
check_solution: Constraint R9 = 1e+30 is above its equality of -1000
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0
check_solution: Constraint R12 = 1e+30 is above its equality of 0
check_solution: Constraint R13 = 1e+30 is above its equality of -2

Seriously low accuracy found ||*|| = 1e+30 (rel. error 1)

FORMULA JoinFreeModules-PT-1000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 2758
rslt: Output for LTLCardinality @ JoinFreeModules-PT-1000
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 13002/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160032
lola: finding significant places
lola: 5001 places, 8001 transitions, 4000 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A (G ((X ((3 <= p3326)) OR X ((((p3381 <= p1993) OR (p4440 <= p87)) AND G (((3 <= p3326) AND G ((p4305 + 1 <= 0))))))))) : A (X ((G ((2 <= p497)) U (p2028 <= p1681)))) : A ((G (X (F (((1 <= p1534) OR NOT(G (F ((p2559 <= p411)))))))) OR X ((p2048 <= p4600)))) : A (G (F (G ((G ((p712 <= p537)) U F ((2 <= p3717))))))) : A (X (F (G (X ((X (((2 <= p4361) AND (p118 <= p4414))) U (p4444 <= p736))))))) : A (X (NOT(((X ((3 <= p4481)) OR G ((p1190 <= p3034))) AND NOT(((p4481 <= 2) OR F (G ((3 <= p4481))))))))) : A (((X (F ((1 <= p3322))) AND (F ((p2118 <= p3733)) U (2 <= p2621))) AND F (G (NOT(F ((p2118 <= p3733))))))) : A ((F ((p2810 <= p4061)) AND NOT(X (X (F ((X (X (X ((p1185 <= p3394)))) U (2 <= p2187)))))))) : A (G (X (NOT(((3 <= p4849) AND X (F ((3 <= p4849)))))))) : A (X (G ((3 <= p3591)))) : A ((F ((p2804 <= p1287)) AND F (X ((F (((p4543 <= p1399) AND X ((3 <= p1448)))) AND F ((p576 <= p4201))))))) : A (X (F ((((p4663 <= p1356) AND ((p996 <= p2966) U (p1356 + 1 <= p4663))) U (p1356 + 1 <= p4663))))) : A ((NOT(X (((p1010 + 1 <= p3248) OR (p4524 + 1 <= p2064) OR (p3366 <= 1)))) U ((p1180 <= p1756) AND X (G ((p1756 + 1 <= p1180)))))) : A (X (X (F (((2 <= p3188) U F (G (F (X (((p4061 <= p3264) OR (p4803 + 1 <= p2256))))))))))) : A ((NOT(X (F ((p1799 <= p1241)))) AND ((3 <= p4739) OR F (NOT(((p3303 <= p3300) OR X ((3 <= p4739)))))))) : A (F (X (X (F (X ((p2903 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= p3326))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= p3326))))
lola: processed formula length: 24
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: subprocess 1 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p2028 <= p1681) OR (G ((2 <= p497)) AND F ((p2028 <= p1681))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p2028 <= p1681) OR (G ((2 <= p497)) AND F ((p2028 <= p1681))))))
lola: processed formula length: 72
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 2 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F (((1 <= p1534) OR F (G ((p411 + 1 <= p2559)))))) OR X ((p2048 <= p4600))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F (((1 <= p1534) OR F (G ((p411 + 1 <= p2559)))))) OR X ((p2048 <= p4600))))
lola: processed formula length: 83
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((p4444 <= p736)) AND (X (((2 <= p4361) AND (p118 <= p4414))) OR (p4444 <= p736))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((p4444 <= p736)) AND (X (((2 <= p4361) AND (p118 <= p4414))) OR (p4444 <= p736))))))
lola: processed formula length: 97
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 101668 markings, 144218 edges, 20334 markings/sec, 0 secs
lola: 204722 markings, 291382 edges, 20611 markings/sec, 5 secs
lola: 307901 markings, 439382 edges, 20636 markings/sec, 10 secs
lola: 410693 markings, 586148 edges, 20558 markings/sec, 15 secs
lola: 511572 markings, 729711 edges, 20176 markings/sec, 20 secs
lola: 613150 markings, 875293 edges, 20316 markings/sec, 25 secs
lola: 714320 markings, 1019117 edges, 20234 markings/sec, 30 secs
lola: 815503 markings, 1164246 edges, 20237 markings/sec, 35 secs
lola: 918288 markings, 1310423 edges, 20557 markings/sec, 40 secs
lola: 1019025 markings, 1455252 edges, 20147 markings/sec, 45 secs
lola: 1120368 markings, 1598900 edges, 20269 markings/sec, 50 secs
lola: 1220680 markings, 1742995 edges, 20062 markings/sec, 55 secs
lola: 1321071 markings, 1885843 edges, 20078 markings/sec, 60 secs
lola: 1422658 markings, 2031300 edges, 20317 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((X ((p4481 <= 2)) AND F ((p3034 + 1 <= p1190))) OR ((p4481 <= 2) OR F (G ((3 <= p4481)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((X ((p4481 <= 2)) AND F ((p3034 + 1 <= p1190))) OR ((p4481 <= 2) OR F (G ((3 <= p4481)))))))
lola: processed formula length: 99
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4003 markings, 4002 edges
lola: ========================================
lola: subprocess 5 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((1 <= p3322)))) AND (A ((F ((p2118 <= p3733)) U (2 <= p2621))) AND A (F (G ((p3733 + 1 <= p2118))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p3733 + 1 <= p2118))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p3733 + 1 <= p2118))))
lola: processed formula length: 32
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 66 markings, 67 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p2810 <= p4061))) AND A (X (X (G ((p2187 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p2810 <= p4061)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4061 + 1 <= p2810)
lola: processed formula length: 20
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p2187 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p2187 <= 1)))))
lola: processed formula length: 28
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 101947 markings, 144704 edges, 20389 markings/sec, 0 secs
lola: 205070 markings, 291730 edges, 20625 markings/sec, 5 secs
lola: 305253 markings, 435335 edges, 20037 markings/sec, 10 secs
lola: 405822 markings, 579141 edges, 20114 markings/sec, 15 secs
lola: 509062 markings, 726834 edges, 20648 markings/sec, 20 secs
lola: 610491 markings, 870640 edges, 20286 markings/sec, 25 secs
lola: 713494 markings, 1018292 edges, 20601 markings/sec, 30 secs
lola: 816728 markings, 1166347 edges, 20647 markings/sec, 35 secs
lola: 919933 markings, 1313302 edges, 20641 markings/sec, 40 secs
lola: 1023591 markings, 1460995 edges, 20732 markings/sec, 45 secs
lola: 1126089 markings, 1607195 edges, 20500 markings/sec, 50 secs
lola: 1228959 markings, 1754885 edges, 20574 markings/sec, 55 secs
lola: 1332012 markings, 1901875 edges, 20611 markings/sec, 60 secs
lola: 1434517 markings, 2047554 edges, 20501 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p4849 <= 2) OR X (G ((p4849 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p4849 <= 2) OR X (G ((p4849 <= 2)))))))
lola: processed formula length: 50
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 101922 markings, 144661 edges, 20384 markings/sec, 0 secs
lola: 205772 markings, 292691 edges, 20770 markings/sec, 5 secs
lola: 307949 markings, 439431 edges, 20435 markings/sec, 10 secs
lola: 409313 markings, 583733 edges, 20273 markings/sec, 15 secs
lola: 510513 markings, 728652 edges, 20240 markings/sec, 20 secs
lola: 612377 markings, 873943 edges, 20373 markings/sec, 25 secs
lola: 715331 markings, 1020402 edges, 20591 markings/sec, 30 secs
lola: 816000 markings, 1165116 edges, 20134 markings/sec, 35 secs
lola: 915885 markings, 1307339 edges, 19977 markings/sec, 40 secs
lola: 1016293 markings, 1450470 edges, 20082 markings/sec, 45 secs
lola: 1116694 markings, 1594725 edges, 20080 markings/sec, 50 secs
lola: 1217784 markings, 1737927 edges, 20218 markings/sec, 55 secs
lola: 1317744 markings, 1881399 edges, 19992 markings/sec, 60 secs
lola: 1418063 markings, 2024670 edges, 20064 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= p3591))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= p3591))))
lola: processed formula length: 24
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 9 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p2804 <= p1287))) AND A (X (F ((F (((p4543 <= p1399) AND X ((3 <= p1448)))) AND F ((p576 <= p4201)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p2804 <= p1287)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1287 + 1 <= p2804)
lola: processed formula length: 20
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F (((p4543 <= p1399) AND X ((3 <= p1448)))) AND F ((p576 <= p4201))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((F (((p4543 <= p1399) AND X ((3 <= p1448)))) AND F ((p576 <= p4201))))))
lola: processed formula length: 81
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p1356 + 1 <= p4663))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p1356 + 1 <= p4663))))
lola: processed formula length: 32
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2002 markings, 2001 edges
lola: ========================================
lola: subprocess 11 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((p3248 <= p1010) AND (p2064 <= p4524) AND (2 <= p3366))) U ((p1180 <= p1756) AND X (G ((p1756 + 1 <= p1180))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((p3248 <= p1010) AND (p2064 <= p4524) AND (2 <= p3366))) U ((p1180 <= p1756) AND X (G ((p1756 + 1 <= p1180))))))
lola: processed formula length: 120
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G ((p1241 + 1 <= p1799)))) AND A (((3 <= p4739) OR F (((p3300 + 1 <= p3303) AND X ((p4739 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p1241 + 1 <= p1799))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p1241 + 1 <= p1799))))
lola: processed formula length: 32
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 943 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((p2903 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((p2903 <= 0))))))
lola: processed formula length: 32
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 14 will run for 1415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((2 <= p3717)) OR (G ((p712 <= p537)) AND F ((2 <= p3717)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((2 <= p3717)) OR (G ((p712 <= p537)) AND F ((2 <= p3717)))))))
lola: processed formula length: 75
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 127 markings, 128 edges
lola: ========================================
lola: subprocess 15 will run for 2830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p4061 <= p3264) OR (p4803 + 1 <= p2256)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p4061 <= p3264) OR (p4803 + 1 <= p2256)))))
lola: processed formula length: 55
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((p4444 <= p736)) AND (X (((2 <= p4361) AND (p118 <= p4414))) OR (p4444 <= p736))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((p4444 <= p736)) AND (X (((2 <= p4361) AND (p118 <= p4414))) OR (p4444 <= p736))))))
lola: processed formula length: 97
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 103305 markings, 147080 edges, 20661 markings/sec, 0 secs
lola: 210093 markings, 299742 edges, 21358 markings/sec, 5 secs
lola: 316271 markings, 450741 edges, 21236 markings/sec, 10 secs
lola: 421839 markings, 601157 edges, 21114 markings/sec, 15 secs
lola: 524089 markings, 748205 edges, 20450 markings/sec, 20 secs
lola: 627714 markings, 896280 edges, 20725 markings/sec, 25 secs
lola: 734510 markings, 1048271 edges, 21359 markings/sec, 30 secs
lola: 841785 markings, 1201251 edges, 21455 markings/sec, 35 secs
lola: 949388 markings, 1355781 edges, 21521 markings/sec, 40 secs
lola: 1056425 markings, 1507646 edges, 21407 markings/sec, 45 secs
lola: 1160963 markings, 1657011 edges, 20908 markings/sec, 50 secs
lola: 1261710 markings, 1801312 edges, 20149 markings/sec, 55 secs
lola: 1361937 markings, 1944640 edges, 20045 markings/sec, 60 secs
lola: 1464387 markings, 2090839 edges, 20490 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: RESULT
lola:
SUMMARY: no no no no unknown yes no unknown unknown no no yes no no no no
lola:
preliminary result: no no no no unknown yes no unknown unknown no no yes no no no no
Segmentation fault
rslt: finished

BK_STOP 1589724097577

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

make: [verify] Error 139 (ignored)

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-1000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is JoinFreeModules-PT-1000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-oct2-158940199700115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;