Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871800410.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is PolyORBLF-PT-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871800410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.9K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 10 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 862K Mar 24 05:37 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 PolyORBLF-PT-S02J04T06-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-15

=== Now, execution of the tool begins

BK_START 1591150840731

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:20:42] [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]
[2020-06-03 02:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:20:42] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2020-06-03 02:20:42] [INFO ] Transformed 476 places.
[2020-06-03 02:20:42] [INFO ] Transformed 920 transitions.
[2020-06-03 02:20:42] [INFO ] Parsed PT model containing 476 places and 920 transitions in 148 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 31 resets, run finished after 408 ms. (steps per millisecond=245 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0]
[2020-06-03 02:20:42] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2020-06-03 02:20:43] [INFO ] Computed 46 place invariants in 46 ms
[2020-06-03 02:20:43] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 02:20:43] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 26 ms returned sat
[2020-06-03 02:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:44] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2020-06-03 02:20:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:20:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 02:20:44] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 33 ms returned sat
[2020-06-03 02:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:20:46] [INFO ] [Nat]Absence check using state equation in 1794 ms returned sat
[2020-06-03 02:20:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-03 02:20:46] [INFO ] [Nat]Added 78 Read/Feed constraints in 654 ms returned sat
[2020-06-03 02:20:47] [INFO ] Deduced a trap composed of 263 places in 371 ms
[2020-06-03 02:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 651 ms
[2020-06-03 02:20:47] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 83 ms.
[2020-06-03 02:20:58] [INFO ] Added : 45 causal constraints over 9 iterations in 11112 ms. Result :unknown
[2020-06-03 02:20:58] [INFO ] [Real]Absence check using 11 positive place invariants in 36 ms returned sat
[2020-06-03 02:20:58] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 51 ms returned sat
[2020-06-03 02:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:00] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2020-06-03 02:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 38 ms returned sat
[2020-06-03 02:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:02] [INFO ] [Nat]Absence check using state equation in 1617 ms returned sat
[2020-06-03 02:21:02] [INFO ] [Nat]Added 78 Read/Feed constraints in 166 ms returned sat
[2020-06-03 02:21:02] [INFO ] Deduced a trap composed of 223 places in 360 ms
[2020-06-03 02:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2020-06-03 02:21:03] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 86 ms.
[2020-06-03 02:21:20] [INFO ] Added : 670 causal constraints over 134 iterations in 17514 ms. Result :unknown
[2020-06-03 02:21:20] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 02:21:20] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 42 ms returned sat
[2020-06-03 02:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:22] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2020-06-03 02:21:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 02:21:22] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 38 ms returned sat
[2020-06-03 02:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:23] [INFO ] [Nat]Absence check using state equation in 1620 ms returned sat
[2020-06-03 02:21:24] [INFO ] [Nat]Added 78 Read/Feed constraints in 868 ms returned sat
[2020-06-03 02:21:24] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 45 ms.
[2020-06-03 02:21:42] [INFO ] Added : 635 causal constraints over 127 iterations in 17347 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 02:21:42] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 02:21:42] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 40 ms returned sat
[2020-06-03 02:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:43] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2020-06-03 02:21:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 02:21:43] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 25 ms returned sat
[2020-06-03 02:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:45] [INFO ] [Nat]Absence check using state equation in 1350 ms returned sat
[2020-06-03 02:21:45] [INFO ] [Nat]Added 78 Read/Feed constraints in 447 ms returned sat
[2020-06-03 02:21:45] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 105 ms.
[2020-06-03 02:22:03] [INFO ] Added : 665 causal constraints over 133 iterations in 18084 ms. Result :unknown
[2020-06-03 02:22:03] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 02:22:03] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 25 ms returned sat
[2020-06-03 02:22:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:04] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2020-06-03 02:22:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:22:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 02:22:04] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 36 ms returned sat
[2020-06-03 02:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:06] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2020-06-03 02:22:06] [INFO ] [Nat]Added 78 Read/Feed constraints in 270 ms returned sat
[2020-06-03 02:22:06] [INFO ] Deduced a trap composed of 65 places in 330 ms
[2020-06-03 02:22:07] [INFO ] Deduced a trap composed of 245 places in 331 ms
[2020-06-03 02:22:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 969 ms
[2020-06-03 02:22:07] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 69 ms.
[2020-06-03 02:22:24] [INFO ] Added : 595 causal constraints over 119 iterations in 17233 ms. Result :unknown
[2020-06-03 02:22:25] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-06-03 02:22:25] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 65 ms returned sat
[2020-06-03 02:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:27] [INFO ] [Real]Absence check using state equation in 2345 ms returned sat
[2020-06-03 02:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:22:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 02:22:27] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 45 ms returned sat
[2020-06-03 02:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:30] [INFO ] [Nat]Absence check using state equation in 2519 ms returned sat
[2020-06-03 02:22:30] [INFO ] [Nat]Added 78 Read/Feed constraints in 164 ms returned sat
[2020-06-03 02:22:30] [INFO ] Deduced a trap composed of 240 places in 292 ms
[2020-06-03 02:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2020-06-03 02:22:30] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 118 ms.
[2020-06-03 02:22:47] [INFO ] Added : 360 causal constraints over 72 iterations in 16697 ms. Result :unknown
[2020-06-03 02:22:47] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 02:22:47] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 43 ms returned sat
[2020-06-03 02:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:48] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2020-06-03 02:22:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:22:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 80 ms returned sat
[2020-06-03 02:22:49] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 30 ms returned sat
[2020-06-03 02:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:22:51] [INFO ] [Nat]Absence check using state equation in 2207 ms returned sat
[2020-06-03 02:22:51] [INFO ] [Nat]Added 78 Read/Feed constraints in 481 ms returned sat
[2020-06-03 02:22:51] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 58 ms.
[2020-06-03 02:22:59] [INFO ] Added : 35 causal constraints over 7 iterations in 7711 ms. Result :unknown
[2020-06-03 02:22:59] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 02:22:59] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 83 ms returned unsat
[2020-06-03 02:22:59] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 02:22:59] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 50 ms returned sat
[2020-06-03 02:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:23:01] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2020-06-03 02:23:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:23:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 51 ms returned sat
[2020-06-03 02:23:01] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 94 ms returned sat
[2020-06-03 02:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:23:04] [INFO ] [Nat]Absence check using state equation in 2662 ms returned sat
[2020-06-03 02:23:04] [INFO ] [Nat]Added 78 Read/Feed constraints in 492 ms returned sat
[2020-06-03 02:23:04] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 104 ms.
[2020-06-03 02:23:12] [INFO ] Added : 35 causal constraints over 7 iterations in 7640 ms. Result :unknown
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 35 ms returned unsat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 20 ms returned unsat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 23 ms returned unsat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 02:23:12] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 34 ms returned sat
[2020-06-03 02:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:23:15] [INFO ] [Real]Absence check using state equation in 2299 ms returned sat
[2020-06-03 02:23:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:23:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 02:23:15] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 41 ms returned sat
[2020-06-03 02:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:23:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:23:25] [INFO ] [Nat]Absence check using state equation in 10188 ms returned unknown
[2020-06-03 02:23:25] [INFO ] [Real]Absence check using 11 positive place invariants in 78 ms returned sat
[2020-06-03 02:23:25] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 40 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 02:23:26] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 02:23:26] [INFO ] Flatten gal took : 126 ms
FORMULA PolyORBLF-PT-S02J04T06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:23:26] [INFO ] Flatten gal took : 55 ms
[2020-06-03 02:23:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 21 ms.
[2020-06-03 02:23:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PolyORBLF-PT-S02J04T06 @ 3570 seconds
check_solution: Constraint R4 = 23.2422089317 is above its equality of 0
check_solution: Constraint R5 = 1 is above its equality of -9
check_solution: Constraint R6 = 972.906266689 is above its equality of 0
check_solution: Constraint R8 = 1 is above its equality of 0
check_solution: Constraint R9 = 1 is above its equality of 0
check_solution: Constraint R10 = 6.30323352701 is above its equality of 0
check_solution: Constraint R11 = 1 is above its equality of 0
check_solution: Constraint R12 = 6.93701634031 is above its equality of 0
check_solution: Constraint R13 = 1 is above its equality of 0
check_solution: Constraint R14 = 54.8512531562 is above its equality of 0

Seriously low accuracy found ||*|| = 1.0973e+06 (rel. error 548649)
check_solution: Variable C1103 = -4 is below its lower bound 0
check_solution: Variable C1161 = -4 is below its lower bound 0
check_solution: Variable C1219 = -4 is below its lower bound 0
check_solution: Variable C1271 = -1 is below its lower bound 0
check_solution: Constraint R4 = 1 is above its equality of 0
check_solution: Constraint R5 = 1 is above its equality of -9
check_solution: Constraint R6 = 1 is above its equality of 0
check_solution: Constraint R7 = 1 is above its equality of 0
check_solution: Constraint R8 = 1 is above its equality of 0
check_solution: Constraint R9 = 1 is above its equality of 0

Seriously low accuracy found ||*|| = 11 (rel. error 4)
check_solution: Constraint R5 = 1.23712354641e-311 is above its equality of -9
check_solution: Constraint R24 = 2.07955587563e-311 is above its equality of -1
check_solution: Constraint R30 = 2.20899761891e-311 is above its equality of -1
check_solution: Constraint R93 = 1.11829178209e-311 is above its equality of -1
check_solution: Constraint R94 = 1.22014758007e-311 is above its equality of -1
check_solution: Constraint R152 = 2.67159270143e-311 is above its equality of -1
check_solution: Constraint R160 = 1.37717526837e-311 is above its equality of -1
check_solution: Constraint R190 = 1.46417710212e-312 is above its equality of -1
check_solution: Constraint R193 = 1.50661701752e-312 is above its equality of -1
check_solution: Constraint R221 = 1.23287955459e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C156 = -0.258606672287 is below its lower bound 0
check_solution: Variable C636 = -1.10672092438 is below its lower bound 0
check_solution: Variable C1116 = -0.569657325745 is below its lower bound 0
check_solution: Constraint R5 = 2.02862797685e-311 is above its equality of -9
check_solution: Constraint R24 = 3.67954070231e-311 is above its equality of -1
check_solution: Constraint R30 = 2.91986620884e-311 is above its equality of -1
check_solution: Constraint R93 = 2.61854280665e-311 is above its equality of -1
check_solution: Constraint R94 = 2.32995137911e-311 is above its equality of -1
check_solution: Constraint R152 = -0.868116855621 is above its equality of -1
check_solution: Constraint R160 = 2.59095686147e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1.10672)
check_solution: Variable C212 = -0.129323601723 is below its lower bound 0
check_solution: Variable C452 = -0.344862937927 is below its lower bound 0
check_solution: Variable C932 = -0.159700751305 is below its lower bound 0
check_solution: Constraint R5 = 2.32995137933e-311 is above its equality of -9
check_solution: Constraint R24 = 2.11138581257e-311 is above its equality of -1
check_solution: Constraint R30 = 2.03923795563e-311 is above its equality of -1
check_solution: Constraint R93 = 2.21324161073e-311 is above its equality of -1
check_solution: Constraint R94 = 3.67317471477e-311 is above its equality of -1
check_solution: Constraint R152 = 3.23179959046e-311 is above its equality of -1
check_solution: Constraint R160 = 1.01643598454e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 6.26171)
check_solution: Variable C378 = -0.142439246178 is below its lower bound 0
check_solution: Variable C618 = -0.739521503449 is below its lower bound 0
check_solution: Constraint R5 = 2.5421509583e-311 is above its equality of -9
check_solution: Constraint R24 = 3.72622460969e-311 is above its equality of -1
check_solution: Constraint R30 = 2.65461673495e-311 is above its equality of -1
check_solution: Constraint R93 = 3.15116375011e-311 is above its equality of -1
check_solution: Constraint R94 = 2.4891010633e-311 is above its equality of -1
check_solution: Constraint R152 = 2.63551877296e-311 is above its equality of -1
check_solution: Constraint R160 = 3.5012930558e-311 is above its equality of -1
check_solution: Constraint R190 = 2.88379228049e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R5 = 2.61005482349e-311 is above its equality of -9
check_solution: Constraint R24 = 2.62915278562e-311 is above its equality of -1
check_solution: Constraint R30 = 2.6333967772e-311 is above its equality of -1
check_solution: Constraint R93 = 2.70342263832e-311 is above its equality of -1
check_solution: Constraint R94 = 2.70342263832e-311 is above its equality of -1
check_solution: Constraint R152 = 4.67737446562e-310 is above its equality of -1
check_solution: Constraint R160 = 0 is above its equality of -1
check_solution: Constraint R190 = 0 is above its equality of -1
check_solution: Constraint R193 = 0 is above its equality of -1
check_solution: Constraint R221 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C164 = -0.571366786957 is below its lower bound 0
check_solution: Variable C644 = -0.387152194977 is below its lower bound 0
check_solution: Variable C1124 = -0.35270190239 is below its lower bound 0
check_solution: Constraint R5 = 3.12357780467e-311 is above its equality of -9
check_solution: Constraint R24 = 2.53154097942e-311 is above its equality of -1
check_solution: Constraint R30 = 3.07689389769e-311 is above its equality of -1
check_solution: Constraint R93 = 2.24082755588e-311 is above its equality of -1
check_solution: Constraint R94 = 3.74532257159e-311 is above its equality of -1
check_solution: Constraint R152 = 3.03657597755e-311 is above its equality of -1
check_solution: Constraint R160 = 0.603867530823 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1.60387)
check_solution: Constraint R5 = 2.5421509583e-311 is above its equality of -9
check_solution: Constraint R24 = 3.35063135459e-311 is above its equality of -1
check_solution: Constraint R30 = 3.20633564076e-311 is above its equality of -1
check_solution: Constraint R93 = 2.03287196847e-311 is above its equality of -1
check_solution: Constraint R94 = 2.78405847839e-311 is above its equality of -1
check_solution: Constraint R152 = 3.11296782602e-311 is above its equality of -1
check_solution: Constraint R160 = 3.72622460964e-311 is above its equality of -1
check_solution: Constraint R190 = 2.80103444445e-311 is above its equality of -1
check_solution: Constraint R193 = 2.81376641961e-311 is above its equality of -1
check_solution: Constraint R221 = 3.14479776305e-311 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of -9
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0
check_solution: Constraint R12 = 1e+30 is above its equality of 0
check_solution: Constraint R13 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 1e+30)
check_solution: Constraint R5 = 0 is above its equality of -9
check_solution: Constraint R20 = -1 is below its equality of 0
check_solution: Constraint R23 = -1 is below its equality of 0
check_solution: Constraint R82 = -1 is below its equality of 0
check_solution: Constraint R92 = -1 is below its equality of 0
check_solution: Constraint R96 = -10 is below its equality of 0
check_solution: Constraint R131 = -1 is below its equality of 0
check_solution: Constraint R152 = 0 is above its equality of -1
check_solution: Constraint R177 = -1 is below its equality of 0
check_solution: Constraint R184 = -1 is below its equality of 0

Seriously low accuracy found ||*|| = 10 (rel. error 1)

FORMULA PolyORBLF-PT-S02J04T06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 231
rslt: Output for LTLFireability @ PolyORBLF-PT-S02J04T06

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 21
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 7,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((((1 <= p299) AND (2 <= p352)) OR ((1 <= p125) AND (2 <= p352)) OR ((1 <= p40) AND (2 <= p352)) OR ((1 <= p94) AND (2 <= p352)) OR ((1 <= p261) AND (2 <= p352)) OR ((2 <= p352) AND (1 <= p392)) OR (1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220)) U (((p299 <= 0) OR (p352 <= 1)) AND ((p125 <= 0) OR (p352 <= 1)) AND ((p40 <= 0) OR (p352 <= 1)) AND ((p94 <= 0) OR (p352 <= 1)) AND ((p261 <= 0) OR (p352 <= 1)) AND ((p352 <= 1) OR (p392 <= 0))))",
"processed_size": 498,
"rewrites": 109
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 23
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 30,
"adisj": 1,
"aneg": 0,
"comp": 90,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 90,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((((1 <= p207) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p3) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p295) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p3) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p207) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p14) AND (1 <= p194) AND (1 <= p351)) OR ((1 <= p207) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p270) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p194) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p350) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p316) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p14) AND (1 <= p207) AND (1 <= p351)) OR ((1 <= p207) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p3) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p3) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p14) AND (1 <= p177) AND (1 <= p351)) OR ((1 <= p350) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p177) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p14) AND (1 <= p270) AND (1 <= p351)) OR ((1 <= p270) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p270) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p14) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p270) AND (1 <= p295) AND (1 <= p351))))",
"processed_size": 1485,
"rewrites": 109
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 23
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 6,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 25,
"aneg": 0,
"comp": 78,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 78,
"taut": 0,
"tconj": 13,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G ((X (G ((X (G ((((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND ((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9))))) AND (((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND (((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9)))))))))) OR (G (((1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220))) AND F (G ((X (G ((((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND ((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9))))) AND (((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND (((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9)))))))))))))",
"processed_size": 1359,
"rewrites": 109
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 22
},
"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": 25
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 38,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p327) OR (1 <= p197) OR (1 <= p132) OR (1 <= p322) OR (1 <= p8) OR (1 <= p332) OR (1 <= p335) OR (1 <= p77) OR (1 <= p15) OR (1 <= p470) OR (1 <= p83) OR (1 <= p19) OR (1 <= p85) OR (1 <= p400) OR (1 <= p274) OR (1 <= p414) OR (1 <= p152) OR (1 <= p280) OR (1 <= p344) OR (1 <= p162) OR (1 <= p292) OR (1 <= p294) OR (1 <= p228) OR (1 <= p366) OR (1 <= p427) OR (1 <= p176) OR (1 <= p371) OR (1 <= p432) OR (1 <= p433) OR (1 <= p442)))) AND G ((((1 <= p312) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p213) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p330) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p352) AND (10 <= p354) AND (1 <= p413)) OR ((1 <= p240) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p81) AND (1 <= p352) AND (10 <= p354))))))",
"processed_size": 795,
"rewrites": 109
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 28
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F ((X (X (F ((((1 <= p128) AND (1 <= p474)) OR ((1 <= p126) AND (1 <= p474)) OR ((1 <= p276) AND (1 <= p474)) OR ((1 <= p334) AND (1 <= p474)) OR ((1 <= p471) AND (1 <= p474)) OR ((1 <= p43) AND (1 <= p474)))))) AND ((1 <= p96) OR (1 <= p423) OR (1 <= p340) OR (1 <= p51) OR (1 <= p387) OR (1 <= p169))))",
"processed_size": 314,
"rewrites": 109
},
"result":
{
"edges": 2879956,
"markings": 1416875,
"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": 30
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 62,
"adisj": 13,
"aneg": 0,
"comp": 144,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 144,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 47,
"visible_transitions": 0
},
"processed": "((((p127 <= 0) OR (p386 <= 0)) AND ((p203 <= 0) OR (p386 <= 0)) AND ((p386 <= 0) OR (p431 <= 0)) AND ((p13 <= 0) OR (p386 <= 0)) AND ((p122 <= 0) OR (p386 <= 0)) AND ((p262 <= 0) OR (p386 <= 0))) U X (X (((((1 <= p131) AND (1 <= p268)) OR ((1 <= p121) AND (1 <= p329)) OR ((1 <= p318) AND (1 <= p416)) OR ((1 <= p121) AND (1 <= p140)) OR ((1 <= p226) AND (1 <= p415)) OR ((1 <= p202) AND (1 <= p416)) OR ((1 <= p415) AND (1 <= p451)) OR ((1 <= p140) AND (1 <= p333)) OR ((1 <= p397) AND (1 <= p416)) OR ((1 <= p93) AND (1 <= p451)) OR ((1 <= p219) AND (1 <= p469)) OR ((1 <= p25) AND (1 <= p268)) OR ((1 <= p49) AND (1 <= p415)) OR ((1 <= p130) AND (1 <= p219)) OR ((1 <= p140) AND (1 <= p388)) OR ((1 <= p208) AND (1 <= p415)) OR ((1 <= p45) AND (1 <= p329)) OR ((1 <= p141) AND (1 <= p230)) OR ((1 <= p45) AND (1 <= p140)) OR ((1 <= p255) AND (1 <= p268)) OR ((1 <= p360) AND (1 <= p415)) OR ((1 <= p230) AND (1 <= p264)) OR ((1 <= p98) AND (1 <= p395)) OR ((1 <= p5) AND (1 <= p462)) OR ((1 <= p98) AND (1 <= p301)) OR ((1 <= p140) AND (1 <= p407)) OR ((1 <= p140) AND (1 <= p472)) OR ((1 <= p21) AND (1 <= p230)) OR ((1 <= p268) AND (1 <= p409)) OR ((1 <= p219) AND (1 <= p253)) OR ((1 <= p5) AND (1 <= p409)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p268) AND (1 <= p462)) OR ((1 <= p68) AND (1 <= p268)) OR ((1 <= p49) AND (1 <= p93)) OR ((1 <= p202) AND (1 <= p230)) OR ((1 <= p93) AND (1 <= p226)) OR ((1 <= p264) AND (1 <= p416)) OR ((1 <= p219) AND (1 <= p395)) OR ((1 <= p5) AND (1 <= p131)) OR ((1 <= p5) AND (1 <= p68)) OR ((1 <= p329) AND (1 <= p407)) OR ((1 <= p98) AND (1 <= p130)) OR ((1 <= p329) AND (1 <= p472)) OR ((1 <= p93) AND (1 <= p208)) OR ((1 <= p5) AND (1 <= p255)) OR ((1 <= p329) AND (1 <= p333)) OR ((1 <= p98) AND (1 <= p253)) OR ((1 <= p230) AND (1 <= p318)) OR ((1 <= p219) AND (1 <= p301)) OR ((1 <= p141) AND (1 <= p416)) OR ((1 <= p99) AND (1 <= p219)) OR ((1 <= p21) AND (1 <= p416)) OR ((1 <= p98) AND (1 <= p469)) OR ((1 <= p230) AND (1 <= p397)) OR ((1 <= p329) AND (1 <= p388)) OR ((1 <= p297) AND (1 <= p415)) OR ((1 <= p93) AND (1 <= p360)) OR ((1 <= p93) AND (1 <= p297)) OR ((1 <= p98) AND (1 <= p99))) AND ((p127 <= 0) OR (p386 <= 0)) AND ((p203 <= 0) OR (p386 <= 0)) AND ((p386 <= 0) OR (p431 <= 0)) AND ((p13 <= 0) OR (p386 <= 0)) AND ((p122 <= 0) OR (p386 <= 0)) AND ((p262 <= 0) OR (p386 <= 0))))))",
"processed_size": 2419,
"rewrites": 109
},
"result":
{
"edges": 35084,
"markings": 24703,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 34
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 2,
"aneg": 2,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((X (X ((G (F (((1 <= p183) AND (1 <= p310) AND (1 <= p355) AND (1 <= p398)))) AND (1 <= p304)))) OR (G ((1 <= p51)) AND X (X (F ((G (F (((1 <= p183) AND (1 <= p310) AND (1 <= p355) AND (1 <= p398)))) AND (1 <= p304))))))))",
"processed_size": 225,
"rewrites": 109
},
"result":
{
"edges": 4139371,
"markings": 352625,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 50
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 38
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (X (((G (((p63 <= 0) OR (p341 <= 0))) OR F (((p4 <= 9) OR (p66 <= 0) OR (p251 <= 0) OR (p338 <= 0) OR (p408 <= 0)))) R ((p374 <= 0)))))",
"processed_size": 142,
"rewrites": 109
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 46
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((p33 <= 0) OR (p392 <= 0)))",
"processed_size": 32,
"rewrites": 109
},
"result":
{
"edges": 4406,
"markings": 4351,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 77
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((1 <= p82) AND (1 <= p311) AND (1 <= p338))))",
"processed_size": 52,
"rewrites": 109
},
"result":
{
"edges": 749,
"markings": 748,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 116
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 6,
"aneg": 6,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((G ((((p298 <= 0) OR (p422 <= 0)) AND ((p117 <= 0) OR (p298 <= 0)) AND ((p223 <= 0) OR (p298 <= 0)) AND ((p53 <= 0) OR (p298 <= 0)) AND ((p168 <= 0) OR (p298 <= 0)) AND ((p298 <= 0) OR (p435 <= 0)))) AND ((p212 <= 3) AND ((p356 <= 3) AND ((p73 <= 3) AND ((p174 <= 3) AND ((p429 <= 3) AND (p17 <= 3)))))))))",
"processed_size": 318,
"rewrites": 109
},
"result":
{
"edges": 747,
"markings": 747,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 232
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 7,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((G (((p96 <= 0) AND (p423 <= 0) AND (p340 <= 0) AND (p51 <= 0) AND (p387 <= 0) AND (p169 <= 0))) AND (((p299 <= 0) OR (p352 <= 1)) AND (((p125 <= 0) OR (p352 <= 1)) AND (((p40 <= 0) OR (p352 <= 1)) AND (((p94 <= 0) OR (p352 <= 1)) AND (((p261 <= 0) OR (p352 <= 1)) AND ((p352 <= 1) OR (p392 <= 0))))))))))",
"processed_size": 317,
"rewrites": 109
},
"result":
{
"edges": 1171,
"markings": 1171,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 512420,
"runtime": 3338.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** U **) AND X(**)) : G(F((G(**) AND (* AND (* AND (* AND (* AND (* AND *)))))))) : G((X(G((X(G(**)) AND (** AND (** AND (** AND (** AND (** AND **)))))))) OR (G(**) AND F(G((X(G(**)) AND (** AND (** AND (** AND (** AND (** AND **))))))))))) : X((X(G(**)) AND G(**))) : F((X(X(F(**))) AND **)) : G(F((G(*) AND (** AND (** AND (** AND (** AND (** AND **)))))))) : (** U X(X(**))) : F((X(X((G(F(*)) AND **))) OR (G(**) AND X(X(F((G(F(*)) AND **))))))) : X(X(((G(*) OR F(*)) R *))) : (G(*) AND X(**)) : X(X(G(*))) : F(G(**))"
},
"net":
{
"arcs": 3570,
"conflict_clusters": 185,
"places": 476,
"places_significant": 430,
"singleton_clusters": 0,
"transitions": 824
},
"result":
{
"preliminary_value": "no no no no no no yes no yes no no no ",
"value": "no no no no no no yes no yes 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: 1300/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15232
lola: finding significant places
lola: 476 places, 824 transitions, 430 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: (1 <= p4)
lola: (((((1 <= p299) AND (2 <= p352)) OR ((1 <= p125) AND (2 <= p352)) OR ((1 <= p40) AND (2 <= p352)) OR ((1 <= p94) AND (2 <= p352)) OR ((1 <= p261) AND (2 <= p352)) OR ((2 <= p352) AND (1 <= p392)) OR (1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220)) U (((p299 <= 0) OR (p352 <= 1)) AND ((p125 <= 0) OR (p352 <= 1)) AND ((p40 <= 0) OR (p352 <= 1)) AND ((p94 <= 0) OR (p352 <= 1)) AND ((p261 <= 0) OR (p352 <= 1)) AND ((p352 <= 1) OR (p392 <= 0)))) AND X ((((1 <= p207) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p3) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p295) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p3) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p207) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p14) AND (1 <= p194) AND (1 <= p351)) OR ((1 <= p207) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p270) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p194) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p350) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p316) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p14) AND (1 <= p207) AND (1 <= p351)) OR ((1 <= p207) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p3) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p3) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p14) AND (1 <= p177) AND (1 <= p351)) OR ((1 <= p350) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p177) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p14) AND (1 <= p270) AND (1 <= p351)) OR ((1 <= p270) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p270) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p14) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p270) AND (1 <= p295) AND (1 <= p351))))) : G (X (NOT(X (G (((((((NOT(G ((((p298 <= 0) OR (p422 <= 0)) AND ((p117 <= 0) OR (p298 <= 0)) AND ((p223 <= 0) OR (p298 <= 0)) AND ((p53 <= 0) OR (p298 <= 0)) AND ((p168 <= 0) OR (p298 <= 0)) AND ((p298 <= 0) OR (p435 <= 0))))) OR (4 <= p212)) OR (4 <= p356)) OR (4 <= p73)) OR (4 <= p174)) OR (4 <= p429)) OR (4 <= p17))))))) : G ((G (((1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220))) U G (X (((((((X (G ((((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND ((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9))))) AND ((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9))) AND ((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9))) AND ((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9))) AND ((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0))) AND ((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9))) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9))))))) : (G (X (X (((1 <= p327) OR (1 <= p197) OR (1 <= p132) OR (1 <= p322) OR (1 <= p8) OR (1 <= p332) OR (1 <= p335) OR (1 <= p77) OR (1 <= p15) OR (1 <= p470) OR (1 <= p83) OR (1 <= p19) OR (1 <= p85) OR (1 <= p400) OR (1 <= p274) OR (1 <= p414) OR (1 <= p152) OR (1 <= p280) OR (1 <= p344) OR (1 <= p162) OR (1 <= p292) OR (1 <= p294) OR (1 <= p228) OR (1 <= p366) OR (1 <= p427) OR (1 <= p176) OR (1 <= p371) OR (1 <= p432) OR (1 <= p433) OR (1 <= p442))))) AND X (G ((((1 <= p312) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p213) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p330) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p352) AND (10 <= p354) AND (1 <= p413)) OR ((1 <= p240) AND (1 <= p352) AND (10 <= p354)) OR ((1 <= p81) AND (1 <= p352) AND (10 <= p354)))))) : F ((X (X (F ((((1 <= p128) AND (1 <= p474)) OR ((1 <= p126) AND (1 <= p474)) OR ((1 <= p276) AND (1 <= p474)) OR ((1 <= p334) AND (1 <= p474)) OR ((1 <= p471) AND (1 <= p474)) OR ((1 <= p43) AND (1 <= p474)))))) AND ((1 <= p96) OR (1 <= p423) OR (1 <= p340) OR (1 <= p51) OR (1 <= p387) OR (1 <= p169)))) : X (G (X (F (((((1 <= p127) AND (1 <= p386)) OR ((1 <= p203) AND (1 <= p386)) OR ((1 <= p386) AND (1 <= p431)) OR ((1 <= p13) AND (1 <= p386)) OR ((1 <= p122) AND (1 <= p386)) OR ((1 <= p262) AND (1 <= p386))) U ((((((NOT(F (((1 <= p96) OR (1 <= p423) OR (1 <= p340) OR (1 <= p51) OR (1 <= p387) OR (1 <= p169)))) AND ((p299 <= 0) OR (p352 <= 1))) AND ((p125 <= 0) OR (p352 <= 1))) AND ((p40 <= 0) OR (p352 <= 1))) AND ((p94 <= 0) OR (p352 <= 1))) AND ((p261 <= 0) OR (p352 <= 1))) AND ((p352 <= 1) OR (p392 <= 0)))))))) : ((((p127 <= 0) OR (p386 <= 0)) AND ((p203 <= 0) OR (p386 <= 0)) AND ((p386 <= 0) OR (p431 <= 0)) AND ((p13 <= 0) OR (p386 <= 0)) AND ((p122 <= 0) OR (p386 <= 0)) AND ((p262 <= 0) OR (p386 <= 0))) U X (X (((((1 <= p131) AND (1 <= p268)) OR ((1 <= p121) AND (1 <= p329)) OR ((1 <= p318) AND (1 <= p416)) OR ((1 <= p121) AND (1 <= p140)) OR ((1 <= p226) AND (1 <= p415)) OR ((1 <= p202) AND (1 <= p416)) OR ((1 <= p415) AND (1 <= p451)) OR ((1 <= p140) AND (1 <= p333)) OR ((1 <= p397) AND (1 <= p416)) OR ((1 <= p93) AND (1 <= p451)) OR ((1 <= p219) AND (1 <= p469)) OR ((1 <= p25) AND (1 <= p268)) OR ((1 <= p49) AND (1 <= p415)) OR ((1 <= p130) AND (1 <= p219)) OR ((1 <= p140) AND (1 <= p388)) OR ((1 <= p208) AND (1 <= p415)) OR ((1 <= p45) AND (1 <= p329)) OR ((1 <= p141) AND (1 <= p230)) OR ((1 <= p45) AND (1 <= p140)) OR ((1 <= p255) AND (1 <= p268)) OR ((1 <= p360) AND (1 <= p415)) OR ((1 <= p230) AND (1 <= p264)) OR ((1 <= p98) AND (1 <= p395)) OR ((1 <= p5) AND (1 <= p462)) OR ((1 <= p98) AND (1 <= p301)) OR ((1 <= p140) AND (1 <= p407)) OR ((1 <= p140) AND (1 <= p472)) OR ((1 <= p21) AND (1 <= p230)) OR ((1 <= p268) AND (1 <= p409)) OR ((1 <= p219) AND (1 <= p253)) OR ((1 <= p5) AND (1 <= p409)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p268) AND (1 <= p462)) OR ((1 <= p68) AND (1 <= p268)) OR ((1 <= p49) AND (1 <= p93)) OR ((1 <= p202) AND (1 <= p230)) OR ((1 <= p93) AND (1 <= p226)) OR ((1 <= p264) AND (1 <= p416)) OR ((1 <= p219) AND (1 <= p395)) OR ((1 <= p5) AND (1 <= p131)) OR ((1 <= p5) AND (1 <= p68)) OR ((1 <= p329) AND (1 <= p407)) OR ((1 <= p98) AND (1 <= p130)) OR ((1 <= p329) AND (1 <= p472)) OR ((1 <= p93) AND (1 <= p208)) OR ((1 <= p5) AND (1 <= p255)) OR ((1 <= p329) AND (1 <= p333)) OR ((1 <= p98) AND (1 <= p253)) OR ((1 <= p230) AND (1 <= p318)) OR ((1 <= p219) AND (1 <= p301)) OR ((1 <= p141) AND (1 <= p416)) OR ((1 <= p99) AND (1 <= p219)) OR ((1 <= p21) AND (1 <= p416)) OR ((1 <= p98) AND (1 <= p469)) OR ((1 <= p230) AND (1 <= p397)) OR ((1 <= p329) AND (1 <= p388)) OR ((1 <= p297) AND (1 <= p415)) OR ((1 <= p93) AND (1 <= p360)) OR ((1 <= p93) AND (1 <= p297)) OR ((1 <= p98) AND (1 <= p99))) AND ((p127 <= 0) OR (p386 <= 0)) AND ((p203 <= 0) OR (p386 <= 0)) AND ((p386 <= 0) OR (p431 <= 0)) AND ((p13 <= 0) OR (p386 <= 0)) AND ((p122 <= 0) OR (p386 <= 0)) AND ((p262 <= 0) OR (p386 <= 0)))))) : F ((G ((1 <= p51)) U X (X ((G (X (NOT(G (((p183 <= 0) OR (p310 <= 0) OR (p355 <= 0) OR (p398 <= 0)))))) AND (1 <= p304)))))) : NOT(X (X ((((((10 <= p4) AND (1 <= p66) AND (1 <= p251) AND (1 <= p338) AND (1 <= p408)) U F (((1 <= p63) AND (1 <= p341)))) AND G (((10 <= p4) AND (1 <= p66) AND (1 <= p251) AND (1 <= p338) AND (1 <= p408)))) U ((1 <= p374)))))) : (NOT(F (((1 <= 0) U F (((1 <= p33) AND (1 <= p392)))))) AND X (((1 <= p203) AND (1 <= p386)))) : X (NOT(X (F (((p306 <= 0) OR (1 <= p423)))))) : F ((G (((1 <= p82) AND (1 <= p311) AND (1 <= p338))) AND F (((1 <= p61) U (0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:254
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:254
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:251
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:251
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:251
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
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:251
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:251
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 21 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p299) AND (2 <= p352)) OR ((1 <= p125) AND (2 <= p352)) OR ((1 <= p40) AND (2 <= p352)) OR ((1 <= p94) AND (2 <= p352)) OR ((1 <= p261) AND (2 <= p352)) OR ((2 <= p352) AND (1 <= p392)) OR (1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220)) U (((p299 <= 0) OR (p352 <= 1)) AND ((p125 <= 0) OR (p352 <= 1)) AND ((p40 <= 0) OR (p352 <= 1)) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 21 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p299) AND (2 <= p352)) OR ((1 <= p125) AND (2 <= p352)) OR ((1 <= p40) AND (2 <= p352)) OR ((1 <= p94) AND (2 <= p352)) OR ((1 <= p261) AND (2 <= p352)) OR ((2 <= p352) AND (1 <= p392)) OR (1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220)) U (((p299 <= 0) OR (p352 <= 1)) AND ((p125 <= 0) OR (p352 <= 1)) AND ((p40 <= 0) OR (p352 <= 1)) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p299) AND (2 <= p352)) OR ((1 <= p125) AND (2 <= p352)) OR ((1 <= p40) AND (2 <= p352)) OR ((1 <= p94) AND (2 <= p352)) OR ((1 <= p261) AND (2 <= p352)) OR ((2 <= p352) AND (1 <= p392)) OR (1 <= p18) OR (1 <= p326) OR (1 <= p272) OR (1 <= p143) OR (1 <= p393) OR (1 <= p220)) U (((p299 <= 0) OR (p352 <= 1)) AND ((p125 <= 0) OR (p352 <= 1)) AND ((p40 <= 0) OR (p352 <= 1)) AND ... (shortened)
lola: processed formula length: 498
lola: 109 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 23 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p207) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p3) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p295) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p3) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p207) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p14) AND (1 <= p194) AND (1 <= p351)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p207) AND (1 <= p316) AND (1 <= p351)) OR ((1 <= p194) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p3) AND (1 <= p295) AND (1 <= p351)) OR ((1 <= p177) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p295) AND (1 <= p350) AND (1 <= p351)) OR ((1 <= p3) AND (1 <= p351) AND (1 <= p455)) OR ((1 <= p207) AND (1 <= p351) AND (1 <= p363)) OR ((1 <= p14) AND (1 <= p194) AND (1 <= p351)) OR (... (shortened)
lola: processed formula length: 1485
lola: 109 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: 479 markings, 479 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 23 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((X (G ((((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND ((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9))))) AND (((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p213 <= 0) OR (p352 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((X (G ((((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p213 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p330 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p352 <= 0) OR (p354 <= 9) OR (p413 <= 0)) AND ((p240 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND ((p81 <= 0) OR (p352 <= 0) OR (p354 <= 9))))) AND (((p312 <= 0) OR (p352 <= 0) OR (p354 <= 9)) AND (((p213 <= 0) OR (p352 <= 0)... (shortened)
lola: processed formula length: 1359
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 22 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: 479 markings, 479 edges
lola: ========================================
lola: subprocess 2 will run for 25 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p327) OR (1 <= p197) OR (1 <= p132) OR (1 <= p322) OR (1 <= p8) OR (1 <= p332) OR (1 <= p335) OR (1 <= p77) OR (1 <= p15) OR (1 <= p470) OR (1 <= p83) OR (1 <= p19) OR (1 <= p85) OR (1 <= p400) OR (1 <= p274) OR (1 <= p414) OR (1 <= p152) OR (1 <= p280) OR (1 <= p344) OR (1 <= p162) OR (1 <= p292) OR (1 <= p294) OR (1 <= p228) OR (1 <= p366) OR (1 <= p427) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p327) OR (1 <= p197) OR (1 <= p132) OR (1 <= p322) OR (1 <= p8) OR (1 <= p332) OR (1 <= p335) OR (1 <= p77) OR (1 <= p15) OR (1 <= p470) OR (1 <= p83) OR (1 <= p19) OR (1 <= p85) OR (1 <= p400) OR (1 <= p274) OR (1 <= p414) OR (1 <= p152) OR (1 <= p280) OR (1 <= p344) OR (1 <= p162) OR (1 <= p292) OR (1 <= p294) OR (1 <= p228) OR (1 <= p366) OR (1 <= p427) ... (shortened)
lola: processed formula length: 795
lola: 109 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: 479 markings, 479 edges
lola: ========================================
lola: subprocess 3 will run for 28 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((((1 <= p128) AND (1 <= p474)) OR ((1 <= p126) AND (1 <= p474)) OR ((1 <= p276) AND (1 <= p474)) OR ((1 <= p334) AND (1 <= p474)) OR ((1 <= p471) AND (1 <= p474)) OR ((1 <= p43) AND (1 <= p474)))))) AND ((1 <= p96) OR (1 <= p423) OR (1 <= p340) OR (1 <= p51) OR (1 <= p387) OR (1 <= p169))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((((1 <= p128) AND (1 <= p474)) OR ((1 <= p126) AND (1 <= p474)) OR ((1 <= p276) AND (1 <= p474)) OR ((1 <= p334) AND (1 <= p474)) OR ((1 <= p471) AND (1 <= p474)) OR ((1 <= p43) AND (1 <= p474)))))) AND ((1 <= p96) OR (1 <= p423) OR (1 <= p340) OR (1 <= p51) OR (1 <= p387) OR (1 <= p169))))
lola: processed formula length: 314
lola: 109 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: 708020 markings, 1390341 edges, 141604 markings/sec, 0 secs
lola: 1351773 markings, 2738652 edges, 128751 markings/sec, 5 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: 1416875 markings, 2879956 edges
lola: ========================================
lola: subprocess 4 will run for 30 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p127 <= 0) OR (p386 <= 0)) AND ((p203 <= 0) OR (p386 <= 0)) AND ((p386 <= 0) OR (p431 <= 0)) AND ((p13 <= 0) OR (p386 <= 0)) AND ((p122 <= 0) OR (p386 <= 0)) AND ((p262 <= 0) OR (p386 <= 0))) U X (X (((((1 <= p131) AND (1 <= p268)) OR ((1 <= p121) AND (1 <= p329)) OR ((1 <= p318) AND (1 <= p416)) OR ((1 <= p121) AND (1 <= p140)) OR ((1 <= p226) AND (1 <= p415)) OR ((1 <= p202) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p127 <= 0) OR (p386 <= 0)) AND ((p203 <= 0) OR (p386 <= 0)) AND ((p386 <= 0) OR (p431 <= 0)) AND ((p13 <= 0) OR (p386 <= 0)) AND ((p122 <= 0) OR (p386 <= 0)) AND ((p262 <= 0) OR (p386 <= 0))) U X (X (((((1 <= p131) AND (1 <= p268)) OR ((1 <= p121) AND (1 <= p329)) OR ((1 <= p318) AND (1 <= p416)) OR ((1 <= p121) AND (1 <= p140)) OR ((1 <= p226) AND (1 <= p415)) OR ((1 <= p202) AND (... (shortened)
lola: processed formula length: 2419
lola: 109 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 24703 markings, 35084 edges
lola: ========================================
lola: subprocess 5 will run for 34 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((G (F (((1 <= p183) AND (1 <= p310) AND (1 <= p355) AND (1 <= p398)))) AND (1 <= p304)))) OR (G ((1 <= p51)) AND X (X (F ((G (F (((1 <= p183) AND (1 <= p310) AND (1 <= p355) AND (1 <= p398)))) AND (1 <= p304))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((G (F (((1 <= p183) AND (1 <= p310) AND (1 <= p355) AND (1 <= p398)))) AND (1 <= p304)))) OR (G ((1 <= p51)) AND X (X (F ((G (F (((1 <= p183) AND (1 <= p310) AND (1 <= p355) AND (1 <= p398)))) AND (1 <= p304))))))))
lola: processed formula length: 225
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 50 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: 151687 markings, 1787980 edges, 30337 markings/sec, 0 secs
lola: 301414 markings, 3557691 edges, 29945 markings/sec, 5 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: 352625 markings, 4139371 edges
lola: ========================================
lola: subprocess 6 will run for 38 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((G (((p63 <= 0) OR (p341 <= 0))) OR F (((p4 <= 9) OR (p66 <= 0) OR (p251 <= 0) OR (p338 <= 0) OR (p408 <= 0)))) R ((p374 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((G (((p63 <= 0) OR (p341 <= 0))) OR F (((p4 <= 9) OR (p66 <= 0) OR (p251 <= 0) OR (p338 <= 0) OR (p408 <= 0)))) R ((p374 <= 0)))))
lola: processed formula length: 142
lola: 109 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 46 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p33 <= 0) OR (p392 <= 0))) AND X (((1 <= p203) AND (1 <= p386))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 46 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p33 <= 0) OR (p392 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p33 <= 0) OR (p392 <= 0)))
lola: processed formula length: 32
lola: 109 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: 4351 markings, 4406 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 58 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p306) AND (p423 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p306) AND (p423 <= 0)))))
lola: processed formula length: 41
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 479 markings, 479 edges
lola: ========================================
lola: subprocess 9 will run for 77 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p82) AND (1 <= p311) AND (1 <= p338))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p82) AND (1 <= p311) AND (1 <= p338))))
lola: processed formula length: 52
lola: 109 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: 748 markings, 749 edges
lola: ========================================
lola: subprocess 10 will run for 116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((p298 <= 0) OR (p422 <= 0)) AND ((p117 <= 0) OR (p298 <= 0)) AND ((p223 <= 0) OR (p298 <= 0)) AND ((p53 <= 0) OR (p298 <= 0)) AND ((p168 <= 0) OR (p298 <= 0)) AND ((p298 <= 0) OR (p435 <= 0)))) AND ((p212 <= 3) AND ((p356 <= 3) AND ((p73 <= 3) AND ((p174 <= 3) AND ((p429 <= 3) AND (p17 <= 3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((p298 <= 0) OR (p422 <= 0)) AND ((p117 <= 0) OR (p298 <= 0)) AND ((p223 <= 0) OR (p298 <= 0)) AND ((p53 <= 0) OR (p298 <= 0)) AND ((p168 <= 0) OR (p298 <= 0)) AND ((p298 <= 0) OR (p435 <= 0)))) AND ((p212 <= 3) AND ((p356 <= 3) AND ((p73 <= 3) AND ((p174 <= 3) AND ((p429 <= 3) AND (p17 <= 3)))))))))
lola: processed formula length: 318
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 747 markings, 747 edges
lola: ========================================
lola: subprocess 11 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p96 <= 0) AND (p423 <= 0) AND (p340 <= 0) AND (p51 <= 0) AND (p387 <= 0) AND (p169 <= 0))) AND (((p299 <= 0) OR (p352 <= 1)) AND (((p125 <= 0) OR (p352 <= 1)) AND (((p40 <= 0) OR (p352 <= 1)) AND (((p94 <= 0) OR (p352 <= 1)) AND (((p261 <= 0) OR (p352 <= 1)) AND ((p352 <= 1) OR (p392 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p96 <= 0) AND (p423 <= 0) AND (p340 <= 0) AND (p51 <= 0) AND (p387 <= 0) AND (p169 <= 0))) AND (((p299 <= 0) OR (p352 <= 1)) AND (((p125 <= 0) OR (p352 <= 1)) AND (((p40 <= 0) OR (p352 <= 1)) AND (((p94 <= 0) OR (p352 <= 1)) AND (((p261 <= 0) OR (p352 <= 1)) AND ((p352 <= 1) OR (p392 <= 0))))))))))
lola: processed formula length: 317
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1171 markings, 1171 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no yes no no no
lola:
preliminary result: no no no no no no yes no yes no no no
lola: memory consumption: 512420 KB
lola: time consumption: 3338 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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r176-tajo-158987871800410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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