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-162106594400162.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-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 19:16 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 136K 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-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1621330117190

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 09:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 09:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:28:40] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2021-05-18 09:28:40] [INFO ] Transformed 403 places.
[2021-05-18 09:28:40] [INFO ] Transformed 403 transitions.
[2021-05-18 09:28:40] [INFO ] Found NUPN structural information;
[2021-05-18 09:28:40] [INFO ] Parsed PT model containing 403 places and 403 transitions in 281 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1017 ms. (steps per millisecond=98 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 402 rows 403 cols
[2021-05-18 09:28:41] [INFO ] Computed 201 place invariants in 16 ms
[2021-05-18 09:28:42] [INFO ] [Real]Absence check using 201 positive place invariants in 203 ms returned sat
[2021-05-18 09:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:28:42] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2021-05-18 09:28:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 78 ms.
[2021-05-18 09:28:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:28:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 225 ms returned sat
[2021-05-18 09:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:28:44] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2021-05-18 09:28:44] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 37 ms.
[2021-05-18 09:28:48] [INFO ] Added : 395 causal constraints over 80 iterations in 3986 ms. Result :sat
[2021-05-18 09:28:48] [INFO ] [Real]Absence check using 201 positive place invariants in 99 ms returned sat
[2021-05-18 09:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:28:49] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2021-05-18 09:28:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 43 ms.
[2021-05-18 09:28:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:28:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 103 ms returned sat
[2021-05-18 09:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:28:49] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-18 09:28:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2021-05-18 09:28:54] [INFO ] Added : 399 causal constraints over 81 iterations in 4084 ms. Result :sat
[2021-05-18 09:28:54] [INFO ] [Real]Absence check using 201 positive place invariants in 108 ms returned sat
[2021-05-18 09:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:28:54] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2021-05-18 09:28:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 36 ms.
[2021-05-18 09:28:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:28:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 107 ms returned sat
[2021-05-18 09:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:28:55] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2021-05-18 09:28:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 41 ms.
[2021-05-18 09:28:59] [INFO ] Added : 395 causal constraints over 80 iterations in 3822 ms. Result :sat
[2021-05-18 09:28:59] [INFO ] [Real]Absence check using 201 positive place invariants in 111 ms returned sat
[2021-05-18 09:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:00] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2021-05-18 09:29:00] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2021-05-18 09:29:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:01] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2021-05-18 09:29:01] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2021-05-18 09:29:04] [INFO ] Added : 395 causal constraints over 80 iterations in 3573 ms. Result :sat
[2021-05-18 09:29:04] [INFO ] [Real]Absence check using 201 positive place invariants in 104 ms returned sat
[2021-05-18 09:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:05] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2021-05-18 09:29:05] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 102 ms returned sat
[2021-05-18 09:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:06] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2021-05-18 09:29:06] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 43 ms.
[2021-05-18 09:29:10] [INFO ] Added : 396 causal constraints over 80 iterations in 4248 ms. Result :sat
[2021-05-18 09:29:10] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:11] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2021-05-18 09:29:11] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 99 ms returned sat
[2021-05-18 09:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:12] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2021-05-18 09:29:12] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 69 ms.
[2021-05-18 09:29:15] [INFO ] Added : 397 causal constraints over 80 iterations in 3670 ms. Result :sat
[2021-05-18 09:29:16] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:16] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2021-05-18 09:29:16] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 114 ms returned sat
[2021-05-18 09:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:17] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2021-05-18 09:29:17] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:21] [INFO ] Added : 394 causal constraints over 79 iterations in 3645 ms. Result :sat
[2021-05-18 09:29:21] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:21] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2021-05-18 09:29:21] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 116 ms returned sat
[2021-05-18 09:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:22] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2021-05-18 09:29:22] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:26] [INFO ] Added : 396 causal constraints over 80 iterations in 3740 ms. Result :sat
[2021-05-18 09:29:26] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:27] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2021-05-18 09:29:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:27] [INFO ] [Nat]Absence check using 201 positive place invariants in 95 ms returned sat
[2021-05-18 09:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:28] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2021-05-18 09:29:28] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:31] [INFO ] Added : 394 causal constraints over 79 iterations in 3626 ms. Result :sat
[2021-05-18 09:29:31] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:32] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2021-05-18 09:29:32] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 103 ms returned sat
[2021-05-18 09:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:33] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2021-05-18 09:29:33] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:36] [INFO ] Added : 399 causal constraints over 80 iterations in 3615 ms. Result :sat
[2021-05-18 09:29:37] [INFO ] [Real]Absence check using 201 positive place invariants in 109 ms returned sat
[2021-05-18 09:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:37] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2021-05-18 09:29:37] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 113 ms returned sat
[2021-05-18 09:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:38] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2021-05-18 09:29:38] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:42] [INFO ] Added : 396 causal constraints over 80 iterations in 4061 ms. Result :sat
[2021-05-18 09:29:42] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:43] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-18 09:29:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 99 ms returned sat
[2021-05-18 09:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:44] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2021-05-18 09:29:44] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 30 ms.
[2021-05-18 09:29:47] [INFO ] Added : 399 causal constraints over 81 iterations in 3795 ms. Result :sat
[2021-05-18 09:29:48] [INFO ] [Real]Absence check using 201 positive place invariants in 96 ms returned sat
[2021-05-18 09:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:48] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2021-05-18 09:29:48] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 104 ms returned sat
[2021-05-18 09:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:49] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-18 09:29:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 30 ms.
[2021-05-18 09:29:53] [INFO ] Added : 400 causal constraints over 81 iterations in 3765 ms. Result :sat
[2021-05-18 09:29:53] [INFO ] [Real]Absence check using 201 positive place invariants in 100 ms returned sat
[2021-05-18 09:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:53] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-18 09:29:53] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 126 ms returned sat
[2021-05-18 09:29:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:54] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2021-05-18 09:29:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:29:58] [INFO ] Added : 396 causal constraints over 80 iterations in 3628 ms. Result :sat
[2021-05-18 09:29:58] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:59] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2021-05-18 09:29:59] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:29:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:29:59] [INFO ] [Nat]Absence check using 201 positive place invariants in 99 ms returned sat
[2021-05-18 09:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:29:59] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2021-05-18 09:30:00] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:30:03] [INFO ] Added : 398 causal constraints over 80 iterations in 3464 ms. Result :sat
[2021-05-18 09:30:03] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:04] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2021-05-18 09:30:04] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 31 ms.
[2021-05-18 09:30:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 97 ms returned sat
[2021-05-18 09:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:05] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2021-05-18 09:30:05] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:30:08] [INFO ] Added : 394 causal constraints over 80 iterations in 3619 ms. Result :sat
[2021-05-18 09:30:08] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:09] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2021-05-18 09:30:09] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2021-05-18 09:30:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:09] [INFO ] [Nat]Absence check using 201 positive place invariants in 94 ms returned sat
[2021-05-18 09:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:10] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2021-05-18 09:30:10] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:14] [INFO ] Added : 396 causal constraints over 80 iterations in 3896 ms. Result :sat
[2021-05-18 09:30:14] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:14] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2021-05-18 09:30:14] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 103 ms returned sat
[2021-05-18 09:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:15] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-18 09:30:15] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 30 ms.
[2021-05-18 09:30:19] [INFO ] Added : 400 causal constraints over 81 iterations in 3788 ms. Result :sat
[2021-05-18 09:30:19] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:20] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2021-05-18 09:30:20] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:30:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:21] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2021-05-18 09:30:21] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:25] [INFO ] Added : 396 causal constraints over 80 iterations in 3997 ms. Result :sat
[2021-05-18 09:30:25] [INFO ] [Real]Absence check using 201 positive place invariants in 102 ms returned sat
[2021-05-18 09:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:25] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2021-05-18 09:30:25] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 104 ms returned sat
[2021-05-18 09:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:26] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2021-05-18 09:30:26] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2021-05-18 09:30:30] [INFO ] Added : 395 causal constraints over 80 iterations in 4001 ms. Result :sat
[2021-05-18 09:30:30] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:31] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2021-05-18 09:30:31] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 47 ms.
[2021-05-18 09:30:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 100 ms returned sat
[2021-05-18 09:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:32] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2021-05-18 09:30:32] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2021-05-18 09:30:36] [INFO ] Added : 394 causal constraints over 80 iterations in 4115 ms. Result :sat
[2021-05-18 09:30:36] [INFO ] [Real]Absence check using 201 positive place invariants in 100 ms returned sat
[2021-05-18 09:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:37] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-18 09:30:37] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:30:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 104 ms returned sat
[2021-05-18 09:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:37] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2021-05-18 09:30:38] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 40 ms.
[2021-05-18 09:30:41] [INFO ] Added : 398 causal constraints over 81 iterations in 3545 ms. Result :sat
[2021-05-18 09:30:41] [INFO ] [Real]Absence check using 201 positive place invariants in 97 ms returned sat
[2021-05-18 09:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:42] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-18 09:30:42] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2021-05-18 09:30:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 99 ms returned sat
[2021-05-18 09:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:43] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2021-05-18 09:30:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2021-05-18 09:30:46] [INFO ] Added : 399 causal constraints over 81 iterations in 3505 ms. Result :sat
[2021-05-18 09:30:46] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:47] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2021-05-18 09:30:47] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2021-05-18 09:30:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 103 ms returned sat
[2021-05-18 09:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:48] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2021-05-18 09:30:48] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:51] [INFO ] Added : 399 causal constraints over 80 iterations in 3709 ms. Result :sat
[2021-05-18 09:30:52] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:52] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2021-05-18 09:30:52] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:52] [INFO ] [Nat]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:53] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2021-05-18 09:30:53] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2021-05-18 09:30:57] [INFO ] Added : 399 causal constraints over 81 iterations in 3949 ms. Result :sat
[2021-05-18 09:30:57] [INFO ] [Real]Absence check using 201 positive place invariants in 104 ms returned sat
[2021-05-18 09:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:58] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2021-05-18 09:30:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:30:58] [INFO ] [Nat]Absence check using 201 positive place invariants in 105 ms returned sat
[2021-05-18 09:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:30:58] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2021-05-18 09:30:59] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2021-05-18 09:31:02] [INFO ] Added : 398 causal constraints over 81 iterations in 3995 ms. Result :sat
[2021-05-18 09:31:03] [INFO ] [Real]Absence check using 201 positive place invariants in 97 ms returned sat
[2021-05-18 09:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:31:03] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-18 09:31:03] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2021-05-18 09:31:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:31:03] [INFO ] [Nat]Absence check using 201 positive place invariants in 96 ms returned sat
[2021-05-18 09:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:31:04] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2021-05-18 09:31:04] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2021-05-18 09:31:08] [INFO ] Added : 396 causal constraints over 80 iterations in 4094 ms. Result :sat
[2021-05-18 09:31:09] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-18 09:31:09] [INFO ] Flatten gal took : 195 ms
FORMULA ShieldRVt-PT-050A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 09:31:09] [INFO ] Applying decomposition
[2021-05-18 09:31:09] [INFO ] Flatten gal took : 53 ms
[2021-05-18 09:31:09] [INFO ] Decomposing Gal with order
[2021-05-18 09:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:31:09] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-18 09:31:09] [INFO ] Flatten gal took : 188 ms
[2021-05-18 09:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 31 ms.
[2021-05-18 09:31:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 26 ms.
[2021-05-18 09:31:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-050A @ 3570 seconds

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

FORMULA ShieldRVt-PT-050A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2954
rslt: Output for LTLFireability @ ShieldRVt-PT-050A

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 09:31:11 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((G (((p355 <= 0))) OR (G (((p7 <= 0))) OR F (((p134 <= 0) OR (p137 <= 0)))))))",
"processed_size": 85,
"rewrites": 38
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 341
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "G (F (((1 <= p165))))",
"processed_size": 21,
"rewrites": 38
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 379
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p91)) U ((1 <= p379) AND (1 <= p388) AND (1 <= p394))) AND (X ((((1 <= p379) AND (1 <= p388) AND (1 <= p394)) OR ((1 <= p379) AND (1 <= p388) AND (1 <= p394)))) OR G (((1 <= p91))))))",
"processed_size": 196,
"rewrites": 38
},
"result":
{
"edges": 314,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 427
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 427
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p248) AND (1 <= p250) AND (1 <= p255))) AND (((p133 <= 0)) OR ((1 <= p248) AND (1 <= p250) AND (1 <= p255))))))",
"processed_size": 128,
"rewrites": 38
},
"result":
{
"edges": 13,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"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": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 488
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p51) AND (1 <= p60) AND (1 <= p66))))",
"processed_size": 50,
"rewrites": 38
},
"result":
{
"edges": 336,
"markings": 336,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 569
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (G (((1 <= p197)))) AND ((1 <= p277))))",
"processed_size": 45,
"rewrites": 38
},
"result":
{
"edges": 314,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"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": 683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((1 <= p159)) U (F (((1 <= p171))) OR ((1 <= p159)))))",
"processed_size": 58,
"rewrites": 38
},
"result":
{
"edges": 340,
"markings": 340,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 854
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": "X ((G (((1 <= p203))) AND ((p28 <= 0) OR (p29 <= 0) OR (p32 <= 0))))",
"processed_size": 70,
"rewrites": 38
},
"result":
{
"edges": 315,
"markings": 315,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 1632
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((p263 <= 0))",
"processed_size": 13,
"rewrites": 40
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3264
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (((((1 <= p267)) U (G (((p24 <= 0) OR (p26 <= 0) OR (p31 <= 0))) AND ((p267 <= 0)))) OR ((1 <= p332) AND (1 <= p333) AND (1 <= p336))))",
"processed_size": 139,
"rewrites": 38
},
"result":
{
"edges": 29405,
"markings": 25916,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3436,
"runtime": 616.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((G(*) OR (G(*) OR F(*))))) : F(G(((X(*) R *) OR F(**)))) : (G(F(**)) AND X(**)) : X(((** U **) AND (X(**) OR G(**)))) : (F(G((F(**) AND (** OR **)))) AND X(X((F(**) AND **)))) : F(((** U (G(*) AND **)) OR **)) : X(F(**)) : X((F(G(**)) AND **)) : X((** U (F(**) OR **))) : F(**) : X((G(**) AND **)) : X(F((G(*) OR F(G(*)))))"
},
"net":
{
"arcs": 1704,
"conflict_clusters": 103,
"places": 403,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 402
},
"result":
{
"preliminary_value": "yes unknown no no no no no no no no no unknown ",
"value": "yes unknown no no no no no no no no no unknown "
},
"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: 805/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 403
lola: finding significant places
lola: 403 places, 402 transitions, 202 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p355 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p394 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p332 <= 1)
lola: LP says that atomic proposition is always true: (p333 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p402 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: NOT(X (X (((F ((((1 <= p134) AND (1 <= p137)) U ((1 <= p355)))) AND F (((1 <= p7)))) AND G (((1 <= p134) AND (1 <= p137))))))) : F (G ((NOT((X (((1 <= p119))) U ((1 <= p180) AND (1 <= p181) AND (1 <= p184)))) OR F ((((1 <= p216) AND (1 <= p218) AND (1 <= p223)) OR ((1 <= p119))))))) : (G (F (((1 <= p165)))) AND X (((1 <= p165)))) : (X ((((1 <= p91)) U ((1 <= p379) AND (1 <= p388) AND (1 <= p394)))) AND X ((X ((((1 <= p379) AND (1 <= p388) AND (1 <= p394)) OR ((1 <= p379) AND (1 <= p388) AND (1 <= p394)))) OR G (((1 <= p91)))))) : (F (G ((((p133 <= 0)) U ((1 <= p248) AND (1 <= p250) AND (1 <= p255))))) AND X (X ((F (((p225 <= 0))) AND ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0)))))) : F (((((1 <= p267)) U (G (NOT(F ((((1 <= p351)) U ((1 <= p24) AND (1 <= p26) AND (1 <= p31)))))) AND ((p267 <= 0)))) OR ((1 <= p332) AND (1 <= p333) AND (1 <= p336)))) : X (F ((X ((((1 <= p35)) U ((1 <= p305)))) U F ((((p301 <= 0)) U ((1 <= p51) AND (1 <= p60) AND (1 <= p66))))))) : X ((F (G (((1 <= p197)))) AND ((1 <= p277)))) : X ((((1 <= p159)) U (F (((1 <= p171))) OR ((1 <= p159))))) : (X (X ((((NOT(F (((1 <= p24) AND (1 <= p26) AND (1 <= p31)))) OR ((p24 <= 0))) OR ((p26 <= 0))) OR ((p31 <= 0))))) U F (((1 <= p263)))) : X ((G (((1 <= p203))) AND ((p28 <= 0) OR (p29 <= 0) OR (p32 <= 0)))) : F (X ((G (NOT(F (((1 <= p387) AND (1 <= p396) AND (1 <= p402))))) OR F (NOT(F (((1 <= p107) AND ((p387 <= 0) OR (p396 <= 0) OR (p402 <= 0)) AND (1 <= p116) AND (1 <= p122))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((p355 <= 0))) OR (G (((p7 <= 0))) OR F (((p134 <= 0) OR (p137 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((p355 <= 0))) OR (G (((p7 <= 0))) OR F (((p134 <= 0) OR (p137 <= 0)))))))
lola: processed formula length: 85
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: ========================================
lola: subprocess 1 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (((p119 <= 0))) R ((p180 <= 0) OR (p181 <= 0) OR (p184 <= 0))) OR F ((((1 <= p216) AND (1 <= p218) AND (1 <= p223)) OR ((1 <= p119)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (((p119 <= 0))) R ((p180 <= 0) OR (p181 <= 0) OR (p184 <= 0))) OR F ((((1 <= p216) AND (1 <= p218) AND (1 <= p223)) OR ((1 <= p119)))))))
lola: processed formula length: 150
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1201504 markings, 1312964 edges, 240301 markings/sec, 0 secs
lola: 2385157 markings, 2603528 edges, 236731 markings/sec, 5 secs
lola: 3560516 markings, 3888010 edges, 235072 markings/sec, 10 secs
lola: 4722051 markings, 5154459 edges, 232307 markings/sec, 15 secs
lola: 5878130 markings, 6416204 edges, 231216 markings/sec, 20 secs
lola: 7026570 markings, 7670088 edges, 229688 markings/sec, 25 secs
lola: 8159079 markings, 8904886 edges, 226502 markings/sec, 30 secs
lola: 9296016 markings, 10147474 edges, 227387 markings/sec, 35 secs
lola: 10434337 markings, 11391573 edges, 227664 markings/sec, 40 secs
lola: 11564652 markings, 12625048 edges, 226063 markings/sec, 45 secs
lola: 12706294 markings, 13871697 edges, 228328 markings/sec, 50 secs
lola: 13834500 markings, 15101809 edges, 225641 markings/sec, 55 secs
lola: 14942008 markings, 16309350 edges, 221502 markings/sec, 60 secs
lola: 16045850 markings, 17515400 edges, 220768 markings/sec, 65 secs
lola: 17151553 markings, 18721426 edges, 221141 markings/sec, 70 secs
lola: 18287372 markings, 19962794 edges, 227164 markings/sec, 75 secs
lola: 19394629 markings, 21170058 edges, 221451 markings/sec, 80 secs
lola: 20003549 markings, 21834226 edges, 121784 markings/sec, 85 secs
lola: 20478267 markings, 22355033 edges, 94944 markings/sec, 90 secs
lola: 20836211 markings, 22745919 edges, 71589 markings/sec, 95 secs
lola: 21326323 markings, 23279567 edges, 98022 markings/sec, 100 secs
lola: 22008363 markings, 24023111 edges, 136408 markings/sec, 105 secs
lola: 22645013 markings, 24716990 edges, 127330 markings/sec, 110 secs
lola: 23035478 markings, 25143722 edges, 78093 markings/sec, 115 secs
lola: 23429474 markings, 25575265 edges, 78799 markings/sec, 120 secs
lola: 24203391 markings, 26419082 edges, 154783 markings/sec, 125 secs
lola: 24552961 markings, 26800224 edges, 69914 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p165)))) AND X (((1 <= p165))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p165))))
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 <= p165))))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p91)) U ((1 <= p379) AND (1 <= p388) AND (1 <= p394))) AND (X ((((1 <= p379) AND (1 <= p388) AND (1 <= p394)) OR ((1 <= p379) AND (1 <= p388) AND (1 <= p394)))) OR G (((1 <= p91))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p91)) U ((1 <= p379) AND (1 <= p388) AND (1 <= p394))) AND (X ((((1 <= p379) AND (1 <= p388) AND (1 <= p394)) OR ((1 <= p379) AND (1 <= p388) AND (1 <= p394)))) OR G (((1 <= p91))))))
lola: processed formula length: 196
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: subprocess 4 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p248) AND (1 <= p250) AND (1 <= p255))) AND (((p133 <= 0)) OR ((1 <= p248) AND (1 <= p250) AND (1 <= p255)))))) AND X (X ((F (((p225 <= 0))) AND ((p36 <= 0) OR (p37 <= 0) OR (p40 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p248) AND (1 <= p250) AND (1 <= p255))) AND (((p133 <= 0)) OR ((1 <= p248) AND (1 <= p250) AND (1 <= p255))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p248) AND (1 <= p250) AND (1 <= p255))) AND (((p133 <= 0)) OR ((1 <= p248) AND (1 <= p250) AND (1 <= p255))))))
lola: processed formula length: 128
lola: 38 rewrites
lola: closed formula file LTLFireability.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: 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: 12 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p51) AND (1 <= p60) AND (1 <= p66))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p51) AND (1 <= p60) AND (1 <= p66))))
lola: processed formula length: 50
lola: 38 rewrites
lola: closed formula file LTLFireability.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: 336 markings, 336 edges
lola: ========================================
lola: subprocess 6 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p197)))) AND ((1 <= p277))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p197)))) AND ((1 <= p277))))
lola: processed formula length: 45
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: subprocess 7 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p159)) U (F (((1 <= p171))) OR ((1 <= p159)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p159)) U (F (((1 <= p171))) OR ((1 <= p159)))))
lola: processed formula length: 58
lola: 38 rewrites
lola: closed formula file LTLFireability.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: 340 markings, 340 edges
lola: ========================================
lola: subprocess 8 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p203))) AND ((p28 <= 0) OR (p29 <= 0) OR (p32 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p203))) AND ((p28 <= 0) OR (p29 <= 0) OR (p32 <= 0))))
lola: processed formula length: 70
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 315 markings, 315 edges
lola: ========================================
lola: subprocess 9 will run for 1138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p387 <= 0) OR (p396 <= 0) OR (p402 <= 0))) OR F (G (((p107 <= 0) OR ((1 <= p387) AND (1 <= p396) AND (1 <= p402)) OR (p116 <= 0) OR (p122 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p387 <= 0) OR (p396 <= 0) OR (p402 <= 0))) OR F (G (((p107 <= 0) OR ((1 <= p387) AND (1 <= p396) AND (1 <= p402)) OR (p116 <= 0) OR (p122 <= 0)))))))
lola: processed formula length: 166
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1110139 markings, 1220345 edges, 222028 markings/sec, 0 secs
lola: 2294443 markings, 2522238 edges, 236861 markings/sec, 5 secs
lola: 3479351 markings, 3824798 edges, 236982 markings/sec, 10 secs
lola: 4617614 markings, 5076079 edges, 227653 markings/sec, 15 secs
lola: 5749929 markings, 6320824 edges, 226463 markings/sec, 20 secs
lola: 6892174 markings, 7576482 edges, 228449 markings/sec, 25 secs
lola: 8039881 markings, 8838145 edges, 229541 markings/sec, 30 secs
lola: 9171497 markings, 10082120 edges, 226323 markings/sec, 35 secs
lola: 10303635 markings, 11326669 edges, 226428 markings/sec, 40 secs
lola: 11433275 markings, 12568473 edges, 225928 markings/sec, 45 secs
lola: 12563558 markings, 13810980 edges, 226057 markings/sec, 50 secs
lola: 13680819 markings, 15039178 edges, 223452 markings/sec, 55 secs
lola: 14795803 markings, 16264868 edges, 222997 markings/sec, 60 secs
lola: 15900753 markings, 17479530 edges, 220990 markings/sec, 65 secs
lola: 17031668 markings, 18722736 edges, 226183 markings/sec, 70 secs
lola: 18151508 markings, 19953762 edges, 223968 markings/sec, 75 secs
lola: 19270490 markings, 21183849 edges, 223796 markings/sec, 80 secs
lola: 20134250 markings, 22133525 edges, 172752 markings/sec, 85 secs
lola: 20657100 markings, 22708375 edges, 104570 markings/sec, 90 secs
lola: 21121474 markings, 23218626 edges, 92875 markings/sec, 95 secs
lola: 21778201 markings, 23940643 edges, 131345 markings/sec, 100 secs
lola: 22048390 markings, 24237573 edges, 54038 markings/sec, 105 secs
lola: 22454904 markings, 24684448 edges, 81303 markings/sec, 110 secs
lola: 22967612 markings, 25248060 edges, 102542 markings/sec, 115 secs
lola: 23235506 markings, 25542559 edges, 53579 markings/sec, 120 secs
lola: 23606441 markings, 25950324 edges, 74187 markings/sec, 125 secs
lola: 24065652 markings, 26455129 edges, 91842 markings/sec, 130 secs
lola: 24310611 markings, 26724408 edges, 48992 markings/sec, 135 secs
lola: 24321378 markings, 26736245 edges, 2153 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p263)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p263 <= 0))
lola: processed formula length: 13
lola: 40 rewrites
lola: closed formula file LTLFireability.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 3264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p267)) U (G (((p24 <= 0) OR (p26 <= 0) OR (p31 <= 0))) AND ((p267 <= 0)))) OR ((1 <= p332) AND (1 <= p333) AND (1 <= p336))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p267)) U (G (((p24 <= 0) OR (p26 <= 0) OR (p31 <= 0))) AND ((p267 <= 0)))) OR ((1 <= p332) AND (1 <= p333) AND (1 <= p336))))
lola: processed formula length: 139
lola: 38 rewrites
lola: closed formula file LTLFireability.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: 25916 markings, 29405 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((X (((p119 <= 0))) R ((p180 <= 0) OR (p181 <= 0) OR (p184 <= 0))) OR F ((((1 <= p216) AND (1 <= p218) AND (1 <= p223)) OR ((1 <= p119)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (((p119 <= 0))) R ((p180 <= 0) OR (p181 <= 0) OR (p184 <= 0))) OR F ((((1 <= p216) AND (1 <= p218) AND (1 <= p223)) OR ((1 <= p119)))))))
lola: processed formula length: 150
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1033296 markings, 1129564 edges, 206659 markings/sec, 0 secs
lola: 2128702 markings, 2323911 edges, 219081 markings/sec, 5 secs
lola: 3245259 markings, 3544276 edges, 223311 markings/sec, 10 secs
lola: 4334039 markings, 4731397 edges, 217756 markings/sec, 15 secs
lola: 5447903 markings, 5945870 edges, 222773 markings/sec, 20 secs
lola: 6544158 markings, 7144102 edges, 219251 markings/sec, 25 secs
lola: 7621753 markings, 8319030 edges, 215519 markings/sec, 30 secs
lola: 8702284 markings, 9497995 edges, 216106 markings/sec, 35 secs
lola: 9808582 markings, 10706341 edges, 221260 markings/sec, 40 secs
lola: 10903787 markings, 11903424 edges, 219041 markings/sec, 45 secs
lola: 12009877 markings, 13112379 edges, 221218 markings/sec, 50 secs
lola: 13115513 markings, 14317880 edges, 221127 markings/sec, 55 secs
lola: 14198526 markings, 15498715 edges, 216603 markings/sec, 60 secs
lola: 15279455 markings, 16677275 edges, 216186 markings/sec, 65 secs
lola: 16347820 markings, 17845099 edges, 213673 markings/sec, 70 secs
lola: 17429023 markings, 19026147 edges, 216241 markings/sec, 75 secs
lola: 18528317 markings, 20225502 edges, 219859 markings/sec, 80 secs
lola: 19604747 markings, 21399253 edges, 215286 markings/sec, 85 secs
lola: 20315994 markings, 22177300 edges, 142249 markings/sec, 90 secs
lola: 20483501 markings, 22360241 edges, 33501 markings/sec, 95 secs
lola: 21090959 markings, 23022958 edges, 121492 markings/sec, 100 secs
lola: 21481118 markings, 23447965 edges, 78032 markings/sec, 105 secs
lola: 21971288 markings, 23982412 edges, 98034 markings/sec, 110 secs
lola: 22471420 markings, 24527716 edges, 100026 markings/sec, 115 secs
lola: 22889030 markings, 24983047 edges, 83522 markings/sec, 120 secs
lola: 23286351 markings, 25419214 edges, 79464 markings/sec, 125 secs
lola: 23662433 markings, 25829261 edges, 75216 markings/sec, 130 secs
lola: 24079076 markings, 26283539 edges, 83329 markings/sec, 135 secs
lola: 24418196 markings, 26653288 edges, 67824 markings/sec, 140 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p387 <= 0) OR (p396 <= 0) OR (p402 <= 0))) OR F (G (((p107 <= 0) OR ((1 <= p387) AND (1 <= p396) AND (1 <= p402)) OR (p116 <= 0) OR (p122 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p387 <= 0) OR (p396 <= 0) OR (p402 <= 0))) OR F (G (((p107 <= 0) OR ((1 <= p387) AND (1 <= p396) AND (1 <= p402)) OR (p116 <= 0) OR (p122 <= 0)))))))
lola: processed formula length: 166
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1028417 markings, 1130506 edges, 205683 markings/sec, 0 secs
lola: 2189636 markings, 2407024 edges, 232244 markings/sec, 5 secs
lola: 3348350 markings, 3680789 edges, 231743 markings/sec, 10 secs
lola: 4488860 markings, 4934542 edges, 228102 markings/sec, 15 secs
lola: 5629524 markings, 6188460 edges, 228133 markings/sec, 20 secs
lola: 6750331 markings, 7420554 edges, 224161 markings/sec, 25 secs
lola: 7876761 markings, 8658832 edges, 225286 markings/sec, 30 secs
lola: 9015536 markings, 9910676 edges, 227755 markings/sec, 35 secs
lola: 10150265 markings, 11158071 edges, 226946 markings/sec, 40 secs
lola: 11286299 markings, 12406905 edges, 227207 markings/sec, 45 secs
lola: 12415162 markings, 13647850 edges, 225773 markings/sec, 50 secs
lola: 13529005 markings, 14872292 edges, 222769 markings/sec, 55 secs
lola: 14631855 markings, 16084643 edges, 220570 markings/sec, 60 secs
lola: 15711777 markings, 17271792 edges, 215984 markings/sec, 65 secs
lola: 16838327 markings, 18510197 edges, 225310 markings/sec, 70 secs
lola: 17952819 markings, 19735345 edges, 222898 markings/sec, 75 secs
lola: 19084552 markings, 20979451 edges, 226347 markings/sec, 80 secs
lola: 20003353 markings, 21989782 edges, 183760 markings/sec, 85 secs
lola: 20318047 markings, 22335776 edges, 62939 markings/sec, 90 secs
lola: 20834264 markings, 22903502 edges, 103243 markings/sec, 95 secs
lola: 21233519 markings, 23341790 edges, 79851 markings/sec, 100 secs
lola: 21571648 markings, 23713493 edges, 67626 markings/sec, 105 secs
lola: 22046534 markings, 24235528 edges, 94977 markings/sec, 110 secs
lola: 22496409 markings, 24730071 edges, 89975 markings/sec, 115 secs
lola: 23090657 markings, 25383328 edges, 118850 markings/sec, 120 secs
lola: 23587830 markings, 25929865 edges, 99435 markings/sec, 125 secs
lola: 23953168 markings, 26331473 edges, 73068 markings/sec, 130 secs
lola: 24267130 markings, 26676606 edges, 62792 markings/sec, 135 secs
lola: 24289236 markings, 26700915 edges, 4421 markings/sec, 140 secs
lola: 24291316 markings, 26703200 edges, 416 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes unknown no no no no no no no no no unknown
lola:
preliminary result: yes unknown no no no no no no no no no unknown
lola: memory consumption: 3436 KB
lola: time consumption: 616 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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-050A"
export BK_EXAMINATION="LTLFireability"
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-050A, examination is LTLFireability"
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-162106594400162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050A.tgz
mv ShieldRVt-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;