fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334600109
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ClientsAndServers-PT-N0100P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16254.632 3600000.00 1127815.00 1689.90 ?FFFFTTFFFFFFFFF normal

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-162038334600109.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-N0100P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.9K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:33 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.2K 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-N0100P0-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-15

=== Now, execution of the tool begins

BK_START 1620897989668

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:26:32] [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:26:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:26:32] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-13 09:26:32] [INFO ] Transformed 25 places.
[2021-05-13 09:26:32] [INFO ] Transformed 18 transitions.
[2021-05-13 09:26:32] [INFO ] Parsed PT model containing 25 places and 18 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100176 steps, including 7 resets, run finished after 91 ms. (steps per millisecond=1100 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:26:32] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 58 ms returned unsat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned unsat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 09:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:26:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-13 09:26:32] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:26:32] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-13 09:26:32] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 21 ms.
[2021-05-13 09:26:32] [INFO ] Added : 14 causal constraints over 3 iterations in 126 ms. Result :sat
[2021-05-13 09:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-13 09:26:33] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 09:26:33] [INFO ] Flatten gal took : 36 ms
FORMULA ClientsAndServers-PT-N0100P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:26:33] [INFO ] Flatten gal took : 35 ms
[2021-05-13 09:26:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 09:26:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0100P0 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0100P0-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0100P0-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0100P0-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2481
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0100P0

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"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 ((p16 <= p0))",
"processed_size": 15,
"rewrites": 77
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p24 <= p1))",
"processed_size": 15,
"rewrites": 77
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p22 + 1 <= p5)) AND X ((p23 <= p9)))))",
"processed_size": 49,
"rewrites": 77
},
"result":
{
"edges": 5003,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 540
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"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 ((p19 <= p8))",
"processed_size": 15,
"rewrites": 77
},
"result":
{
"edges": 24777,
"markings": 20791,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((G (((p16 <= p10) AND (1 <= p24))) OR (X (((p10 + 1 <= p16) OR (p15 + 1 <= p11))) OR G ((1 <= p24))))))",
"processed_size": 110,
"rewrites": 77
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((X (G ((p24 + 1 <= p8))) AND (((p4 <= 2) OR (p22 + 1 <= p10)) AND (p10 <= 2)))))",
"processed_size": 87,
"rewrites": 77
},
"result":
{
"edges": 9024,
"markings": 7018,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= p10) R (p18 + 1 <= p24)) OR (p18 + 1 <= p24))))",
"processed_size": 62,
"rewrites": 77
},
"result":
{
"edges": 3223,
"markings": 3223,
"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": 3236
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p22)",
"processed_size": 10,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p22)",
"processed_size": 10,
"rewrites": 77
},
"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": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((p19 + 1 <= p20)) AND ((p19 + 1 <= p20) AND (p13 <= p20))))",
"processed_size": 66,
"rewrites": 77
},
"result":
{
"edges": 2824,
"markings": 2824,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3636,
"runtime": 1089.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((* R X(*)) OR (G(*) AND *)))) : X((F(**) U X(G(**)))) : ((** U **) AND (X(G(**)) AND G(**))) : (F(**) AND (X(**) AND (X(**) U **))) : F(G((F(*) AND X(**)))) : (F((X(X(X(**))) OR **)) AND G(**)) : X(G((G(**) OR (X(**) OR G(**))))) : G(F(((* R *) OR *))) : (F((G(*) AND (* AND *))) OR **) : G(F((X(G(*)) AND (* AND *)))) : X(G(((G(F(**)) OR G((** AND F(**)))) AND (** AND **))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "unknown no no no no no no no no no no ",
"value": "unknown no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: NOT(((0 <= 0) U X (F ((((p5 <= p18) U X ((1 <= p3))) AND (F ((p14 <= p10)) OR (1 <= p3))))))) : (F (((2 <= p22) U X ((p12 <= p11)))) U NOT(X (F (X (NOT(G ((1 <= p8)))))))) : ((((p10 <= p16) U (p7 + 1 <= p8)) AND X (G ((p10 <= p16)))) AND G ((p16 <= p0))) : ((F (((p10 + 1 <= p16) OR (p3 <= p0))) AND X ((p24 <= p1))) AND (X ((p16 <= p17)) U (p24 <= p1))) : F (G ((NOT(G ((p5 <= p22))) AND X ((p23 <= p9))))) : (NOT(G (NOT(F ((X (X (X ((2 <= p4)))) OR (p19 <= p8)))))) AND G ((p19 <= p8))) : G (X (((G (((p16 <= p10) AND (1 <= p24))) OR X (((p10 + 1 <= p16) OR (p15 + 1 <= p11)))) OR G ((1 <= p24))))) : (X ((p24 <= p18)) U F (G (NOT(G ((((p10 + 1 <= p0) U (p24 <= p18)) AND (p24 <= p18))))))) : (NOT(G (((F ((p20 <= p19)) OR (p20 <= p19)) OR (p20 + 1 <= p13)))) OR (1 <= p22)) : X (G (NOT(G (((X (F ((p8 <= p24))) OR ((3 <= p4) AND (p10 <= p22))) OR (3 <= p10)))))) : X (G ((((G ((p12 <= p13)) U G (F ((p20 <= p5)))) AND (1 <= p13)) AND (1 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p18 + 1 <= p5) R X ((p3 <= 0))) OR (G ((p10 + 1 <= p14)) AND (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p18 + 1 <= p5) R X ((p3 <= 0))) OR (G ((p10 + 1 <= p14)) AND (p3 <= 0)))))
lola: processed formula length: 83
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2339991 markings, 7822027 edges, 467998 markings/sec, 0 secs
lola: 4417798 markings, 15467570 edges, 415561 markings/sec, 5 secs
lola: 6359646 markings, 22815941 edges, 388370 markings/sec, 10 secs
lola: 7857593 markings, 28531574 edges, 299589 markings/sec, 15 secs
lola: 9188208 markings, 33627944 edges, 266123 markings/sec, 20 secs
lola: 10821973 markings, 40048452 edges, 326753 markings/sec, 25 secs
lola: 12382890 markings, 46244848 edges, 312183 markings/sec, 30 secs
lola: 13977190 markings, 52480334 edges, 318860 markings/sec, 35 secs
lola: 15257478 markings, 57554560 edges, 256058 markings/sec, 40 secs
lola: 16403904 markings, 62119818 edges, 229285 markings/sec, 45 secs
lola: 17524848 markings, 66579912 edges, 224189 markings/sec, 50 secs
lola: 18640803 markings, 71104741 edges, 223191 markings/sec, 55 secs
lola: 19737291 markings, 75516991 edges, 219298 markings/sec, 60 secs
lola: 20777372 markings, 79791592 edges, 208016 markings/sec, 65 secs
lola: 21919608 markings, 84420950 edges, 228447 markings/sec, 70 secs
lola: 23168203 markings, 89555948 edges, 249719 markings/sec, 75 secs
lola: 24527019 markings, 94979470 edges, 271763 markings/sec, 80 secs
lola: 25880162 markings, 100583653 edges, 270629 markings/sec, 85 secs
lola: 27254128 markings, 106174046 edges, 274793 markings/sec, 90 secs
lola: 28675999 markings, 112029313 edges, 284374 markings/sec, 95 secs
lola: 30036799 markings, 117619861 edges, 272160 markings/sec, 100 secs
lola: 31292035 markings, 122882028 edges, 251047 markings/sec, 105 secs
lola: 32611833 markings, 128378827 edges, 263960 markings/sec, 110 secs
lola: 33902025 markings, 133757120 edges, 258038 markings/sec, 115 secs
lola: 35180526 markings, 138971601 edges, 255700 markings/sec, 120 secs
lola: 36462339 markings, 144287002 edges, 256363 markings/sec, 125 secs
lola: 37701957 markings, 149447785 edges, 247924 markings/sec, 130 secs
lola: 38886663 markings, 154483066 edges, 236941 markings/sec, 135 secs
lola: 40090782 markings, 159572484 edges, 240824 markings/sec, 140 secs
lola: 41247949 markings, 164389433 edges, 231433 markings/sec, 145 secs
lola: 42396914 markings, 169229060 edges, 229793 markings/sec, 150 secs
lola: 43563451 markings, 174205306 edges, 233307 markings/sec, 155 secs
lola: 44735986 markings, 179145421 edges, 234507 markings/sec, 160 secs
lola: 45856842 markings, 183934088 edges, 224171 markings/sec, 165 secs
lola: 46947185 markings, 188660877 edges, 218069 markings/sec, 170 secs
lola: 48052172 markings, 193368809 edges, 220997 markings/sec, 175 secs
lola: 49251485 markings, 198397411 edges, 239863 markings/sec, 180 secs
lola: 50386768 markings, 203226710 edges, 227057 markings/sec, 185 secs
lola: 51474464 markings, 207832401 edges, 217539 markings/sec, 190 secs
lola: 52569429 markings, 212506036 edges, 218993 markings/sec, 195 secs
lola: 53688258 markings, 217218508 edges, 223766 markings/sec, 200 secs
lola: 54713967 markings, 221664972 edges, 205142 markings/sec, 205 secs
lola: 55663875 markings, 225684037 edges, 189982 markings/sec, 210 secs
lola: 56686189 markings, 230147391 edges, 204463 markings/sec, 215 secs
lola: 57705194 markings, 234523976 edges, 203801 markings/sec, 220 secs
lola: 58737376 markings, 238959217 edges, 206436 markings/sec, 225 secs
lola: 59740995 markings, 243267813 edges, 200724 markings/sec, 230 secs
lola: 60828835 markings, 247907725 edges, 217568 markings/sec, 235 secs
lola: 61853108 markings, 252297876 edges, 204855 markings/sec, 240 secs
lola: 62851155 markings, 256634617 edges, 199609 markings/sec, 245 secs
lola: 63836261 markings, 260886519 edges, 197021 markings/sec, 250 secs
lola: 64786765 markings, 265063207 edges, 190101 markings/sec, 255 secs
lola: 65807009 markings, 269461191 edges, 204049 markings/sec, 260 secs
lola: 66851495 markings, 273978959 edges, 208897 markings/sec, 265 secs
lola: 67826674 markings, 278280604 edges, 195036 markings/sec, 270 secs
lola: 68811130 markings, 282573062 edges, 196891 markings/sec, 275 secs
lola: 69790461 markings, 286818922 edges, 195866 markings/sec, 280 secs
lola: 70789504 markings, 291144159 edges, 199809 markings/sec, 285 secs
lola: 71773298 markings, 295429303 edges, 196759 markings/sec, 290 secs
lola: 72705399 markings, 299584427 edges, 186420 markings/sec, 295 secs
lola: 73666635 markings, 303748176 edges, 192247 markings/sec, 300 secs
lola: 74623362 markings, 308030148 edges, 191345 markings/sec, 305 secs
lola: 75557038 markings, 312164486 edges, 186735 markings/sec, 310 secs
lola: 76509001 markings, 316290592 edges, 190393 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p12 <= p11)) U X (G ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p12 <= p11)) U X (G ((1 <= p8)))))
lola: processed formula length: 42
lola: 77 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: 12100 markings, 16544 edges
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p10 <= p16) U (p7 + 1 <= p8)) AND (X (G ((p10 <= p16))) AND G ((p16 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p16 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p16 <= p0))
lola: processed formula length: 15
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5001 markings, 5001 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p10 + 1 <= p16) OR (p3 <= p0))) AND (X ((p24 <= p1)) AND (X ((p16 <= p17)) U (p24 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p10 + 1 <= p16) OR (p3 <= p0)))
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: ((p16 <= p10) AND (p0 + 1 <= p3))
lola: processed formula length: 33
lola: 79 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: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p24 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p24 <= p1))
lola: processed formula length: 15
lola: 77 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: 5001 markings, 5001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p22 + 1 <= p5)) AND X ((p23 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p22 + 1 <= p5)) AND X ((p23 <= p9)))))
lola: processed formula length: 49
lola: 77 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: 5002 markings, 5003 edges
lola: ========================================
lola: subprocess 5 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (X (X ((2 <= p4)))) OR (p19 <= p8))) AND G ((p19 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p19 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p19 <= p8))
lola: processed formula length: 15
lola: 77 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: 20791 markings, 24777 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 6 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p16 <= p10) AND (1 <= p24))) OR (X (((p10 + 1 <= p16) OR (p15 + 1 <= p11))) OR G ((1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p16 <= p10) AND (1 <= p24))) OR (X (((p10 + 1 <= p16) OR (p15 + 1 <= p11))) OR G ((1 <= p24))))))
lola: processed formula length: 110
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 5001 markings, 5001 edges
lola: ========================================
lola: subprocess 7 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p24 + 1 <= p8))) AND (((p4 <= 2) OR (p22 + 1 <= p10)) AND (p10 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p24 + 1 <= p8))) AND (((p4 <= 2) OR (p22 + 1 <= p10)) AND (p10 <= 2)))))
lola: processed formula length: 87
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
lola: add low 17
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: 7018 markings, 9024 edges
lola: ========================================
lola: subprocess 8 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((G (F ((p20 <= p5))) OR G (((p12 <= p13) AND F ((p20 <= p5))))) AND ((1 <= p13) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((G (F ((p20 <= p5))) OR G (((p12 <= p13) AND F ((p20 <= p5))))) AND ((1 <= p13) AND (1 <= p4)))))
lola: processed formula length: 104
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 2279141 markings, 7579304 edges, 455828 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2846405 markings, 9631538 edges
lola: ========================================
lola: subprocess 9 will run for 1618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= p10) R (p18 + 1 <= p24)) OR (p18 + 1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p0 <= p10) R (p18 + 1 <= p24)) OR (p18 + 1 <= p24))))
lola: processed formula length: 62
lola: 77 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: 3223 markings, 3223 edges
lola: subprocess 10 will run for 3236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p19 + 1 <= p20)) AND ((p19 + 1 <= p20) AND (p13 <= p20)))) OR (1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 10 will run for 3236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p22)
lola: processed formula length: 10
lola: 77 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: 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: X (G ((((p18 + 1 <= p5) R X ((p3 <= 0))) OR (G ((p10 + 1 <= p14)) AND (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p18 + 1 <= p5) R X ((p3 <= 0))) OR (G ((p10 + 1 <= p14)) AND (p3 <= 0)))))
lola: processed formula length: 83
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2363523 markings, 7907343 edges, 472705 markings/sec, 0 secs
lola: 4168964 markings, 14533077 edges, 361088 markings/sec, 5 secs
lola: 5849863 markings, 20859142 edges, 336180 markings/sec, 10 secs
lola: 7368149 markings, 26669919 edges, 303657 markings/sec, 15 secs
lola: 8787711 markings, 32144288 edges, 283912 markings/sec, 20 secs
lola: 10177576 markings, 37520630 edges, 277973 markings/sec, 25 secs
lola: 11552233 markings, 42920080 edges, 274931 markings/sec, 30 secs
lola: 12813407 markings, 47918001 edges, 252235 markings/sec, 35 secs
lola: 14116523 markings, 53052531 edges, 260623 markings/sec, 40 secs
lola: 15347721 markings, 57938181 edges, 246240 markings/sec, 45 secs
lola: 16531598 markings, 62605666 edges, 236775 markings/sec, 50 secs
lola: 17673117 markings, 67195599 edges, 228304 markings/sec, 55 secs
lola: 18789207 markings, 71698838 edges, 223218 markings/sec, 60 secs
lola: 19870164 markings, 76076867 edges, 216191 markings/sec, 65 secs
lola: 20920104 markings, 80363084 edges, 209988 markings/sec, 70 secs
lola: 21999340 markings, 84770719 edges, 215847 markings/sec, 75 secs
lola: 23067524 markings, 89181181 edges, 213637 markings/sec, 80 secs
lola: 24110998 markings, 93313637 edges, 208695 markings/sec, 85 secs
lola: 25162240 markings, 97592282 edges, 210248 markings/sec, 90 secs
lola: 26178531 markings, 101794765 edges, 203258 markings/sec, 95 secs
lola: 27139856 markings, 105702667 edges, 192265 markings/sec, 100 secs
lola: 28174476 markings, 110012835 edges, 206924 markings/sec, 105 secs
lola: 29167570 markings, 114033824 edges, 198619 markings/sec, 110 secs
lola: 30143371 markings, 118049557 edges, 195160 markings/sec, 115 secs
lola: 30996825 markings, 121659118 edges, 170691 markings/sec, 120 secs
lola: 31966854 markings, 125738412 edges, 194006 markings/sec, 125 secs
lola: 32929222 markings, 129677025 edges, 192474 markings/sec, 130 secs
lola: 33918981 markings, 133827585 edges, 197952 markings/sec, 135 secs
lola: 34933166 markings, 137966121 edges, 202837 markings/sec, 140 secs
lola: 35975521 markings, 142220089 edges, 208471 markings/sec, 145 secs
lola: 37018155 markings, 146612461 edges, 208527 markings/sec, 150 secs
lola: 38088652 markings, 151114048 edges, 214099 markings/sec, 155 secs
lola: 39135072 markings, 155545892 edges, 209284 markings/sec, 160 secs
lola: 40075298 markings, 159502762 edges, 188045 markings/sec, 165 secs
lola: 40816081 markings, 162586640 edges, 148157 markings/sec, 170 secs
lola: 41519152 markings, 165544631 edges, 140614 markings/sec, 175 secs
lola: 42487066 markings, 169594703 edges, 193583 markings/sec, 180 secs
lola: 43237631 markings, 172758302 edges, 150113 markings/sec, 185 secs
lola: 43961233 markings, 175878499 edges, 144720 markings/sec, 190 secs
lola: 44725094 markings, 179106679 edges, 152772 markings/sec, 195 secs
lola: 45446055 markings, 182174766 edges, 144192 markings/sec, 200 secs
lola: 46149137 markings, 185160245 edges, 140616 markings/sec, 205 secs
lola: 46865805 markings, 188304912 edges, 143334 markings/sec, 210 secs
lola: 47589311 markings, 191392578 edges, 144701 markings/sec, 215 secs
lola: 48284354 markings, 194375801 edges, 139009 markings/sec, 220 secs
lola: 49073642 markings, 197645101 edges, 157858 markings/sec, 225 secs
lola: 49827120 markings, 200848005 edges, 150696 markings/sec, 230 secs
lola: 50509096 markings, 203736483 edges, 136395 markings/sec, 235 secs
lola: 51193933 markings, 206656141 edges, 136967 markings/sec, 240 secs
lola: 51901345 markings, 209652681 edges, 141482 markings/sec, 245 secs
lola: 52615819 markings, 212699112 edges, 142895 markings/sec, 250 secs
lola: 53308327 markings, 215615239 edges, 138502 markings/sec, 255 secs
lola: 54007206 markings, 218616007 edges, 139776 markings/sec, 260 secs
lola: 54679995 markings, 221519124 edges, 134558 markings/sec, 265 secs
lola: 55389322 markings, 224501437 edges, 141865 markings/sec, 270 secs
lola: 56079205 markings, 227520390 edges, 137977 markings/sec, 275 secs
lola: 56740306 markings, 230385374 edges, 132220 markings/sec, 280 secs
lola: 57404833 markings, 233241677 edges, 132905 markings/sec, 285 secs
lola: 58081348 markings, 236147314 edges, 135303 markings/sec, 290 secs
lola: 58736241 markings, 238953861 edges, 130979 markings/sec, 295 secs
lola: 59379736 markings, 241715165 edges, 128699 markings/sec, 300 secs
lola: 60027814 markings, 244494139 edges, 129616 markings/sec, 305 secs
lola: 60747613 markings, 247567463 edges, 143960 markings/sec, 310 secs
lola: 61415277 markings, 250428480 edges, 133533 markings/sec, 315 secs
lola: 62064720 markings, 253222995 edges, 129889 markings/sec, 320 secs
lola: 62716631 markings, 256045970 edges, 130382 markings/sec, 325 secs
lola: 63363410 markings, 258872009 edges, 129356 markings/sec, 330 secs
lola: 64009279 markings, 261678427 edges, 129174 markings/sec, 335 secs
lola: 64619055 markings, 264312569 edges, 121955 markings/sec, 340 secs
lola: 65241621 markings, 267051918 edges, 124513 markings/sec, 345 secs
lola: 65930483 markings, 269973910 edges, 137772 markings/sec, 350 secs
lola: 66570737 markings, 272775532 edges, 128051 markings/sec, 355 secs
lola: 67247831 markings, 275712529 edges, 135419 markings/sec, 360 secs
lola: 67888941 markings, 278552984 edges, 128222 markings/sec, 365 secs
lola: 68532292 markings, 281346892 edges, 128670 markings/sec, 370 secs
lola: 69181894 markings, 284194949 edges, 129920 markings/sec, 375 secs
lola: 69847876 markings, 287038823 edges, 133196 markings/sec, 380 secs
lola: 70471164 markings, 289769969 edges, 124658 markings/sec, 385 secs
lola: 71106250 markings, 292540177 edges, 127017 markings/sec, 390 secs
lola: 71743434 markings, 295299317 edges, 127437 markings/sec, 395 secs
lola: 72385118 markings, 298131210 edges, 128337 markings/sec, 400 secs
lola: 72949989 markings, 300681543 edges, 112974 markings/sec, 405 secs
lola: 73571405 markings, 303349887 edges, 124283 markings/sec, 410 secs
lola: 74199891 markings, 306136398 edges, 125697 markings/sec, 415 secs
lola: 74837481 markings, 308968221 edges, 127518 markings/sec, 420 secs
lola: 75461724 markings, 311750670 edges, 124849 markings/sec, 425 secs
lola: 76116730 markings, 314597314 edges, 131001 markings/sec, 430 secs
lola: 76726061 markings, 317231613 edges, 121866 markings/sec, 435 secs
lola: 77341818 markings, 319937435 edges, 123151 markings/sec, 440 secs
lola: 77946793 markings, 322563463 edges, 120995 markings/sec, 445 secs
lola: 78572648 markings, 325345560 edges, 125171 markings/sec, 450 secs
lola: 79207031 markings, 328049985 edges, 126877 markings/sec, 455 secs
lola: 79832727 markings, 330757452 edges, 125139 markings/sec, 460 secs
lola: 80434688 markings, 333412577 edges, 120392 markings/sec, 465 secs
lola: 81071184 markings, 336219222 edges, 127299 markings/sec, 470 secs
lola: 81718715 markings, 339079069 edges, 129506 markings/sec, 475 secs
lola: 82299883 markings, 341622231 edges, 116234 markings/sec, 480 secs
lola: 82945510 markings, 344455584 edges, 129125 markings/sec, 485 secs
lola: 83619674 markings, 347353975 edges, 134833 markings/sec, 490 secs
lola: 84208896 markings, 349982572 edges, 117844 markings/sec, 495 secs
lola: 84848238 markings, 352763358 edges, 127868 markings/sec, 500 secs
lola: 85455869 markings, 355429777 edges, 121526 markings/sec, 505 secs
lola: 86090319 markings, 358215491 edges, 126890 markings/sec, 510 secs
lola: 86668910 markings, 360761362 edges, 115718 markings/sec, 515 secs
lola: 87231089 markings, 363279968 edges, 112436 markings/sec, 520 secs
lola: 87806802 markings, 365799894 edges, 115143 markings/sec, 525 secs
lola: 88379460 markings, 368328504 edges, 114532 markings/sec, 530 secs
lola: 88983744 markings, 370992621 edges, 120857 markings/sec, 535 secs
lola: 89556208 markings, 373548802 edges, 114493 markings/sec, 540 secs
lola: 90166696 markings, 376256679 edges, 122098 markings/sec, 545 secs
lola: 90840413 markings, 379163407 edges, 134743 markings/sec, 550 secs
lola: 91395908 markings, 381634969 edges, 111099 markings/sec, 555 secs
lola: 91966147 markings, 384153479 edges, 114048 markings/sec, 560 secs
lola: 92520154 markings, 386583388 edges, 110801 markings/sec, 565 secs
lola: 93075125 markings, 389052915 edges, 110994 markings/sec, 570 secs
lola: 93697604 markings, 391799780 edges, 124496 markings/sec, 575 secs
lola: 94281152 markings, 394369834 edges, 116710 markings/sec, 580 secs
lola: 94830897 markings, 396785733 edges, 109949 markings/sec, 585 secs
lola: 95407245 markings, 399299003 edges, 115270 markings/sec, 590 secs
lola: 95982470 markings, 401881844 edges, 115045 markings/sec, 595 secs
lola: 96572361 markings, 404481339 edges, 117978 markings/sec, 600 secs
lola: 97164384 markings, 407095478 edges, 118405 markings/sec, 605 secs
lola: 97788648 markings, 409828661 edges, 124853 markings/sec, 610 secs
lola: 98405644 markings, 412498565 edges, 123399 markings/sec, 615 secs
lola: 98973521 markings, 415036603 edges, 113575 markings/sec, 620 secs
lola: 99534183 markings, 417535665 edges, 112132 markings/sec, 625 secs
lola: 100100021 markings, 420076302 edges, 113168 markings/sec, 630 secs
lola: 100658896 markings, 422566773 edges, 111775 markings/sec, 635 secs
lola: 101213516 markings, 425015864 edges, 110924 markings/sec, 640 secs
lola: 101771420 markings, 427532628 edges, 111581 markings/sec, 645 secs
lola: 102355507 markings, 430137235 edges, 116817 markings/sec, 650 secs
lola: 102888147 markings, 432488963 edges, 106528 markings/sec, 655 secs
lola: 103461746 markings, 435062752 edges, 114720 markings/sec, 660 secs
lola: 104009737 markings, 437495625 edges, 109598 markings/sec, 665 secs
lola: 104585221 markings, 440054491 edges, 115097 markings/sec, 670 secs
lola: 105142102 markings, 442540872 edges, 111376 markings/sec, 675 secs
lola: 105703118 markings, 445004366 edges, 112203 markings/sec, 680 secs
lola: 106248075 markings, 447476710 edges, 108991 markings/sec, 685 secs
lola: 106821805 markings, 449996376 edges, 114746 markings/sec, 690 secs
lola: 107388576 markings, 452544438 edges, 113354 markings/sec, 695 secs
lola: 107957264 markings, 455144183 edges, 113738 markings/sec, 700 secs
lola: 108507569 markings, 457571966 edges, 110061 markings/sec, 705 secs
lola: 109046476 markings, 460021731 edges, 107781 markings/sec, 710 secs
lola: 109610428 markings, 462542736 edges, 112790 markings/sec, 715 secs
lola: 110183148 markings, 465136246 edges, 114544 markings/sec, 720 secs
lola: 110720276 markings, 467547362 edges, 107426 markings/sec, 725 secs
lola: 111274704 markings, 470037349 edges, 110886 markings/sec, 730 secs
lola: 111882204 markings, 472761337 edges, 121500 markings/sec, 735 secs
lola: 112519317 markings, 475629251 edges, 127423 markings/sec, 740 secs
lola: 113221556 markings, 478741306 edges, 140448 markings/sec, 745 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((G ((p19 + 1 <= p20)) AND ((p19 + 1 <= p20) AND (p13 <= p20)))) OR (1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p22)
lola: processed formula length: 10
lola: 77 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: F ((G ((p19 + 1 <= p20)) AND ((p19 + 1 <= p20) AND (p13 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p19 + 1 <= p20)) AND ((p19 + 1 <= p20) AND (p13 <= p20))))
lola: processed formula length: 66
lola: 77 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: 2824 markings, 2824 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no no no no no
lola:
preliminary result: unknown no no no no no no no no no no
lola: memory consumption: 3636 KB
lola: time consumption: 1089 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-N0100P0"
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-N0100P0, 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-162038334600109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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