Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432900346.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is RefineWMG-PT-100100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 218K May 5 16:51 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 RefineWMG-PT-100100-00
FORMULA_NAME RefineWMG-PT-100100-01
FORMULA_NAME RefineWMG-PT-100100-02
FORMULA_NAME RefineWMG-PT-100100-03
FORMULA_NAME RefineWMG-PT-100100-04
FORMULA_NAME RefineWMG-PT-100100-05
FORMULA_NAME RefineWMG-PT-100100-06
FORMULA_NAME RefineWMG-PT-100100-07
FORMULA_NAME RefineWMG-PT-100100-08
FORMULA_NAME RefineWMG-PT-100100-09
FORMULA_NAME RefineWMG-PT-100100-10
FORMULA_NAME RefineWMG-PT-100100-11
FORMULA_NAME RefineWMG-PT-100100-12
FORMULA_NAME RefineWMG-PT-100100-13
FORMULA_NAME RefineWMG-PT-100100-14
FORMULA_NAME RefineWMG-PT-100100-15

=== Now, execution of the tool begins

BK_START 1621429475305

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:04:37] [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-19 13:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:04:37] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2021-05-19 13:04:37] [INFO ] Transformed 504 places.
[2021-05-19 13:04:37] [INFO ] Transformed 403 transitions.
[2021-05-19 13:04:37] [INFO ] Parsed PT model containing 504 places and 403 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100085 steps, including 0 resets, run finished after 503 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 403 rows 504 cols
[2021-05-19 13:04:37] [INFO ] Computed 202 place invariants in 20 ms
[2021-05-19 13:04:38] [INFO ] [Real]Absence check using 202 positive place invariants in 115 ms returned sat
[2021-05-19 13:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:38] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-19 13:04:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 90 ms returned sat
[2021-05-19 13:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:39] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2021-05-19 13:04:39] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 27 ms.
[2021-05-19 13:04:39] [INFO ] Added : 17 causal constraints over 4 iterations in 126 ms. Result :sat
[2021-05-19 13:04:39] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2021-05-19 13:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:40] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2021-05-19 13:04:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:40] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2021-05-19 13:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:40] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-19 13:04:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 29 ms.
[2021-05-19 13:04:41] [INFO ] Added : 190 causal constraints over 38 iterations in 991 ms. Result :sat
[2021-05-19 13:04:41] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2021-05-19 13:04:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:42] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2021-05-19 13:04:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:42] [INFO ] [Nat]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:43] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2021-05-19 13:04:43] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 25 ms.
[2021-05-19 13:04:43] [INFO ] Added : 66 causal constraints over 14 iterations in 302 ms. Result :sat
[2021-05-19 13:04:43] [INFO ] [Real]Absence check using 202 positive place invariants in 57 ms returned sat
[2021-05-19 13:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:43] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2021-05-19 13:04:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:44] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:44] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2021-05-19 13:04:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 15 ms.
[2021-05-19 13:04:44] [INFO ] Added : 75 causal constraints over 15 iterations in 244 ms. Result :sat
[2021-05-19 13:04:44] [INFO ] [Real]Absence check using 202 positive place invariants in 81 ms returned sat
[2021-05-19 13:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:45] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2021-05-19 13:04:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:46] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2021-05-19 13:04:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2021-05-19 13:04:46] [INFO ] Added : 150 causal constraints over 30 iterations in 545 ms. Result :sat
[2021-05-19 13:04:46] [INFO ] [Real]Absence check using 202 positive place invariants in 88 ms returned sat
[2021-05-19 13:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:47] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2021-05-19 13:04:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:47] [INFO ] [Nat]Absence check using 202 positive place invariants in 68 ms returned sat
[2021-05-19 13:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:47] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-19 13:04:47] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2021-05-19 13:04:48] [INFO ] Added : 75 causal constraints over 15 iterations in 324 ms. Result :sat
[2021-05-19 13:04:48] [INFO ] [Real]Absence check using 202 positive place invariants in 68 ms returned sat
[2021-05-19 13:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:48] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2021-05-19 13:04:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 84 ms returned sat
[2021-05-19 13:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:49] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2021-05-19 13:04:49] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2021-05-19 13:04:49] [INFO ] Added : 104 causal constraints over 21 iterations in 446 ms. Result :sat
[2021-05-19 13:04:50] [INFO ] [Real]Absence check using 202 positive place invariants in 72 ms returned sat
[2021-05-19 13:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:50] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2021-05-19 13:04:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:50] [INFO ] [Nat]Absence check using 202 positive place invariants in 71 ms returned sat
[2021-05-19 13:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:51] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2021-05-19 13:04:51] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 27 ms.
[2021-05-19 13:04:51] [INFO ] Added : 136 causal constraints over 28 iterations in 521 ms. Result :sat
[2021-05-19 13:04:51] [INFO ] [Real]Absence check using 202 positive place invariants in 91 ms returned sat
[2021-05-19 13:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:52] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2021-05-19 13:04:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:52] [INFO ] [Nat]Absence check using 202 positive place invariants in 70 ms returned sat
[2021-05-19 13:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:53] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2021-05-19 13:04:53] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 23 ms.
[2021-05-19 13:04:53] [INFO ] Added : 77 causal constraints over 16 iterations in 334 ms. Result :sat
[2021-05-19 13:04:53] [INFO ] [Real]Absence check using 202 positive place invariants in 83 ms returned sat
[2021-05-19 13:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:54] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2021-05-19 13:04:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:54] [INFO ] [Nat]Absence check using 202 positive place invariants in 84 ms returned sat
[2021-05-19 13:04:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:54] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2021-05-19 13:04:54] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 49 ms.
[2021-05-19 13:04:55] [INFO ] Added : 192 causal constraints over 39 iterations in 893 ms. Result :sat
[2021-05-19 13:04:55] [INFO ] [Real]Absence check using 202 positive place invariants in 116 ms returned sat
[2021-05-19 13:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:56] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-19 13:04:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:57] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2021-05-19 13:04:57] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2021-05-19 13:04:57] [INFO ] Added : 169 causal constraints over 34 iterations in 560 ms. Result :sat
[2021-05-19 13:04:57] [INFO ] [Real]Absence check using 202 positive place invariants in 91 ms returned sat
[2021-05-19 13:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:58] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2021-05-19 13:04:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:58] [INFO ] [Nat]Absence check using 202 positive place invariants in 108 ms returned sat
[2021-05-19 13:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:59] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2021-05-19 13:04:59] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2021-05-19 13:04:59] [INFO ] Added : 44 causal constraints over 9 iterations in 231 ms. Result :sat
[2021-05-19 13:04:59] [INFO ] [Real]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:00] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2021-05-19 13:05:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:00] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:01] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2021-05-19 13:05:01] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 12 ms.
[2021-05-19 13:05:01] [INFO ] Added : 79 causal constraints over 16 iterations in 358 ms. Result :sat
[2021-05-19 13:05:01] [INFO ] [Real]Absence check using 202 positive place invariants in 99 ms returned sat
[2021-05-19 13:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:02] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2021-05-19 13:05:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:02] [INFO ] [Nat]Absence check using 202 positive place invariants in 67 ms returned sat
[2021-05-19 13:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:02] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2021-05-19 13:05:02] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2021-05-19 13:05:03] [INFO ] Added : 172 causal constraints over 35 iterations in 687 ms. Result :sat
[2021-05-19 13:05:03] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:04] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2021-05-19 13:05:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:04] [INFO ] [Nat]Absence check using 202 positive place invariants in 59 ms returned sat
[2021-05-19 13:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:04] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2021-05-19 13:05:05] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 25 ms.
[2021-05-19 13:05:05] [INFO ] Added : 172 causal constraints over 35 iterations in 564 ms. Result :sat
[2021-05-19 13:05:05] [INFO ] [Real]Absence check using 202 positive place invariants in 97 ms returned sat
[2021-05-19 13:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:06] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-19 13:05:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:06] [INFO ] [Nat]Absence check using 202 positive place invariants in 70 ms returned sat
[2021-05-19 13:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:06] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2021-05-19 13:05:06] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2021-05-19 13:05:07] [INFO ] Added : 75 causal constraints over 15 iterations in 242 ms. Result :sat
[2021-05-19 13:05:07] [INFO ] [Real]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:07] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2021-05-19 13:05:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:08] [INFO ] [Nat]Absence check using 202 positive place invariants in 96 ms returned sat
[2021-05-19 13:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:08] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2021-05-19 13:05:08] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2021-05-19 13:05:09] [INFO ] Added : 147 causal constraints over 30 iterations in 502 ms. Result :sat
[2021-05-19 13:05:09] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:09] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2021-05-19 13:05:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:10] [INFO ] [Nat]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:10] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2021-05-19 13:05:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2021-05-19 13:05:11] [INFO ] Added : 110 causal constraints over 22 iterations in 369 ms. Result :sat
[2021-05-19 13:05:11] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:05:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:11] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2021-05-19 13:05:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:11] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2021-05-19 13:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:12] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-19 13:05:12] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 28 ms.
[2021-05-19 13:05:12] [INFO ] Added : 153 causal constraints over 31 iterations in 627 ms. Result :sat
[2021-05-19 13:05:13] [INFO ] [Real]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:13] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2021-05-19 13:05:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:13] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2021-05-19 13:05:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:14] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2021-05-19 13:05:14] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 34 ms.
[2021-05-19 13:05:15] [INFO ] Added : 179 causal constraints over 36 iterations in 795 ms. Result :sat
[2021-05-19 13:05:15] [INFO ] [Real]Absence check using 202 positive place invariants in 58 ms returned sat
[2021-05-19 13:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:15] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-19 13:05:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:15] [INFO ] [Nat]Absence check using 202 positive place invariants in 58 ms returned sat
[2021-05-19 13:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:16] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2021-05-19 13:05:16] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2021-05-19 13:05:17] [INFO ] Added : 181 causal constraints over 37 iterations in 807 ms. Result :sat
[2021-05-19 13:05:17] [INFO ] [Real]Absence check using 202 positive place invariants in 65 ms returned sat
[2021-05-19 13:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:17] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2021-05-19 13:05:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 92 ms returned sat
[2021-05-19 13:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:18] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2021-05-19 13:05:18] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 34 ms.
[2021-05-19 13:05:19] [INFO ] Added : 197 causal constraints over 40 iterations in 789 ms. Result :sat
[2021-05-19 13:05:19] [INFO ] [Real]Absence check using 202 positive place invariants in 86 ms returned sat
[2021-05-19 13:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:20] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-19 13:05:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:05:20] [INFO ] [Nat]Absence check using 202 positive place invariants in 60 ms returned sat
[2021-05-19 13:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:05:20] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2021-05-19 13:05:20] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2021-05-19 13:05:21] [INFO ] Added : 135 causal constraints over 27 iterations in 512 ms. Result :sat
[2021-05-19 13:05:21] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-19 13:05:21] [INFO ] Flatten gal took : 78 ms
FORMULA RefineWMG-PT-100100-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:05:21] [INFO ] Flatten gal took : 32 ms
[2021-05-19 13:05:21] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 13:05:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-100100 @ 3570 seconds

FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2855
rslt: Output for LTLFireability @ RefineWMG-PT-100100

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:05:21 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G (((((1 <= p346) AND (1 <= p347) AND (1 <= p349) AND (1 <= p177)) U X ((1 <= p350))) OR (p177 <= 0))))",
"processed_size": 106,
"rewrites": 33
},
"result":
{
"edges": 106,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 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": 0,
"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": "(1 <= p288)",
"processed_size": 11,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 0,
"aconj": 0,
"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 ((1 <= p337))",
"processed_size": 15,
"rewrites": 33
},
"result":
{
"edges": 7798,
"markings": 4300,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"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": "X (G ((1 <= p478)))",
"processed_size": 19,
"rewrites": 33
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p268 <= 0)",
"processed_size": 11,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0)))))",
"processed_size": 92,
"rewrites": 33
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"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": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1072
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p326 <= 0) OR (p327 <= 0) OR (p329 <= 0))",
"processed_size": 45,
"rewrites": 35
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1608
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "F (G ((F ((1 <= p113)) AND (1 <= p493))))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 3216
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3215
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p297 <= 0)",
"processed_size": 11,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p268 <= 0)",
"processed_size": 11,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0)))))",
"processed_size": 92,
"rewrites": 33
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p297 <= 0)",
"processed_size": 11,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "F (G ((1 <= p443)))",
"processed_size": 19,
"rewrites": 33
},
"result":
{
"edges": 9,
"markings": 8,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4176,
"runtime": 715.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(((** U X(**)) OR **))) : (X(F(**)) AND (G(**) OR **)) : F(G((F(**) AND **))) : X(G(**)) : F(**) : (X((* R (* R *))) OR (X(F((G(*) OR (* AND *)))) AND **)) : X(X(G(*))) : (F(G(**)) AND F(**))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "no no no no no unknown unknown no ",
"value": "no no no no no unknown unknown 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: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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: F (G (((((1 <= p346) AND (1 <= p347) AND (1 <= p349) AND (1 <= p177)) U X ((1 <= p350))) OR (p177 <= 0)))) : (X (F ((p288 <= 0))) AND (G ((1 <= p337)) OR (1 <= p288))) : F (G (X ((F ((1 <= p113)) AND (1 <= p493))))) : X (G ((1 <= p478))) : F (((((1 <= p66) AND (1 <= p67) AND (1 <= p69)) OR ((1 <= p326) AND (1 <= p327) AND (1 <= p329))) U (((1 <= p63) U X (((1 <= p66) AND (1 <= p67) AND (1 <= p69)))) U ((1 <= p326) AND (1 <= p327) AND (1 <= p329))))) : (NOT(X (((1 <= p358) U ((1 <= p268) U ((1 <= p131) AND (1 <= p132) AND (1 <= p134)))))) OR (NOT(X (G ((((1 <= p131) AND (1 <= p132) AND (1 <= p134)) U (1 <= p268))))) AND (p268 <= 0))) : G (X (NOT(F (X ((1 <= p125)))))) : (F (NOT(F (NOT(G ((1 <= p443)))))) AND F ((1 <= p297)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((1 <= p346) AND (1 <= p347) AND (1 <= p349) AND (1 <= p177)) U X ((1 <= p350))) OR (p177 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((1 <= p346) AND (1 <= p347) AND (1 <= p349) AND (1 <= p177)) U X ((1 <= p350))) OR (p177 <= 0))))
lola: processed formula length: 106
lola: 33 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: 105 markings, 106 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p288 <= 0))) AND (G ((1 <= p337)) OR (1 <= p288)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p288)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p288)
lola: processed formula length: 11
lola: 33 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p337))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p337))
lola: processed formula length: 15
lola: 33 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: 4300 markings, 7798 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p478)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p478)))
lola: processed formula length: 19
lola: 33 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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p358 <= 0) R ((p268 <= 0) R ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0))))) OR (X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0))))) AND (p268 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p268 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p268 <= 0)
lola: processed formula length: 11
lola: 33 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0)))))
lola: processed formula length: 92
lola: 33 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: 149 markings, 149 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p358 <= 0) R ((p268 <= 0) R ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p358 <= 0) R ((p268 <= 0) R ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)))))
lola: processed formula length: 81
lola: 33 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: 1229552 markings, 1850365 edges, 245910 markings/sec, 0 secs
lola: 2417889 markings, 3638807 edges, 237667 markings/sec, 5 secs
lola: 3612021 markings, 5436031 edges, 238826 markings/sec, 10 secs
lola: 4792792 markings, 7213047 edges, 236154 markings/sec, 15 secs
lola: 5902761 markings, 8883546 edges, 221994 markings/sec, 20 secs
lola: 7063848 markings, 10630965 edges, 232217 markings/sec, 25 secs
lola: 8163594 markings, 12286138 edges, 219949 markings/sec, 30 secs
lola: 9356372 markings, 14081184 edges, 238556 markings/sec, 35 secs
lola: 10449885 markings, 15727025 edges, 218703 markings/sec, 40 secs
lola: 11555356 markings, 17390668 edges, 221094 markings/sec, 45 secs
lola: 12616956 markings, 18988439 edges, 212320 markings/sec, 50 secs
lola: 13677435 markings, 20584432 edges, 212096 markings/sec, 55 secs
lola: 14735869 markings, 22177385 edges, 211687 markings/sec, 60 secs
lola: 15815599 markings, 23802390 edges, 215946 markings/sec, 65 secs
lola: 16953884 markings, 25515544 edges, 227657 markings/sec, 70 secs
lola: 18108841 markings, 27253675 edges, 230991 markings/sec, 75 secs
lola: 19135004 markings, 28798075 edges, 205233 markings/sec, 80 secs
lola: 20217381 markings, 30427096 edges, 216475 markings/sec, 85 secs
lola: 21273765 markings, 32016880 edges, 211277 markings/sec, 90 secs
lola: 22355111 markings, 33644344 edges, 216269 markings/sec, 95 secs
lola: 23392503 markings, 35205579 edges, 207478 markings/sec, 100 secs
lola: 24448274 markings, 36794569 edges, 211154 markings/sec, 105 secs
lola: 25046732 markings, 37695529 edges, 119692 markings/sec, 110 secs
lola: 25348599 markings, 38149765 edges, 60373 markings/sec, 115 secs
lola: 25682881 markings, 38652625 edges, 66856 markings/sec, 120 secs
lola: 26242810 markings, 39495320 edges, 111986 markings/sec, 125 secs
lola: 26590264 markings, 40018259 edges, 69491 markings/sec, 130 secs
lola: 27171661 markings, 40893280 edges, 116279 markings/sec, 135 secs
lola: 27624278 markings, 41574438 edges, 90523 markings/sec, 140 secs
lola: 28071411 markings, 42247372 edges, 89427 markings/sec, 145 secs
lola: 28819778 markings, 43373693 edges, 149673 markings/sec, 150 secs
lola: 29308720 markings, 44109485 edges, 97788 markings/sec, 155 secs
lola: 30095921 markings, 45294232 edges, 157440 markings/sec, 160 secs
lola: 30538809 markings, 45960836 edges, 88578 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 4 will run for 848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p125 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p125 <= 0))))
lola: processed formula length: 23
lola: 33 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: 1118986 markings, 1683963 edges, 223797 markings/sec, 0 secs
lola: 2190457 markings, 3296576 edges, 214294 markings/sec, 5 secs
lola: 3317486 markings, 4992715 edges, 225406 markings/sec, 10 secs
lola: 4426418 markings, 6661733 edges, 221786 markings/sec, 15 secs
lola: 5587707 markings, 8409444 edges, 232258 markings/sec, 20 secs
lola: 6694125 markings, 10074595 edges, 221284 markings/sec, 25 secs
lola: 7826258 markings, 11778438 edges, 226427 markings/sec, 30 secs
lola: 8955428 markings, 13477852 edges, 225834 markings/sec, 35 secs
lola: 10109311 markings, 15214442 edges, 230777 markings/sec, 40 secs
lola: 11251614 markings, 16933571 edges, 228461 markings/sec, 45 secs
lola: 12398804 markings, 18660142 edges, 229438 markings/sec, 50 secs
lola: 13528183 markings, 20359836 edges, 225876 markings/sec, 55 secs
lola: 14642710 markings, 22037195 edges, 222905 markings/sec, 60 secs
lola: 15759583 markings, 23718055 edges, 223375 markings/sec, 65 secs
lola: 16880929 markings, 25405724 edges, 224269 markings/sec, 70 secs
lola: 18010627 markings, 27105888 edges, 225940 markings/sec, 75 secs
lola: 19098265 markings, 28742829 edges, 217528 markings/sec, 80 secs
lola: 20216373 markings, 30425596 edges, 223622 markings/sec, 85 secs
lola: 21341927 markings, 32119536 edges, 225111 markings/sec, 90 secs
lola: 22486795 markings, 33842564 edges, 228974 markings/sec, 95 secs
lola: 23466076 markings, 35316343 edges, 195856 markings/sec, 100 secs
lola: 24582750 markings, 36996988 edges, 223335 markings/sec, 105 secs
lola: 24948440 markings, 37547771 edges, 73138 markings/sec, 110 secs
lola: 25351130 markings, 38153329 edges, 80538 markings/sec, 115 secs
lola: 25905881 markings, 38988267 edges, 110950 markings/sec, 120 secs
lola: 26224125 markings, 39467189 edges, 63649 markings/sec, 125 secs
lola: 26822360 markings, 40367601 edges, 119647 markings/sec, 130 secs
lola: 27538489 markings, 41445339 edges, 143226 markings/sec, 135 secs
lola: 27991668 markings, 42127363 edges, 90636 markings/sec, 140 secs
lola: 28681917 markings, 43166214 edges, 138050 markings/sec, 145 secs
lola: 29026648 markings, 43685027 edges, 68946 markings/sec, 150 secs
lola: 29710409 markings, 44714059 edges, 136752 markings/sec, 155 secs
lola: 30240379 markings, 45511688 edges, 105994 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 1072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p326) AND (1 <= p327) AND (1 <= p329)))
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: ((p326 <= 0) OR (p327 <= 0) OR (p329 <= 0))
lola: processed formula length: 45
lola: 35 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 1608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p113)) AND (1 <= p493))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p113)) AND (1 <= p493))))
lola: processed formula length: 41
lola: 33 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: add low 401
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, 9 edges
lola: ========================================
lola: subprocess 7 will run for 3216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p443))) AND F ((1 <= p297)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p297))
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: (p297 <= 0)
lola: processed formula length: 11
lola: 35 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 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: (X (((p358 <= 0) R ((p268 <= 0) R ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0))))) OR (X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0))))) AND (p268 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p268 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p268 <= 0)
lola: processed formula length: 11
lola: 33 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p268 <= 0)) OR (((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)) AND (p268 <= 0)))))
lola: processed formula length: 92
lola: 33 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: 149 markings, 149 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((p358 <= 0) R ((p268 <= 0) R ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p358 <= 0) R ((p268 <= 0) R ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0)))))
lola: processed formula length: 81
lola: 33 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: 1000862 markings, 1506188 edges, 200172 markings/sec, 0 secs
lola: 2039848 markings, 3069940 edges, 207797 markings/sec, 5 secs
lola: 3170468 markings, 4771426 edges, 226124 markings/sec, 10 secs
lola: 4282394 markings, 6444948 edges, 222385 markings/sec, 15 secs
lola: 5382198 markings, 8100089 edges, 219961 markings/sec, 20 secs
lola: 6465219 markings, 9730098 edges, 216604 markings/sec, 25 secs
lola: 7447840 markings, 11208901 edges, 196524 markings/sec, 30 secs
lola: 8462991 markings, 12736734 edges, 203030 markings/sec, 35 secs
lola: 9521175 markings, 14329238 edges, 211637 markings/sec, 40 secs
lola: 10513610 markings, 15822876 edges, 198487 markings/sec, 45 secs
lola: 11504289 markings, 17313855 edges, 198136 markings/sec, 50 secs
lola: 12491667 markings, 18799882 edges, 197476 markings/sec, 55 secs
lola: 13511793 markings, 20335145 edges, 204025 markings/sec, 60 secs
lola: 14514094 markings, 21843623 edges, 200460 markings/sec, 65 secs
lola: 15511322 markings, 23344396 edges, 199446 markings/sec, 70 secs
lola: 16426749 markings, 24722175 edges, 183085 markings/sec, 75 secs
lola: 17413436 markings, 26207099 edges, 197337 markings/sec, 80 secs
lola: 18474645 markings, 27804214 edges, 212242 markings/sec, 85 secs
lola: 19459412 markings, 29286281 edges, 196953 markings/sec, 90 secs
lola: 20463180 markings, 30797024 edges, 200754 markings/sec, 95 secs
lola: 21461222 markings, 32299015 edges, 199608 markings/sec, 100 secs
lola: 22471852 markings, 33820019 edges, 202126 markings/sec, 105 secs
lola: 23445098 markings, 35284760 edges, 194649 markings/sec, 110 secs
lola: 24437268 markings, 36777981 edges, 198434 markings/sec, 115 secs
lola: 25007080 markings, 37635612 edges, 113962 markings/sec, 120 secs
lola: 25493793 markings, 38368203 edges, 97343 markings/sec, 125 secs
lola: 26111994 markings, 39298461 edges, 123640 markings/sec, 130 secs
lola: 26739991 markings, 40243616 edges, 125599 markings/sec, 135 secs
lola: 27310529 markings, 41102203 edges, 114108 markings/sec, 140 secs
lola: 27888175 markings, 41971607 edges, 115529 markings/sec, 145 secs
lola: 28489800 markings, 42877011 edges, 120325 markings/sec, 150 secs
lola: 28793643 markings, 43334332 edges, 60769 markings/sec, 155 secs
lola: 29420312 markings, 44277505 edges, 125334 markings/sec, 160 secs
lola: 29909817 markings, 45014168 edges, 97901 markings/sec, 165 secs
lola: 30527997 markings, 45944698 edges, 123636 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((p125 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p125 <= 0))))
lola: processed formula length: 23
lola: 33 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: 1008038 markings, 1516977 edges, 201608 markings/sec, 0 secs
lola: 2013266 markings, 3029895 edges, 201046 markings/sec, 5 secs
lola: 3070479 markings, 4620930 edges, 211443 markings/sec, 10 secs
lola: 4135687 markings, 6224149 edges, 213042 markings/sec, 15 secs
lola: 5159697 markings, 7765275 edges, 204802 markings/sec, 20 secs
lola: 6243175 markings, 9395950 edges, 216696 markings/sec, 25 secs
lola: 7340988 markings, 11048071 edges, 219563 markings/sec, 30 secs
lola: 8364175 markings, 12588050 edges, 204637 markings/sec, 35 secs
lola: 9511068 markings, 14314045 edges, 229379 markings/sec, 40 secs
lola: 10658566 markings, 16041058 edges, 229500 markings/sec, 45 secs
lola: 11699559 markings, 17607711 edges, 208199 markings/sec, 50 secs
lola: 12694063 markings, 19104511 edges, 198901 markings/sec, 55 secs
lola: 13710890 markings, 20634812 edges, 203365 markings/sec, 60 secs
lola: 14761747 markings, 22216362 edges, 210171 markings/sec, 65 secs
lola: 15832230 markings, 23827426 edges, 214097 markings/sec, 70 secs
lola: 16854168 markings, 25365438 edges, 204388 markings/sec, 75 secs
lola: 17930271 markings, 26984973 edges, 215221 markings/sec, 80 secs
lola: 19035731 markings, 28648709 edges, 221092 markings/sec, 85 secs
lola: 20162999 markings, 30345233 edges, 225454 markings/sec, 90 secs
lola: 21194162 markings, 31897114 edges, 206233 markings/sec, 95 secs
lola: 22242315 markings, 33474584 edges, 209631 markings/sec, 100 secs
lola: 23298396 markings, 35063998 edges, 211216 markings/sec, 105 secs
lola: 24470796 markings, 36828432 edges, 234480 markings/sec, 110 secs
lola: 25083027 markings, 37750290 edges, 122446 markings/sec, 115 secs
lola: 25517814 markings, 38404414 edges, 86957 markings/sec, 120 secs
lola: 26175006 markings, 39393311 edges, 131438 markings/sec, 125 secs
lola: 26872882 markings, 40443645 edges, 139575 markings/sec, 130 secs
lola: 27501242 markings, 41389293 edges, 125672 markings/sec, 135 secs
lola: 28250171 markings, 42516396 edges, 149786 markings/sec, 140 secs
lola: 28634993 markings, 43095553 edges, 76964 markings/sec, 145 secs
lola: 29342655 markings, 44160601 edges, 141532 markings/sec, 150 secs
lola: 29955628 markings, 45083111 edges, 122595 markings/sec, 155 secs
lola: 30430828 markings, 45798283 edges, 95040 markings/sec, 160 secs
lola: 30618835 markings, 46081253 edges, 37601 markings/sec, 165 secs
lola: 30650458 markings, 46128870 edges, 6325 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p443))) AND F ((1 <= p297)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((1 <= p297))
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: (p297 <= 0)
lola: processed formula length: 11
lola: 35 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p443)))
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 <= p443)))
lola: processed formula length: 19
lola: 33 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: add low 401
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, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no unknown unknown no
lola:
preliminary result: no no no no no unknown unknown no
lola: memory consumption: 4176 KB
lola: time consumption: 715 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="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r189-tajo-162089432900346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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