fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r322-tall-162132127800073
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ServersAndClients-PT-100160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8195.611 3600000.00 2774682.00 17038.20 FFTTFFFTFFFFFFTF normal

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-162132127800073.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-100160, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127800073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.8K May 11 20:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 20:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 17:22 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 31M 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-100160-00
FORMULA_NAME ServersAndClients-PT-100160-01
FORMULA_NAME ServersAndClients-PT-100160-02
FORMULA_NAME ServersAndClients-PT-100160-03
FORMULA_NAME ServersAndClients-PT-100160-04
FORMULA_NAME ServersAndClients-PT-100160-05
FORMULA_NAME ServersAndClients-PT-100160-06
FORMULA_NAME ServersAndClients-PT-100160-07
FORMULA_NAME ServersAndClients-PT-100160-08
FORMULA_NAME ServersAndClients-PT-100160-09
FORMULA_NAME ServersAndClients-PT-100160-10
FORMULA_NAME ServersAndClients-PT-100160-11
FORMULA_NAME ServersAndClients-PT-100160-12
FORMULA_NAME ServersAndClients-PT-100160-13
FORMULA_NAME ServersAndClients-PT-100160-14
FORMULA_NAME ServersAndClients-PT-100160-15

=== Now, execution of the tool begins

BK_START 1621440445281

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 16:07:26] [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:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 16:07:27] [INFO ] Load time of PNML (sax parser for PT used): 880 ms
[2021-05-19 16:07:27] [INFO ] Transformed 16561 places.
[2021-05-19 16:07:27] [INFO ] Transformed 32200 transitions.
[2021-05-19 16:07:27] [INFO ] Found NUPN structural information;
[2021-05-19 16:07:27] [INFO ] Parsed PT model containing 16561 places and 32200 transitions in 1067 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 185 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 3491 ms. (steps per millisecond=28 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 32200 rows 16561 cols
[2021-05-19 16:07:33] [INFO ] Computed 361 place invariants in 1656 ms
[2021-05-19 16:07:40] [INFO ] [Real]Absence check using 261 positive place invariants in 4148 ms returned sat
[2021-05-19 16:07:41] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1450 ms returned sat
[2021-05-19 16:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:07:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:07:53] [INFO ] [Real]Absence check using state equation in 12012 ms returned (error "Failed to check-sat")
[2021-05-19 16:07:59] [INFO ] [Real]Absence check using 261 positive place invariants in 4311 ms returned sat
[2021-05-19 16:08:01] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1416 ms returned sat
[2021-05-19 16:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:08:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:08:13] [INFO ] [Real]Absence check using state equation in 12238 ms returned (error "Failed to check-sat")
[2021-05-19 16:08:19] [INFO ] [Real]Absence check using 261 positive place invariants in 4266 ms returned sat
[2021-05-19 16:08:21] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1417 ms returned sat
[2021-05-19 16:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:08:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:08:33] [INFO ] [Real]Absence check using state equation in 12400 ms returned (error "Failed to check-sat")
[2021-05-19 16:08:39] [INFO ] [Real]Absence check using 261 positive place invariants in 3923 ms returned sat
[2021-05-19 16:08:40] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1362 ms returned sat
[2021-05-19 16:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:08:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:08:53] [INFO ] [Real]Absence check using state equation in 12806 ms returned unknown
[2021-05-19 16:08:59] [INFO ] [Real]Absence check using 261 positive place invariants in 4046 ms returned sat
[2021-05-19 16:09:01] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1404 ms returned sat
[2021-05-19 16:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:09:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:09:13] [INFO ] [Real]Absence check using state equation in 12176 ms returned unknown
[2021-05-19 16:09:19] [INFO ] [Real]Absence check using 261 positive place invariants in 4290 ms returned sat
[2021-05-19 16:09:21] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1451 ms returned sat
[2021-05-19 16:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:09:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:09:33] [INFO ] [Real]Absence check using state equation in 12279 ms returned (error "Failed to check-sat")
[2021-05-19 16:09:39] [INFO ] [Real]Absence check using 261 positive place invariants in 4208 ms returned sat
[2021-05-19 16:09:41] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 1533 ms returned sat
[2021-05-19 16:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:09:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:09:53] [INFO ] [Real]Absence check using state equation in 12296 ms returned (error "Failed to check-sat")
[2021-05-19 16:09:56] [INFO ] [Real]Absence check using 261 positive place invariants in 167 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-19 16:09:57] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 16:09:57] [INFO ] Flatten gal took : 1335 ms
FORMULA ServersAndClients-PT-100160-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:09:57] [INFO ] Applying decomposition
[2021-05-19 16:09:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 16:09:58] [INFO ] Flatten gal took : 1046 ms
[2021-05-19 16:09:59] [INFO ] Decomposing Gal with order
[2021-05-19 16:10:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 16:23:42] [INFO ] Removed a total of 31680 redundant transitions.
[2021-05-19 16:23:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 16:24:04] [INFO ] Flatten gal took : 842335 ms
[2021-05-19 16:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 32000 labels/synchronizations in 17035 ms.
[2021-05-19 16:24:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ServersAndClients-PT-100160-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:24:44] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 16:24:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 129 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ServersAndClients-PT-100160 @ 3570 seconds

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

FORMULA ServersAndClients-PT-100160-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-100160-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-100160-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-100160-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-100160-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-100160-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ServersAndClients-PT-100160-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-100160-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1901
rslt: Output for LTLCardinality @ ServersAndClients-PT-100160

{
"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:45 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 174
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 3,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((G (((p2990 <= 1) AND (1 <= p2990))) AND (F ((((p13929 <= 0)) OR ((p3785 <= 1) AND (1 <= p3785)))) AND F ((((p12002 <= 0)) OR ((p7113 <= 1) AND (1 <= p7113))))))))",
"processed_size": 171,
"rewrites": 81
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 191
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((((p11554 <= 0)) OR ((p10065 <= 1) AND (1 <= p10065))) OR ((p15844 <= 1) AND (1 <= p15844)))))",
"processed_size": 102,
"rewrites": 81
},
"result":
{
"edges": 18060,
"markings": 9092,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 3,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) AND (G ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) OR (((p9553 <= 0)) OR ((p15864 <= 1) AND (1 <= p15864))))))",
"processed_size": 186,
"rewrites": 81
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 4,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F (((G ((((p7747 <= 0)) OR ((p619 <= 1) AND (1 <= p619)))) OR (((1 <= p9632)) AND ((2 <= p9632) OR (p9632 <= 0)))) AND F ((((1 <= p7747)) AND ((2 <= p619) OR (p619 <= 0))))))))",
"processed_size": 185,
"rewrites": 81
},
"result":
{
"edges": 7,
"markings": 7,
"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": 318
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((2 <= p9742) OR (p9742 <= 0))",
"processed_size": 31,
"rewrites": 83
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p14587 <= 0)) OR ((p13893 <= 1) AND (1 <= p13893)))))",
"processed_size": 63,
"rewrites": 81
},
"result":
{
"edges": 32201,
"markings": 16202,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (((p9742 <= 1) AND (1 <= p9742))) AND X (F ((((p3029 <= 0)) OR ((p12471 <= 1) AND (1 <= p12471)))))))",
"processed_size": 108,
"rewrites": 81
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X ((((p14633 <= 0)) OR ((p3910 <= 1) AND (1 <= p3910)))) OR ((p14383 <= 1) AND (1 <= p14383))))",
"processed_size": 100,
"rewrites": 81
},
"result":
{
"edges": 5519,
"markings": 2782,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((((p10082 <= 0)) OR ((p10082 <= 1) AND (1 <= p10082)))))",
"processed_size": 63,
"rewrites": 81
},
"result":
{
"edges": 32200,
"markings": 16201,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "G (F (((p2111 <= 1) AND (1 <= p2111))))",
"processed_size": 39,
"rewrites": 81
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 951
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 4,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((((((1 <= p3182)) AND ((2 <= p4567) OR (p4567 <= 0))) R F ((((1 <= p15644)) AND ((2 <= p15644) OR (p15644 <= 0))))) AND (((1 <= p15644)) AND ((2 <= p15644) OR (p15644 <= 0))))))",
"processed_size": 186,
"rewrites": 81
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 1902
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1902
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))",
"processed_size": 53,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))",
"processed_size": 53,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F ((((1 <= p2238)) AND ((2 <= p11387) OR (p11387 <= 0)))))",
"processed_size": 62,
"rewrites": 81
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3926176,
"runtime": 1669.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : X(X((G(**) AND (F(*) AND F(**))))) : (G(F(*)) AND **) : X(G((** OR **))) : X(X(F((X((X(**) U G(**))) OR (** OR **))))) : X((X(**) AND (G(*) OR (** OR **)))) : X(X(F(((G(**) OR **) AND F(*))))) : F(G(((* R F(*)) AND (* AND *)))) : ((F(**) AND X(F(**))) OR (G(F(**)) AND F((F(**) AND X(F(**)))))) : G((X(**) OR **)) : G(F(**))"
},
"net":
{
"arcs": 96800,
"conflict_clusters": 16102,
"places": 16561,
"places_significant": 16200,
"singleton_clusters": 0,
"transitions": 32200
},
"result":
{
"preliminary_value": "yes no no no yes no no no no no no ",
"value": "yes no no no yes 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: 48761/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 529952
lola: finding significant places
lola: 16561 places, 32200 transitions, 16200 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X (G (X (F ((((p10082 <= 0)) OR ((p10082 <= 1) AND (1 <= p10082))))))) : X (X (((G (((p2990 <= 1) AND (1 <= p2990))) AND NOT(G ((((1 <= p13929)) AND ((2 <= p3785) OR (p3785 <= 0)))))) AND F ((((p12002 <= 0)) OR ((p7113 <= 1) AND (1 <= p7113))))))) : (G (F (NOT(G (((1 <= 0) U (((p2238 <= 0)) OR ((p11387 <= 1) AND (1 <= p11387)))))))) AND (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))) : G ((X ((((p11554 <= 0)) OR ((p10065 <= 1) AND (1 <= p10065)))) OR X (((p15844 <= 1) AND (1 <= p15844))))) : X (F (X (((((1 <= p7319)) AND ((2 <= p413) OR (p413 <= 0))) U F (((X ((X ((((p4291 <= 0)) OR ((p7786 <= 1) AND (1 <= p7786)))) U G ((((p4291 <= 0)) OR ((p7786 <= 1) AND (1 <= p7786)))))) OR ((p7319 <= 0))) OR ((p413 <= 1) AND (1 <= p413)))))))) : X ((X ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) AND ((G (NOT(F ((((p5031 <= 0)) OR ((p14919 <= 1) AND (1 <= p14919)))))) OR ((p9553 <= 0))) OR ((p15864 <= 1) AND (1 <= p15864))))) : NOT(G (X ((NOT(X ((G ((((p7747 <= 0)) OR ((p619 <= 1) AND (1 <= p619)))) OR (((1 <= p9632)) AND ((2 <= p9632) OR (p9632 <= 0)))))) OR G (X (G ((((p7747 <= 0)) OR ((p619 <= 1) AND (1 <= p619)))))))))) : NOT(G (NOT(F (X (NOT(X (F (((((((p3182 <= 0)) OR ((p4567 <= 1) AND (1 <= p4567))) U G ((((p15644 <= 0)) OR ((p15644 <= 1) AND (1 <= p15644))))) OR ((p15644 <= 0))) OR ((p15644 <= 1) AND (1 <= p15644))))))))))) : (G (F ((((p14587 <= 0)) OR ((p13893 <= 1) AND (1 <= p13893))))) U (F (((p9742 <= 1) AND (1 <= p9742))) AND F (X ((((p3029 <= 0)) OR ((p12471 <= 1) AND (1 <= p12471))))))) : G ((X ((((p14633 <= 0)) OR ((p3910 <= 1) AND (1 <= p3910)))) OR ((p14383 <= 1) AND (1 <= p14383)))) : G (((0 <= 0) U ((p2111 <= 1) AND (1 <= p2111))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:318
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:318
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((p2990 <= 1) AND (1 <= p2990))) AND (F ((((p13929 <= 0)) OR ((p3785 <= 1) AND (1 <= p3785)))) AND F ((((p12002 <= 0)) OR ((p7113 <= 1) AND (1 <= p7113))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((p2990 <= 1) AND (1 <= p2990))) AND (F ((((p13929 <= 0)) OR ((p3785 <= 1) AND (1 <= p3785)))) AND F ((((p12002 <= 0)) OR ((p7113 <= 1) AND (1 <= p7113))))))))
lola: processed formula length: 171
lola: 81 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((p11554 <= 0)) OR ((p10065 <= 1) AND (1 <= p10065))) OR ((p15844 <= 1) AND (1 <= p15844)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((p11554 <= 0)) OR ((p10065 <= 1) AND (1 <= p10065))) OR ((p15844 <= 1) AND (1 <= p15844)))))
lola: processed formula length: 102
lola: 81 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: 9092 markings, 18060 edges
lola: ========================================
lola: subprocess 2 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X ((X ((((p4291 <= 0)) OR ((p7786 <= 1) AND (1 <= p7786)))) U G ((((p4291 <= 0)) OR ((p7786 <= 1) AND (1 <= p7786)))))) OR (((p7319 <= 0)) OR ((p413 <= 1) AND (1 <= p413)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X ((X ((((p4291 <= 0)) OR ((p7786 <= 1) AND (1 <= p7786)))) U G ((((p4291 <= 0)) OR ((p7786 <= 1) AND (1 <= p7786)))))) OR (((p7319 <= 0)) OR ((p413 <= 1) AND (1 <= p413)))))))
lola: processed formula length: 188
lola: 81 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16102 markings, 16101 edges
lola: ========================================
lola: subprocess 3 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) AND (G ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) OR (((p9553 <= 0)) OR ((p15864 <= 1) AND (1 <= p15864))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) AND (G ((((1 <= p5031)) AND ((2 <= p14919) OR (p14919 <= 0)))) OR (((p9553 <= 0)) OR ((p15864 <= 1) AND (1 <= p15864))))))
lola: processed formula length: 186
lola: 81 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((G ((((p7747 <= 0)) OR ((p619 <= 1) AND (1 <= p619)))) OR (((1 <= p9632)) AND ((2 <= p9632) OR (p9632 <= 0)))) AND F ((((1 <= p7747)) AND ((2 <= p619) OR (p619 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((G ((((p7747 <= 0)) OR ((p619 <= 1) AND (1 <= p619)))) OR (((1 <= p9632)) AND ((2 <= p9632) OR (p9632 <= 0)))) AND F ((((1 <= p7747)) AND ((2 <= p619) OR (p619 <= 0))))))))
lola: processed formula length: 185
lola: 81 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((p9742 <= 1) AND (1 <= p9742))) AND X (F ((((p3029 <= 0)) OR ((p12471 <= 1) AND (1 <= p12471)))))) OR (G (F ((((p14587 <= 0)) OR ((p13893 <= 1) AND (1 <= p13893))))) AND F ((F (((p9742 <= 1) AND (1 <= p9742))) AND X (F ((((p3029 <= 0)) OR ((p12471 <= 1) AND (1 <= p12471)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p9742 <= 1) AND (1 <= p9742)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((2 <= p9742) OR (p9742 <= 0))
lola: processed formula length: 31
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p14587 <= 0)) OR ((p13893 <= 1) AND (1 <= p13893)))))
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 ((((p14587 <= 0)) OR ((p13893 <= 1) AND (1 <= p13893)))))
lola: processed formula length: 63
lola: 81 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: 16202 markings, 32201 edges
lola: ========================================
lola: subprocess 7 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p9742 <= 1) AND (1 <= p9742))) AND X (F ((((p3029 <= 0)) OR ((p12471 <= 1) AND (1 <= p12471)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p9742 <= 1) AND (1 <= p9742))) AND X (F ((((p3029 <= 0)) OR ((p12471 <= 1) AND (1 <= p12471)))))))
lola: processed formula length: 108
lola: 81 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((p14633 <= 0)) OR ((p3910 <= 1) AND (1 <= p3910)))) OR ((p14383 <= 1) AND (1 <= p14383))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((p14633 <= 0)) OR ((p3910 <= 1) AND (1 <= p3910)))) OR ((p14383 <= 1) AND (1 <= p14383))))
lola: processed formula length: 100
lola: 81 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: 2782 markings, 5519 edges
lola: ========================================
lola: subprocess 7 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p10082 <= 0)) OR ((p10082 <= 1) AND (1 <= p10082)))))
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 ((((p10082 <= 0)) OR ((p10082 <= 1) AND (1 <= p10082)))))
lola: processed formula length: 63
lola: 81 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: 16201 markings, 32200 edges
lola: ========================================
lola: subprocess 8 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p2111 <= 1) AND (1 <= p2111))))
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 (((p2111 <= 1) AND (1 <= p2111))))
lola: processed formula length: 39
lola: 81 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((((1 <= p3182)) AND ((2 <= p4567) OR (p4567 <= 0))) R F ((((1 <= p15644)) AND ((2 <= p15644) OR (p15644 <= 0))))) AND (((1 <= p15644)) AND ((2 <= p15644) OR (p15644 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((((1 <= p3182)) AND ((2 <= p4567) OR (p4567 <= 0))) R F ((((1 <= p15644)) AND ((2 <= p15644) OR (p15644 <= 0))))) AND (((1 <= p15644)) AND ((2 <= p15644) OR (p15644 <= 0))))))
lola: processed formula length: 186
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 1902 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((1 <= p2238)) AND ((2 <= p11387) OR (p11387 <= 0))))) AND (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1902 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))
lola: processed formula length: 53
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((((1 <= p2238)) AND ((2 <= p11387) OR (p11387 <= 0))))) AND (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p11619 <= 0)) OR ((p3851 <= 1) AND (1 <= p3851)))
lola: processed formula length: 53
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p2238)) AND ((2 <= p11387) OR (p11387 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p2238)) AND ((2 <= p11387) OR (p11387 <= 0)))))
lola: processed formula length: 62
lola: 81 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no no no no no
lola:
preliminary result: yes no no no yes no no no no no no
lola: memory consumption: 3926176 KB
lola: time consumption: 1669 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-100160"
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-100160, 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-162132127800073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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