About the Execution of 2018-Gold for TriangularGrid-PT-3011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.120 | 731804.00 | 750398.00 | 3646.70 | FFFFFFFFF?FFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r176-oct2-155297760900134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is TriangularGrid-PT-3011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-oct2-155297760900134
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.1K Feb 12 21:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 21:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 9 05:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 9 05:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:06 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:06 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 01:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 01:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K Feb 4 22:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 4 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 1 23:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 1 23:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rwxr-xr-x 1 mcc users 70K Mar 10 17:31 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 TriangularGrid-PT-3011-LTLCardinality-00
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-01
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-02
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-03
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-04
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-05
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-06
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-07
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-08
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-09
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-10
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-11
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-12
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-13
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-14
FORMULA_NAME TriangularGrid-PT-3011-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553301068946
info: Time: 3600 - MCC
===========================================================================================
prep: translating TriangularGrid-PT-3011 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TriangularGrid-PT-3011 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ TriangularGrid-PT-3011 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 198/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 90 transitions, 62 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 135 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-3011-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= pil3_3_1)
lola: LP says that atomic proposition is always false: (3 <= pil2_3_3)
lola: LP says that atomic proposition is always false: (3 <= pol3_2_3)
lola: LP says that atomic proposition is always false: (3 <= pil3_3_3)
lola: LP says that atomic proposition is always false: (2 <= pil2_2_1)
lola: LP says that atomic proposition is always false: (2 <= pol1_3_3)
lola: A (F (G (X (F ((pb2_1_1 <= pb1_1_1)))))) : A ((3 <= pb3_3_1)) : A (X (G (G (X ((pol2_3_3 <= pol3_3_1)))))) : A (((FALSE U (3 <= pb3_2_1)) U (FALSE U FALSE))) : A (X (G (F (F ((1 <= pil3_3_3)))))) : A (G (F (X (X ((po1_1_1 <= pi2_3_5)))))) : A (G (X (F (FALSE)))) : A (F ((pb3_2_1 <= po3_3_1))) : A (G (G (((pb2_1_1 <= pbl_3_2) U (pol3_2_1 <= pb3_1_1))))) : A (X (F (G ((pol1_3_3 <= pb2_3_3))))) : A ((X (X (FALSE)) U X (G ((pi2_3_3 <= po2_3_1))))) : A ((F (X ((pi1_3_3 <= pb3_3_5))) U (2 <= pbl_2_3))) : A (X (G (((1 <= pi1_3_5) U (pb1_2_2 <= pi3_2_1))))) : A ((((1 <= pb3_2_1) U (po3_3_1 <= pol2_3_1)) U G (F ((po1_3_3 <= po2_2_3))))) : A (((FALSE U (3 <= pb2_2_3)) U ((pbl_3_4 <= pol2_3_1) U (pol1_2_1 <= pbl_2_1)))) : A (G ((1 <= pbl_3_2)))
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= pb3_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pb3_3_1)
lola: processed formula length: 14
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((pol2_3_3 <= pol3_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((pol2_3_3 <= pol3_3_1)))))
lola: processed formula length: 38
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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: 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, 66 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((pi2_3_3 <= po2_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((pi2_3_3 <= po2_3_1))))
lola: processed formula length: 32
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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: 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, 66 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((pi1_3_3 <= pb3_3_5))) U (2 <= pbl_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((pi1_3_3 <= pb3_3_5))) U (2 <= pbl_2_3)))
lola: processed formula length: 51
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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: 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: 135 markings, 136 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((pb1_2_2 <= pi3_2_1)) AND ((1 <= pi1_3_5) OR (pb1_2_2 <= pi3_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((pb1_2_2 <= pi3_2_1)) AND ((1 <= pi1_3_5) OR (pb1_2_2 <= pi3_2_1))))))
lola: processed formula length: 83
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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: 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: 117 markings, 117 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pbl_3_2)))
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 <= pbl_3_2)))
lola: processed formula length: 22
lola: 44 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.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: (pbl_3_2 <= 0)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pb3_2_1 <= po3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (po3_3_1 + 1 <= pb3_2_1)
lola: processed formula length: 24
lola: 44 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 243 markings, 244 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= pil3_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= pil3_3_3))))
lola: processed formula length: 27
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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 (--stubborn)
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: 970357 markings, 1553531 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((po1_1_1 <= pi2_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((po1_1_1 <= pi2_3_5))))
lola: processed formula length: 32
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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 (--stubborn)
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: 237 markings, 237 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((pol1_3_3 <= pb2_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pol1_3_3 <= pb2_3_3))))
lola: processed formula length: 33
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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 (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2260488 markings, 3565672 edges, 452098 markings/sec, 0 secs
lola: 4103037 markings, 6574475 edges, 368510 markings/sec, 5 secs
lola: 6071894 markings, 9496419 edges, 393771 markings/sec, 10 secs
lola: 7786659 markings, 12281803 edges, 342953 markings/sec, 15 secs
lola: 9391041 markings, 15099191 edges, 320876 markings/sec, 20 secs
lola: 11531056 markings, 18198013 edges, 428003 markings/sec, 25 secs
lola: 13312874 markings, 20836486 edges, 356364 markings/sec, 30 secs
lola: 15072313 markings, 23505864 edges, 351888 markings/sec, 35 secs
lola: 16846745 markings, 26296330 edges, 354886 markings/sec, 40 secs
lola: 18431635 markings, 28965768 edges, 316978 markings/sec, 45 secs
lola: 19683106 markings, 31254963 edges, 250294 markings/sec, 50 secs
lola: 20934690 markings, 33581711 edges, 250317 markings/sec, 55 secs
lola: 22814631 markings, 36644378 edges, 375988 markings/sec, 60 secs
lola: 24835455 markings, 39951415 edges, 404165 markings/sec, 65 secs
lola: 26616362 markings, 43035498 edges, 356181 markings/sec, 70 secs
lola: 28583962 markings, 46126643 edges, 393520 markings/sec, 75 secs
lola: 30563432 markings, 49207980 edges, 395894 markings/sec, 80 secs
lola: 32469449 markings, 52460697 edges, 381203 markings/sec, 85 secs
lola: 34299888 markings, 55655363 edges, 366088 markings/sec, 90 secs
lola: 36303385 markings, 58816512 edges, 400699 markings/sec, 95 secs
lola: 38250829 markings, 61818821 edges, 389489 markings/sec, 100 secs
lola: 39945614 markings, 64554001 edges, 338957 markings/sec, 105 secs
lola: 41618609 markings, 67085433 edges, 334599 markings/sec, 110 secs
lola: 43072990 markings, 69588289 edges, 290876 markings/sec, 115 secs
lola: 44685674 markings, 72289867 edges, 322537 markings/sec, 120 secs
lola: 46353784 markings, 74694995 edges, 333622 markings/sec, 125 secs
lola: 47866631 markings, 76968875 edges, 302569 markings/sec, 130 secs
lola: 49419893 markings, 79350361 edges, 310652 markings/sec, 135 secs
lola: 51053809 markings, 81934270 edges, 326783 markings/sec, 140 secs
lola: 52469143 markings, 84355588 edges, 283067 markings/sec, 145 secs
lola: 53695971 markings, 86556026 edges, 245366 markings/sec, 150 secs
lola: 54791809 markings, 88638142 edges, 219168 markings/sec, 155 secs
lola: 56481440 markings, 91388613 edges, 337926 markings/sec, 160 secs
lola: 58516096 markings, 94469286 edges, 406931 markings/sec, 165 secs
lola: 60206905 markings, 96901334 edges, 338162 markings/sec, 170 secs
lola: 61690652 markings, 98991840 edges, 296749 markings/sec, 175 secs
lola: 63123175 markings, 101061632 edges, 286505 markings/sec, 180 secs
lola: 64551436 markings, 103236716 edges, 285652 markings/sec, 185 secs
lola: 65981096 markings, 105384752 edges, 285932 markings/sec, 190 secs
lola: 67455092 markings, 107620777 edges, 294799 markings/sec, 195 secs
lola: 69062825 markings, 110095829 edges, 321547 markings/sec, 200 secs
lola: 70652560 markings, 112568215 edges, 317947 markings/sec, 205 secs
lola: 72210255 markings, 115002535 edges, 311539 markings/sec, 210 secs
lola: 73813509 markings, 117556777 edges, 320651 markings/sec, 215 secs
lola: 75367795 markings, 120069133 edges, 310857 markings/sec, 220 secs
lola: 76589220 markings, 122227036 edges, 244285 markings/sec, 225 secs
lola: 77705609 markings, 124242172 edges, 223278 markings/sec, 230 secs
lola: 78902054 markings, 126368740 edges, 239289 markings/sec, 235 secs
lola: 79963988 markings, 128332819 edges, 212387 markings/sec, 240 secs
lola: 81113220 markings, 130461894 edges, 229846 markings/sec, 245 secs
lola: 82292932 markings, 132639929 edges, 235942 markings/sec, 250 secs
lola: 83725091 markings, 134995674 edges, 286432 markings/sec, 255 secs
lola: 85458580 markings, 137825646 edges, 346698 markings/sec, 260 secs
lola: 87485327 markings, 141188488 edges, 405349 markings/sec, 265 secs
lola: 89329990 markings, 144365396 edges, 368933 markings/sec, 270 secs
lola: 91255356 markings, 147445563 edges, 385073 markings/sec, 275 secs
lola: 93162472 markings, 150454323 edges, 381423 markings/sec, 280 secs
lola: 95053116 markings, 153726341 edges, 378129 markings/sec, 285 secs
lola: 96590293 markings, 156470937 edges, 307435 markings/sec, 290 secs
lola: 98503238 markings, 159508751 edges, 382589 markings/sec, 295 secs
lola: 100402580 markings, 162497432 edges, 379868 markings/sec, 300 secs
lola: 102298523 markings, 165449364 edges, 379189 markings/sec, 305 secs
lola: 104094431 markings, 168250089 edges, 359182 markings/sec, 310 secs
lola: 106040495 markings, 171288190 edges, 389213 markings/sec, 315 secs
lola: 108193551 markings, 174672290 edges, 430611 markings/sec, 320 secs
lola: 109982454 markings, 177762627 edges, 357781 markings/sec, 325 secs
lola: 111140488 markings, 180206785 edges, 231607 markings/sec, 330 secs
lola: 113009486 markings, 183370277 edges, 373800 markings/sec, 335 secs
lola: 115114910 markings, 186690993 edges, 421085 markings/sec, 340 secs
lola: 117202342 markings, 190098817 edges, 417486 markings/sec, 345 secs
lola: 119548642 markings, 193729191 edges, 469260 markings/sec, 350 secs
lola: 121410607 markings, 196713885 edges, 372393 markings/sec, 355 secs
lola: 121429487 markings, 196740535 edges, 3776 markings/sec, 360 secs
lola: 121463257 markings, 196788762 edges, 6754 markings/sec, 365 secs
lola: 121473668 markings, 196803609 edges, 2082 markings/sec, 370 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((po1_3_3 <= po2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((po1_3_3 <= po2_2_3))))
lola: processed formula length: 32
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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 (--stubborn)
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: 179752 markings, 282996 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((pb2_1_1 <= pb1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((pb2_1_1 <= pb1_1_1))))
lola: processed formula length: 32
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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 (--stubborn)
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: 185 markings, 188 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= pb2_2_3) U ((pbl_3_4 <= pol2_3_1) U (pol1_2_1 <= pbl_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= pb2_2_3) U ((pbl_3_4 <= pol2_3_1) U (pol1_2_1 <= pbl_2_1))))
lola: processed formula length: 70
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((pol3_2_1 <= pb3_1_1)))) AND A (G (((pb2_1_1 <= pbl_3_2) OR (pol3_2_1 <= pb3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pb2_1_1 <= pbl_3_2) OR (pol3_2_1 <= pb3_1_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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((pb2_1_1 <= pbl_3_2) OR (pol3_2_1 <= pb3_1_1))))
lola: processed formula length: 55
lola: 47 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((pbl_3_2 + 1 <= pb2_1_1) AND (pb3_1_1 + 1 <= pol3_2_1))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA TriangularGrid-PT-3011-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (F (G ((pol1_3_3 <= pb2_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pol1_3_3 <= pb2_3_3))))
lola: processed formula length: 33
lola: 42 rewrites
lola: closed formula file TriangularGrid-PT-3011-LTLCardinality.task
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 (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2702350 markings, 4256116 edges, 540470 markings/sec, 0 secs
lola: 4835678 markings, 7676779 edges, 426666 markings/sec, 5 secs
lola: 6904600 markings, 10782333 edges, 413784 markings/sec, 10 secs
lola: 8611494 markings, 13797834 edges, 341379 markings/sec, 15 secs
lola: 10978796 markings, 17420428 edges, 473460 markings/sec, 20 secs
lola: 12974113 markings, 20331351 edges, 399063 markings/sec, 25 secs
lola: 14853358 markings, 23166934 edges, 375849 markings/sec, 30 secs
lola: 16870280 markings, 26333107 edges, 403384 markings/sec, 35 secs
lola: 18616896 markings, 29301545 edges, 349323 markings/sec, 40 secs
lola: 20041946 markings, 31927671 edges, 285010 markings/sec, 45 secs
lola: 21623486 markings, 34693964 edges, 316308 markings/sec, 50 secs
lola: 23853370 markings, 38400382 edges, 445977 markings/sec, 55 secs
lola: 25924450 markings, 41856364 edges, 414216 markings/sec, 60 secs
lola: 27930720 markings, 45114290 edges, 401254 markings/sec, 65 secs
lola: 30060423 markings, 48422685 edges, 425941 markings/sec, 70 secs
lola: 32246695 markings, 51984275 edges, 437254 markings/sec, 75 secs
lola: 34085178 markings, 55308862 edges, 367697 markings/sec, 80 secs
lola: 36298313 markings, 58808767 edges, 442627 markings/sec, 85 secs
lola: 38431429 markings, 62113092 edges, 426623 markings/sec, 90 secs
lola: 40271688 markings, 65026517 edges, 368052 markings/sec, 95 secs
lola: 42107950 markings, 67872703 edges, 367252 markings/sec, 100 secs
lola: 43526744 markings, 70460280 edges, 283759 markings/sec, 105 secs
lola: 45524105 markings, 73508333 edges, 399472 markings/sec, 110 secs
lola: 47210118 markings, 75955709 edges, 337203 markings/sec, 115 secs
lola: 48887885 markings, 78522082 edges, 335553 markings/sec, 120 secs
lola: 50625635 markings, 81255653 edges, 347550 markings/sec, 125 secs
lola: 52186027 markings, 83892130 edges, 312078 markings/sec, 130 secs
lola: 53615742 markings, 86405650 edges, 285943 markings/sec, 135 secs
lola: 54833753 markings, 88715891 edges, 243602 markings/sec, 140 secs
lola: 56763247 markings, 91818300 edges, 385899 markings/sec, 145 secs
lola: 58912585 markings, 95058027 edges, 429868 markings/sec, 150 secs
lola: 60697182 markings, 97589889 edges, 356919 markings/sec, 155 secs
lola: 62307127 markings, 99873916 edges, 321989 markings/sec, 160 secs
lola: 63915639 markings, 102233359 edges, 321702 markings/sec, 165 secs
lola: 65486290 markings, 104636739 edges, 314130 markings/sec, 170 secs
lola: 67088672 markings, 107062890 edges, 320476 markings/sec, 175 secs
lola: 68811356 markings, 109706367 edges, 344537 markings/sec, 180 secs
lola: 70527311 markings, 112371685 edges, 343191 markings/sec, 185 secs
lola: 72219387 markings, 115015917 edges, 338415 markings/sec, 190 secs
lola: 73977181 markings, 117818905 edges, 351559 markings/sec, 195 secs
lola: 75595313 markings, 120471633 edges, 323626 markings/sec, 200 secs
lola: 76874303 markings, 122739936 edges, 255798 markings/sec, 205 secs
lola: 78055830 markings, 124882861 edges, 236305 markings/sec, 210 secs
lola: 79345268 markings, 127187905 edges, 257888 markings/sec, 215 secs
lola: 80491829 markings, 129311388 edges, 229312 markings/sec, 220 secs
lola: 81657571 markings, 131470857 edges, 233148 markings/sec, 225 secs
lola: 82902583 markings, 133734778 edges, 249002 markings/sec, 230 secs
lola: 84471366 markings, 136220602 edges, 313757 markings/sec, 235 secs
lola: 86478737 markings, 139565966 edges, 401474 markings/sec, 240 secs
lola: 88562811 markings, 142896653 edges, 416815 markings/sec, 245 secs
lola: 90360925 markings, 146016589 edges, 359623 markings/sec, 250 secs
lola: 92276957 markings, 149054609 edges, 383206 markings/sec, 255 secs
lola: 94342481 markings, 152359857 edges, 413105 markings/sec, 260 secs
lola: 95785033 markings, 155184856 edges, 288510 markings/sec, 265 secs
lola: 97629062 markings, 158131676 edges, 368806 markings/sec, 270 secs
lola: 99658294 markings, 161303001 edges, 405846 markings/sec, 275 secs
lola: 101477657 markings, 164178533 edges, 363873 markings/sec, 280 secs
lola: 103295599 markings, 167003658 edges, 363588 markings/sec, 285 secs
lola: 105168551 markings, 169925772 edges, 374590 markings/sec, 290 secs
lola: 107249652 markings, 173185211 edges, 416220 markings/sec, 295 secs
lola: 109345136 markings, 176595279 edges, 419097 markings/sec, 300 secs
lola: 110670383 markings, 179216909 edges, 265049 markings/sec, 305 secs
lola: 112036762 markings, 181826495 edges, 273276 markings/sec, 310 secs
lola: 114309184 markings, 185401968 edges, 454484 markings/sec, 315 secs
lola: 116391811 markings, 188821113 edges, 416525 markings/sec, 320 secs
lola: 118528269 markings, 192179332 edges, 427292 markings/sec, 325 secs
lola: 120419686 markings, 195240321 edges, 378283 markings/sec, 330 secs
lola: 121463178 markings, 196788645 edges, 208698 markings/sec, 335 secs
lola: 121520853 markings, 196871219 edges, 11535 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA TriangularGrid-PT-3011-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no no unknown no no no no yes no
lola:
preliminary result: no no no no no no no no no unknown no no no no yes no
lola: memory consumption: 17704 KB
lola: time consumption: 731 seconds
BK_STOP 1553301800750
--------------------
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="TriangularGrid-PT-3011"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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-3954"
echo " Executing tool win2018"
echo " Input is TriangularGrid-PT-3011, 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 r176-oct2-155297760900134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-3011.tgz
mv TriangularGrid-PT-3011 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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 '
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 ;