Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r322-tall-162132127800081.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ServersAndClients-PT-200040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127800081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 138K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.9K May 11 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 16M May 12 08:13 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 ServersAndClients-PT-200040-00
FORMULA_NAME ServersAndClients-PT-200040-01
FORMULA_NAME ServersAndClients-PT-200040-02
FORMULA_NAME ServersAndClients-PT-200040-03
FORMULA_NAME ServersAndClients-PT-200040-04
FORMULA_NAME ServersAndClients-PT-200040-05
FORMULA_NAME ServersAndClients-PT-200040-06
FORMULA_NAME ServersAndClients-PT-200040-07
FORMULA_NAME ServersAndClients-PT-200040-08
FORMULA_NAME ServersAndClients-PT-200040-09
FORMULA_NAME ServersAndClients-PT-200040-10
FORMULA_NAME ServersAndClients-PT-200040-11
FORMULA_NAME ServersAndClients-PT-200040-12
FORMULA_NAME ServersAndClients-PT-200040-13
FORMULA_NAME ServersAndClients-PT-200040-14
FORMULA_NAME ServersAndClients-PT-200040-15

=== Now, execution of the tool begins

BK_START 1621441141058

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 16:19:02] [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]
[2021-05-19 16:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 16:19:03] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2021-05-19 16:19:03] [INFO ] Transformed 8841 places.
[2021-05-19 16:19:03] [INFO ] Transformed 16400 transitions.
[2021-05-19 16:19:03] [INFO ] Found NUPN structural information;
[2021-05-19 16:19:03] [INFO ] Parsed PT model containing 8841 places and 16400 transitions in 650 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 146 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2589 ms. (steps per millisecond=38 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0]
// Phase 1: matrix 16400 rows 8841 cols
[2021-05-19 16:19:06] [INFO ] Computed 441 place invariants in 613 ms
[2021-05-19 16:19:09] [INFO ] [Real]Absence check using 241 positive place invariants in 1475 ms returned sat
[2021-05-19 16:19:11] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 1479 ms returned sat
[2021-05-19 16:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:19:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:19:26] [INFO ] [Real]Absence check using state equation in 15724 ms returned (error "Failed to check-sat")
[2021-05-19 16:19:29] [INFO ] [Real]Absence check using 241 positive place invariants in 1548 ms returned sat
[2021-05-19 16:19:31] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 1627 ms returned sat
[2021-05-19 16:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:19:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:19:46] [INFO ] [Real]Absence check using state equation in 15656 ms returned (error "Failed to check-sat")
[2021-05-19 16:19:49] [INFO ] [Real]Absence check using 241 positive place invariants in 1478 ms returned sat
[2021-05-19 16:19:50] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 1444 ms returned sat
[2021-05-19 16:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:20:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:20:06] [INFO ] [Real]Absence check using state equation in 16035 ms returned (error "Failed to check-sat")
[2021-05-19 16:20:09] [INFO ] [Real]Absence check using 241 positive place invariants in 1493 ms returned sat
[2021-05-19 16:20:11] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 1586 ms returned sat
[2021-05-19 16:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:20:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:20:26] [INFO ] [Real]Absence check using state equation in 15874 ms returned (error "Failed to check-sat")
[2021-05-19 16:20:29] [INFO ] [Real]Absence check using 241 positive place invariants in 1530 ms returned sat
[2021-05-19 16:20:31] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 1554 ms returned sat
[2021-05-19 16:20:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:20:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:20:46] [INFO ] [Real]Absence check using state equation in 15875 ms returned unknown
[2021-05-19 16:20:47] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 16:20:47] [INFO ] Flatten gal took : 778 ms
FORMULA ServersAndClients-PT-200040-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:20:47] [INFO ] Applying decomposition
[2021-05-19 16:20:48] [INFO ] Flatten gal took : 563 ms
[2021-05-19 16:20:49] [INFO ] Decomposing Gal with order
[2021-05-19 16:20:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 16:24:15] [INFO ] Removed a total of 15920 redundant transitions.
[2021-05-19 16:24:21] [INFO ] Flatten gal took : 211516 ms
[2021-05-19 16:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 16000 labels/synchronizations in 4494 ms.
[2021-05-19 16:24:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 16:24:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 84 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ServersAndClients-PT-200040 @ 3570 seconds

FORMULA ServersAndClients-PT-200040-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3119
rslt: Output for LTLCardinality @ ServersAndClients-PT-200040

{
"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 May 19 16:24:33 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 284
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 ((((p1653 <= 0)) OR ((1 <= p8641))))",
"processed_size": 39,
"rewrites": 42
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"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 ((((p7271 <= 0)) OR ((1 <= p2550))))))",
"processed_size": 47,
"rewrites": 42
},
"result":
{
"edges": 8201,
"markings": 8202,
"produced_by": "LTL model checker",
"value": true
},
"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": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((((p5326 <= 0)) OR ((1 <= p8434)))) U (((p5668 <= 0)) OR ((1 <= p2797)) OR ((p5326 <= 0)) OR ((1 <= p8434)))))",
"processed_size": 121,
"rewrites": 42
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((X ((((p4932 <= 0)) OR ((p6650 <= 1) AND (1 <= p6650)))) OR ((((p5720 <= 0)) OR ((p4083 <= 1) AND (1 <= p4083))) AND (((p6845 <= 0)) OR ((1 <= p3606))))))",
"processed_size": 160,
"rewrites": 42
},
"result":
{
"edges": 16402,
"markings": 8403,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1040
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((((p7371 <= 0)) OR ((1 <= p3289)))))",
"processed_size": 43,
"rewrites": 42
},
"result":
{
"edges": 11268,
"markings": 5773,
"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": 1560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((((p7004 <= 0)) OR ((p4048 <= 1) AND (1 <= p4048))) AND ((p2803 <= 0)))))",
"processed_size": 81,
"rewrites": 42
},
"result":
{
"edges": 16402,
"markings": 8403,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3120
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p299 <= 0)))",
"processed_size": 17,
"rewrites": 42
},
"result":
{
"edges": 4108,
"markings": 2108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 1080212,
"runtime": 451.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((X(G(*)) AND *))) : (G((G(**) AND X(G(**)))) OR X(**)) : G(F(*)) : (X(F(*)) AND G(*)) : X(*) : G(*) : G((F(G(**)) AND X(F(**)))) : X(X(F(**))) : X((X(**) U **)) : G((X(**) OR **)) : F(G(**)) : FALSE"
},
"net":
{
"arcs": 49600,
"conflict_clusters": 8202,
"places": 8841,
"places_significant": 8400,
"singleton_clusters": 0,
"transitions": 16400
},
"result":
{
"preliminary_value": "no yes yes no no no no yes yes yes no no ",
"value": "no yes yes no no no no yes yes yes 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: 25241/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 282912
lola: finding significant places
lola: 8841 places, 16400 transitions, 8400 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: (p1378 <= 1)
lola: LP says that atomic proposition is always true: (p4537 <= 1)
lola: LP says that atomic proposition is always true: (p8641 <= 1)
lola: LP says that atomic proposition is always true: (p2803 <= 1)
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p2269 <= 1)
lola: LP says that atomic proposition is always true: (p2269 <= 1)
lola: LP says that atomic proposition is always true: (p2269 <= 1)
lola: LP says that atomic proposition is always true: (p2550 <= 1)
lola: LP says that atomic proposition is always true: (p2550 <= 1)
lola: LP says that atomic proposition is always true: (p8434 <= 1)
lola: LP says that atomic proposition is always true: (p2797 <= 1)
lola: LP says that atomic proposition is always true: (p8434 <= 1)
lola: LP says that atomic proposition is always true: (p3606 <= 1)
lola: LP says that atomic proposition is always true: (p3289 <= 1)
lola: LP says that atomic proposition is always true: (p3360 <= 1)
lola: LP says that atomic proposition is always true: (p3360 <= 1)
lola: F (NOT(G ((X (F (X ((((p8603 <= 0)) OR ((1 <= p1378)))))) OR X (((1 <= p4537))))))) : (G ((G (((p5818 <= 1) AND (1 <= p5818))) AND X (G (((p1415 <= 1) AND (1 <= p1415)))))) OR X ((((p1653 <= 0)) OR ((1 <= p8641))))) : NOT(F (G (X (((((1 <= p7004)) AND ((2 <= p4048) OR (p4048 <= 0))) OR ((1 <= p2803))))))) : (NOT(X (G ((((p6656 <= 0)) OR ((p5575 <= 1) AND (1 <= p5575)))))) AND NOT(F (((p4373 <= 1) AND (1 <= p4373))))) : NOT(X ((((p4082 <= 0)) OR ((p3592 <= 1) AND (1 <= p3592))))) : NOT(F (((1 <= p299)))) : G ((F ((X ((((p421 <= 0)) OR ((1 <= p2269)))) U G ((((p421 <= 0)) OR ((1 <= p2269)))))) AND X (((1 <= 0) U F ((((p421 <= 0)) OR ((1 <= p2269)))))))) : F ((X ((((p7271 <= 0)) OR ((1 <= p2550)))) U X (X ((((p7271 <= 0)) OR ((1 <= p2550))))))) : X ((X ((((p5326 <= 0)) OR ((1 <= p8434)))) U (((p5668 <= 0)) OR ((1 <= p2797)) OR ((p5326 <= 0)) OR ((1 <= p8434))))) : G ((X ((((p4932 <= 0)) OR ((p6650 <= 1) AND (1 <= p6650)))) OR ((((p5720 <= 0)) OR ((p4083 <= 1) AND (1 <= p4083))) AND (((p6845 <= 0)) OR ((1 <= p3606)))))) : F (G ((((p7371 <= 0)) OR ((1 <= p3289))))) : (X (F (X (()))) AND G (F (())))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G (((p5818 <= 1) AND (1 <= p5818))) AND X (G (((p1415 <= 1) AND (1 <= p1415)))))) OR X ((((p1653 <= 0)) OR ((1 <= p8641)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p1653 <= 0)) OR ((1 <= p8641))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p1653 <= 0)) OR ((1 <= p8641))))
lola: processed formula length: 39
lola: 42 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: 201 markings, 200 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p6656)) AND ((2 <= p5575) OR (p5575 <= 0))))) AND G (((2 <= p4373) OR (p4373 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((2 <= p4373) OR (p4373 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((2 <= p4373) OR (p4373 <= 0)))
lola: processed formula length: 35
lola: 42 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: 6516 markings, 12715 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p4082)) AND ((2 <= p3592) OR (p3592 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p4082)) AND ((2 <= p3592) OR (p3592 <= 0))))
lola: processed formula length: 56
lola: 42 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((((p421 <= 0)) OR ((1 <= p2269))))) AND X (F ((((p421 <= 0)) OR ((1 <= p2269)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((((p421 <= 0)) OR ((1 <= p2269))))) AND X (F ((((p421 <= 0)) OR ((1 <= p2269)))))))
lola: processed formula length: 95
lola: 42 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: add low 14068
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: 7905 markings, 15426 edges
lola: ========================================
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p7271 <= 0)) OR ((1 <= p2550))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p7271 <= 0)) OR ((1 <= p2550))))))
lola: processed formula length: 47
lola: 42 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: 8202 markings, 8201 edges
lola: ========================================
lola: subprocess 6 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((p5326 <= 0)) OR ((1 <= p8434)))) U (((p5668 <= 0)) OR ((1 <= p2797)) OR ((p5326 <= 0)) OR ((1 <= p8434)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((p5326 <= 0)) OR ((1 <= p8434)))) U (((p5668 <= 0)) OR ((1 <= p2797)) OR ((p5326 <= 0)) OR ((1 <= p8434)))))
lola: processed formula length: 121
lola: 42 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: 201 markings, 200 edges
lola: ========================================
lola: subprocess 7 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((p4932 <= 0)) OR ((p6650 <= 1) AND (1 <= p6650)))) OR ((((p5720 <= 0)) OR ((p4083 <= 1) AND (1 <= p4083))) AND (((p6845 <= 0)) OR ((1 <= p3606))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((p4932 <= 0)) OR ((p6650 <= 1) AND (1 <= p6650)))) OR ((((p5720 <= 0)) OR ((p4083 <= 1) AND (1 <= p4083))) AND (((p6845 <= 0)) OR ((1 <= p3606))))))
lola: processed formula length: 160
lola: 42 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: 8403 markings, 16402 edges
lola: ========================================
lola: subprocess 8 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G ((((1 <= p8603)) AND ((p1378 <= 0))))) AND ((p4537 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G ((((1 <= p8603)) AND ((p1378 <= 0))))) AND ((p4537 <= 0)))))
lola: processed formula length: 72
lola: 42 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p7371 <= 0)) OR ((1 <= p3289)))))
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 ((((p7371 <= 0)) OR ((1 <= p3289)))))
lola: processed formula length: 43
lola: 42 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: 5773 markings, 11268 edges
lola: ========================================
lola: subprocess 10 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p7004 <= 0)) OR ((p4048 <= 1) AND (1 <= p4048))) AND ((p2803 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p7004 <= 0)) OR ((p4048 <= 1) AND (1 <= p4048))) AND ((p2803 <= 0)))))
lola: processed formula length: 81
lola: 42 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8403 markings, 16402 edges
lola: ========================================
lola: subprocess 11 will run for 3120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p299 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p299 <= 0)))
lola: processed formula length: 17
lola: 42 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: 2108 markings, 4108 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no no yes yes yes no no
lola:
preliminary result: no yes yes no no no no yes yes yes no no
lola: memory consumption: 1080212 KB
lola: time consumption: 451 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="ServersAndClients-PT-200040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ServersAndClients-PT-200040, 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 r322-tall-162132127800081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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