Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r246-smll-162106594400153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is ShieldRVt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 109K May 5 16:52 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 ShieldRVt-PT-040A-00
FORMULA_NAME ShieldRVt-PT-040A-01
FORMULA_NAME ShieldRVt-PT-040A-02
FORMULA_NAME ShieldRVt-PT-040A-03
FORMULA_NAME ShieldRVt-PT-040A-04
FORMULA_NAME ShieldRVt-PT-040A-05
FORMULA_NAME ShieldRVt-PT-040A-06
FORMULA_NAME ShieldRVt-PT-040A-07
FORMULA_NAME ShieldRVt-PT-040A-08
FORMULA_NAME ShieldRVt-PT-040A-09
FORMULA_NAME ShieldRVt-PT-040A-10
FORMULA_NAME ShieldRVt-PT-040A-11
FORMULA_NAME ShieldRVt-PT-040A-12
FORMULA_NAME ShieldRVt-PT-040A-13
FORMULA_NAME ShieldRVt-PT-040A-14
FORMULA_NAME ShieldRVt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1621327191544

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 08:39:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 08:39:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 08:39:55] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2021-05-18 08:39:55] [INFO ] Transformed 323 places.
[2021-05-18 08:39:55] [INFO ] Transformed 323 transitions.
[2021-05-18 08:39:55] [INFO ] Found NUPN structural information;
[2021-05-18 08:39:55] [INFO ] Parsed PT model containing 323 places and 323 transitions in 237 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 874 ms. (steps per millisecond=114 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0]
// Phase 1: matrix 322 rows 323 cols
[2021-05-18 08:39:56] [INFO ] Computed 161 place invariants in 15 ms
[2021-05-18 08:39:57] [INFO ] [Real]Absence check using 161 positive place invariants in 134 ms returned sat
[2021-05-18 08:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:39:57] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2021-05-18 08:39:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:39:58] [INFO ] [Nat]Absence check using 161 positive place invariants in 193 ms returned sat
[2021-05-18 08:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:39:58] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-18 08:39:59] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 84 ms.
[2021-05-18 08:40:03] [INFO ] Added : 315 causal constraints over 65 iterations in 4220 ms. Result :sat
[2021-05-18 08:40:03] [INFO ] [Real]Absence check using 161 positive place invariants in 119 ms returned sat
[2021-05-18 08:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:04] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2021-05-18 08:40:04] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 48 ms.
[2021-05-18 08:40:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:04] [INFO ] [Nat]Absence check using 161 positive place invariants in 143 ms returned sat
[2021-05-18 08:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:05] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2021-05-18 08:40:05] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 31 ms.
[2021-05-18 08:40:09] [INFO ] Added : 320 causal constraints over 65 iterations in 3712 ms. Result :sat
[2021-05-18 08:40:09] [INFO ] [Real]Absence check using 161 positive place invariants in 110 ms returned sat
[2021-05-18 08:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:09] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2021-05-18 08:40:09] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 31 ms.
[2021-05-18 08:40:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 112 ms returned sat
[2021-05-18 08:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:10] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2021-05-18 08:40:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 49 ms.
[2021-05-18 08:40:14] [INFO ] Added : 316 causal constraints over 64 iterations in 3559 ms. Result :sat
[2021-05-18 08:40:14] [INFO ] [Real]Absence check using 161 positive place invariants in 109 ms returned sat
[2021-05-18 08:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:15] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2021-05-18 08:40:15] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:40:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 106 ms returned sat
[2021-05-18 08:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:15] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2021-05-18 08:40:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 41 ms.
[2021-05-18 08:40:18] [INFO ] Added : 319 causal constraints over 64 iterations in 2948 ms. Result :sat
[2021-05-18 08:40:19] [INFO ] [Real]Absence check using 161 positive place invariants in 115 ms returned sat
[2021-05-18 08:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:19] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2021-05-18 08:40:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:19] [INFO ] [Nat]Absence check using 161 positive place invariants in 105 ms returned sat
[2021-05-18 08:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:20] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2021-05-18 08:40:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:40:24] [INFO ] Added : 314 causal constraints over 63 iterations in 3691 ms. Result :sat
[2021-05-18 08:40:24] [INFO ] [Real]Absence check using 161 positive place invariants in 84 ms returned sat
[2021-05-18 08:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:24] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2021-05-18 08:40:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned unsat
[2021-05-18 08:40:25] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2021-05-18 08:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:25] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-18 08:40:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 103 ms returned sat
[2021-05-18 08:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:26] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2021-05-18 08:40:26] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 36 ms.
[2021-05-18 08:40:30] [INFO ] Added : 315 causal constraints over 63 iterations in 3681 ms. Result :sat
[2021-05-18 08:40:30] [INFO ] [Real]Absence check using 161 positive place invariants in 116 ms returned sat
[2021-05-18 08:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:31] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2021-05-18 08:40:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 14 ms returned unsat
[2021-05-18 08:40:31] [INFO ] [Real]Absence check using 161 positive place invariants in 111 ms returned sat
[2021-05-18 08:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:31] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2021-05-18 08:40:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 83 ms returned sat
[2021-05-18 08:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:32] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2021-05-18 08:40:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:40:35] [INFO ] Added : 317 causal constraints over 64 iterations in 3119 ms. Result :sat
[2021-05-18 08:40:35] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:36] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2021-05-18 08:40:36] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 37 ms.
[2021-05-18 08:40:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:36] [INFO ] [Nat]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-18 08:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:37] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2021-05-18 08:40:37] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2021-05-18 08:40:40] [INFO ] Added : 317 causal constraints over 65 iterations in 3584 ms. Result :sat
[2021-05-18 08:40:41] [INFO ] [Real]Absence check using 161 positive place invariants in 122 ms returned sat
[2021-05-18 08:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:41] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2021-05-18 08:40:41] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 34 ms.
[2021-05-18 08:40:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 113 ms returned sat
[2021-05-18 08:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:42] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2021-05-18 08:40:42] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2021-05-18 08:40:46] [INFO ] Added : 318 causal constraints over 64 iterations in 3858 ms. Result :sat
[2021-05-18 08:40:46] [INFO ] [Real]Absence check using 161 positive place invariants in 70 ms returned sat
[2021-05-18 08:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:47] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2021-05-18 08:40:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 83 ms returned sat
[2021-05-18 08:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:47] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2021-05-18 08:40:47] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 37 ms.
[2021-05-18 08:40:52] [INFO ] Added : 315 causal constraints over 66 iterations in 4355 ms. Result :sat
[2021-05-18 08:40:52] [INFO ] [Real]Absence check using 161 positive place invariants in 124 ms returned sat
[2021-05-18 08:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:53] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2021-05-18 08:40:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:53] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned unsat
[2021-05-18 08:40:53] [INFO ] [Real]Absence check using 161 positive place invariants in 122 ms returned sat
[2021-05-18 08:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:54] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2021-05-18 08:40:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 38 ms.
[2021-05-18 08:40:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-18 08:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:54] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2021-05-18 08:40:54] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 27 ms.
[2021-05-18 08:40:58] [INFO ] Added : 314 causal constraints over 64 iterations in 4039 ms. Result :sat
[2021-05-18 08:40:59] [INFO ] [Real]Absence check using 161 positive place invariants in 112 ms returned sat
[2021-05-18 08:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:59] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2021-05-18 08:40:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:59] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned unsat
[2021-05-18 08:40:59] [INFO ] [Real]Absence check using 161 positive place invariants in 110 ms returned sat
[2021-05-18 08:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:00] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2021-05-18 08:41:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned unsat
[2021-05-18 08:41:00] [INFO ] [Real]Absence check using 161 positive place invariants in 123 ms returned sat
[2021-05-18 08:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:01] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2021-05-18 08:41:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:01] [INFO ] [Nat]Absence check using 161 positive place invariants in 129 ms returned sat
[2021-05-18 08:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:02] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-18 08:41:02] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 36 ms.
[2021-05-18 08:41:06] [INFO ] Added : 318 causal constraints over 65 iterations in 4103 ms. Result :sat
[2021-05-18 08:41:06] [INFO ] [Real]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-18 08:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:07] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2021-05-18 08:41:07] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 32 ms.
[2021-05-18 08:41:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:08] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2021-05-18 08:41:08] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 36 ms.
[2021-05-18 08:41:11] [INFO ] Added : 316 causal constraints over 64 iterations in 3750 ms. Result :sat
[2021-05-18 08:41:12] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:12] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-18 08:41:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:41:12] [INFO ] [Nat]Absence check using 161 positive place invariants in 117 ms returned sat
[2021-05-18 08:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:41:13] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2021-05-18 08:41:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 44 ms.
[2021-05-18 08:41:17] [INFO ] Added : 316 causal constraints over 64 iterations in 3835 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-18 08:41:18] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 08:41:18] [INFO ] Flatten gal took : 245 ms
FORMULA ShieldRVt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 08:41:18] [INFO ] Applying decomposition
[2021-05-18 08:41:18] [INFO ] Flatten gal took : 74 ms
[2021-05-18 08:41:18] [INFO ] Decomposing Gal with order
[2021-05-18 08:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:41:18] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-18 08:41:18] [INFO ] Flatten gal took : 227 ms
[2021-05-18 08:41:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2021-05-18 08:41:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2021-05-18 08:41:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-040A @ 3570 seconds

FORMULA ShieldRVt-PT-040A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ ShieldRVt-PT-040A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 08:41:20 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p10)) U (((p257 <= 0)) AND (X (X (((p10 <= 0)))) OR (((p10 <= 0)) R X (((p257 <= 0)))))))",
"processed_size": 97,
"rewrites": 58
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 20
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F (((1 <= p93)))) AND (((p105 <= 0)) OR ((1 <= p163)))))",
"processed_size": 64,
"rewrites": 58
},
"result":
{
"edges": 350,
"markings": 350,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(((p6 <= 0)) OR ((1 <= p6)))",
"processed_size": 28,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((p71 <= 0))))",
"processed_size": 20,
"rewrites": 58
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (G (((1 <= p227)))) OR (F (((1 <= p227))) OR (((1 <= p227)) OR ((1 <= p232))))))",
"processed_size": 86,
"rewrites": 58
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p118 <= 0)) OR ((1 <= p217)))",
"processed_size": 33,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p132)) AND ((p315 <= 0)))))",
"processed_size": 41,
"rewrites": 58
},
"result":
{
"edges": 25,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((((1 <= p193)) AND ((p15 <= 0))) OR ((p278 <= 0)) OR ((1 <= p92)))))",
"processed_size": 77,
"rewrites": 58
},
"result":
{
"edges": 1546,
"markings": 1465,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p125 <= 0)) OR ((1 <= p266)))) AND (((p294 <= 0)) OR ((1 <= p146))))))",
"processed_size": 85,
"rewrites": 58
},
"result":
{
"edges": 446,
"markings": 335,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p319 <= 0)) OR ((1 <= p296))))",
"processed_size": 37,
"rewrites": 58
},
"result":
{
"edges": 49,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p319 <= 0)) OR ((1 <= p296))))",
"processed_size": 37,
"rewrites": 58
},
"result":
{
"edges": 49,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p180 <= 0)) OR ((1 <= p60))) U G ((((1 <= p319)) AND ((p296 <= 0)))))",
"processed_size": 74,
"rewrites": 58
},
"result":
{
"edges": 18,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30184,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** U (* AND (X(X(*)) OR (* R X(*))))) : F(G((F(**) AND *))) : F((X(F(**)) AND **)) : (X(G(*)) AND (G((* AND (F(*) OR G(*)))) OR (** OR **))) : F(*) : (G(**) OR (** U G(**))) : F((X(G(**)) OR (F(**) OR (** OR **)))) : F(G(*)) : G(F(*))"
},
"net":
{
"arcs": 1364,
"conflict_clusters": 83,
"places": 323,
"places_significant": 162,
"singleton_clusters": 0,
"transitions": 322
},
"result":
{
"preliminary_value": "yes no no no yes no yes no no ",
"value": "yes no no no yes no yes no no "
},
"task":
{
"type": "compound"
}
}
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: 645/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 323
lola: finding significant places
lola: 323 places, 322 transitions, 162 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: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p315 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: (((1 <= p10)) U (NOT(((1 <= 0) U ((1 <= p257)))) AND (NOT(X (X (((1 <= p10))))) OR NOT((((1 <= p10)) U X (((1 <= p257)))))))) : X (X (NOT(G (X (F (X ((NOT(F ((((p125 <= 0)) OR ((1 <= p266))))) OR (((1 <= p294)) AND ((p146 <= 0))))))))))) : F ((F (X (((1 <= p93)))) AND (((p105 <= 0)) OR ((1 <= p163))))) : (G (NOT(X (((1 <= p71))))) AND ((NOT(F ((G (((1 <= p71))) U ((1 <= p71))))) OR ((p6 <= 0))) OR ((1 <= p6)))) : NOT(G ((((p118 <= 0)) OR ((1 <= p217))))) : (G ((((p319 <= 0)) OR ((1 <= p296)))) OR ((((p180 <= 0)) OR ((1 <= p60))) U G ((((1 <= p319)) AND ((p296 <= 0)))))) : F ((((X (G (((1 <= p227)))) OR F (((1 <= p227)))) OR ((1 <= p227))) OR ((1 <= p232)))) : NOT(G (F ((((p132 <= 0)) OR ((1 <= p315)))))) : G (X (X (X (X (F (NOT(G (((((p193 <= 0)) OR ((1 <= p15))) AND ((1 <= p278)) AND ((p92 <= 0)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:332
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p10)) U (((p257 <= 0)) AND (X (X (((p10 <= 0)))) OR (((p10 <= 0)) R X (((p257 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p10)) U (((p257 <= 0)) AND (X (X (((p10 <= 0)))) OR (((p10 <= 0)) R X (((p257 <= 0)))))))
lola: processed formula length: 97
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 20 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: 3 markings, 2 edges
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p93)))) AND (((p105 <= 0)) OR ((1 <= p163)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p93)))) AND (((p105 <= 0)) OR ((1 <= p163)))))
lola: processed formula length: 64
lola: 58 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 350 markings, 350 edges
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p71 <= 0)))) AND (G ((((p71 <= 0)) AND (F (((p71 <= 0))) OR G (((p71 <= 0)))))) OR (((p6 <= 0)) OR ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p6 <= 0)) OR ((1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((p6 <= 0)) OR ((1 <= p6)))
lola: processed formula length: 28
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p71 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p71 <= 0))))
lola: processed formula length: 20
lola: 58 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: 254 markings, 254 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p227)))) OR (F (((1 <= p227))) OR (((1 <= p227)) OR ((1 <= p232))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p227)))) OR (F (((1 <= p227))) OR (((1 <= p227)) OR ((1 <= p232))))))
lola: processed formula length: 86
lola: 58 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p118)) AND ((p217 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p118 <= 0)) OR ((1 <= p217)))
lola: processed formula length: 33
lola: 60 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 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p132)) AND ((p315 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p132)) AND ((p315 <= 0)))))
lola: processed formula length: 41
lola: 58 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: 24 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p193)) AND ((p15 <= 0))) OR ((p278 <= 0)) OR ((1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p193)) AND ((p15 <= 0))) OR ((p278 <= 0)) OR ((1 <= p92)))))
lola: processed formula length: 77
lola: 58 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: 1465 markings, 1546 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p125 <= 0)) OR ((1 <= p266)))) AND (((p294 <= 0)) OR ((1 <= p146))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p125 <= 0)) OR ((1 <= p266)))) AND (((p294 <= 0)) OR ((1 <= p146))))))
lola: processed formula length: 85
lola: 58 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: 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: add low 90
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: 335 markings, 446 edges
lola: ========================================
lola: subprocess 8 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p319 <= 0)) OR ((1 <= p296)))) OR ((((p180 <= 0)) OR ((1 <= p60))) U G ((((1 <= p319)) AND ((p296 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p319 <= 0)) OR ((1 <= p296))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p319 <= 0)) OR ((1 <= p296))))
lola: processed formula length: 37
lola: 58 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: 47 markings, 49 edges
lola: ========================================
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: ========================================
lola: ...considering subproblem: (G ((((p319 <= 0)) OR ((1 <= p296)))) OR ((((p180 <= 0)) OR ((1 <= p60))) U G ((((1 <= p319)) AND ((p296 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((((p319 <= 0)) OR ((1 <= p296))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p319 <= 0)) OR ((1 <= p296))))
lola: processed formula length: 37
lola: 58 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: 47 markings, 49 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((p180 <= 0)) OR ((1 <= p60))) U G ((((1 <= p319)) AND ((p296 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p180 <= 0)) OR ((1 <= p60))) U G ((((1 <= p319)) AND ((p296 <= 0)))))
lola: processed formula length: 74
lola: 58 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: 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: 17 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no yes no no
lola:
preliminary result: yes no no no yes no yes no no
lola: memory consumption: 30184 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="ShieldRVt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ShieldRVt-PT-040A, 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 r246-smll-162106594400153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040A.tgz
mv ShieldRVt-PT-040A 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 ;