Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200321.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Dekker-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 247K Apr 27 14:36 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 Dekker-PT-020-00
FORMULA_NAME Dekker-PT-020-01
FORMULA_NAME Dekker-PT-020-02
FORMULA_NAME Dekker-PT-020-03
FORMULA_NAME Dekker-PT-020-04
FORMULA_NAME Dekker-PT-020-05
FORMULA_NAME Dekker-PT-020-06
FORMULA_NAME Dekker-PT-020-07
FORMULA_NAME Dekker-PT-020-08
FORMULA_NAME Dekker-PT-020-09
FORMULA_NAME Dekker-PT-020-10
FORMULA_NAME Dekker-PT-020-11
FORMULA_NAME Dekker-PT-020-12
FORMULA_NAME Dekker-PT-020-13
FORMULA_NAME Dekker-PT-020-14
FORMULA_NAME Dekker-PT-020-15

=== Now, execution of the tool begins

BK_START 1591216247070

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:30:49] [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 20:30:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:30:49] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2020-06-03 20:30:49] [INFO ] Transformed 100 places.
[2020-06-03 20:30:49] [INFO ] Transformed 440 transitions.
[2020-06-03 20:30:49] [INFO ] Found NUPN structural information;
[2020-06-03 20:30:49] [INFO ] Parsed PT model containing 100 places and 440 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 397 ms. (steps per millisecond=251 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2020-06-03 20:30:49] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2020-06-03 20:30:49] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 20:30:49] [INFO ] [Real]Absence check using 40 positive place invariants in 31 ms returned sat
[2020-06-03 20:30:49] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 6 ms returned sat
[2020-06-03 20:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:49] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 20:30:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 73 ms returned sat
[2020-06-03 20:30:50] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 12 ms returned sat
[2020-06-03 20:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:50] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-06-03 20:30:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:30:50] [INFO ] [Nat]Added 20 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:30:50] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-03 20:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2020-06-03 20:30:50] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 36 ms.
[2020-06-03 20:30:50] [INFO ] Added : 21 causal constraints over 5 iterations in 168 ms. Result :sat
[2020-06-03 20:30:50] [INFO ] [Real]Absence check using 40 positive place invariants in 46 ms returned sat
[2020-06-03 20:30:50] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 9 ms returned sat
[2020-06-03 20:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:50] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 20:30:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 112 ms returned sat
[2020-06-03 20:30:51] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-06-03 20:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:51] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 20:30:51] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-06-03 20:30:51] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-06-03 20:30:51] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2020-06-03 20:30:51] [INFO ] Deduced a trap composed of 4 places in 160 ms
[2020-06-03 20:30:51] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2020-06-03 20:30:51] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-06-03 20:30:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 353 ms
[2020-06-03 20:30:51] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 16 ms.
[2020-06-03 20:30:51] [INFO ] Added : 21 causal constraints over 5 iterations in 71 ms. Result :sat
[2020-06-03 20:30:51] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2020-06-03 20:30:51] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-06-03 20:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:51] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-03 20:30:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 262 ms returned sat
[2020-06-03 20:30:52] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 131 ms returned sat
[2020-06-03 20:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:52] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2020-06-03 20:30:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2020-06-03 20:30:52] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 20:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-06-03 20:30:52] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 33 ms.
[2020-06-03 20:30:52] [INFO ] Added : 21 causal constraints over 5 iterations in 151 ms. Result :sat
[2020-06-03 20:30:52] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2020-06-03 20:30:52] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 6 ms returned sat
[2020-06-03 20:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:53] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2020-06-03 20:30:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2020-06-03 20:30:53] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-06-03 20:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:53] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2020-06-03 20:30:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2020-06-03 20:30:53] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-03 20:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-06-03 20:30:53] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 14 ms.
[2020-06-03 20:30:53] [INFO ] Added : 21 causal constraints over 5 iterations in 100 ms. Result :sat
[2020-06-03 20:30:53] [INFO ] [Real]Absence check using 40 positive place invariants in 9 ms returned sat
[2020-06-03 20:30:53] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2020-06-03 20:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned unsat
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using 40 positive place invariants in 110 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 56 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2020-06-03 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 131 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:54] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:30:54] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2020-06-03 20:30:54] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:30:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 41 ms
[2020-06-03 20:30:54] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 14 ms.
[2020-06-03 20:30:54] [INFO ] Added : 21 causal constraints over 5 iterations in 68 ms. Result :sat
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 4 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned unsat
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-06-03 20:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:54] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-03 20:30:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned unsat
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using 40 positive place invariants in 112 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 5 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 20:30:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 260 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 43 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:30:55] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:30:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-06-03 20:30:55] [INFO ] Computed and/alt/rep : 420/1200/60 causal constraints in 27 ms.
[2020-06-03 20:30:55] [INFO ] Added : 21 causal constraints over 5 iterations in 132 ms. Result :sat
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 7 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 20:30:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 20:30:56] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 20:30:56] [INFO ] Flatten gal took : 171 ms
FORMULA Dekker-PT-020-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:30:56] [INFO ] Applying decomposition
[2020-06-03 20:30:56] [INFO ] Flatten gal took : 64 ms
[2020-06-03 20:30:56] [INFO ] Decomposing Gal with order
[2020-06-03 20:30:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 20:30:56] [INFO ] Removed a total of 1460 redundant transitions.
[2020-06-03 20:30:56] [INFO ] Flatten gal took : 120 ms
[2020-06-03 20:30:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-06-03 20:30:56] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 20:30:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-020 @ 3570 seconds

FORMULA Dekker-PT-020-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-020-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2472
rslt: Output for LTLCardinality @ Dekker-PT-020

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:30:57 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p90)) AND ((p84 <= 0)))))",
"processed_size": 39,
"rewrites": 44
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 4,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((F ((((p34 <= 0)) OR ((1 <= p64)))) AND ((((p79 <= 0)) OR ((1 <= p88))) OR (((p34 <= 0)) OR ((1 <= p64))))))) OR (G ((((p41 <= 0)) OR ((1 <= p50)))) OR (((p79 <= 0)) OR ((1 <= p88)))))))",
"processed_size": 203,
"rewrites": 44
},
"result":
{
"edges": 283769,
"markings": 51930,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p63 <= 0)) OR ((1 <= p97)))))",
"processed_size": 39,
"rewrites": 44
},
"result":
{
"edges": 496893982,
"markings": 4718598,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 472
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((((p5 <= 0)) OR ((1 <= p58)))) AND (((1 <= p5)) AND ((p58 <= 0)))))",
"processed_size": 75,
"rewrites": 44
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 551
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((G ((((1 <= p69)) AND ((p17 <= 0)))) AND (((1 <= p13)) AND ((p38 <= 0)))) OR F (G ((((p4 <= 0)) OR ((1 <= p18)))))))",
"processed_size": 121,
"rewrites": 44
},
"result":
{
"edges": 3848,
"markings": 1033,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 661
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((((p56 <= 0)) OR ((1 <= p17))))))",
"processed_size": 43,
"rewrites": 44
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 827
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 5,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p67)) AND ((p1 <= 0)))) AND ((((p67 <= 0)) OR ((1 <= p1))) OR (((1 <= p67)) AND ((p1 <= 0)))))))",
"processed_size": 115,
"rewrites": 44
},
"result":
{
"edges": 3846,
"markings": 1030,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1103
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p50 <= 0)) OR ((1 <= p48))))",
"processed_size": 35,
"rewrites": 44
},
"result":
{
"edges": 344071,
"markings": 65544,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 3,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((F ((((1 <= p67)) AND ((p35 <= 0)))) OR (((p93 <= 0)) OR ((1 <= p56))))) AND (F ((((p67 <= 0)) OR ((1 <= p35)))) OR (F ((((1 <= p67)) AND ((p35 <= 0)))) OR (((p93 <= 0)) OR ((1 <= p56)))))))",
"processed_size": 198,
"rewrites": 44
},
"result":
{
"edges": 1050410903,
"markings": 9961477,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 2473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G ((((p33 <= 0)) OR ((1 <= p48)))) OR (((p58 <= 0)) OR ((1 <= p98)))))",
"processed_size": 75,
"rewrites": 44
},
"result":
{
"edges": 23,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 38040,
"runtime": 1098.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G(**) OR (** OR **))) : X(F(*)) : G((F((F(*) OR (** OR **))) AND (F(**) OR (F(*) OR (** OR **))))) : X(F((F(G((F(**) AND (** OR **)))) OR (G(**) OR (** OR **))))) : X(G(**)) : G(**) : X((F(**) AND (** AND **))) : X(((G(*) AND (* AND *)) OR F(G(**)))) : F(G((F(**) AND (** OR **)))) : X(X(F(**)))"
},
"net":
{
"arcs": 3240,
"conflict_clusters": 1,
"places": 100,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 440
},
"result":
{
"preliminary_value": "no no no no no no no no no no ",
"value": "no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 540/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 440 transitions, 40 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: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: G (((G ((((p33 <= 0)) OR ((1 <= p48)))) OR ((p58 <= 0))) OR ((1 <= p98)))) : X (NOT(G ((((p90 <= 0)) OR ((1 <= p84)))))) : G ((F ((((p67 <= 0)) OR ((1 <= p35)))) U ((NOT(G ((((p67 <= 0)) OR ((1 <= p35))))) OR ((p93 <= 0))) OR ((1 <= p56))))) : F (X ((((G (F (G (((((p79 <= 0)) OR ((1 <= p88))) U (((p34 <= 0)) OR ((1 <= p64))))))) OR G ((((p41 <= 0)) OR ((1 <= p50))))) OR ((p79 <= 0))) OR ((1 <= p88))))) : X (G ((((p63 <= 0)) OR ((1 <= p97))))) : G ((((p50 <= 0)) OR ((1 <= p48)))) : X (((F ((((p5 <= 0)) OR ((1 <= p58)))) AND ((1 <= p5))) AND ((p58 <= 0)))) : NOT(X ((((F ((((p69 <= 0)) OR ((1 <= p17)))) OR ((p13 <= 0))) OR ((1 <= p38))) AND G (NOT(F (G ((((p4 <= 0)) OR ((1 <= p18)))))))))) : ((0 <= 0) U G (((((p67 <= 0)) OR ((1 <= p1))) U (((1 <= p67)) AND ((p1 <= 0)))))) : NOT(X (X (NOT(((((F ((((p38 <= 0)) OR ((1 <= p66)))) AND ((1 <= p56))) AND ((p17 <= 0))) OR ((p18 <= 0))) U F ((((p56 <= 0)) OR ((1 <= p17)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p90)) AND ((p84 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p90)) AND ((p84 <= 0)))))
lola: processed formula length: 39
lola: 44 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((F ((((p34 <= 0)) OR ((1 <= p64)))) AND ((((p79 <= 0)) OR ((1 <= p88))) OR (((p34 <= 0)) OR ((1 <= p64))))))) OR (G ((((p41 <= 0)) OR ((1 <= p50)))) OR (((p79 <= 0)) OR ((1 <= p88)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((F ((((p34 <= 0)) OR ((1 <= p64)))) AND ((((p79 <= 0)) OR ((1 <= p88))) OR (((p34 <= 0)) OR ((1 <= p64))))))) OR (G ((((p41 <= 0)) OR ((1 <= p50)))) OR (((p79 <= 0)) OR ((1 <= p88)))))))
lola: processed formula length: 203
lola: 44 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: 51930 markings, 283769 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p63 <= 0)) OR ((1 <= p97)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p63 <= 0)) OR ((1 <= p97)))))
lola: processed formula length: 39
lola: 44 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: 1096941 markings, 6819632 edges, 219388 markings/sec, 0 secs
lola: 1572866 markings, 15547874 edges, 95185 markings/sec, 5 secs
lola: 1572866 markings, 25035884 edges, 0 markings/sec, 10 secs
lola: 1572866 markings, 35189824 edges, 0 markings/sec, 15 secs
lola: 1572866 markings, 45327853 edges, 0 markings/sec, 20 secs
lola: 1572866 markings, 53810253 edges, 0 markings/sec, 25 secs
lola: 1572866 markings, 63460650 edges, 0 markings/sec, 30 secs
lola: 1572866 markings, 73856831 edges, 0 markings/sec, 35 secs
lola: 1572866 markings, 84211125 edges, 0 markings/sec, 40 secs
lola: 1572866 markings, 94858845 edges, 0 markings/sec, 45 secs
lola: 1572866 markings, 105810007 edges, 0 markings/sec, 50 secs
lola: 1572866 markings, 116102479 edges, 0 markings/sec, 55 secs
lola: 2097154 markings, 124255293 edges, 104858 markings/sec, 60 secs
lola: 2097154 markings, 134042231 edges, 0 markings/sec, 65 secs
lola: 2097154 markings, 143348588 edges, 0 markings/sec, 70 secs
lola: 2097154 markings, 153274381 edges, 0 markings/sec, 75 secs
lola: 2097154 markings, 163304944 edges, 0 markings/sec, 80 secs
lola: 2097154 markings, 171933329 edges, 0 markings/sec, 85 secs
lola: 2097154 markings, 181392868 edges, 0 markings/sec, 90 secs
lola: 2097154 markings, 192006378 edges, 0 markings/sec, 95 secs
lola: 2451012 markings, 201483612 edges, 70772 markings/sec, 100 secs
lola: 2621442 markings, 210886368 edges, 34086 markings/sec, 105 secs
lola: 2621442 markings, 220223708 edges, 0 markings/sec, 110 secs
lola: 2621442 markings, 229008355 edges, 0 markings/sec, 115 secs
lola: 2621442 markings, 238350075 edges, 0 markings/sec, 120 secs
lola: 2621442 markings, 248450425 edges, 0 markings/sec, 125 secs
lola: 2621442 markings, 258167708 edges, 0 markings/sec, 130 secs
lola: 2873187 markings, 267855463 edges, 50349 markings/sec, 135 secs
lola: 3145730 markings, 277257610 edges, 54509 markings/sec, 140 secs
lola: 3145730 markings, 286071988 edges, 0 markings/sec, 145 secs
lola: 3145730 markings, 296275738 edges, 0 markings/sec, 150 secs
lola: 3145730 markings, 306211710 edges, 0 markings/sec, 155 secs
lola: 3145730 markings, 316337090 edges, 0 markings/sec, 160 secs
lola: 3145731 markings, 326975511 edges, 0 markings/sec, 165 secs
lola: 3670018 markings, 334798087 edges, 104857 markings/sec, 170 secs
lola: 3670018 markings, 343948851 edges, 0 markings/sec, 175 secs
lola: 3670018 markings, 353821906 edges, 0 markings/sec, 180 secs
lola: 3670018 markings, 363584432 edges, 0 markings/sec, 185 secs
lola: 3670018 markings, 373372714 edges, 0 markings/sec, 190 secs
lola: 3670018 markings, 383155295 edges, 0 markings/sec, 195 secs
lola: 4194306 markings, 391255184 edges, 104858 markings/sec, 200 secs
lola: 4194306 markings, 401341695 edges, 0 markings/sec, 205 secs
lola: 4194306 markings, 411583184 edges, 0 markings/sec, 210 secs
lola: 4194306 markings, 421609574 edges, 0 markings/sec, 215 secs
lola: 4194306 markings, 431672870 edges, 0 markings/sec, 220 secs
lola: 4303728 markings, 441725501 edges, 21884 markings/sec, 225 secs
lola: 4718594 markings, 450595602 edges, 82973 markings/sec, 230 secs
lola: 4718594 markings, 460842770 edges, 0 markings/sec, 235 secs
lola: 4718594 markings, 471251324 edges, 0 markings/sec, 240 secs
lola: 4718594 markings, 481445978 edges, 0 markings/sec, 245 secs
lola: 4718594 markings, 491745994 edges, 0 markings/sec, 250 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4718598 markings, 496893982 edges
lola: ========================================
lola: subprocess 3 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p5 <= 0)) OR ((1 <= p58)))) AND (((1 <= p5)) AND ((p58 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p5 <= 0)) OR ((1 <= p58)))) AND (((1 <= p5)) AND ((p58 <= 0)))))
lola: processed formula length: 75
lola: 44 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((((1 <= p69)) AND ((p17 <= 0)))) AND (((1 <= p13)) AND ((p38 <= 0)))) OR F (G ((((p4 <= 0)) OR ((1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((((1 <= p69)) AND ((p17 <= 0)))) AND (((1 <= p13)) AND ((p38 <= 0)))) OR F (G ((((p4 <= 0)) OR ((1 <= p18)))))))
lola: processed formula length: 121
lola: 44 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: 1033 markings, 3848 edges
lola: ========================================
lola: subprocess 5 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p56 <= 0)) OR ((1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p56 <= 0)) OR ((1 <= p17))))))
lola: processed formula length: 43
lola: 44 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p67)) AND ((p1 <= 0)))) AND ((((p67 <= 0)) OR ((1 <= p1))) OR (((1 <= p67)) AND ((p1 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p67)) AND ((p1 <= 0)))) AND ((((p67 <= 0)) OR ((1 <= p1))) OR (((1 <= p67)) AND ((p1 <= 0)))))))
lola: processed formula length: 115
lola: 44 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: 1030 markings, 3846 edges
lola: ========================================
lola: subprocess 7 will run for 1103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p50 <= 0)) OR ((1 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p50 <= 0)) OR ((1 <= p48))))
lola: processed formula length: 35
lola: 44 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: 65544 markings, 344071 edges
lola: ========================================
lola: subprocess 8 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F ((((1 <= p67)) AND ((p35 <= 0)))) OR (((p93 <= 0)) OR ((1 <= p56))))) AND (F ((((p67 <= 0)) OR ((1 <= p35)))) OR (F ((((1 <= p67)) AND ((p35 <= 0)))) OR (((p93 <= 0)) OR ((1 <= p56)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F ((((1 <= p67)) AND ((p35 <= 0)))) OR (((p93 <= 0)) OR ((1 <= p56))))) AND (F ((((p67 <= 0)) OR ((1 <= p35)))) OR (F ((((1 <= p67)) AND ((p35 <= 0)))) OR (((p93 <= 0)) OR ((1 <= p56)))))))
lola: processed formula length: 198
lola: 44 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: 232105 markings, 1341161 edges, 46421 markings/sec, 0 secs
lola: 428207 markings, 2569250 edges, 39220 markings/sec, 5 secs
lola: 649890 markings, 3965286 edges, 44337 markings/sec, 10 secs
lola: 863997 markings, 5405957 edges, 42821 markings/sec, 15 secs
lola: 1104571 markings, 6863412 edges, 48115 markings/sec, 20 secs
lola: 1288776 markings, 8001896 edges, 36841 markings/sec, 25 secs
lola: 1405315 markings, 8763949 edges, 23308 markings/sec, 30 secs
lola: 1521755 markings, 9524180 edges, 23288 markings/sec, 35 secs
lola: 1572866 markings, 16500104 edges, 10222 markings/sec, 40 secs
lola: 1572866 markings, 25374244 edges, 0 markings/sec, 45 secs
lola: 1572866 markings, 35473364 edges, 0 markings/sec, 50 secs
lola: 1572866 markings, 45276580 edges, 0 markings/sec, 55 secs
lola: 1572866 markings, 54977046 edges, 0 markings/sec, 60 secs
lola: 1572866 markings, 64652756 edges, 0 markings/sec, 65 secs
lola: 1572866 markings, 74655092 edges, 0 markings/sec, 70 secs
lola: 1572866 markings, 85371824 edges, 0 markings/sec, 75 secs
lola: 1572866 markings, 96073761 edges, 0 markings/sec, 80 secs
lola: 1572866 markings, 106883337 edges, 0 markings/sec, 85 secs
lola: 1572866 markings, 117879668 edges, 0 markings/sec, 90 secs
lola: 1747341 markings, 119258614 edges, 34895 markings/sec, 95 secs
lola: 1891522 markings, 120169182 edges, 28836 markings/sec, 100 secs
lola: 2010788 markings, 120972837 edges, 23853 markings/sec, 105 secs
lola: 2097154 markings, 127182268 edges, 17273 markings/sec, 110 secs
lola: 2097154 markings, 137495973 edges, 0 markings/sec, 115 secs
lola: 2097154 markings, 147788022 edges, 0 markings/sec, 120 secs
lola: 2097154 markings, 158053312 edges, 0 markings/sec, 125 secs
lola: 2097154 markings, 167365858 edges, 0 markings/sec, 130 secs
lola: 2097154 markings, 176466829 edges, 0 markings/sec, 135 secs
lola: 2097154 markings, 186066682 edges, 0 markings/sec, 140 secs
lola: 2097154 markings, 197103673 edges, 0 markings/sec, 145 secs
lola: 2261863 markings, 200258687 edges, 32942 markings/sec, 150 secs
lola: 2409385 markings, 201192972 edges, 29504 markings/sec, 155 secs
lola: 2528964 markings, 201996605 edges, 23916 markings/sec, 160 secs
lola: 2621442 markings, 207127001 edges, 18496 markings/sec, 165 secs
lola: 2621442 markings, 217092724 edges, 0 markings/sec, 170 secs
lola: 2621442 markings, 227486901 edges, 0 markings/sec, 175 secs
lola: 2621442 markings, 237530302 edges, 0 markings/sec, 180 secs
lola: 2621442 markings, 247899625 edges, 0 markings/sec, 185 secs
lola: 2621442 markings, 258018411 edges, 0 markings/sec, 190 secs
lola: 2692459 markings, 266729858 edges, 14203 markings/sec, 195 secs
lola: 2855090 markings, 267746245 edges, 32526 markings/sec, 200 secs
lola: 2998464 markings, 268690461 edges, 28675 markings/sec, 205 secs
lola: 3145730 markings, 270016911 edges, 29453 markings/sec, 210 secs
lola: 3145730 markings, 280357282 edges, 0 markings/sec, 215 secs
lola: 3145730 markings, 290603574 edges, 0 markings/sec, 220 secs
lola: 3145730 markings, 300963025 edges, 0 markings/sec, 225 secs
lola: 3145730 markings, 311072080 edges, 0 markings/sec, 230 secs
lola: 3145730 markings, 321456599 edges, 0 markings/sec, 235 secs
lola: 3265905 markings, 327670193 edges, 24035 markings/sec, 240 secs
lola: 3429654 markings, 328682529 edges, 32750 markings/sec, 245 secs
lola: 3560741 markings, 329567395 edges, 26217 markings/sec, 250 secs
lola: 3670018 markings, 333695466 edges, 21855 markings/sec, 255 secs
lola: 3670018 markings, 343621941 edges, 0 markings/sec, 260 secs
lola: 3670018 markings, 353905420 edges, 0 markings/sec, 265 secs
lola: 3670018 markings, 363806489 edges, 0 markings/sec, 270 secs
lola: 3670018 markings, 373920499 edges, 0 markings/sec, 275 secs
lola: 3670018 markings, 384124816 edges, 0 markings/sec, 280 secs
lola: 3853378 markings, 385789852 edges, 36672 markings/sec, 285 secs
lola: 4005352 markings, 386747123 edges, 30395 markings/sec, 290 secs
lola: 4116581 markings, 387500687 edges, 22246 markings/sec, 295 secs
lola: 4194306 markings, 393438533 edges, 15545 markings/sec, 300 secs
lola: 4194306 markings, 402604125 edges, 0 markings/sec, 305 secs
lola: 4194306 markings, 411635597 edges, 0 markings/sec, 310 secs
lola: 4194306 markings, 420639695 edges, 0 markings/sec, 315 secs
lola: 4194306 markings, 430663023 edges, 0 markings/sec, 320 secs
lola: 4194306 markings, 440586075 edges, 0 markings/sec, 325 secs
lola: 4371816 markings, 442148574 edges, 35502 markings/sec, 330 secs
lola: 4536029 markings, 443191841 edges, 32843 markings/sec, 335 secs
lola: 4703767 markings, 444289067 edges, 33548 markings/sec, 340 secs
lola: 4718594 markings, 452481057 edges, 2965 markings/sec, 345 secs
lola: 4718594 markings, 461353378 edges, 0 markings/sec, 350 secs
lola: 4718594 markings, 470251961 edges, 0 markings/sec, 355 secs
lola: 4718594 markings, 479249212 edges, 0 markings/sec, 360 secs
lola: 4718594 markings, 488762225 edges, 0 markings/sec, 365 secs
lola: 4742876 markings, 497021505 edges, 4856 markings/sec, 370 secs
lola: 4916340 markings, 498079381 edges, 34693 markings/sec, 375 secs
lola: 5087382 markings, 499186692 edges, 34208 markings/sec, 380 secs
lola: 5242882 markings, 501552846 edges, 31100 markings/sec, 385 secs
lola: 5242882 markings, 511429778 edges, 0 markings/sec, 390 secs
lola: 5242882 markings, 521605883 edges, 0 markings/sec, 395 secs
lola: 5242882 markings, 531664495 edges, 0 markings/sec, 400 secs
lola: 5242882 markings, 541802052 edges, 0 markings/sec, 405 secs
lola: 5242882 markings, 551950531 edges, 0 markings/sec, 410 secs
lola: 5436037 markings, 553583389 edges, 38631 markings/sec, 415 secs
lola: 5618648 markings, 554768811 edges, 36522 markings/sec, 420 secs
lola: 5767170 markings, 557483648 edges, 29704 markings/sec, 425 secs
lola: 5767170 markings, 567444271 edges, 0 markings/sec, 430 secs
lola: 5767170 markings, 577274423 edges, 0 markings/sec, 435 secs
lola: 5767170 markings, 586038996 edges, 0 markings/sec, 440 secs
lola: 5767170 markings, 595137076 edges, 0 markings/sec, 445 secs
lola: 5767170 markings, 604333072 edges, 0 markings/sec, 450 secs
lola: 5891844 markings, 608554383 edges, 24935 markings/sec, 455 secs
lola: 6046104 markings, 609507904 edges, 30852 markings/sec, 460 secs
lola: 6208889 markings, 610607514 edges, 32557 markings/sec, 465 secs
lola: 6291458 markings, 616548968 edges, 16514 markings/sec, 470 secs
lola: 6291458 markings, 626500871 edges, 0 markings/sec, 475 secs
lola: 6291458 markings, 636659270 edges, 0 markings/sec, 480 secs
lola: 6291458 markings, 646647985 edges, 0 markings/sec, 485 secs
lola: 6291458 markings, 656789727 edges, 0 markings/sec, 490 secs
lola: 6379308 markings, 663688671 edges, 17570 markings/sec, 495 secs
lola: 6558231 markings, 664788753 edges, 35785 markings/sec, 500 secs
lola: 6730791 markings, 665946467 edges, 34512 markings/sec, 505 secs
lola: 6815746 markings, 671830109 edges, 16991 markings/sec, 510 secs
lola: 6815746 markings, 681773964 edges, 0 markings/sec, 515 secs
lola: 6815746 markings, 691948895 edges, 0 markings/sec, 520 secs
lola: 6815746 markings, 701924700 edges, 0 markings/sec, 525 secs
lola: 6815746 markings, 712044309 edges, 0 markings/sec, 530 secs
lola: 6899942 markings, 718994724 edges, 16839 markings/sec, 535 secs
lola: 7070248 markings, 720054821 edges, 34061 markings/sec, 540 secs
lola: 7244057 markings, 721200051 edges, 34762 markings/sec, 545 secs
lola: 7340034 markings, 726102953 edges, 19195 markings/sec, 550 secs
lola: 7340034 markings, 736005252 edges, 0 markings/sec, 555 secs
lola: 7340034 markings, 746107310 edges, 0 markings/sec, 560 secs
lola: 7340034 markings, 756023524 edges, 0 markings/sec, 565 secs
lola: 7340034 markings, 765582058 edges, 0 markings/sec, 570 secs
lola: 7354836 markings, 773916794 edges, 2960 markings/sec, 575 secs
lola: 7515843 markings, 774885844 edges, 32201 markings/sec, 580 secs
lola: 7668723 markings, 775849742 edges, 30576 markings/sec, 585 secs
lola: 7825793 markings, 776898616 edges, 31414 markings/sec, 590 secs
lola: 7864322 markings, 784779327 edges, 7706 markings/sec, 595 secs
lola: 7864322 markings, 794651137 edges, 0 markings/sec, 600 secs
lola: 7864322 markings, 804708536 edges, 0 markings/sec, 605 secs
lola: 7864322 markings, 814456412 edges, 0 markings/sec, 610 secs
lola: 7864322 markings, 824410586 edges, 0 markings/sec, 615 secs
lola: 7968732 markings, 829760426 edges, 20882 markings/sec, 620 secs
lola: 8123005 markings, 830717921 edges, 30855 markings/sec, 625 secs
lola: 8281010 markings, 831768933 edges, 31601 markings/sec, 630 secs
lola: 8388610 markings, 835463715 edges, 21520 markings/sec, 635 secs
lola: 8388610 markings, 844959342 edges, 0 markings/sec, 640 secs
lola: 8388610 markings, 854655588 edges, 0 markings/sec, 645 secs
lola: 8388610 markings, 864253751 edges, 0 markings/sec, 650 secs
lola: 8388610 markings, 873847454 edges, 0 markings/sec, 655 secs
lola: 8388610 markings, 883495882 edges, 0 markings/sec, 660 secs
lola: 8525782 markings, 885265515 edges, 27434 markings/sec, 665 secs
lola: 8641714 markings, 886005570 edges, 23186 markings/sec, 670 secs
lola: 8763092 markings, 886819318 edges, 24276 markings/sec, 675 secs
lola: 8878147 markings, 887564715 edges, 23011 markings/sec, 680 secs
lola: 8912898 markings, 894218171 edges, 6950 markings/sec, 685 secs
lola: 8912898 markings, 902649910 edges, 0 markings/sec, 690 secs
lola: 8912898 markings, 911527589 edges, 0 markings/sec, 695 secs
lola: 8912898 markings, 920698665 edges, 0 markings/sec, 700 secs
lola: 8912898 markings, 930081415 edges, 0 markings/sec, 705 secs
lola: 8912898 markings, 939520326 edges, 0 markings/sec, 710 secs
lola: 9016457 markings, 940386857 edges, 20712 markings/sec, 715 secs
lola: 9111366 markings, 940987482 edges, 18982 markings/sec, 720 secs
lola: 9214802 markings, 941629559 edges, 20687 markings/sec, 725 secs
lola: 9314130 markings, 942314522 edges, 19866 markings/sec, 730 secs
lola: 9407653 markings, 942922695 edges, 18705 markings/sec, 735 secs
lola: 9437186 markings, 950083903 edges, 5907 markings/sec, 740 secs
lola: 9437186 markings, 959316051 edges, 0 markings/sec, 745 secs
lola: 9437186 markings, 968675442 edges, 0 markings/sec, 750 secs
lola: 9437186 markings, 977777441 edges, 0 markings/sec, 755 secs
lola: 9437186 markings, 987027966 edges, 0 markings/sec, 760 secs
lola: 9455700 markings, 995193750 edges, 3703 markings/sec, 765 secs
lola: 9536095 markings, 995678877 edges, 16079 markings/sec, 770 secs
lola: 9597861 markings, 996057926 edges, 12353 markings/sec, 775 secs
lola: 9661780 markings, 996481873 edges, 12784 markings/sec, 780 secs
lola: 9745076 markings, 997005286 edges, 16659 markings/sec, 785 secs
lola: 9820134 markings, 997538604 edges, 15012 markings/sec, 790 secs
lola: 9884402 markings, 997963211 edges, 12854 markings/sec, 795 secs
lola: 9961474 markings, 999933456 edges, 15414 markings/sec, 800 secs
lola: 9961474 markings, 1008869589 edges, 0 markings/sec, 805 secs
lola: 9961474 markings, 1018251468 edges, 0 markings/sec, 810 secs
lola: 9961474 markings, 1027486925 edges, 0 markings/sec, 815 secs
lola: 9961474 markings, 1036624826 edges, 0 markings/sec, 820 secs
lola: 9961474 markings, 1045813914 edges, 0 markings/sec, 825 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9961477 markings, 1050410903 edges
lola: ========================================
lola: subprocess 9 will run for 2473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p33 <= 0)) OR ((1 <= p48)))) OR (((p58 <= 0)) OR ((1 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p33 <= 0)) OR ((1 <= p48)))) OR (((p58 <= 0)) OR ((1 <= p98)))))
lola: processed formula length: 75
lola: 44 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: 16 markings, 23 edges
lola: lola: ========================================
RESULT
lola:
SUMMARY: no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no
lola: memory consumption: 38040 KB
lola: time consumption: 1098 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="Dekker-PT-020"
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 Dekker-PT-020, 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 r178-tajo-158987882200321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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