Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.1K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620896451225

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:00:52] [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-13 09:00:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:00:52] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-13 09:00:52] [INFO ] Transformed 25 places.
[2021-05-13 09:00:52] [INFO ] Transformed 18 transitions.
[2021-05-13 09:00:52] [INFO ] Parsed PT model containing 25 places and 18 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100003 steps, including 163 resets, run finished after 77 ms. (steps per millisecond=1298 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:00:52] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-13 09:00:52] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2021-05-13 09:00:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:00:52] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-13 09:00:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-13 09:00:53] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 09:00:53] [INFO ] Flatten gal took : 25 ms
FORMULA ClientsAndServers-PT-N0005P0-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P0-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:00:53] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:00:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 09:00:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0005P0 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0005P0-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2680
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0005P0

{
"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": "Thu May 13 09:00:53 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p1 + 1 <= p24)",
"processed_size": 15,
"rewrites": 83
},
"result":
{
"edges": 439,
"markings": 437,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p1 <= p3))",
"processed_size": 14,
"rewrites": 81
},
"result":
{
"edges": 240,
"markings": 240,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p3 <= 0)",
"processed_size": 9,
"rewrites": 83
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p12 <= 2)",
"processed_size": 10,
"rewrites": 83
},
"result":
{
"edges": 222,
"markings": 222,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p4 <= p15)) OR (p5 <= p22))))",
"processed_size": 40,
"rewrites": 81
},
"result":
{
"edges": 2767,
"markings": 1716,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X (((p12 <= 2) AND (2 <= p24)))",
"processed_size": 31,
"rewrites": 81
},
"result":
{
"edges": 1,
"markings": 2,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 5,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F ((p0 <= p4)) AND ((p0 <= p4) AND (F (((p5 + 1 <= p22) AND (p6 + 1 <= p22))) OR G ((F ((p0 <= p4)) AND (p0 <= p4)))))))",
"processed_size": 124,
"rewrites": 81
},
"result":
{
"edges": 251,
"markings": 251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((p22 + 1 <= p10))) AND X (G ((X ((p10 <= 2)) AND F ((p4 <= 2))))))))",
"processed_size": 81,
"rewrites": 81
},
"result":
{
"edges": 86332,
"markings": 30028,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((p0 <= p9) AND (F (G ((p0 <= p9))) OR X ((p4 <= p2)))))",
"processed_size": 59,
"rewrites": 81
},
"result":
{
"edges": 696,
"markings": 620,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p22 <= 0)))",
"processed_size": 18,
"rewrites": 81
},
"result":
{
"edges": 331,
"markings": 317,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3115
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 <= p10)",
"processed_size": 11,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p21 + 1 <= p22)))",
"processed_size": 24,
"rewrites": 81
},
"result":
{
"edges": 95314,
"markings": 47543,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 <= p10)",
"processed_size": 11,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p21 + 1 <= p22)",
"processed_size": 16,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p21 + 1 <= p22)))",
"processed_size": 24,
"rewrites": 81
},
"result":
{
"edges": 95314,
"markings": 47543,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 3708,
"runtime": 890.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(**) OR X(F((X(*) AND *))))) : (F(*) AND X(**)) : (F(**) OR ((G((X(**) OR **)) OR (G(**) AND F(G((X(**) OR **))))) AND F(**))) : (X(**) OR (F(**) OR (F((X(**) OR F(**))) AND F(G((F(**) OR **)))))) : X((F(*) AND (* AND (F(*) OR G((F(*) AND *)))))) : ((G(F(*)) AND (F(*) OR G(F(*)))) OR **) : F(G(*)) : G(F((G(F(*)) AND X(G((X(*) AND F(*))))))) : F((** AND (F(G(**)) OR X(**)))) : G(F((G(F(*)) OR **)))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "yes no yes yes no no no no no unknown ",
"value": "yes no yes yes no no no no no unknown "
},
"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: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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 (F ((p24 <= p8))) OR X (X (NOT(G ((X ((p24 <= p8)) OR (p23 <= p6))))))) : (NOT(G ((p1 + 1 <= p24))) AND X ((p16 <= p17))) : (F ((1 <= p3)) OR ((G ((p1 <= p3)) U G ((X ((p1 <= p3)) OR (p1 <= p3)))) AND F ((p1 <= p3)))) : (F (G ((F ((p4 <= p15)) OR (p5 <= p22)))) U (X (((p12 <= 2) AND (2 <= p24))) OR F ((3 <= p12)))) : NOT(X ((G (((p22 <= p5) OR (p22 <= p6))) U (G ((p4 + 1 <= p0)) OR (p4 + 1 <= p0))))) : (NOT((G ((p0 <= p10)) U F ((X ((1 <= p9)) U G (X ((p22 <= p21))))))) OR (p21 + 1 <= p22)) : F (((X ((p13 <= p20)) U (p13 <= p20)) U G (NOT(X ((1 <= p22)))))) : G (NOT(G ((X (F (G ((p10 <= p22)))) OR X (F ((X ((3 <= p10)) OR G ((3 <= p4))))))))) : F (((p0 <= p9) AND (X (F (G ((p0 <= p9)))) OR X ((p4 <= p2))))) : G (F ((F (G (NOT(X (X (X (G (X (G ((p12 <= p13)))))))))) OR (1 <= p4))))
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:315
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:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p24 <= p8)) OR X (F ((X ((p8 + 1 <= p24)) AND (p6 + 1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p24 <= p8)) OR X (F ((X ((p8 + 1 <= p24)) AND (p6 + 1 <= p23))))))
lola: processed formula length: 74
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: 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p24 <= p1)) AND X ((p16 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p24 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p1 + 1 <= p24)
lola: processed formula length: 15
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: 437 markings, 439 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p3)) OR ((G ((X ((p1 <= p3)) OR (p1 <= p3))) OR (G ((p1 <= p3)) AND F (G ((X ((p1 <= p3)) OR (p1 <= p3)))))) AND F ((p1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= p3))
lola: processed formula length: 14
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: 240 markings, 240 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p3))
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: (p3 <= 0)
lola: processed formula length: 9
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p12 <= 2) AND (2 <= p24))) OR (F ((3 <= p12)) OR (F ((X (((p12 <= 2) AND (2 <= p24))) OR F ((3 <= p12)))) AND F (G ((F ((p4 <= p15)) OR (p5 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12 <= 2)
lola: processed formula length: 10
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: 222 markings, 222 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p4 <= p15)) OR (p5 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p4 <= p15)) OR (p5 <= p22))))
lola: processed formula length: 40
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: 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: 1716 markings, 2767 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p12 <= 2) AND (2 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p12 <= 2) AND (2 <= p24)))
lola: processed formula length: 31
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p0 <= p4)) AND ((p0 <= p4) AND (F (((p5 + 1 <= p22) AND (p6 + 1 <= p22))) OR G ((F ((p0 <= p4)) AND (p0 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p0 <= p4)) AND ((p0 <= p4) AND (F (((p5 + 1 <= p22) AND (p6 + 1 <= p22))) OR G ((F ((p0 <= p4)) AND (p0 <= p4)))))))
lola: processed formula length: 124
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 251 markings, 251 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((p22 + 1 <= p10))) AND X (G ((X ((p10 <= 2)) AND F ((p4 <= 2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((p22 + 1 <= p10))) AND X (G ((X ((p10 <= 2)) AND F ((p4 <= 2))))))))
lola: processed formula length: 81
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 30028 markings, 86332 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p0 <= p9) AND (F (G ((p0 <= p9))) OR X ((p4 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((p0 <= p9) AND (F (G ((p0 <= p9))) OR X ((p4 <= p2)))))
lola: processed formula length: 59
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 620 markings, 696 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p22 <= 0)))
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 ((p22 <= 0)))
lola: processed formula length: 18
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: add low 0
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: 317 markings, 331 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((p13 + 1 <= p12))) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((p13 + 1 <= p12))) OR (1 <= p4))))
lola: processed formula length: 47
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: 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: 2691664 markings, 6793324 edges, 538333 markings/sec, 0 secs
lola: 5065058 markings, 13588230 edges, 474679 markings/sec, 5 secs
lola: 7261986 markings, 20786017 edges, 439386 markings/sec, 10 secs
lola: 9434422 markings, 27964924 edges, 434487 markings/sec, 15 secs
lola: 11550703 markings, 34903109 edges, 423256 markings/sec, 20 secs
lola: 13772209 markings, 42143244 edges, 444301 markings/sec, 25 secs
lola: 16142695 markings, 49360356 edges, 474097 markings/sec, 30 secs
lola: 18499563 markings, 56227557 edges, 471374 markings/sec, 35 secs
lola: 20828370 markings, 63027558 edges, 465761 markings/sec, 40 secs
lola: 23138431 markings, 69766000 edges, 462012 markings/sec, 45 secs
lola: 25457776 markings, 76603671 edges, 463869 markings/sec, 50 secs
lola: 27580967 markings, 84276946 edges, 424638 markings/sec, 55 secs
lola: 29367120 markings, 91350467 edges, 357231 markings/sec, 60 secs
lola: 31099277 markings, 98200455 edges, 346431 markings/sec, 65 secs
lola: 32836954 markings, 104967949 edges, 347535 markings/sec, 70 secs
lola: 34517187 markings, 111668463 edges, 336047 markings/sec, 75 secs
lola: 36185054 markings, 118224533 edges, 333573 markings/sec, 80 secs
lola: 37869977 markings, 124822093 edges, 336985 markings/sec, 85 secs
lola: 39568599 markings, 131491313 edges, 339724 markings/sec, 90 secs
lola: 41223797 markings, 138038683 edges, 331040 markings/sec, 95 secs
lola: 42904561 markings, 144619297 edges, 336153 markings/sec, 100 secs
lola: 44628289 markings, 151261746 edges, 344746 markings/sec, 105 secs
lola: 46408412 markings, 157998034 edges, 356025 markings/sec, 110 secs
lola: 48584891 markings, 164752806 edges, 435296 markings/sec, 115 secs
lola: 50687009 markings, 171203459 edges, 420424 markings/sec, 120 secs
lola: 52721166 markings, 177497760 edges, 406831 markings/sec, 125 secs
lola: 54751914 markings, 183772516 edges, 406150 markings/sec, 130 secs
lola: 56828351 markings, 190166165 edges, 415287 markings/sec, 135 secs
lola: 58914113 markings, 196537861 edges, 417152 markings/sec, 140 secs
lola: 61005761 markings, 202900949 edges, 418330 markings/sec, 145 secs
lola: 63047361 markings, 209215113 edges, 408320 markings/sec, 150 secs
lola: 65200423 markings, 215870713 edges, 430612 markings/sec, 155 secs
lola: 67193700 markings, 222265153 edges, 398655 markings/sec, 160 secs
lola: 69357247 markings, 229004416 edges, 432709 markings/sec, 165 secs
lola: 70922140 markings, 235909845 edges, 312979 markings/sec, 170 secs
lola: 72413550 markings, 242349485 edges, 298282 markings/sec, 175 secs
lola: 73881556 markings, 248674709 edges, 293601 markings/sec, 180 secs
lola: 75328568 markings, 254942965 edges, 289402 markings/sec, 185 secs
lola: 76791695 markings, 261264840 edges, 292625 markings/sec, 190 secs
lola: 78238601 markings, 267398286 edges, 289381 markings/sec, 195 secs
lola: 79664832 markings, 273658935 edges, 285246 markings/sec, 200 secs
lola: 81133432 markings, 279879885 edges, 293720 markings/sec, 205 secs
lola: 82584263 markings, 286234420 edges, 290166 markings/sec, 210 secs
lola: 84074393 markings, 292508065 edges, 298026 markings/sec, 215 secs
lola: 85520088 markings, 298861125 edges, 289139 markings/sec, 220 secs
lola: 86906105 markings, 304849896 edges, 277203 markings/sec, 225 secs
lola: 88385371 markings, 311155896 edges, 295853 markings/sec, 230 secs
lola: 89842224 markings, 317503573 edges, 291371 markings/sec, 235 secs
lola: 91219426 markings, 323444284 edges, 275440 markings/sec, 240 secs
lola: 92684809 markings, 329615470 edges, 293077 markings/sec, 245 secs
lola: 94106282 markings, 335868974 edges, 284295 markings/sec, 250 secs
lola: 95457475 markings, 341700226 edges, 270239 markings/sec, 255 secs
lola: 96928308 markings, 347787953 edges, 294167 markings/sec, 260 secs
lola: 98231810 markings, 353857480 edges, 260700 markings/sec, 265 secs
lola: 99669109 markings, 360055544 edges, 287460 markings/sec, 270 secs
lola: 101069473 markings, 366172463 edges, 280073 markings/sec, 275 secs
lola: 102433330 markings, 372080564 edges, 272771 markings/sec, 280 secs
lola: 104150648 markings, 378521360 edges, 343464 markings/sec, 285 secs
lola: 106134667 markings, 384864045 edges, 396804 markings/sec, 290 secs
lola: 108108064 markings, 391059441 edges, 394679 markings/sec, 295 secs
lola: 110021768 markings, 397149931 edges, 382741 markings/sec, 300 secs
lola: 111938505 markings, 403205208 edges, 383347 markings/sec, 305 secs
lola: 113021503 markings, 406506917 edges, 216600 markings/sec, 310 secs
lola: 114382326 markings, 410933161 edges, 272165 markings/sec, 315 secs
lola: 115837045 markings, 415428867 edges, 290944 markings/sec, 320 secs
lola: 117377191 markings, 420412131 edges, 308029 markings/sec, 325 secs
lola: 118779990 markings, 424743210 edges, 280560 markings/sec, 330 secs
lola: 120373307 markings, 429839030 edges, 318663 markings/sec, 335 secs
lola: 121145518 markings, 432128993 edges, 154442 markings/sec, 340 secs
lola: 122494966 markings, 436504093 edges, 269890 markings/sec, 345 secs
lola: 123703994 markings, 440344002 edges, 241806 markings/sec, 350 secs
lola: 124805931 markings, 443755355 edges, 220387 markings/sec, 355 secs
lola: 126112194 markings, 447906292 edges, 261253 markings/sec, 360 secs
lola: 127402010 markings, 451805091 edges, 257963 markings/sec, 365 secs
lola: 128713450 markings, 456128473 edges, 262288 markings/sec, 370 secs
lola: 130028095 markings, 460954010 edges, 262929 markings/sec, 375 secs
lola: 131604574 markings, 466059325 edges, 315296 markings/sec, 380 secs
lola: 133233836 markings, 471100598 edges, 325852 markings/sec, 385 secs
lola: 133562424 markings, 472000021 edges, 65718 markings/sec, 390 secs
lola: 134014041 markings, 473642918 edges, 90323 markings/sec, 395 secs
lola: 134494921 markings, 475867825 edges, 96176 markings/sec, 400 secs
lola: 135119248 markings, 478783240 edges, 124865 markings/sec, 405 secs
lola: 136002282 markings, 482812284 edges, 176607 markings/sec, 410 secs
lola: 136736251 markings, 486333309 edges, 146794 markings/sec, 415 secs
lola: 137398846 markings, 489252181 edges, 132519 markings/sec, 420 secs
lola: 137797302 markings, 491115441 edges, 79691 markings/sec, 425 secs
lola: 138645655 markings, 495015460 edges, 169671 markings/sec, 430 secs
lola: 139122843 markings, 497107725 edges, 95438 markings/sec, 435 secs
lola: 139384266 markings, 498307727 edges, 52285 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F ((p21 + 1 <= p22))) AND (F ((p10 + 1 <= p0)) OR G (F ((p21 + 1 <= p22))))) OR (p21 + 1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p10 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p0 <= p10)
lola: processed formula length: 11
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p21 + 1 <= p22)))
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 ((p21 + 1 <= p22)))
lola: processed formula length: 24
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: 47543 markings, 95314 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((p13 + 1 <= p12))) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((p13 + 1 <= p12))) OR (1 <= p4))))
lola: processed formula length: 47
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: 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: 2972226 markings, 7480800 edges, 594445 markings/sec, 0 secs
lola: 5486697 markings, 14990806 edges, 502894 markings/sec, 5 secs
lola: 7544923 markings, 21779432 edges, 411645 markings/sec, 10 secs
lola: 9556623 markings, 28432749 edges, 402340 markings/sec, 15 secs
lola: 11591421 markings, 35042945 edges, 406960 markings/sec, 20 secs
lola: 13785075 markings, 42184746 edges, 438731 markings/sec, 25 secs
lola: 16128010 markings, 49313770 edges, 468587 markings/sec, 30 secs
lola: 18369558 markings, 55845532 edges, 448310 markings/sec, 35 secs
lola: 20556618 markings, 62211324 edges, 437412 markings/sec, 40 secs
lola: 22713974 markings, 68578223 edges, 431471 markings/sec, 45 secs
lola: 25026432 markings, 75287325 edges, 462492 markings/sec, 50 secs
lola: 27112702 markings, 82375449 edges, 417254 markings/sec, 55 secs
lola: 28819095 markings, 89190365 edges, 341279 markings/sec, 60 secs
lola: 30490062 markings, 95770711 edges, 334193 markings/sec, 65 secs
lola: 32100208 markings, 102128452 edges, 322029 markings/sec, 70 secs
lola: 33702560 markings, 108431537 edges, 320470 markings/sec, 75 secs
lola: 35245011 markings, 114454498 edges, 308490 markings/sec, 80 secs
lola: 36876572 markings, 120868578 edges, 326312 markings/sec, 85 secs
lola: 38452078 markings, 127141243 edges, 315101 markings/sec, 90 secs
lola: 40056775 markings, 133422790 edges, 320939 markings/sec, 95 secs
lola: 41691898 markings, 139909127 edges, 327025 markings/sec, 100 secs
lola: 43318650 markings, 146251325 edges, 325350 markings/sec, 105 secs
lola: 45042080 markings, 152917611 edges, 344686 markings/sec, 110 secs
lola: 46968930 markings, 159733344 edges, 385370 markings/sec, 115 secs
lola: 49039801 markings, 166161298 edges, 414174 markings/sec, 120 secs
lola: 51112069 markings, 172524802 edges, 414454 markings/sec, 125 secs
lola: 53048783 markings, 178555462 edges, 387343 markings/sec, 130 secs
lola: 55043437 markings, 184669172 edges, 398931 markings/sec, 135 secs
lola: 57058004 markings, 190863760 edges, 402913 markings/sec, 140 secs
lola: 59115803 markings, 197180426 edges, 411560 markings/sec, 145 secs
lola: 61211985 markings, 203567636 edges, 419236 markings/sec, 150 secs
lola: 63324693 markings, 210042981 edges, 422542 markings/sec, 155 secs
lola: 65450230 markings, 216755899 edges, 425107 markings/sec, 160 secs
lola: 67501591 markings, 223234295 edges, 410272 markings/sec, 165 secs
lola: 69633863 markings, 230274480 edges, 426454 markings/sec, 170 secs
lola: 71145768 markings, 236896237 edges, 302381 markings/sec, 175 secs
lola: 72651756 markings, 243305022 edges, 301198 markings/sec, 180 secs
lola: 74149058 markings, 249769008 edges, 299460 markings/sec, 185 secs
lola: 75586509 markings, 256052967 edges, 287490 markings/sec, 190 secs
lola: 77068296 markings, 262454411 edges, 296357 markings/sec, 195 secs
lola: 78503710 markings, 268585938 edges, 287083 markings/sec, 200 secs
lola: 79902239 markings, 274660505 edges, 279706 markings/sec, 205 secs
lola: 81310356 markings, 280661419 edges, 281623 markings/sec, 210 secs
lola: 82679278 markings, 286644288 edges, 273784 markings/sec, 215 secs
lola: 84058803 markings, 292423116 edges, 275905 markings/sec, 220 secs
lola: 85412628 markings, 298429327 edges, 270765 markings/sec, 225 secs
lola: 86727733 markings, 304085077 edges, 263021 markings/sec, 230 secs
lola: 88149270 markings, 310115316 edges, 284307 markings/sec, 235 secs
lola: 89545561 markings, 316218702 edges, 279258 markings/sec, 240 secs
lola: 90914351 markings, 322117051 edges, 273758 markings/sec, 245 secs
lola: 92389747 markings, 328340580 edges, 295079 markings/sec, 250 secs
lola: 93790398 markings, 334490281 edges, 280130 markings/sec, 255 secs
lola: 95150600 markings, 340365120 edges, 272040 markings/sec, 260 secs
lola: 96503547 markings, 346157647 edges, 270589 markings/sec, 265 secs
lola: 97915504 markings, 352383019 edges, 282391 markings/sec, 270 secs
lola: 99296764 markings, 358415197 edges, 276252 markings/sec, 275 secs
lola: 100744823 markings, 364775159 edges, 289612 markings/sec, 280 secs
lola: 102102843 markings, 370658795 edges, 271604 markings/sec, 285 secs
lola: 103648538 markings, 376911389 edges, 309139 markings/sec, 290 secs
lola: 105640794 markings, 383262883 edges, 398451 markings/sec, 295 secs
lola: 107560147 markings, 389359325 edges, 383871 markings/sec, 300 secs
lola: 109491802 markings, 395411034 edges, 386331 markings/sec, 305 secs
lola: 111374782 markings, 401377000 edges, 376596 markings/sec, 310 secs
lola: 113209746 markings, 407125031 edges, 366993 markings/sec, 315 secs
lola: 114686528 markings, 411903996 edges, 295356 markings/sec, 320 secs
lola: 115899592 markings, 415649800 edges, 242613 markings/sec, 325 secs
lola: 117341749 markings, 420280242 edges, 288431 markings/sec, 330 secs
lola: 119016770 markings, 425526878 edges, 335004 markings/sec, 335 secs
lola: 120693857 markings, 430819108 edges, 335417 markings/sec, 340 secs
lola: 121870489 markings, 434453335 edges, 235326 markings/sec, 345 secs
lola: 123342059 markings, 439213463 edges, 294314 markings/sec, 350 secs
lola: 124753110 markings, 443593898 edges, 282210 markings/sec, 355 secs
lola: 126103861 markings, 447879120 edges, 270150 markings/sec, 360 secs
lola: 127616221 markings, 452446800 edges, 302472 markings/sec, 365 secs
lola: 129124220 markings, 457690333 edges, 301600 markings/sec, 370 secs
lola: 130641992 markings, 462976795 edges, 303554 markings/sec, 375 secs
lola: 132260726 markings, 468197594 edges, 323747 markings/sec, 380 secs
lola: 133866205 markings, 472937714 edges, 321096 markings/sec, 385 secs
lola: 134594868 markings, 476389824 edges, 145733 markings/sec, 390 secs
lola: 135390061 markings, 480097769 edges, 159039 markings/sec, 395 secs
lola: 136153050 markings, 483567834 edges, 152598 markings/sec, 400 secs
lola: 137155707 markings, 488128592 edges, 200531 markings/sec, 405 secs
lola: 137666380 markings, 490465308 edges, 102135 markings/sec, 410 secs
lola: 138593493 markings, 494792110 edges, 185423 markings/sec, 415 secs
lola: 139036734 markings, 496685544 edges, 88648 markings/sec, 420 secs
lola: 139666485 markings, 499632229 edges, 125950 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((G (F ((p21 + 1 <= p22))) AND (F ((p10 + 1 <= p0)) OR G (F ((p21 + 1 <= p22))))) OR (p21 + 1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p10 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p0 <= p10)
lola: processed formula length: 11
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p21 + 1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 + 1 <= p22)
lola: processed formula length: 16
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: G (F ((p21 + 1 <= p22)))
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 ((p21 + 1 <= p22)))
lola: processed formula length: 24
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: 47543 markings, 95314 edges
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no no unknown
lola:
preliminary result: yes no yes yes no no no no no unknown
lola: memory consumption: 3708 KB
lola: time consumption: 890 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="ClientsAndServers-PT-N0005P0"
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 ClientsAndServers-PT-N0005P0, 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 r056-oct2-162038334500065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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