Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928700553.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is Kanban-PT-05000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 7 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 16:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591213656558

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:47:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 19:47:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:47:38] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-06-03 19:47:38] [INFO ] Transformed 16 places.
[2020-06-03 19:47:38] [INFO ] Transformed 16 transitions.
[2020-06-03 19:47:38] [INFO ] Parsed PT model containing 16 places and 16 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100022 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=1754 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 19:47:38] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive place invariants in 41 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 18 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 6 ms.
[2020-06-03 19:47:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 19:47:39] [INFO ] Added : 14 causal constraints over 4 iterations in 50 ms. Result :sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:47:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:47:39] [INFO ] Added : 11 causal constraints over 3 iterations in 101 ms. Result :sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned unsat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:39] [INFO ] Added : 13 causal constraints over 4 iterations in 85 ms. Result :sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-03 19:47:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-03 19:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-03 19:47:39] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 16 ms.
[2020-06-03 19:47:39] [INFO ] Added : 14 causal constraints over 3 iterations in 29 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 6 ms.
[2020-06-03 19:47:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 10 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:40] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 8 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms.
[2020-06-03 19:47:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms.
[2020-06-03 19:47:40] [INFO ] Added : 14 causal constraints over 4 iterations in 17 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 10 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-03 19:47:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:40] [INFO ] Added : 11 causal constraints over 3 iterations in 6 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-03 19:47:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:40] [INFO ] Added : 11 causal constraints over 3 iterations in 6 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 19:47:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 3 ms.
[2020-06-03 19:47:40] [INFO ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 6 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 11 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-03 19:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 19:47:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 19:47:40] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms.
[2020-06-03 19:47:40] [INFO ] Added : 14 causal constraints over 4 iterations in 8 ms. Result :sat
[2020-06-03 19:47:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
[2020-06-03 19:47:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 19:47:40] [INFO ] Flatten gal took : 20 ms
FORMULA Kanban-PT-05000-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:47:40] [INFO ] Flatten gal took : 3 ms
[2020-06-03 19:47:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 18 ms.
[2020-06-03 19:47:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-05000 @ 3570 seconds

FORMULA Kanban-PT-05000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3033
rslt: Output for LTLCardinality @ Kanban-PT-05000

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 19:47:41 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (((2 <= p10) U G ((p3 <= p15)))) U (G (F ((p1 <= p8))) AND (p2 <= 0)))",
"processed_size": 73,
"rewrites": 46
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G ((((p4 <= p1) AND (2 <= p8) AND (p3 + 1 <= p4)) OR (p4 <= p1)))) AND F ((2 <= p8))))",
"processed_size": 94,
"rewrites": 46
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 324
},
"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 ((3 <= p1)))",
"processed_size": 17,
"rewrites": 46
},
"result":
{
"edges": 20014,
"markings": 20014,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 356
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "((p2 + 1 <= p12) U G ((2 <= p13)))",
"processed_size": 34,
"rewrites": 46
},
"result":
{
"edges": 79982,
"markings": 64986,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p6)) AND (X ((1 <= p6)) OR ((p2 <= p11) U (1 <= p6)))))",
"processed_size": 68,
"rewrites": 46
},
"result":
{
"edges": 30004,
"markings": 30004,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 549
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p3 <= p8)))",
"processed_size": 18,
"rewrites": 46
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 823
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((3 <= p10))",
"processed_size": 14,
"rewrites": 46
},
"result":
{
"edges": 30004,
"markings": 30004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 823
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p9 <= p13)))",
"processed_size": 19,
"rewrites": 46
},
"result":
{
"edges": 20006,
"markings": 15005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((F ((F ((p8 <= p12)) OR (p12 + 1 <= p15))) AND (p8 <= p11))))",
"processed_size": 67,
"rewrites": 46
},
"result":
{
"edges": 65026,
"markings": 50021,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": 5,
"visible_transitions": 0
},
"processed": "((p6 <= p7) U (((3 <= p0) U (p12 <= p10)) AND G ((p6 <= p7))))",
"processed_size": 62,
"rewrites": 46
},
"result":
{
"edges": 1062401,
"markings": 616354,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3272,
"runtime": 537.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((** U G(**))) U (G(F(**)) AND **)) : X((X(G(**)) AND F(**))) : G(**) : F(G(**)) : X(F(**)) : (X(*) OR (G((F((** OR (G(**) AND F(**)))) AND ((** U **) OR (** OR (G(**) AND F(**)))))) AND X(F(*)))) : (** U ((** U **) AND G(**))) : (G((F(**) AND (X(**) OR (** U **)))) OR (** U G(**))) : (G(*) OR (X(X(X(F(*)))) AND **)) : G(F((F((F(**) OR **)) AND **))) : X(X(G(((X(*) R *) OR G(*))))) : X(F(**)) : (F(G(*)) OR X(**))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no no no yes no no yes no unknown yes no ",
"value": "no no no no no yes no no yes no unknown yes 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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 LTLCardinality.xml
lola: (X (((2 <= p10) U G ((p3 <= p15)))) U (F (G (F ((p1 <= p8)))) AND (p2 <= 0))) : (X (X (G ((((p4 <= p1) AND (2 <= p8) AND (p3 + 1 <= p4)) OR (p4 <= p1))))) AND F (X ((2 <= p8)))) : G ((p5 <= p0)) : F (X (G ((p9 <= p13)))) : X (F ((3 <= p1))) : (G ((((1 <= p11) U (p1 <= p9)) U (G ((1 <= p8)) U (1 <= p8)))) U NOT(X ((p4 <= p5)))) : ((p6 <= p7) U (((3 <= p0) U (p12 <= p10)) AND G ((p6 <= p7)))) : (G ((X ((1 <= p6)) U ((p2 <= p11) U (1 <= p6)))) OR ((p2 + 1 <= p12) U G ((2 <= p13)))) : (NOT(F ((2 <= p10))) OR (NOT(X (X (NOT(X (NOT(G ((3 <= p7)))))))) AND (p10 <= 1))) : G (F ((F ((F ((p8 <= p12)) OR (p12 + 1 <= p15))) AND (p8 <= p11)))) : X (X (NOT(((3 <= p11) U F (((X ((2 <= p15)) U (3 <= p11)) AND F ((2 <= p15)))))))) : X (F ((p3 <= p8))) : (G (NOT(F (NOT(F (NOT(F ((p15 + 1 <= p12)))))))) OR X ((3 <= p10)))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((2 <= p10) U G ((p3 <= p15)))) U (G (F ((p1 <= p8))) AND (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((2 <= p10) U G ((p3 <= p15)))) U (G (F ((p1 <= p8))) AND (p2 <= 0)))
lola: processed formula length: 73
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 30004 markings, 30004 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((((p4 <= p1) AND (2 <= p8) AND (p3 + 1 <= p4)) OR (p4 <= p1)))) AND F ((2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((((p4 <= p1) AND (2 <= p8) AND (p3 + 1 <= p4)) OR (p4 <= p1)))) AND F ((2 <= p8))))
lola: processed formula length: 94
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30004 markings, 30004 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((3 <= p1)))
lola: processed formula length: 17
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 20014 markings, 20014 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p5 + 1 <= p4)) OR (G ((F (((1 <= p8) OR (G ((1 <= p8)) AND F ((1 <= p8))))) AND (((1 <= p11) U (p1 <= p9)) OR ((1 <= p8) OR (G ((1 <= p8)) AND F ((1 <= p8))))))) AND X (F ((p5 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p5 + 1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p5 + 1 <= p4))
lola: processed formula length: 18
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((1 <= p6)) AND (X ((1 <= p6)) OR ((p2 <= p11) U (1 <= p6))))) OR ((p2 + 1 <= p12) U G ((2 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 + 1 <= p12) U G ((2 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p2 + 1 <= p12) U G ((2 <= p13)))
lola: processed formula length: 34
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 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: 64986 markings, 79982 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p6)) AND (X ((1 <= p6)) OR ((p2 <= p11) U (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p6)) AND (X ((1 <= p6)) OR ((p2 <= p11) U (1 <= p6)))))
lola: processed formula length: 68
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 30004 markings, 30004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p10 <= 1)) OR (X (X (X (F ((p7 <= 2))))) AND (p10 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 <= 1)
lola: processed formula length: 10
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p10 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p10 <= 1))
lola: processed formula length: 14
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: ========================================
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: 90016 markings, 115018 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p7 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p7 <= 2)))))
lola: processed formula length: 25
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 10 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((X ((p15 <= 1)) R (p11 <= 2)) OR G ((p15 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((X ((p15 <= 1)) R (p11 <= 2)) OR G ((p15 <= 1))))))
lola: processed formula length: 61
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 3818217 markings, 7517509 edges, 763643 markings/sec, 0 secs
lola: 7199731 markings, 14270721 edges, 676303 markings/sec, 5 secs
lola: 10360814 markings, 20589482 edges, 632217 markings/sec, 10 secs
lola: 13183883 markings, 26228409 edges, 564614 markings/sec, 15 secs
lola: 15960071 markings, 31778487 edges, 555238 markings/sec, 20 secs
lola: 18650247 markings, 37156903 edges, 538035 markings/sec, 25 secs
lola: 21299170 markings, 42447787 edges, 529785 markings/sec, 30 secs
lola: 23844053 markings, 47536435 edges, 508977 markings/sec, 35 secs
lola: 26247166 markings, 52342411 edges, 480623 markings/sec, 40 secs
lola: 28677577 markings, 57196257 edges, 486082 markings/sec, 45 secs
lola: 31053073 markings, 61946835 edges, 475099 markings/sec, 50 secs
lola: 33479926 markings, 66800012 edges, 485371 markings/sec, 55 secs
lola: 35906232 markings, 71650501 edges, 485261 markings/sec, 60 secs
lola: 38365766 markings, 76567062 edges, 491907 markings/sec, 65 secs
lola: 40755645 markings, 81345101 edges, 477976 markings/sec, 70 secs
lola: 43205939 markings, 86243247 edges, 490059 markings/sec, 75 secs
lola: 45559995 markings, 90952665 edges, 470811 markings/sec, 80 secs
lola: 47927265 markings, 95678363 edges, 473454 markings/sec, 85 secs
lola: 50261691 markings, 100345240 edges, 466885 markings/sec, 90 secs
lola: 54031486 markings, 107884748 edges, 753959 markings/sec, 95 secs
lola: 57342185 markings, 114499355 edges, 662140 markings/sec, 100 secs
lola: 60272679 markings, 120357775 edges, 586099 markings/sec, 105 secs
lola: 63049101 markings, 125907981 edges, 555284 markings/sec, 110 secs
lola: 65720349 markings, 131245724 edges, 534250 markings/sec, 115 secs
lola: 68281843 markings, 136367269 edges, 512299 markings/sec, 120 secs
lola: 70838669 markings, 141477739 edges, 511365 markings/sec, 125 secs
lola: 73323589 markings, 146446789 edges, 496984 markings/sec, 130 secs
lola: 75842409 markings, 151479567 edges, 503764 markings/sec, 135 secs
lola: 78337769 markings, 156468207 edges, 499072 markings/sec, 140 secs
lola: 80828289 markings, 161448281 edges, 498104 markings/sec, 145 secs
lola: 83251185 markings, 166295589 edges, 484579 markings/sec, 150 secs
lola: 85674349 markings, 171133738 edges, 484633 markings/sec, 155 secs
lola: 88055105 markings, 175895445 edges, 476151 markings/sec, 160 secs
lola: 90482797 markings, 180755241 edges, 485538 markings/sec, 165 secs
lola: 92847137 markings, 185477425 edges, 472868 markings/sec, 170 secs
lola: 95223317 markings, 190226933 edges, 475236 markings/sec, 175 secs
lola: 97563023 markings, 194910083 edges, 467941 markings/sec, 180 secs
lola: 99904337 markings, 199586297 edges, 468263 markings/sec, 185 secs
lola: 102497291 markings, 206233311 edges, 518591 markings/sec, 190 secs
lola: 103730333 markings, 209926698 edges, 246608 markings/sec, 195 secs
lola: 105693821 markings, 215809738 edges, 392698 markings/sec, 200 secs
lola: 107497063 markings, 221210993 edges, 360648 markings/sec, 205 secs
lola: 109265181 markings, 226510625 edges, 353624 markings/sec, 210 secs
lola: 110764271 markings, 231005137 edges, 299818 markings/sec, 215 secs
lola: 112333740 markings, 235709745 edges, 313894 markings/sec, 220 secs
lola: 113876091 markings, 240329562 edges, 308470 markings/sec, 225 secs
lola: 115598058 markings, 245493460 edges, 344393 markings/sec, 230 secs
lola: 117312219 markings, 250633313 edges, 342832 markings/sec, 235 secs
lola: 118771604 markings, 255007602 edges, 291877 markings/sec, 240 secs
lola: 120484239 markings, 260145104 edges, 342527 markings/sec, 245 secs
lola: 122081861 markings, 264932717 edges, 319524 markings/sec, 250 secs
lola: 123700819 markings, 269784449 edges, 323792 markings/sec, 255 secs
lola: 124762299 markings, 272967993 edges, 212296 markings/sec, 260 secs
lola: 126170071 markings, 277193664 edges, 281554 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p3 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p3 <= p8)))
lola: processed formula length: 18
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p12 <= p15))) OR X ((3 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p12 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p12 <= p15)))
lola: processed formula length: 20
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 7
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: 15005 markings, 20006 edges
lola: ========================================
lola: subprocess 9 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((3 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((3 <= p10))
lola: processed formula length: 14
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30004 markings, 30004 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p9 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p9 <= p13)))
lola: processed formula length: 19
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 7
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: 15005 markings, 20006 edges
lola: ========================================
lola: subprocess 10 will run for 1098 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= p0))
lola: processed formula length: 14
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 69999 markings, 94997 edges
lola: ========================================
lola: subprocess 11 will run for 1647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((F ((p8 <= p12)) OR (p12 + 1 <= p15))) AND (p8 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((F ((p8 <= p12)) OR (p12 + 1 <= p15))) AND (p8 <= p11))))
lola: processed formula length: 67
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 50021 markings, 65026 edges
lola: ========================================
lola: subprocess 12 will run for 3294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= p7) U (((3 <= p0) U (p12 <= p10)) AND G ((p6 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 <= p7) U (((3 <= p0) U (p12 <= p10)) AND G ((p6 <= p7))))
lola: processed formula length: 62
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 616354 markings, 1062401 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G (((X ((p15 <= 1)) R (p11 <= 2)) OR G ((p15 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((X ((p15 <= 1)) R (p11 <= 2)) OR G ((p15 <= 1))))))
lola: processed formula length: 61
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 3834224 markings, 7549238 edges, 766845 markings/sec, 0 secs
lola: 7367625 markings, 14607994 edges, 706680 markings/sec, 5 secs
lola: 10565984 markings, 20995829 edges, 639672 markings/sec, 10 secs
lola: 13643662 markings, 27150877 edges, 615536 markings/sec, 15 secs
lola: 16510192 markings, 32877366 edges, 573306 markings/sec, 20 secs
lola: 19196415 markings, 38245731 edges, 537245 markings/sec, 25 secs
lola: 21761969 markings, 43378035 edges, 513111 markings/sec, 30 secs
lola: 24382595 markings, 48611601 edges, 524125 markings/sec, 35 secs
lola: 26865847 markings, 53575941 edges, 496650 markings/sec, 40 secs
lola: 29441204 markings, 58726139 edges, 515071 markings/sec, 45 secs
lola: 31950270 markings, 63738766 edges, 501813 markings/sec, 50 secs
lola: 34508450 markings, 68853870 edges, 511636 markings/sec, 55 secs
lola: 36988527 markings, 73811859 edges, 496015 markings/sec, 60 secs
lola: 39467596 markings, 78769178 edges, 495814 markings/sec, 65 secs
lola: 41854865 markings, 83538471 edges, 477454 markings/sec, 70 secs
lola: 44303147 markings, 88432159 edges, 489656 markings/sec, 75 secs
lola: 46706177 markings, 93239691 edges, 480606 markings/sec, 80 secs
lola: 49150373 markings, 98127030 edges, 488839 markings/sec, 85 secs
lola: 52379617 markings, 104583852 edges, 645849 markings/sec, 90 secs
lola: 56001415 markings, 111821175 edges, 724360 markings/sec, 95 secs
lola: 59303613 markings, 118421526 edges, 660440 markings/sec, 100 secs
lola: 62517851 markings, 124845105 edges, 642848 markings/sec, 105 secs
lola: 65520079 markings, 130846527 edges, 600446 markings/sec, 110 secs
lola: 68457458 markings, 136719528 edges, 587476 markings/sec, 115 secs
lola: 71246294 markings, 142292675 edges, 557767 markings/sec, 120 secs
lola: 73899077 markings, 147595009 edges, 530557 markings/sec, 125 secs
lola: 76565232 markings, 152924801 edges, 533231 markings/sec, 130 secs
lola: 79098337 markings, 157986647 edges, 506621 markings/sec, 135 secs
lola: 81673865 markings, 163141096 edges, 515106 markings/sec, 140 secs
lola: 84187999 markings, 168163647 edges, 502827 markings/sec, 145 secs
lola: 86698786 markings, 173183905 edges, 502157 markings/sec, 150 secs
lola: 89134229 markings, 178053521 edges, 487089 markings/sec, 155 secs
lola: 91605789 markings, 182992611 edges, 494312 markings/sec, 160 secs
lola: 93961197 markings, 187710803 edges, 471082 markings/sec, 165 secs
lola: 96422158 markings, 192622764 edges, 492192 markings/sec, 170 secs
lola: 98866281 markings, 197513757 edges, 488825 markings/sec, 175 secs
lola: 101413622 markings, 202992666 edges, 509468 markings/sec, 180 secs
lola: 103781883 markings, 210081722 edges, 473652 markings/sec, 185 secs
lola: 105829285 markings, 216236075 edges, 409480 markings/sec, 190 secs
lola: 107600505 markings, 221522896 edges, 354244 markings/sec, 195 secs
lola: 109384009 markings, 226866965 edges, 356701 markings/sec, 200 secs
lola: 111152416 markings, 232165806 edges, 353681 markings/sec, 205 secs
lola: 112889163 markings, 237371673 edges, 347349 markings/sec, 210 secs
lola: 114510323 markings, 242233975 edges, 324232 markings/sec, 215 secs
lola: 115967909 markings, 246601993 edges, 291517 markings/sec, 220 secs
lola: 117628967 markings, 251581631 edges, 332212 markings/sec, 225 secs
lola: 119045045 markings, 255825322 edges, 283216 markings/sec, 230 secs
lola: 120203645 markings, 259300235 edges, 231720 markings/sec, 235 secs
lola: 121810313 markings, 264118091 edges, 321334 markings/sec, 240 secs
lola: 123375225 markings, 268809909 edges, 312982 markings/sec, 245 secs
lola: 124809797 markings, 273113088 edges, 286914 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes no no yes no unknown yes no
lola:
preliminary result: no no no no no yes no no yes no unknown yes no
lola: memory consumption: 3272 KB
lola: time consumption: 537 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="Kanban-PT-05000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Kanban-PT-05000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928700553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-05000.tgz
mv Kanban-PT-05000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;