About the Execution of 2020-gold for RefineWMG-PT-100101
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16256.363 | 3600000.00 | 1104251.00 | 57415.10 | TFFFF?FF?FFTFF?F | normal |
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-162089432900350.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-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900350
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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 2.8K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K Mar 25 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:02 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-100101-00
FORMULA_NAME RefineWMG-PT-100101-01
FORMULA_NAME RefineWMG-PT-100101-02
FORMULA_NAME RefineWMG-PT-100101-03
FORMULA_NAME RefineWMG-PT-100101-04
FORMULA_NAME RefineWMG-PT-100101-05
FORMULA_NAME RefineWMG-PT-100101-06
FORMULA_NAME RefineWMG-PT-100101-07
FORMULA_NAME RefineWMG-PT-100101-08
FORMULA_NAME RefineWMG-PT-100101-09
FORMULA_NAME RefineWMG-PT-100101-10
FORMULA_NAME RefineWMG-PT-100101-11
FORMULA_NAME RefineWMG-PT-100101-12
FORMULA_NAME RefineWMG-PT-100101-13
FORMULA_NAME RefineWMG-PT-100101-14
FORMULA_NAME RefineWMG-PT-100101-15
=== Now, execution of the tool begins
BK_START 1621429579648
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:06:23] [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:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:06:23] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-05-19 13:06:23] [INFO ] Transformed 504 places.
[2021-05-19 13:06:23] [INFO ] Transformed 403 transitions.
[2021-05-19 13:06:23] [INFO ] Parsed PT model containing 504 places and 403 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100023 steps, including 0 resets, run finished after 352 ms. (steps per millisecond=284 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 403 rows 504 cols
[2021-05-19 13:06:23] [INFO ] Computed 202 place invariants in 12 ms
[2021-05-19 13:06:23] [INFO ] [Real]Absence check using 202 positive place invariants in 99 ms returned sat
[2021-05-19 13:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:24] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2021-05-19 13:06:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:24] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2021-05-19 13:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:25] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2021-05-19 13:06:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 38 ms.
[2021-05-19 13:06:25] [INFO ] Added : 75 causal constraints over 15 iterations in 578 ms. Result :sat
[2021-05-19 13:06:26] [INFO ] [Real]Absence check using 202 positive place invariants in 83 ms returned sat
[2021-05-19 13:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:26] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2021-05-19 13:06:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 89 ms returned sat
[2021-05-19 13:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:27] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2021-05-19 13:06:27] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 32 ms.
[2021-05-19 13:06:28] [INFO ] Added : 192 causal constraints over 39 iterations in 818 ms. Result :sat
[2021-05-19 13:06:28] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2021-05-19 13:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:28] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2021-05-19 13:06:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:29] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2021-05-19 13:06:29] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2021-05-19 13:06:30] [INFO ] Added : 195 causal constraints over 39 iterations in 875 ms. Result :sat
[2021-05-19 13:06:30] [INFO ] [Real]Absence check using 202 positive place invariants in 77 ms returned sat
[2021-05-19 13:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:31] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2021-05-19 13:06:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:31] [INFO ] [Nat]Absence check using 202 positive place invariants in 74 ms returned sat
[2021-05-19 13:06:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:31] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-19 13:06:31] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 33 ms.
[2021-05-19 13:06:32] [INFO ] Added : 117 causal constraints over 24 iterations in 623 ms. Result :sat
[2021-05-19 13:06:32] [INFO ] [Real]Absence check using 202 positive place invariants in 70 ms returned sat
[2021-05-19 13:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:33] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2021-05-19 13:06:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:33] [INFO ] [Nat]Absence check using 202 positive place invariants in 58 ms returned sat
[2021-05-19 13:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:33] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-19 13:06:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2021-05-19 13:06:34] [INFO ] Added : 140 causal constraints over 28 iterations in 617 ms. Result :sat
[2021-05-19 13:06:34] [INFO ] [Real]Absence check using 202 positive place invariants in 60 ms returned sat
[2021-05-19 13:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:34] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2021-05-19 13:06:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:35] [INFO ] [Nat]Absence check using 202 positive place invariants in 73 ms returned sat
[2021-05-19 13:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:35] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-19 13:06:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 29 ms.
[2021-05-19 13:06:36] [INFO ] Added : 150 causal constraints over 30 iterations in 764 ms. Result :sat
[2021-05-19 13:06:36] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:37] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2021-05-19 13:06:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:37] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:37] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2021-05-19 13:06:37] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2021-05-19 13:06:38] [INFO ] Added : 104 causal constraints over 21 iterations in 356 ms. Result :sat
[2021-05-19 13:06:38] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2021-05-19 13:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:38] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2021-05-19 13:06:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:39] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2021-05-19 13:06:39] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 33 ms.
[2021-05-19 13:06:40] [INFO ] Added : 136 causal constraints over 28 iterations in 584 ms. Result :sat
[2021-05-19 13:06:40] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:40] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2021-05-19 13:06:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:41] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-19 13:06:41] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 30 ms.
[2021-05-19 13:06:42] [INFO ] Added : 135 causal constraints over 27 iterations in 621 ms. Result :sat
[2021-05-19 13:06:42] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:43] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-19 13:06:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:43] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2021-05-19 13:06:43] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 29 ms.
[2021-05-19 13:06:44] [INFO ] Added : 104 causal constraints over 21 iterations in 551 ms. Result :sat
[2021-05-19 13:06:44] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:45] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2021-05-19 13:06:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 71 ms returned sat
[2021-05-19 13:06:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:45] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-19 13:06:45] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2021-05-19 13:06:46] [INFO ] Added : 75 causal constraints over 15 iterations in 434 ms. Result :sat
[2021-05-19 13:06:46] [INFO ] [Real]Absence check using 202 positive place invariants in 84 ms returned sat
[2021-05-19 13:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:47] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2021-05-19 13:06:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:47] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:47] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2021-05-19 13:06:48] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2021-05-19 13:06:48] [INFO ] Added : 169 causal constraints over 34 iterations in 789 ms. Result :sat
[2021-05-19 13:06:48] [INFO ] [Real]Absence check using 202 positive place invariants in 89 ms returned sat
[2021-05-19 13:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:49] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-19 13:06:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2021-05-19 13:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:50] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2021-05-19 13:06:50] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 25 ms.
[2021-05-19 13:06:50] [INFO ] Added : 44 causal constraints over 9 iterations in 201 ms. Result :sat
[2021-05-19 13:06:50] [INFO ] [Real]Absence check using 202 positive place invariants in 95 ms returned sat
[2021-05-19 13:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:51] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2021-05-19 13:06:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:51] [INFO ] [Nat]Absence check using 202 positive place invariants in 97 ms returned sat
[2021-05-19 13:06:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:52] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2021-05-19 13:06:52] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 34 ms.
[2021-05-19 13:06:52] [INFO ] Added : 77 causal constraints over 16 iterations in 439 ms. Result :sat
[2021-05-19 13:06:52] [INFO ] [Real]Absence check using 202 positive place invariants in 108 ms returned sat
[2021-05-19 13:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:53] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2021-05-19 13:06:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:53] [INFO ] [Nat]Absence check using 202 positive place invariants in 82 ms returned sat
[2021-05-19 13:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:53] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2021-05-19 13:06:53] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 32 ms.
[2021-05-19 13:06:54] [INFO ] Added : 75 causal constraints over 15 iterations in 340 ms. Result :sat
[2021-05-19 13:06:54] [INFO ] [Real]Absence check using 202 positive place invariants in 104 ms returned sat
[2021-05-19 13:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:55] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2021-05-19 13:06:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:55] [INFO ] [Nat]Absence check using 202 positive place invariants in 96 ms returned sat
[2021-05-19 13:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:55] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2021-05-19 13:06:56] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2021-05-19 13:06:56] [INFO ] Added : 168 causal constraints over 34 iterations in 749 ms. Result :sat
[2021-05-19 13:06:56] [INFO ] [Real]Absence check using 202 positive place invariants in 91 ms returned sat
[2021-05-19 13:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:57] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2021-05-19 13:06:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:57] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:58] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2021-05-19 13:06:58] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 32 ms.
[2021-05-19 13:06:59] [INFO ] Added : 145 causal constraints over 29 iterations in 719 ms. Result :sat
[2021-05-19 13:06:59] [INFO ] [Real]Absence check using 202 positive place invariants in 84 ms returned sat
[2021-05-19 13:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:06:59] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2021-05-19 13:06:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:06:59] [INFO ] [Nat]Absence check using 202 positive place invariants in 94 ms returned sat
[2021-05-19 13:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:00] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2021-05-19 13:07:00] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2021-05-19 13:07:00] [INFO ] Added : 110 causal constraints over 22 iterations in 451 ms. Result :sat
[2021-05-19 13:07:00] [INFO ] [Real]Absence check using 202 positive place invariants in 96 ms returned sat
[2021-05-19 13:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:01] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2021-05-19 13:07:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:07:01] [INFO ] [Nat]Absence check using 202 positive place invariants in 91 ms returned sat
[2021-05-19 13:07:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:02] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2021-05-19 13:07:02] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 32 ms.
[2021-05-19 13:07:03] [INFO ] Added : 124 causal constraints over 25 iterations in 680 ms. Result :sat
[2021-05-19 13:07:03] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:03] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2021-05-19 13:07:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:07:04] [INFO ] [Nat]Absence check using 202 positive place invariants in 83 ms returned sat
[2021-05-19 13:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:04] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2021-05-19 13:07:04] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 25 ms.
[2021-05-19 13:07:04] [INFO ] Added : 22 causal constraints over 5 iterations in 163 ms. Result :sat
[2021-05-19 13:07:04] [INFO ] [Real]Absence check using 202 positive place invariants in 98 ms returned sat
[2021-05-19 13:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:05] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2021-05-19 13:07:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:07:05] [INFO ] [Nat]Absence check using 202 positive place invariants in 97 ms returned sat
[2021-05-19 13:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:06] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2021-05-19 13:07:06] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2021-05-19 13:07:06] [INFO ] Added : 172 causal constraints over 35 iterations in 692 ms. Result :sat
[2021-05-19 13:07:07] [INFO ] [Real]Absence check using 202 positive place invariants in 103 ms returned sat
[2021-05-19 13:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:07] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-19 13:07:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:07:07] [INFO ] [Nat]Absence check using 202 positive place invariants in 82 ms returned sat
[2021-05-19 13:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:08] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2021-05-19 13:07:08] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2021-05-19 13:07:09] [INFO ] Added : 186 causal constraints over 38 iterations in 842 ms. Result :sat
[2021-05-19 13:07:09] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:10] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2021-05-19 13:07:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:07:10] [INFO ] [Nat]Absence check using 202 positive place invariants in 99 ms returned sat
[2021-05-19 13:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:07:10] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2021-05-19 13:07:10] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2021-05-19 13:07:11] [INFO ] Added : 172 causal constraints over 35 iterations in 561 ms. Result :sat
[2021-05-19 13:07:11] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 13:07:11] [INFO ] Flatten gal took : 66 ms
FORMULA RefineWMG-PT-100101-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:07:11] [INFO ] Flatten gal took : 24 ms
[2021-05-19 13:07:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 13:07:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-100101 @ 3570 seconds
FORMULA RefineWMG-PT-100101-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-100101-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2529
rslt: Output for LTLFireability @ RefineWMG-PT-100101
{
"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:07:12 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"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 <= p373)))",
"processed_size": 19,
"rewrites": 67
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((X ((1 <= p32)) OR (1 <= p85)) U ((1 <= p401) AND (1 <= p402) AND (1 <= p404))) U X ((F (G ((1 <= p320))) AND G (((1 <= p32) OR G ((1 <= p320)))))))",
"processed_size": 150,
"rewrites": 67
},
"result":
{
"edges": 206,
"markings": 203,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 51
},
"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": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((X (((1 <= p326) AND (1 <= p327) AND (1 <= p329))) OR ((1 <= p326) AND (1 <= p327) AND (1 <= p329))))",
"processed_size": 104,
"rewrites": 67
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((F (G ((((1 <= p81) AND (1 <= p82) AND (1 <= p84)) OR ((1 <= p131) AND (1 <= p132) AND (1 <= p134))))) OR (1 <= p268)))",
"processed_size": 123,
"rewrites": 67
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((1 <= p72)) OR ((1 <= p145) OR (((p452 <= 0) OR (1 <= p448)) AND ((1 <= p72) OR (1 <= p448)))))))",
"processed_size": 109,
"rewrites": 67
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 800
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 800
},
"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": "(p230 <= 0)",
"processed_size": 11,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1067
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F ((p87 <= 0))))",
"processed_size": 22,
"rewrites": 67
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1510
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (F ((p70 <= 0))) OR F ((((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)) AND (G ((1 <= p70)) R F ((p70 <= 0)))))))",
"processed_size": 117,
"rewrites": 67
},
"result":
{
"edges": 4423,
"markings": 2736,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 9,
"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": 3020
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((F (((1 <= p121) AND (1 <= p122) AND (1 <= p124))) OR (G (((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND F (((1 <= p121) AND (1 <= p122) AND (1 <= p124)))))))",
"processed_size": 168,
"rewrites": 67
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 3484,
"runtime": 1041.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((F(**) OR (G(**) AND F(**))))) : F((X((G(F(*)) OR *)) OR G(*))) : X(G(**)) : (((X(**) OR **) U **) U X((F(G(**)) AND G((** OR G(**)))))) : X(G((* R (X(*) OR (G(*) AND F(*)))))) : F((X(**) OR **)) : X((F(G(*)) OR **)) : X(F((F(**) OR (** OR **)))) : (X(X(F(*))) AND **) : X(((** U G(**)) OR G(**))) : F((G(F(*)) OR F((* AND (G(*) R F(*))))))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "no unknown no no unknown no no yes no unknown no ",
"value": "no unknown no no unknown no no yes no 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: G (F ((NOT((((1 <= p375) OR (1 <= p48)) U NOT(G (((1 <= p151) AND (1 <= p152) AND (1 <= p154)))))) U F (((1 <= p121) AND (1 <= p122) AND (1 <= p124)))))) : F ((NOT(X ((F (G ((1 <= p493))) AND (1 <= p113)))) OR NOT((((1 <= p171) AND (1 <= p172) AND (1 <= p174)) U F (((1 <= p171) AND (1 <= p172) AND (1 <= p174))))))) : NOT(F ((NOT((F ((1 <= p245)) U (1 <= p425))) U NOT(X ((1 <= p373)))))) : (((X ((1 <= p32)) OR (1 <= p85)) U ((1 <= p401) AND (1 <= p402) AND (1 <= p404))) U G (X (((1 <= p32) U G ((1 <= p320)))))) : X (G (NOT(((p438 <= 0) U (X ((p438 <= 0)) AND (F ((1 <= p58)) OR G ((1 <= p58)))))))) : F ((X (((1 <= p326) AND (1 <= p327) AND (1 <= p329))) OR ((1 <= p326) AND (1 <= p327) AND (1 <= p329)))) : X ((F (NOT(G (F ((((p81 <= 0) OR (p82 <= 0) OR (p84 <= 0)) AND ((p131 <= 0) OR (p132 <= 0) OR (p134 <= 0))))))) OR (1 <= p268))) : X (F (((F ((1 <= p72)) OR (1 <= p145)) OR (((p452 <= 0) OR (1 <= p448)) AND ((1 <= p72) OR (1 <= p448)))))) : (NOT(G (X (X ((1 <= p87))))) AND (p230 <= 0)) : X ((((1 <= p378) U G ((1 <= p138))) OR G ((1 <= p297)))) : F (NOT(G ((((1 <= p171) AND (1 <= p172) AND (1 <= p174)) U (F ((((1 <= p70) U (1 <= p45)) U (p70 <= 0))) U G ((1 <= p70)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((G (F ((p493 <= 0))) OR (p113 <= 0))) OR G (((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((G (F ((p493 <= 0))) OR (p113 <= 0))) OR G (((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)))))
lola: processed formula length: 99
lola: 67 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: 1110774 markings, 1671490 edges, 222155 markings/sec, 0 secs
lola: 2218080 markings, 3337964 edges, 221461 markings/sec, 5 secs
lola: 3326054 markings, 5005423 edges, 221595 markings/sec, 10 secs
lola: 4412948 markings, 6641176 edges, 217379 markings/sec, 15 secs
lola: 5525537 markings, 8315487 edges, 222518 markings/sec, 20 secs
lola: 6632097 markings, 9980874 edges, 221312 markings/sec, 25 secs
lola: 7600416 markings, 11438092 edges, 193664 markings/sec, 30 secs
lola: 8620229 markings, 12972894 edges, 203963 markings/sec, 35 secs
lola: 9711265 markings, 14614838 edges, 218207 markings/sec, 40 secs
lola: 10784051 markings, 16229334 edges, 214557 markings/sec, 45 secs
lola: 11818144 markings, 17785595 edges, 206819 markings/sec, 50 secs
lola: 12894416 markings, 19405312 edges, 215254 markings/sec, 55 secs
lola: 13988226 markings, 21051447 edges, 218762 markings/sec, 60 secs
lola: 15010304 markings, 22589613 edges, 204416 markings/sec, 65 secs
lola: 16083734 markings, 24205089 edges, 214686 markings/sec, 70 secs
lola: 17118016 markings, 25761622 edges, 206856 markings/sec, 75 secs
lola: 18195373 markings, 27382961 edges, 215471 markings/sec, 80 secs
lola: 19236853 markings, 28950385 edges, 208296 markings/sec, 85 secs
lola: 20230853 markings, 30446273 edges, 198800 markings/sec, 90 secs
lola: 21268880 markings, 32008508 edges, 207605 markings/sec, 95 secs
lola: 22340304 markings, 33620905 edges, 214285 markings/sec, 100 secs
lola: 23378215 markings, 35182900 edges, 207582 markings/sec, 105 secs
lola: 24429809 markings, 36765505 edges, 210319 markings/sec, 110 secs
lola: 25090190 markings, 37759797 edges, 132076 markings/sec, 115 secs
lola: 25754333 markings, 38758852 edges, 132829 markings/sec, 120 secs
lola: 26119640 markings, 39308638 edges, 73061 markings/sec, 125 secs
lola: 26850699 markings, 40408814 edges, 146212 markings/sec, 130 secs
lola: 27287689 markings, 41066493 edges, 87398 markings/sec, 135 secs
lola: 27543360 markings, 41451289 edges, 51134 markings/sec, 140 secs
lola: 28166487 markings, 42388985 edges, 124625 markings/sec, 145 secs
lola: 28687989 markings, 43173867 edges, 104300 markings/sec, 150 secs
lola: 29201456 markings, 43946631 edges, 102693 markings/sec, 155 secs
lola: 30017681 markings, 45174989 edges, 163245 markings/sec, 160 secs
lola: 30368834 markings, 45703399 edges, 70231 markings/sec, 165 secs
lola: 30600482 markings, 46052053 edges, 46330 markings/sec, 170 secs
lola: 30639049 markings, 46110095 edges, 7713 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p373)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p373)))
lola: processed formula length: 19
lola: 67 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 2 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X ((1 <= p32)) OR (1 <= p85)) U ((1 <= p401) AND (1 <= p402) AND (1 <= p404))) U X ((F (G ((1 <= p320))) AND G (((1 <= p32) OR G ((1 <= p320)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((X ((1 <= p32)) OR (1 <= p85)) U ((1 <= p401) AND (1 <= p402) AND (1 <= p404))) U X ((F (G ((1 <= p320))) AND G (((1 <= p32) OR G ((1 <= p320)))))))
lola: processed formula length: 150
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 51 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: 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: 203 markings, 206 edges
lola: ========================================
lola: subprocess 3 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p438) R (X ((1 <= p438)) OR (G ((p58 <= 0)) AND F ((p58 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p438) R (X ((1 <= p438)) OR (G ((p58 <= 0)) AND F ((p58 <= 0)))))))
lola: processed formula length: 80
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1086926 markings, 1635688 edges, 217385 markings/sec, 0 secs
lola: 2250093 markings, 3386243 edges, 232633 markings/sec, 5 secs
lola: 3352683 markings, 5045538 edges, 220518 markings/sec, 10 secs
lola: 4496003 markings, 6766217 edges, 228664 markings/sec, 15 secs
lola: 5673179 markings, 8537750 edges, 235435 markings/sec, 20 secs
lola: 6806586 markings, 10243500 edges, 226681 markings/sec, 25 secs
lola: 7941733 markings, 11951844 edges, 227029 markings/sec, 30 secs
lola: 9008767 markings, 13557675 edges, 213407 markings/sec, 35 secs
lola: 10031813 markings, 15097291 edges, 204609 markings/sec, 40 secs
lola: 11007990 markings, 16566426 edges, 195235 markings/sec, 45 secs
lola: 12038770 markings, 18117626 edges, 206156 markings/sec, 50 secs
lola: 13151348 markings, 19792058 edges, 222516 markings/sec, 55 secs
lola: 14288024 markings, 21502665 edges, 227335 markings/sec, 60 secs
lola: 15375608 markings, 23139450 edges, 217517 markings/sec, 65 secs
lola: 16515027 markings, 24854234 edges, 227884 markings/sec, 70 secs
lola: 17572338 markings, 26445401 edges, 211462 markings/sec, 75 secs
lola: 18598871 markings, 27990322 edges, 205307 markings/sec, 80 secs
lola: 19586376 markings, 29476432 edges, 197501 markings/sec, 85 secs
lola: 20565607 markings, 30950122 edges, 195846 markings/sec, 90 secs
lola: 21522328 markings, 32389941 edges, 191344 markings/sec, 95 secs
lola: 22521038 markings, 33892938 edges, 199742 markings/sec, 100 secs
lola: 23483162 markings, 35340885 edges, 192425 markings/sec, 105 secs
lola: 24445861 markings, 36789697 edges, 192540 markings/sec, 110 secs
lola: 25042214 markings, 37687595 edges, 119271 markings/sec, 115 secs
lola: 25337594 markings, 38132145 edges, 59076 markings/sec, 120 secs
lola: 25619284 markings, 38555682 edges, 56338 markings/sec, 125 secs
lola: 26202016 markings, 39432640 edges, 116546 markings/sec, 130 secs
lola: 26524619 markings, 39918110 edges, 64521 markings/sec, 135 secs
lola: 27341482 markings, 41147536 edges, 163373 markings/sec, 140 secs
lola: 28049957 markings, 42213736 edges, 141695 markings/sec, 145 secs
lola: 28789104 markings, 43326067 edges, 147829 markings/sec, 150 secs
lola: 29504708 markings, 44403086 edges, 143121 markings/sec, 155 secs
lola: 30206916 markings, 45459833 edges, 140442 markings/sec, 160 secs
lola: 30631358 markings, 46098580 edges, 84888 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p326) AND (1 <= p327) AND (1 <= p329))) OR ((1 <= p326) AND (1 <= p327) AND (1 <= p329))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p326) AND (1 <= p327) AND (1 <= p329))) OR ((1 <= p326) AND (1 <= p327) AND (1 <= p329))))
lola: processed formula length: 104
lola: 67 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 5 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((((1 <= p81) AND (1 <= p82) AND (1 <= p84)) OR ((1 <= p131) AND (1 <= p132) AND (1 <= p134))))) OR (1 <= p268)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((((1 <= p81) AND (1 <= p82) AND (1 <= p84)) OR ((1 <= p131) AND (1 <= p132) AND (1 <= p134))))) OR (1 <= p268)))
lola: processed formula length: 123
lola: 67 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 6 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((1 <= p72)) OR ((1 <= p145) OR (((p452 <= 0) OR (1 <= p448)) AND ((1 <= p72) OR (1 <= p448)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((1 <= p72)) OR ((1 <= p145) OR (((p452 <= 0) OR (1 <= p448)) AND ((1 <= p72) OR (1 <= p448)))))))
lola: processed formula length: 109
lola: 67 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 7 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p87 <= 0)))) AND (p230 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p230 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p230 <= 0)
lola: processed formula length: 11
lola: 67 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 8 will run for 1067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p87 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p87 <= 0))))
lola: processed formula length: 22
lola: 67 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: 102 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p378) U G ((1 <= p138))) OR G ((1 <= p297))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p378) U G ((1 <= p138))) OR G ((1 <= p297))))
lola: processed formula length: 56
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 993659 markings, 1495321 edges, 198732 markings/sec, 0 secs
lola: 2030350 markings, 3055494 edges, 207338 markings/sec, 5 secs
lola: 3081895 markings, 4638007 edges, 210309 markings/sec, 10 secs
lola: 4140187 markings, 6230761 edges, 211658 markings/sec, 15 secs
lola: 5183520 markings, 7800839 edges, 208667 markings/sec, 20 secs
lola: 6214236 markings, 9352064 edges, 206143 markings/sec, 25 secs
lola: 7209437 markings, 10849714 edges, 199040 markings/sec, 30 secs
lola: 8229811 markings, 12385370 edges, 204075 markings/sec, 35 secs
lola: 9241186 markings, 13907472 edges, 202275 markings/sec, 40 secs
lola: 10304227 markings, 15507304 edges, 212608 markings/sec, 45 secs
lola: 11363131 markings, 17100859 edges, 211781 markings/sec, 50 secs
lola: 12391686 markings, 18648758 edges, 205711 markings/sec, 55 secs
lola: 13403961 markings, 20172209 edges, 202455 markings/sec, 60 secs
lola: 14434145 markings, 21722572 edges, 206037 markings/sec, 65 secs
lola: 15372347 markings, 23134528 edges, 187640 markings/sec, 70 secs
lola: 16367666 markings, 24632412 edges, 199064 markings/sec, 75 secs
lola: 17391451 markings, 26173203 edges, 204757 markings/sec, 80 secs
lola: 18445550 markings, 27759514 edges, 210820 markings/sec, 85 secs
lola: 19391844 markings, 29183730 edges, 189259 markings/sec, 90 secs
lola: 20398706 markings, 30698923 edges, 201372 markings/sec, 95 secs
lola: 21507635 markings, 32367821 edges, 221786 markings/sec, 100 secs
lola: 22545937 markings, 33930390 edges, 207660 markings/sec, 105 secs
lola: 23523197 markings, 35401155 edges, 195452 markings/sec, 110 secs
lola: 24510729 markings, 36887335 edges, 197506 markings/sec, 115 secs
lola: 25081474 markings, 37746420 edges, 114149 markings/sec, 120 secs
lola: 25704080 markings, 38683870 edges, 124521 markings/sec, 125 secs
lola: 26288882 markings, 39563366 edges, 116960 markings/sec, 130 secs
lola: 26770713 markings, 40288503 edges, 96366 markings/sec, 135 secs
lola: 27584642 markings, 41513456 edges, 162786 markings/sec, 140 secs
lola: 28249775 markings, 42514401 edges, 133027 markings/sec, 145 secs
lola: 29005527 markings, 43651823 edges, 151150 markings/sec, 150 secs
lola: 29558816 markings, 44484472 edges, 110658 markings/sec, 155 secs
lola: 30333275 markings, 45649961 edges, 154892 markings/sec, 160 secs
lola: 30597514 markings, 46047619 edges, 52848 markings/sec, 165 secs
lola: 30630212 markings, 46096879 edges, 6540 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((p70 <= 0))) OR F ((((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)) AND (G ((1 <= p70)) R F ((p70 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p70 <= 0))) OR F ((((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)) AND (G ((1 <= p70)) R F ((p70 <= 0)))))))
lola: processed formula length: 117
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 2736 markings, 4423 edges
lola: ========================================
lola: subprocess 10 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((1 <= p121) AND (1 <= p122) AND (1 <= p124))) OR (G (((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND F (((1 <= p121) AND (1 <= p122) AND (1 <= p124)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((1 <= p121) AND (1 <= p122) AND (1 <= p124))) OR (G (((1 <= p151) AND (1 <= p152) AND (1 <= p154))) AND F (((1 <= p121) AND (1 <= p122) AND (1 <= p124)))))))
lola: processed formula length: 168
lola: 67 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: 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: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((X ((G (F ((p493 <= 0))) OR (p113 <= 0))) OR G (((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((G (F ((p493 <= 0))) OR (p113 <= 0))) OR G (((p171 <= 0) OR (p172 <= 0) OR (p174 <= 0)))))
lola: processed formula length: 99
lola: 67 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: 1142831 markings, 1719778 edges, 228566 markings/sec, 0 secs
lola: 2250371 markings, 3386617 edges, 221508 markings/sec, 5 secs
lola: 3300819 markings, 4967435 edges, 210090 markings/sec, 10 secs
lola: 4381320 markings, 6593536 edges, 216100 markings/sec, 15 secs
lola: 5640966 markings, 8489251 edges, 251929 markings/sec, 20 secs
lola: 6735414 markings, 10136333 edges, 218890 markings/sec, 25 secs
lola: 7833755 markings, 11789257 edges, 219668 markings/sec, 30 secs
lola: 8921751 markings, 13426661 edges, 217599 markings/sec, 35 secs
lola: 10037426 markings, 15105685 edges, 223135 markings/sec, 40 secs
lola: 11137160 markings, 16760724 edges, 219947 markings/sec, 45 secs
lola: 12228613 markings, 18403331 edges, 218291 markings/sec, 50 secs
lola: 13137775 markings, 19771545 edges, 181832 markings/sec, 55 secs
lola: 14152670 markings, 21298935 edges, 202979 markings/sec, 60 secs
lola: 15088715 markings, 22707674 edges, 187209 markings/sec, 65 secs
lola: 16102264 markings, 24232983 edges, 202710 markings/sec, 70 secs
lola: 17102950 markings, 25738973 edges, 200137 markings/sec, 75 secs
lola: 18197219 markings, 27385739 edges, 218854 markings/sec, 80 secs
lola: 19155436 markings, 28827849 edges, 191643 markings/sec, 85 secs
lola: 20131957 markings, 30297413 edges, 195304 markings/sec, 90 secs
lola: 21061241 markings, 31696046 edges, 185857 markings/sec, 95 secs
lola: 22046524 markings, 33178745 edges, 197057 markings/sec, 100 secs
lola: 23042122 markings, 34677143 edges, 199120 markings/sec, 105 secs
lola: 23998370 markings, 36116190 edges, 191250 markings/sec, 110 secs
lola: 24834872 markings, 37375253 edges, 167300 markings/sec, 115 secs
lola: 25417886 markings, 38252995 edges, 116603 markings/sec, 120 secs
lola: 25928045 markings, 39020309 edges, 102032 markings/sec, 125 secs
lola: 26657487 markings, 40118046 edges, 145888 markings/sec, 130 secs
lola: 27327961 markings, 41127122 edges, 134095 markings/sec, 135 secs
lola: 27961176 markings, 42080057 edges, 126643 markings/sec, 140 secs
lola: 28709769 markings, 43206628 edges, 149719 markings/sec, 145 secs
lola: 29553462 markings, 44476356 edges, 168739 markings/sec, 150 secs
lola: 30180894 markings, 45420600 edges, 125486 markings/sec, 155 secs
lola: 30623019 markings, 46085950 edges, 88425 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p438) R (X ((1 <= p438)) OR (G ((p58 <= 0)) AND F ((p58 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p438) R (X ((1 <= p438)) OR (G ((p58 <= 0)) AND F ((p58 <= 0)))))))
lola: processed formula length: 80
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1030820 markings, 1551232 edges, 206164 markings/sec, 0 secs
lola: 2025626 markings, 3048378 edges, 198961 markings/sec, 5 secs
lola: 3051185 markings, 4591783 edges, 205112 markings/sec, 10 secs
lola: 4066700 markings, 6120105 edges, 203103 markings/sec, 15 secs
lola: 5008605 markings, 7537630 edges, 188381 markings/sec, 20 secs
lola: 6067432 markings, 9131093 edges, 211765 markings/sec, 25 secs
lola: 7127672 markings, 10726663 edges, 212048 markings/sec, 30 secs
lola: 8293590 markings, 12481370 edges, 233184 markings/sec, 35 secs
lola: 9437150 markings, 14202301 edges, 228712 markings/sec, 40 secs
lola: 10589620 markings, 15936827 edges, 230494 markings/sec, 45 secs
lola: 11745689 markings, 17676568 edges, 231214 markings/sec, 50 secs
lola: 12887336 markings, 19394732 edges, 228329 markings/sec, 55 secs
lola: 14056086 markings, 21153579 edges, 233750 markings/sec, 60 secs
lola: 15160183 markings, 22815220 edges, 220819 markings/sec, 65 secs
lola: 16181490 markings, 24352257 edges, 204261 markings/sec, 70 secs
lola: 17202930 markings, 25889504 edges, 204288 markings/sec, 75 secs
lola: 18301996 markings, 27543471 edges, 219813 markings/sec, 80 secs
lola: 19362819 markings, 29139991 edges, 212165 markings/sec, 85 secs
lola: 20400860 markings, 30702168 edges, 207608 markings/sec, 90 secs
lola: 21411564 markings, 32223296 edges, 202141 markings/sec, 95 secs
lola: 22533096 markings, 33911097 edges, 224306 markings/sec, 100 secs
lola: 23662697 markings, 35611101 edges, 225920 markings/sec, 105 secs
lola: 24771293 markings, 37279999 edges, 221719 markings/sec, 110 secs
lola: 25345132 markings, 38143135 edges, 114768 markings/sec, 115 secs
lola: 25827122 markings, 38868442 edges, 96398 markings/sec, 120 secs
lola: 26464405 markings, 39827493 edges, 127457 markings/sec, 125 secs
lola: 27138367 markings, 40841819 edges, 134792 markings/sec, 130 secs
lola: 27842119 markings, 41900977 edges, 140750 markings/sec, 135 secs
lola: 28595862 markings, 43035244 edges, 150749 markings/sec, 140 secs
lola: 29377773 markings, 44212015 edges, 156382 markings/sec, 145 secs
lola: 30149788 markings, 45373889 edges, 154403 markings/sec, 150 secs
lola: 30626395 markings, 46091221 edges, 95321 markings/sec, 155 secs
lola: 30644074 markings, 46117720 edges, 3536 markings/sec, 160 secs
lola: 30644199 markings, 46117877 edges, 25 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p378) U G ((1 <= p138))) OR G ((1 <= p297))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p378) U G ((1 <= p138))) OR G ((1 <= p297))))
lola: processed formula length: 56
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1156640 markings, 1740576 edges, 231328 markings/sec, 0 secs
lola: 2314514 markings, 3483160 edges, 231575 markings/sec, 5 secs
lola: 3490274 markings, 5252605 edges, 235152 markings/sec, 10 secs
lola: 4641861 markings, 6985719 edges, 230317 markings/sec, 15 secs
lola: 5814351 markings, 8750206 edges, 234498 markings/sec, 20 secs
lola: 6965953 markings, 10483340 edges, 230320 markings/sec, 25 secs
lola: 8135690 markings, 12243776 edges, 233947 markings/sec, 30 secs
lola: 9306265 markings, 14005393 edges, 234115 markings/sec, 35 secs
lola: 10500524 markings, 15802705 edges, 238852 markings/sec, 40 secs
lola: 11665805 markings, 17556333 edges, 233056 markings/sec, 45 secs
lola: 12823377 markings, 19298478 edges, 231514 markings/sec, 50 secs
lola: 13999691 markings, 21068765 edges, 235263 markings/sec, 55 secs
lola: 15161181 markings, 22816716 edges, 232298 markings/sec, 60 secs
lola: 16333100 markings, 24580438 edges, 234384 markings/sec, 65 secs
lola: 17503093 markings, 26341188 edges, 233999 markings/sec, 70 secs
lola: 18686864 markings, 28122742 edges, 236754 markings/sec, 75 secs
lola: 19856279 markings, 29882613 edges, 233883 markings/sec, 80 secs
lola: 21035005 markings, 31656588 edges, 235745 markings/sec, 85 secs
lola: 22208035 markings, 33421898 edges, 234606 markings/sec, 90 secs
lola: 23384840 markings, 35192952 edges, 235361 markings/sec, 95 secs
lola: 24562157 markings, 36964704 edges, 235463 markings/sec, 100 secs
lola: 25187550 markings, 37905992 edges, 125079 markings/sec, 105 secs
lola: 25633348 markings, 38577380 edges, 89160 markings/sec, 110 secs
lola: 26418969 markings, 39759121 edges, 157124 markings/sec, 115 secs
lola: 27073496 markings, 40744199 edges, 130905 markings/sec, 120 secs
lola: 27703329 markings, 41692044 edges, 125967 markings/sec, 125 secs
lola: 28471325 markings, 42847817 edges, 153599 markings/sec, 130 secs
lola: 29215625 markings, 43968008 edges, 148860 markings/sec, 135 secs
lola: 29948803 markings, 45071395 edges, 146636 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no yes no unknown no
lola:
preliminary result: no unknown no no unknown no no yes no unknown no
lola: memory consumption: 3484 KB
lola: time consumption: 1041 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-100101"
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-100101, 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-162089432900350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 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 '
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 ;