Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231000234.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 ShieldIIPt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231000234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 212K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-040A-00
FORMULA_NAME ShieldIIPt-PT-040A-01
FORMULA_NAME ShieldIIPt-PT-040A-02
FORMULA_NAME ShieldIIPt-PT-040A-03
FORMULA_NAME ShieldIIPt-PT-040A-04
FORMULA_NAME ShieldIIPt-PT-040A-05
FORMULA_NAME ShieldIIPt-PT-040A-06
FORMULA_NAME ShieldIIPt-PT-040A-07
FORMULA_NAME ShieldIIPt-PT-040A-08
FORMULA_NAME ShieldIIPt-PT-040A-09
FORMULA_NAME ShieldIIPt-PT-040A-10
FORMULA_NAME ShieldIIPt-PT-040A-11
FORMULA_NAME ShieldIIPt-PT-040A-12
FORMULA_NAME ShieldIIPt-PT-040A-13
FORMULA_NAME ShieldIIPt-PT-040A-14
FORMULA_NAME ShieldIIPt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1621149122999

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 07:12:04] [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-16 07:12:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 07:12:04] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2021-05-16 07:12:04] [INFO ] Transformed 763 places.
[2021-05-16 07:12:04] [INFO ] Transformed 563 transitions.
[2021-05-16 07:12:04] [INFO ] Found NUPN structural information;
[2021-05-16 07:12:04] [INFO ] Parsed PT model containing 763 places and 563 transitions in 149 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1007 ms. (steps per millisecond=99 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 562 rows 763 cols
[2021-05-16 07:12:05] [INFO ] Computed 361 place invariants in 16 ms
[2021-05-16 07:12:06] [INFO ] [Real]Absence check using 361 positive place invariants in 184 ms returned sat
[2021-05-16 07:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:07] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2021-05-16 07:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:07] [INFO ] [Nat]Absence check using 361 positive place invariants in 227 ms returned sat
[2021-05-16 07:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:08] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2021-05-16 07:12:08] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 67 ms.
[2021-05-16 07:12:15] [INFO ] Added : 556 causal constraints over 115 iterations in 6641 ms. Result :sat
[2021-05-16 07:12:15] [INFO ] [Real]Absence check using 361 positive place invariants in 167 ms returned sat
[2021-05-16 07:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:16] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2021-05-16 07:12:16] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 37 ms.
[2021-05-16 07:12:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:17] [INFO ] [Nat]Absence check using 361 positive place invariants in 166 ms returned sat
[2021-05-16 07:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:18] [INFO ] [Nat]Absence check using state equation in 1010 ms returned sat
[2021-05-16 07:12:18] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 38 ms.
[2021-05-16 07:12:24] [INFO ] Added : 557 causal constraints over 114 iterations in 6677 ms. Result :sat
[2021-05-16 07:12:25] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:26] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2021-05-16 07:12:26] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 33 ms.
[2021-05-16 07:12:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:26] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:27] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2021-05-16 07:12:27] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 32 ms.
[2021-05-16 07:12:33] [INFO ] Added : 554 causal constraints over 112 iterations in 5662 ms. Result :sat
[2021-05-16 07:12:33] [INFO ] [Real]Absence check using 361 positive place invariants in 165 ms returned sat
[2021-05-16 07:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:34] [INFO ] [Real]Absence check using state equation in 1141 ms returned sat
[2021-05-16 07:12:34] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 35 ms.
[2021-05-16 07:12:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:12:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:36] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2021-05-16 07:12:36] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:12:41] [INFO ] Added : 540 causal constraints over 110 iterations in 5300 ms. Result :sat
[2021-05-16 07:12:41] [INFO ] [Real]Absence check using 361 positive place invariants in 160 ms returned sat
[2021-05-16 07:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:42] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2021-05-16 07:12:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:42] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:43] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2021-05-16 07:12:43] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:12:49] [INFO ] Added : 549 causal constraints over 112 iterations in 5775 ms. Result :sat
[2021-05-16 07:12:49] [INFO ] [Real]Absence check using 361 positive place invariants in 161 ms returned sat
[2021-05-16 07:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:50] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2021-05-16 07:12:51] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:12:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:51] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:52] [INFO ] [Nat]Absence check using state equation in 1010 ms returned sat
[2021-05-16 07:12:52] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:12:57] [INFO ] Added : 557 causal constraints over 112 iterations in 5502 ms. Result :sat
[2021-05-16 07:12:58] [INFO ] [Real]Absence check using 361 positive place invariants in 160 ms returned sat
[2021-05-16 07:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:12:59] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2021-05-16 07:12:59] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:12:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:12:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:00] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2021-05-16 07:13:00] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:13:06] [INFO ] Added : 555 causal constraints over 113 iterations in 6360 ms. Result :sat
[2021-05-16 07:13:07] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:08] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2021-05-16 07:13:08] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:13:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:08] [INFO ] [Nat]Absence check using 361 positive place invariants in 156 ms returned sat
[2021-05-16 07:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:09] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2021-05-16 07:13:09] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:13:15] [INFO ] Added : 554 causal constraints over 113 iterations in 5477 ms. Result :sat
[2021-05-16 07:13:15] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:16] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2021-05-16 07:13:16] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:13:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:17] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2021-05-16 07:13:17] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:13:23] [INFO ] Added : 550 causal constraints over 113 iterations in 5813 ms. Result :sat
[2021-05-16 07:13:23] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:24] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2021-05-16 07:13:24] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 27 ms.
[2021-05-16 07:13:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:26] [INFO ] [Nat]Absence check using state equation in 964 ms returned sat
[2021-05-16 07:13:26] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:13:32] [INFO ] Added : 552 causal constraints over 114 iterations in 6533 ms. Result :sat
[2021-05-16 07:13:32] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:33] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2021-05-16 07:13:34] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 30 ms.
[2021-05-16 07:13:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:13:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:35] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2021-05-16 07:13:35] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:13:40] [INFO ] Added : 552 causal constraints over 112 iterations in 5287 ms. Result :sat
[2021-05-16 07:13:40] [INFO ] [Real]Absence check using 361 positive place invariants in 160 ms returned sat
[2021-05-16 07:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:41] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2021-05-16 07:13:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:42] [INFO ] [Nat]Absence check using 361 positive place invariants in 160 ms returned sat
[2021-05-16 07:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:43] [INFO ] [Nat]Absence check using state equation in 1014 ms returned sat
[2021-05-16 07:13:43] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 31 ms.
[2021-05-16 07:13:49] [INFO ] Added : 549 causal constraints over 113 iterations in 6028 ms. Result :sat
[2021-05-16 07:13:49] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:50] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2021-05-16 07:13:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:50] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:51] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2021-05-16 07:13:51] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:13:57] [INFO ] Added : 555 causal constraints over 114 iterations in 5577 ms. Result :sat
[2021-05-16 07:13:57] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:58] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2021-05-16 07:13:58] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:13:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:13:58] [INFO ] [Nat]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:13:59] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2021-05-16 07:14:00] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 22 ms.
[2021-05-16 07:14:05] [INFO ] Added : 552 causal constraints over 111 iterations in 5380 ms. Result :sat
[2021-05-16 07:14:05] [INFO ] [Real]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:06] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2021-05-16 07:14:06] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:06] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:07] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2021-05-16 07:14:08] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:14:13] [INFO ] Added : 551 causal constraints over 111 iterations in 5700 ms. Result :sat
[2021-05-16 07:14:13] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:14] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2021-05-16 07:14:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:15] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:16] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2021-05-16 07:14:16] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 32 ms.
[2021-05-16 07:14:23] [INFO ] Added : 558 causal constraints over 117 iterations in 7502 ms. Result :sat
[2021-05-16 07:14:23] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:24] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2021-05-16 07:14:25] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:26] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2021-05-16 07:14:26] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:32] [INFO ] Added : 555 causal constraints over 114 iterations in 6526 ms. Result :sat
[2021-05-16 07:14:33] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:34] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2021-05-16 07:14:34] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:35] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2021-05-16 07:14:35] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:14:41] [INFO ] Added : 551 causal constraints over 112 iterations in 6108 ms. Result :sat
[2021-05-16 07:14:41] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:42] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2021-05-16 07:14:42] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 160 ms returned sat
[2021-05-16 07:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:44] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2021-05-16 07:14:44] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:50] [INFO ] Added : 553 causal constraints over 114 iterations in 6061 ms. Result :sat
[2021-05-16 07:14:50] [INFO ] [Real]Absence check using 361 positive place invariants in 160 ms returned sat
[2021-05-16 07:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:51] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2021-05-16 07:14:51] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:51] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:52] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2021-05-16 07:14:52] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:14:58] [INFO ] Added : 555 causal constraints over 113 iterations in 5401 ms. Result :sat
[2021-05-16 07:14:58] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:14:59] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2021-05-16 07:14:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:14:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:14:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:00] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2021-05-16 07:15:00] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:07] [INFO ] Added : 556 causal constraints over 115 iterations in 7029 ms. Result :sat
[2021-05-16 07:15:08] [INFO ] [Real]Absence check using 361 positive place invariants in 163 ms returned sat
[2021-05-16 07:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:09] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2021-05-16 07:15:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:15:09] [INFO ] [Nat]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:10] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2021-05-16 07:15:10] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:17] [INFO ] Added : 556 causal constraints over 115 iterations in 6968 ms. Result :sat
[2021-05-16 07:15:17] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:18] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2021-05-16 07:15:18] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:15:19] [INFO ] [Nat]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:20] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2021-05-16 07:15:20] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:25] [INFO ] Added : 555 causal constraints over 114 iterations in 5519 ms. Result :sat
[2021-05-16 07:15:25] [INFO ] [Real]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:26] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2021-05-16 07:15:26] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:15:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 156 ms returned sat
[2021-05-16 07:15:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:28] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2021-05-16 07:15:28] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:34] [INFO ] Added : 553 causal constraints over 113 iterations in 6134 ms. Result :sat
[2021-05-16 07:15:34] [INFO ] [Real]Absence check using 361 positive place invariants in 157 ms returned sat
[2021-05-16 07:15:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:35] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2021-05-16 07:15:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:15:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:36] [INFO ] [Nat]Absence check using state equation in 1010 ms returned sat
[2021-05-16 07:15:36] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:15:42] [INFO ] Added : 553 causal constraints over 112 iterations in 5434 ms. Result :sat
[2021-05-16 07:15:42] [INFO ] [Real]Absence check using 361 positive place invariants in 159 ms returned sat
[2021-05-16 07:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:43] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2021-05-16 07:15:43] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 28 ms.
[2021-05-16 07:15:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 07:15:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 158 ms returned sat
[2021-05-16 07:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 07:15:45] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2021-05-16 07:15:45] [INFO ] Computed and/alt/rep : 561/1999/561 causal constraints in 29 ms.
[2021-05-16 07:15:51] [INFO ] Added : 559 causal constraints over 114 iterations in 6885 ms. Result :sat
[2021-05-16 07:15:52] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-16 07:15:52] [INFO ] Flatten gal took : 193 ms
FORMULA ShieldIIPt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 07:15:52] [INFO ] Applying decomposition
[2021-05-16 07:15:52] [INFO ] Flatten gal took : 66 ms
[2021-05-16 07:15:52] [INFO ] Decomposing Gal with order
[2021-05-16 07:15:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 07:15:52] [INFO ] Removed a total of 160 redundant transitions.
[2021-05-16 07:15:52] [INFO ] Flatten gal took : 97 ms
[2021-05-16 07:15:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2021-05-16 07:15:52] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-16 07:15:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-040A @ 3570 seconds

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

FORMULA ShieldIIPt-PT-040A-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-040A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ShieldIIPt-PT-040A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((p308 <= 0) OR (p321 <= 0))) OR (X (G (((1 <= p605)))) OR ((1 <= p240) AND (1 <= p265))))))",
"processed_size": 103,
"rewrites": 67
},
"result":
{
"edges": 1099412,
"markings": 821191,
"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": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 7,
"adisj": 0,
"aneg": 2,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((F (((1 <= p139) AND (1 <= p148))) OR (((1 <= p214) AND (1 <= p225)) OR (G (((p248 <= 0))) AND F ((F (((1 <= p139) AND (1 <= p148))) OR ((1 <= p214) AND (1 <= p225))))))) U (X (((p396 <= 0))) OR ((1 <= p214) AND (1 <= p225))))",
"processed_size": 227,
"rewrites": 67
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 2,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((((p147 <= 0) OR (p162 <= 0)) R ((p334 <= 0) OR (p338 <= 0) OR (p344 <= 0))) U (G ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) OR ((1 <= p147) AND (1 <= p162)))) AND X (((1 <= p334) AND (1 <= p338) AND (1 <= p344))))))",
"processed_size": 229,
"rewrites": 67
},
"result":
{
"edges": 8635,
"markings": 8635,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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 (((p457 <= 0))))",
"processed_size": 21,
"rewrites": 67
},
"result":
{
"edges": 8632,
"markings": 8632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((X (((p704 <= 0))) R ((p100 <= 0) OR (p111 <= 0))) U X (F (((1 <= p704))))))",
"processed_size": 81,
"rewrites": 67
},
"result":
{
"edges": 287,
"markings": 286,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 441
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p671) AND (1 <= p680)) OR ((1 <= p539) AND (1 <= p541)))))",
"processed_size": 73,
"rewrites": 67
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p717 <= 0) OR (p732 <= 0)) U X (X (((1 <= p138) AND (1 <= p149) AND (1 <= p690) AND (1 <= p699)))))",
"processed_size": 103,
"rewrites": 67
},
"result":
{
"edges": 8632,
"markings": 8632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 6,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "F (((F (((p223 <= 0))) U ((1 <= p405) AND (1 <= p414))) OR (G (((1 <= p223))) AND F (((1 <= p405) AND (1 <= p414))))))",
"processed_size": 118,
"rewrites": 67
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"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": "G ((X (((1 <= p521) AND (1 <= p532))) OR (F (((1 <= p481) AND (1 <= p490))) AND X ((((1 <= p706) AND (1 <= p723)) OR F (((1 <= p521) AND (1 <= p532))))))))",
"processed_size": 155,
"rewrites": 67
},
"result":
{
"edges": 10014,
"markings": 10014,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1178
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "F (G ((((p204 <= 0) OR (p219 <= 0)) AND ((p225 <= 0)))))",
"processed_size": 57,
"rewrites": 67
},
"result":
{
"edges": 28893,
"markings": 28853,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1767
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((F (((1 <= p423) AND (1 <= p434))) AND (((1 <= p688) AND (1 <= p701)) OR ((1 <= p423) AND (1 <= p434)))))) AND (((1 <= p387)) AND (((1 <= p389)) AND (((1 <= p723)) OR ((1 <= p638) AND (1 <= p642) AND (1 <= p648))))))))",
"processed_size": 232,
"rewrites": 67
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 3534
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p681 <= 0))",
"processed_size": 13,
"rewrites": 69
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 50760,
"runtime": 36.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) OR (X(G(**)) OR **)))) : ((F(**) OR (** OR (G(*) AND F((F(**) OR **))))) U (X(*) OR **)) : F(G((F(G((F(**) AND (** OR **)))) AND (** AND (** AND **))))) : X(((* R *) U (G(**) AND X(**)))) : X(G(**)) : X(((X(*) R *) U X(F(**)))) : (G(F(**)) AND (X(*) AND **)) : ((** U X(X(**))) OR (G(**) OR (** OR **))) : (F(((F(*) U **) OR (G(**) AND F(**)))) AND X(*)) : (F(G(*)) AND (F(**) OR (G(**) AND F(**)))) : X((G(((* R X(*)) AND **)) OR **)) : F(G(*)) : G((X(**) OR (F(**) AND X((** OR F(**))))))"
},
"net":
{
"arcs": 2404,
"conflict_clusters": 283,
"places": 763,
"places_significant": 402,
"singleton_clusters": 0,
"transitions": 562
},
"result":
{
"preliminary_value": "no yes no no no no no no no no no no no ",
"value": "no yes no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1325/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 763
lola: finding significant places
lola: 763 places, 562 transitions, 402 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p605 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p688 <= 1)
lola: LP says that atomic proposition is always true: (p701 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p389 <= 1)
lola: LP says that atomic proposition is always true: (p723 <= 1)
lola: LP says that atomic proposition is always true: (p638 <= 1)
lola: LP says that atomic proposition is always true: (p642 <= 1)
lola: LP says that atomic proposition is always true: (p648 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p334 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p344 <= 1)
lola: LP says that atomic proposition is always true: (p296 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p306 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p334 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p344 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: LP says that atomic proposition is always true: (p704 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p704 <= 1)
lola: LP says that atomic proposition is always true: (p671 <= 1)
lola: LP says that atomic proposition is always true: (p680 <= 1)
lola: LP says that atomic proposition is always true: (p539 <= 1)
lola: LP says that atomic proposition is always true: (p541 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p717 <= 1)
lola: LP says that atomic proposition is always true: (p732 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p690 <= 1)
lola: LP says that atomic proposition is always true: (p699 <= 1)
lola: LP says that atomic proposition is always true: (p448 <= 1)
lola: LP says that atomic proposition is always true: (p452 <= 1)
lola: LP says that atomic proposition is always true: (p458 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p405 <= 1)
lola: LP says that atomic proposition is always true: (p414 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p681 <= 1)
lola: LP says that atomic proposition is always true: (p681 <= 1)
lola: LP says that atomic proposition is always true: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p681 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p219 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p521 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: LP says that atomic proposition is always true: (p481 <= 1)
lola: LP says that atomic proposition is always true: (p490 <= 1)
lola: LP says that atomic proposition is always true: (p706 <= 1)
lola: LP says that atomic proposition is always true: (p723 <= 1)
lola: LP says that atomic proposition is always true: (p521 <= 1)
lola: LP says that atomic proposition is always true: (p532 <= 1)
lola: X (F (G (((F (((p308 <= 0) OR (p321 <= 0))) OR G (X (((1 <= p605))))) OR ((1 <= p240) AND (1 <= p265)))))) : ((NOT(F (((1 <= p248)))) U (F (((1 <= p139) AND (1 <= p148))) OR ((1 <= p214) AND (1 <= p225)))) U (NOT(X (((1 <= p396)))) OR ((1 <= p214) AND (1 <= p225)))) : G (F (G ((((F (X (G ((((1 <= p688) AND (1 <= p701)) U ((1 <= p423) AND (1 <= p434)))))) AND ((1 <= p387))) AND ((1 <= p389))) AND (((1 <= p723)) OR ((1 <= p638) AND (1 <= p642) AND (1 <= p648))))))) : X ((NOT((((1 <= p147) AND (1 <= p162)) U ((1 <= p334) AND (1 <= p338) AND (1 <= p344)))) U (G ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) OR ((1 <= p147) AND (1 <= p162)))) AND X (((1 <= p334) AND (1 <= p338) AND (1 <= p344)))))) : NOT(X (F (NOT(G (((p457 <= 0))))))) : X ((NOT((X (((1 <= p704))) U ((1 <= p100) AND (1 <= p111)))) U F (X (((1 <= p704)))))) : ((X (G (F ((((1 <= p671) AND (1 <= p680)) OR ((1 <= p539) AND (1 <= p541)))))) AND NOT(X (((p290 <= 0) OR (p301 <= 0))))) AND ((p1 <= 0) OR (p18 <= 0))) : ((((((p717 <= 0) OR (p732 <= 0)) U X (X (((1 <= p138) AND (1 <= p149) AND (1 <= p690) AND (1 <= p699))))) OR G (((1 <= p448) AND (1 <= p452) AND (1 <= p458)))) OR ((1 <= p423) AND (1 <= p434))) OR ((1 <= p138) AND (1 <= p149))) : (F ((G (((1 <= p223))) U (NOT(G (((1 <= p223)))) U ((1 <= p405) AND (1 <= p414))))) AND NOT(X (((1 <= p43) AND (1 <= p54))))) : (F (NOT(X (F (G (F (((1 <= p681)))))))) AND (G (((1 <= p681) AND (1 <= p337))) U F (((1 <= p681))))) : X ((G ((NOT((((1 <= p510)) U X (((1 <= p163) AND (1 <= p167) AND (1 <= p173))))) AND ((p163 <= 0) OR (p167 <= 0) OR (p173 <= 0)))) OR ((1 <= p280)))) : F (G (F (NOT(F (X (F ((((1 <= p204) AND (1 <= p219)) OR ((1 <= p225)))))))))) : G ((X (((1 <= p521) AND (1 <= p532))) OR (F (((1 <= p481) AND (1 <= p490))) AND (X (((1 <= p706) AND (1 <= p723))) OR F (X (((1 <= p521) AND (1 <= p532))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p308 <= 0) OR (p321 <= 0))) OR (X (G (((1 <= p605)))) OR ((1 <= p240) AND (1 <= p265))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p308 <= 0) OR (p321 <= 0))) OR (X (G (((1 <= p605)))) OR ((1 <= p240) AND (1 <= p265))))))
lola: processed formula length: 103
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 777243 markings, 1042117 edges, 155449 markings/sec, 0 secs
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: 821191 markings, 1099412 edges
lola: ========================================
lola: subprocess 1 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p139) AND (1 <= p148))) OR (((1 <= p214) AND (1 <= p225)) OR (G (((p248 <= 0))) AND F ((F (((1 <= p139) AND (1 <= p148))) OR ((1 <= p214) AND (1 <= p225))))))) U (X (((p396 <= 0))) OR ((1 <= p214) AND (1 <= p225))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p139) AND (1 <= p148))) OR (((1 <= p214) AND (1 <= p225)) OR (G (((p248 <= 0))) AND F ((F (((1 <= p139) AND (1 <= p148))) OR ((1 <= p214) AND (1 <= p225))))))) U (X (((p396 <= 0))) OR ((1 <= p214) AND (1 <= p225))))
lola: processed formula length: 227
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: 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p147 <= 0) OR (p162 <= 0)) R ((p334 <= 0) OR (p338 <= 0) OR (p344 <= 0))) U (G ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) OR ((1 <= p147) AND (1 <= p162)))) AND X (((1 <= p334) AND (1 <= p338) AND (1 <= p344))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p147 <= 0) OR (p162 <= 0)) R ((p334 <= 0) OR (p338 <= 0) OR (p344 <= 0))) U (G ((((1 <= p296) AND (1 <= p300) AND (1 <= p306)) OR ((1 <= p147) AND (1 <= p162)))) AND X (((1 <= p334) AND (1 <= p338) AND (1 <= p344))))))
lola: processed formula length: 229
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 8635 markings, 8635 edges
lola: ========================================
lola: subprocess 3 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p457 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p457 <= 0))))
lola: processed formula length: 21
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: 8632 markings, 8632 edges
lola: ========================================
lola: subprocess 4 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((p704 <= 0))) R ((p100 <= 0) OR (p111 <= 0))) U X (F (((1 <= p704))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((p704 <= 0))) R ((p100 <= 0) OR (p111 <= 0))) U X (F (((1 <= p704))))))
lola: processed formula length: 81
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: 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: 286 markings, 287 edges
lola: ========================================
lola: subprocess 5 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((1 <= p671) AND (1 <= p680)) OR ((1 <= p539) AND (1 <= p541))))) AND (X (((1 <= p290) AND (1 <= p301))) AND ((p1 <= 0) OR (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) OR (p18 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1 <= 0) OR (p18 <= 0))
lola: processed formula length: 26
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p671) AND (1 <= p680)) OR ((1 <= p539) AND (1 <= p541)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p671) AND (1 <= p680)) OR ((1 <= p539) AND (1 <= p541)))))
lola: processed formula length: 73
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p717 <= 0) OR (p732 <= 0)) U X (X (((1 <= p138) AND (1 <= p149) AND (1 <= p690) AND (1 <= p699))))) OR (G (((1 <= p448) AND (1 <= p452) AND (1 <= p458))) OR (((1 <= p423) AND (1 <= p434)) OR ((1 <= p138) AND (1 <= p149)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p423) AND (1 <= p434)) OR ((1 <= p138) AND (1 <= p149)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p423) AND (1 <= p434)) OR ((1 <= p138) AND (1 <= p149)))
lola: processed formula length: 64
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 7 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p448) AND (1 <= p452) AND (1 <= p458)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p448) AND (1 <= p452) AND (1 <= p458)))
lola: processed formula length: 49
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p717 <= 0) OR (p732 <= 0)) U X (X (((1 <= p138) AND (1 <= p149) AND (1 <= p690) AND (1 <= p699)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p717 <= 0) OR (p732 <= 0)) U X (X (((1 <= p138) AND (1 <= p149) AND (1 <= p690) AND (1 <= p699)))))
lola: processed formula length: 103
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8632 markings, 8632 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((F (((p223 <= 0))) U ((1 <= p405) AND (1 <= p414))) OR (G (((1 <= p223))) AND F (((1 <= p405) AND (1 <= p414)))))) AND X (((p43 <= 0) OR (p54 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p43 <= 0) OR (p54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p43 <= 0) OR (p54 <= 0)))
lola: processed formula length: 31
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((F (((p223 <= 0))) U ((1 <= p405) AND (1 <= p414))) OR (G (((1 <= p223))) AND F (((1 <= p405) AND (1 <= p414))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((F (((p223 <= 0))) U ((1 <= p405) AND (1 <= p414))) OR (G (((1 <= p223))) AND F (((1 <= p405) AND (1 <= p414))))))
lola: processed formula length: 118
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((((p510 <= 0)) R X (((p163 <= 0) OR (p167 <= 0) OR (p173 <= 0)))) AND ((p163 <= 0) OR (p167 <= 0) OR (p173 <= 0)))) OR ((1 <= p280))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((((p510 <= 0)) R X (((p163 <= 0) OR (p167 <= 0) OR (p173 <= 0)))) AND ((p163 <= 0) OR (p167 <= 0) OR (p173 <= 0)))) OR ((1 <= p280))))
lola: processed formula length: 146
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9107 markings, 9108 edges
lola: ========================================
lola: subprocess 9 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p521) AND (1 <= p532))) OR (F (((1 <= p481) AND (1 <= p490))) AND X ((((1 <= p706) AND (1 <= p723)) OR F (((1 <= p521) AND (1 <= p532))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p521) AND (1 <= p532))) OR (F (((1 <= p481) AND (1 <= p490))) AND X ((((1 <= p706) AND (1 <= p723)) OR F (((1 <= p521) AND (1 <= p532))))))))
lola: processed formula length: 155
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: 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: 10014 markings, 10014 edges
lola: ========================================
lola: subprocess 10 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p204 <= 0) OR (p219 <= 0)) AND ((p225 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p204 <= 0) OR (p219 <= 0)) AND ((p225 <= 0)))))
lola: processed formula length: 57
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: 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: 28853 markings, 28893 edges
lola: ========================================
lola: subprocess 11 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((F (((1 <= p423) AND (1 <= p434))) AND (((1 <= p688) AND (1 <= p701)) OR ((1 <= p423) AND (1 <= p434)))))) AND (((1 <= p387)) AND (((1 <= p389)) AND (((1 <= p723)) OR ((1 <= p638) AND (1 <= p642) AND (1 <= p648))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((F (((1 <= p423) AND (1 <= p434))) AND (((1 <= p688) AND (1 <= p701)) OR ((1 <= p423) AND (1 <= p434)))))) AND (((1 <= p387)) AND (((1 <= p389)) AND (((1 <= p723)) OR ((1 <= p638) AND (1 <= p642) AND (1 <= p648))))))))
lola: processed formula length: 232
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 12 will run for 3534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p681 <= 0)))) AND (F (((1 <= p681))) OR (G (((1 <= p681) AND (1 <= p337))) AND F (((1 <= p681))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p681)))
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: ((p681 <= 0))
lola: processed formula length: 13
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no no no
lola:
preliminary result: no yes no no no no no no no no no no no
lola: memory consumption: 50760 KB
lola: time consumption: 36 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="ShieldIIPt-PT-040A"
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 ShieldIIPt-PT-040A, 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 r227-tall-162098231000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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