fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r170-oct2-162089287000022
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for PhilosophersDyn-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4324.275 3600000.00 12621.00 48.40 FFFFTTTFFTTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287000022.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287000022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 30K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 299K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 87K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621372035620

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 21:07:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 21:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 21:07:17] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-18 21:07:17] [INFO ] Transformed 30 places.
[2021-05-18 21:07:17] [INFO ] Transformed 84 transitions.
[2021-05-18 21:07:17] [INFO ] Parsed PT model containing 30 places and 84 transitions in 69 ms.
[2021-05-18 21:07:17] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-18 21:07:17] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-18 21:07:17] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-18 21:07:17] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-18 21:07:17] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-18 21:07:17] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14270 resets, run finished after 293 ms. (steps per millisecond=341 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-18 21:07:17] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-18 21:07:17] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-18 21:07:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-18 21:07:17] [INFO ] [Real]Added 36 Read/Feed constraints in 10 ms returned sat
[2021-05-18 21:07:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:17] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2021-05-18 21:07:17] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 9 ms.
[2021-05-18 21:07:17] [INFO ] Added : 33 causal constraints over 8 iterations in 93 ms. Result :sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Added 36 Read/Feed constraints in 8 ms returned sat
[2021-05-18 21:07:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-18 21:07:17] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 7 ms.
[2021-05-18 21:07:17] [INFO ] Added : 29 causal constraints over 6 iterations in 59 ms. Result :sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2021-05-18 21:07:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 8 ms.
[2021-05-18 21:07:18] [INFO ] Added : 36 causal constraints over 8 iterations in 80 ms. Result :sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 4 ms.
[2021-05-18 21:07:18] [INFO ] Added : 35 causal constraints over 8 iterations in 76 ms. Result :sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2021-05-18 21:07:18] [INFO ] Added : 33 causal constraints over 7 iterations in 86 ms. Result :sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2021-05-18 21:07:18] [INFO ] Added : 25 causal constraints over 5 iterations in 57 ms. Result :sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2021-05-18 21:07:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:07:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-18 21:07:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2021-05-18 21:07:18] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2021-05-18 21:07:18] [INFO ] Added : 33 causal constraints over 8 iterations in 81 ms. Result :sat
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2021-05-18 21:07:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-18 21:07:19] [INFO ] Flatten gal took : 37 ms
FORMULA PhilosophersDyn-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 21:07:19] [INFO ] Flatten gal took : 12 ms
[2021-05-18 21:07:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-18 21:07:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PhilosophersDyn-PT-03 @ 3570 seconds

FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ PhilosophersDyn-PT-03

{
"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": "Tue May 18 21:07:19 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(F (((1 <= p3) OR (1 <= p7) OR (1 <= p10))) U (X (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))) U G ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))))",
"processed_size": 248,
"rewrites": 214
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))))",
"processed_size": 49,
"rewrites": 214
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 81,
"adisj": 4,
"aneg": 4,
"comp": 315,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 315,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X ((((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0))) R (F ((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0)))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0))))) OR (((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))))",
"processed_size": 4787,
"rewrites": 214
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 0,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))",
"processed_size": 401,
"rewrites": 229
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 5,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((G ((F (G (((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)))) OR ((p4 <= 0) OR ((p5 <= 0) OR (p16 <= 0))))) OR X (F (((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))))))",
"processed_size": 162,
"rewrites": 214
},
"result":
{
"edges": 1626,
"markings": 658,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((X (F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) U (1 <= p7)) AND (((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p12 <= 0))))))",
"processed_size": 201,
"rewrites": 214
},
"result":
{
"edges": 702,
"markings": 285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p9) AND (1 <= p14) AND (1 <= p17)) U (X (F ((X (((1 <= p9) AND (1 <= p14) AND (1 <= p17))) AND ((1 <= p9) AND ((1 <= p14) AND (1 <= p17)))))) OR G (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))",
"processed_size": 200,
"rewrites": 214
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "((1 <= p4) AND (1 <= p5) AND (1 <= p16))",
"processed_size": 40,
"rewrites": 214
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G ((X (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)))))",
"processed_size": 116,
"rewrites": 214
},
"result":
{
"edges": 306,
"markings": 155,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((G (F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))) OR F (((1 <= p3) AND (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0))) R F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))))",
"processed_size": 191,
"rewrites": 214
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))",
"processed_size": 409,
"rewrites": 216
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR (p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0))))",
"processed_size": 124,
"rewrites": 214
},
"result":
{
"edges": 847,
"markings": 346,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p13) AND (1 <= p15) AND (1 <= p26))",
"processed_size": 42,
"rewrites": 214
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))) AND ((1 <= p14) AND (1 <= p20)))))",
"processed_size": 87,
"rewrites": 214
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))",
"processed_size": 91,
"rewrites": 216
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))",
"processed_size": 91,
"rewrites": 216
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 0,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p28)) OR ((2 <= p4) AND (1 <= p8) AND (1 <= p16)) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p28)) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p29)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p29)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p25) AND (1 <= p29)))",
"processed_size": 627,
"rewrites": 235
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 146628,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : (F(**) U (X(F(**)) U G(**))) : X(F(**)) : (F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : X(((* R (F(*) OR *)) OR *)) : (X(G(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))) : (F(G((F(**) AND (** AND **)))) OR **) : G(F((G((F(G(*)) OR (* OR (* OR *)))) OR X(F(*))))) : G(F(*)) : F((G(*) AND ((X(F(**)) U **) AND (** AND **)))) : (** U (X(F((X(**) AND (** AND (** AND **))))) OR G(**))) : (X(G((X(*) AND **))) OR **) : (X(F(**)) AND (X(G(**)) U G(**))) : F(G((G(F(**)) OR F((* AND (X(*) R F(**)))))))"
},
"net":
{
"arcs": 534,
"conflict_clusters": 1,
"places": 30,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no no no yes yes no yes yes no no no no no ",
"value": "no no no no yes yes no yes yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 111/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 81 transitions, 19 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 false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: F ((X ((NOT(G (F ((F (((1 <= p3) OR (1 <= p7) OR (1 <= p10))) U (((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25))))))) AND NOT(X (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))) U (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) : (F (((1 <= p3) OR (1 <= p7) OR (1 <= p10))) U (F (X ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))) U G ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))) : F (X ((NOT(G (((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)) OR (p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)) U (((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)))))) U F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) : ((((((((((((F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19))) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28))) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12))) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12))) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28))) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p29))) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p28))) OR ((2 <= p4) AND (1 <= p8) AND (1 <= p16))) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p28))) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p29))) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p29))) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p25) AND (1 <= p29))) : (NOT(X (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25))) U (G ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)))) AND (((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25))))))) OR NOT(X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) : (((((((((NOT(F (X (((1 <= p8) AND (1 <= p28) AND (1 <= p29))))) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12))) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22))) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27))) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25))) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21))) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17))) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12))) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19))) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) : (X (X (F (X (G (((F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))) AND (1 <= p14)) AND (1 <= p20))))))) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26))) : G (NOT(G ((F ((((G (F (((1 <= p13) AND (1 <= p25) AND (1 <= p26)))) AND (1 <= p4)) AND (1 <= p5)) AND (1 <= p16))) AND X (G (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))) : NOT(X (X (X (F (G (X (G ((((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND (1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)))))))))) : F ((((NOT(F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) AND (F (X (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) U (1 <= p7))) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0))) AND ((p1 <= 0) OR (p12 <= 0)))) : (((1 <= p9) AND (1 <= p14) AND (1 <= p17)) U (F (X ((((X (((1 <= p9) AND (1 <= p14) AND (1 <= p17))) AND (1 <= p9)) AND (1 <= p14)) AND (1 <= p17)))) OR G (((1 <= p8) AND (1 <= p28) AND (1 <= p29))))) : (NOT(X (F (NOT(G ((NOT(X (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)))))))) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) : (X (F ((p3 <= 0))) AND (X (G ((1 <= p3))) U G ((((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p25)) OR (1 <= p3))))) : G (NOT(G (F (G (((p3 <= 0) U (X (((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25))) U NOT(F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: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: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: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: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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p3) OR (1 <= p7) OR (1 <= p10))) U (X (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))) U G ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p3) OR (1 <= p7) OR (1 <= p10))) U (X (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))) U G ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))))
lola: processed formula length: 248
lola: 214 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))))
lola: processed formula length: 49
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR ... (shortened)
lola: processed formula length: 4787
lola: 214 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)))) OR (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR (((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR (((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR (((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR (((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR (((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR (((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR (((1 <= p4) AND (1 <= p9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR (((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR (((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR (((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR (((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR (((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR (((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR (((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))... (shortened)
lola: processed formula length: 401
lola: 229 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 27 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))))
lola: processed formula length: 49
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 325 markings, 810 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F (G (((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)))) OR ((p4 <= 0) OR ((p5 <= 0) OR (p16 <= 0))))) OR X (F (((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F (G (((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)))) OR ((p4 <= 0) OR ((p5 <= 0) OR (p16 <= 0))))) OR X (F (((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))))))
lola: processed formula length: 162
lola: 214 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: 658 markings, 1626 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((X (F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) U (1 <= p7)) AND (((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((X (F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) U (1 <= p7)) AND (((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p1 <= 0) OR (p12 <= 0))))))
lola: processed formula length: 201
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 285 markings, 702 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p9) AND (1 <= p14) AND (1 <= p17)) U (X (F ((X (((1 <= p9) AND (1 <= p14) AND (1 <= p17))) AND ((1 <= p9) AND ((1 <= p14) AND (1 <= p17)))))) OR G (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p9) AND (1 <= p14) AND (1 <= p17)) U (X (F ((X (((1 <= p9) AND (1 <= p14) AND (1 <= p17))) AND ((1 <= p9) AND ((1 <= p14) AND (1 <= p17)))))) OR G (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))
lola: processed formula length: 200
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((X (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0))))) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p5) AND (1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p5) AND (1 <= p16))
lola: processed formula length: 40
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)))))
lola: processed formula length: 116
lola: 214 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: 155 markings, 306 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p3 <= 0))) AND (X (G ((1 <= p3))) U G ((((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p25)) OR (1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p3 <= 0)))
lola: processed formula length: 17
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))) OR F (((1 <= p3) AND (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0))) R F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))) OR F (((1 <= p3) AND (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0))) R F (((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))))
lola: processed formula length: 191
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p1... (shortened)
lola: processed formula length: 409
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR (p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR (p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0))))
lola: processed formula length: 124
lola: 214 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: 346 markings, 847 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))) AND ((1 <= p14) AND (1 <= p20))))) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p13) AND (1 <= p15) AND (1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p13) AND (1 <= p15) AND (1 <= p26))
lola: processed formula length: 42
lola: 214 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))) AND ((1 <= p14) AND (1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))) AND ((1 <= p14) AND (1 <= p20)))))
lola: processed formula length: 87
lola: 214 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: 6 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))) OR (((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR (((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR (((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR (((1 <= p6) AND (2 <= p12) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))
lola: processed formula length: 91
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))) OR (((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR (((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR (((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR (((1 <= p6) AND (2 <= p12) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))
lola: processed formula length: 91
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR (((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR (((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR (((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR (((1 <= p6) AND (2 <= p12) AND (1 <= p29)) OR (((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p28)) OR (((2 <= p4) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p28)) OR ((2 <= p4) AND (1 <= p8) AND... (shortened)
lola: processed formula length: 627
lola: 235 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 42 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes yes no no no no no
lola:
preliminary result: no no no no yes yes no yes yes no no no no no
lola: memory consumption: 146628 KB
lola: time consumption: 3 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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is PhilosophersDyn-PT-03, 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 r170-oct2-162089287000022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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