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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.1K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.4K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K 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-N0020P2-00
FORMULA_NAME ClientsAndServers-PT-N0020P2-01
FORMULA_NAME ClientsAndServers-PT-N0020P2-02
FORMULA_NAME ClientsAndServers-PT-N0020P2-03
FORMULA_NAME ClientsAndServers-PT-N0020P2-04
FORMULA_NAME ClientsAndServers-PT-N0020P2-05
FORMULA_NAME ClientsAndServers-PT-N0020P2-06
FORMULA_NAME ClientsAndServers-PT-N0020P2-07
FORMULA_NAME ClientsAndServers-PT-N0020P2-08
FORMULA_NAME ClientsAndServers-PT-N0020P2-09
FORMULA_NAME ClientsAndServers-PT-N0020P2-10
FORMULA_NAME ClientsAndServers-PT-N0020P2-11
FORMULA_NAME ClientsAndServers-PT-N0020P2-12
FORMULA_NAME ClientsAndServers-PT-N0020P2-13
FORMULA_NAME ClientsAndServers-PT-N0020P2-14
FORMULA_NAME ClientsAndServers-PT-N0020P2-15

=== Now, execution of the tool begins

BK_START 1620897480643

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

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

FORMULA ClientsAndServers-PT-N0020P2-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA ClientsAndServers-PT-N0020P2-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P2-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3087
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0020P2

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

{
"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": 1,
"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": "G ((p7 <= 1))",
"processed_size": 13,
"rewrites": 41
},
"result":
{
"edges": 3887,
"markings": 3641,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 446
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (F ((p8 <= p7))))",
"processed_size": 22,
"rewrites": 41
},
"result":
{
"edges": 1145,
"markings": 1145,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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": 5,
"visible_transitions": 0
},
"processed": "X (F (((X ((p10 + 1 <= p16)) AND (p18 + 1 <= p19)) OR (p16 <= p17))))",
"processed_size": 69,
"rewrites": 41
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p15 <= p23)) AND X (X (G ((p15 <= p23))))))",
"processed_size": 51,
"rewrites": 41
},
"result":
{
"edges": 1145,
"markings": 1145,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((G ((p20 <= p5)) OR (1 <= p4))) OR X (X (F ((p7 <= p2))))))",
"processed_size": 66,
"rewrites": 41
},
"result":
{
"edges": 171690,
"markings": 84817,
"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": 1111
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((p13 <= p20)))",
"processed_size": 20,
"rewrites": 41
},
"result":
{
"edges": 623,
"markings": 621,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1666
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((2 <= p24)) OR (3 <= p12))))",
"processed_size": 38,
"rewrites": 41
},
"result":
{
"edges": 959,
"markings": 959,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3333
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 + 1 <= p23)",
"processed_size": 15,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"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": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 + 1 <= p23)",
"processed_size": 15,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p22 <= p5))",
"processed_size": 15,
"rewrites": 41
},
"result":
{
"edges": 187,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3812,
"runtime": 483.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(F(**))) OR (F(G(*)) AND G(**))) : X(F(((X(*) AND *) OR *))) : G(F((G(**) OR **))) : G((F(**) AND X(X(G(**))))) : (G(*) AND F(**)) : G(F(**)) : F(G(**)) : F(G((G(*) OR (X(**) U **)))) : G((G((G(**) OR **)) OR X(X(F(**)))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no yes no no no unknown no no no ",
"value": "no yes no no no unknown 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: (X (X (F ((p8 <= p7)))) OR (NOT(G (F ((2 <= p7)))) AND G ((p7 <= 1)))) : X (NOT(G (((X ((p16 <= p10)) OR (p19 <= p18)) AND (p17 + 1 <= p16))))) : F (G (F ((G ((2 <= p24)) OR (3 <= p12))))) : G ((F ((X ((2 <= p4)) U (p15 <= p23))) AND G (X (G (X ((p15 <= p23))))))) : (NOT(F ((p5 + 1 <= p22))) AND F ((p23 <= p2))) : G (F (X ((p22 <= p21)))) : X (F (X (G ((p13 <= p20))))) : X (NOT(X (G (F ((((0 <= 0) U (3 <= p18)) AND NOT((X ((p18 <= 2)) U (3 <= p18))))))))) : G ((G ((G ((p20 <= p5)) OR (1 <= p4))) OR X (X (F ((p7 <= p2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:341
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:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p8 <= p7)))) OR (F (G ((p7 <= 1))) AND G ((p7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p7 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p7 <= 1))
lola: processed formula length: 13
lola: 41 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: 3641 markings, 3887 edges
lola: ========================================
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p8 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p8 <= p7))))
lola: processed formula length: 22
lola: 41 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: 1145 markings, 1145 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((X ((p10 + 1 <= p16)) AND (p18 + 1 <= p19)) OR (p16 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((X ((p10 + 1 <= p16)) AND (p18 + 1 <= p19)) OR (p16 <= p17))))
lola: processed formula length: 69
lola: 41 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: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p15 <= p23)) AND X (X (G ((p15 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p15 <= p23)) AND X (X (G ((p15 <= p23))))))
lola: processed formula length: 51
lola: 41 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: 1145 markings, 1145 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p18 <= 2)) OR (X ((p18 <= 2)) U (3 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p18 <= 2)) OR (X ((p18 <= 2)) U (3 <= p18)))))
lola: processed formula length: 57
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 2153195 markings, 7564685 edges, 430639 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: 2955812 markings, 10630400 edges
lola: ========================================
lola: subprocess 4 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((G ((p20 <= p5)) OR (1 <= p4))) OR X (X (F ((p7 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((G ((p20 <= p5)) OR (1 <= p4))) OR X (X (F ((p7 <= p2))))))
lola: processed formula length: 66
lola: 41 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: 84817 markings, 171690 edges
lola: ========================================
lola: subprocess 5 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p22 <= p21)))
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 ((p22 <= p21)))
lola: processed formula length: 20
lola: 41 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: 4152750 markings, 4833279 edges, 830550 markings/sec, 0 secs
lola: 8423191 markings, 9780380 edges, 854088 markings/sec, 5 secs
lola: 12625954 markings, 14635606 edges, 840553 markings/sec, 10 secs
lola: 16781734 markings, 19432425 edges, 831156 markings/sec, 15 secs
lola: 20879544 markings, 24163039 edges, 819562 markings/sec, 20 secs
lola: 24952324 markings, 28859907 edges, 814556 markings/sec, 25 secs
lola: 28947944 markings, 33469610 edges, 799124 markings/sec, 30 secs
lola: 32975863 markings, 38112496 edges, 805584 markings/sec, 35 secs
lola: 36983637 markings, 42729357 edges, 801555 markings/sec, 40 secs
lola: 40958023 markings, 47305103 edges, 794877 markings/sec, 45 secs
lola: 44867586 markings, 51811367 edges, 781913 markings/sec, 50 secs
lola: 48744961 markings, 56271151 edges, 775475 markings/sec, 55 secs
lola: 52685780 markings, 60807401 edges, 788164 markings/sec, 60 secs
lola: 56716899 markings, 65439881 edges, 806224 markings/sec, 65 secs
lola: 60230793 markings, 69481587 edges, 702779 markings/sec, 70 secs
lola: 62970558 markings, 72633684 edges, 547953 markings/sec, 75 secs
lola: 66279636 markings, 76441105 edges, 661816 markings/sec, 80 secs
lola: 69804630 markings, 80486401 edges, 704999 markings/sec, 85 secs
lola: 73310096 markings, 84515797 edges, 701093 markings/sec, 90 secs
lola: 75994209 markings, 87605983 edges, 536823 markings/sec, 95 secs
lola: 78739362 markings, 90758127 edges, 549031 markings/sec, 100 secs
lola: 81715837 markings, 94183322 edges, 595295 markings/sec, 105 secs
lola: 84805532 markings, 97735889 edges, 617939 markings/sec, 110 secs
lola: 88021613 markings, 101436157 edges, 643216 markings/sec, 115 secs
lola: 91331895 markings, 105243143 edges, 662056 markings/sec, 120 secs
lola: 94558507 markings, 108952713 edges, 645322 markings/sec, 125 secs
lola: 97845549 markings, 112729504 edges, 657408 markings/sec, 130 secs
lola: 101138485 markings, 116515067 edges, 658587 markings/sec, 135 secs
lola: 104427224 markings, 120298304 edges, 657748 markings/sec, 140 secs
lola: 107792539 markings, 124155707 edges, 673063 markings/sec, 145 secs
lola: 111131466 markings, 127993457 edges, 667785 markings/sec, 150 secs
lola: 114307691 markings, 131639580 edges, 635245 markings/sec, 155 secs
lola: 116844958 markings, 134558101 edges, 507453 markings/sec, 160 secs
lola: 118747037 markings, 136749318 edges, 380416 markings/sec, 165 secs
lola: 120984317 markings, 139315458 edges, 447456 markings/sec, 170 secs
lola: 123419777 markings, 142113175 edges, 487092 markings/sec, 175 secs
lola: 125928642 markings, 144990280 edges, 501773 markings/sec, 180 secs
lola: 128424892 markings, 147854790 edges, 499250 markings/sec, 185 secs
lola: 130869667 markings, 150664740 edges, 488955 markings/sec, 190 secs
lola: 133210624 markings, 153357567 edges, 468191 markings/sec, 195 secs
lola: 135553173 markings, 156045302 edges, 468510 markings/sec, 200 secs
lola: 137976723 markings, 158823537 edges, 484710 markings/sec, 205 secs
lola: 140362510 markings, 161560936 edges, 477157 markings/sec, 210 secs
lola: 142709840 markings, 164250824 edges, 469466 markings/sec, 215 secs
lola: 143509604 markings, 165171965 edges, 159953 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p13 <= p20)))
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 ((p13 <= p20)))
lola: processed formula length: 20
lola: 41 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: 621 markings, 623 edges
lola: ========================================
lola: subprocess 7 will run for 1666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((2 <= p24)) OR (3 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((2 <= p24)) OR (3 <= p12))))
lola: processed formula length: 38
lola: 41 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: 959 markings, 959 edges
lola: ========================================
lola: subprocess 8 will run for 3333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p22 <= p5)) AND F ((p23 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p23 <= p2))
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: (p2 + 1 <= p23)
lola: processed formula length: 15
lola: 43 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: 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: ========================================
lola: ...considering subproblem: G (F ((p22 <= p21)))
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 ((p22 <= p21)))
lola: processed formula length: 20
lola: 41 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: 4505045 markings, 5241220 edges, 901009 markings/sec, 0 secs
lola: 8361341 markings, 9708598 edges, 771259 markings/sec, 5 secs
lola: 11982823 markings, 13893693 edges, 724296 markings/sec, 10 secs
lola: 15284642 markings, 17707452 edges, 660364 markings/sec, 15 secs
lola: 18367119 markings, 21261110 edges, 616495 markings/sec, 20 secs
lola: 21366880 markings, 24727236 edges, 599952 markings/sec, 25 secs
lola: 24254658 markings, 28055701 edges, 577556 markings/sec, 30 secs
lola: 27101488 markings, 31340252 edges, 569366 markings/sec, 35 secs
lola: 29949172 markings, 34619215 edges, 569537 markings/sec, 40 secs
lola: 32794171 markings, 37903467 edges, 569000 markings/sec, 45 secs
lola: 35617837 markings, 41155173 edges, 564733 markings/sec, 50 secs
lola: 38487257 markings, 44466642 edges, 573884 markings/sec, 55 secs
lola: 41451147 markings, 47871100 edges, 592778 markings/sec, 60 secs
lola: 44402893 markings, 51277270 edges, 590349 markings/sec, 65 secs
lola: 47406181 markings, 54731676 edges, 600658 markings/sec, 70 secs
lola: 50406057 markings, 58181877 edges, 599975 markings/sec, 75 secs
lola: 53415975 markings, 61647046 edges, 601984 markings/sec, 80 secs
lola: 56483858 markings, 65173131 edges, 613577 markings/sec, 85 secs
lola: 59550725 markings, 68700900 edges, 613373 markings/sec, 90 secs
lola: 62795498 markings, 72431612 edges, 648955 markings/sec, 95 secs
lola: 66078918 markings, 76210912 edges, 656684 markings/sec, 100 secs
lola: 69054493 markings, 79626481 edges, 595115 markings/sec, 105 secs
lola: 72316068 markings, 83372448 edges, 652315 markings/sec, 110 secs
lola: 75594638 markings, 87145407 edges, 655714 markings/sec, 115 secs
lola: 78803253 markings, 90831793 edges, 641723 markings/sec, 120 secs
lola: 82057553 markings, 94576380 edges, 650860 markings/sec, 125 secs
lola: 85207079 markings, 98198889 edges, 629905 markings/sec, 130 secs
lola: 88339583 markings, 101800971 edges, 626501 markings/sec, 135 secs
lola: 91390053 markings, 105311863 edges, 610094 markings/sec, 140 secs
lola: 94446600 markings, 108824687 edges, 611309 markings/sec, 145 secs
lola: 97524785 markings, 112361576 edges, 615637 markings/sec, 150 secs
lola: 100589912 markings, 115884170 edges, 613025 markings/sec, 155 secs
lola: 103643595 markings, 119397366 edges, 610737 markings/sec, 160 secs
lola: 106703579 markings, 122906187 edges, 611997 markings/sec, 165 secs
lola: 109762909 markings, 126418304 edges, 611866 markings/sec, 170 secs
lola: 112740681 markings, 129844750 edges, 595554 markings/sec, 175 secs
lola: 115567388 markings, 133086566 edges, 565341 markings/sec, 180 secs
lola: 118272433 markings, 136207046 edges, 541009 markings/sec, 185 secs
lola: 120978008 markings, 139308017 edges, 541115 markings/sec, 190 secs
lola: 123542755 markings, 142254157 edges, 512949 markings/sec, 195 secs
lola: 126126535 markings, 145215660 edges, 516756 markings/sec, 200 secs
lola: 128650109 markings, 148112937 edges, 504715 markings/sec, 205 secs
lola: 131059476 markings, 150883554 edges, 481873 markings/sec, 210 secs
lola: 133304332 markings, 153464232 edges, 448971 markings/sec, 215 secs
lola: 135720236 markings, 156238025 edges, 483181 markings/sec, 220 secs
lola: 138089151 markings, 158953514 edges, 473783 markings/sec, 225 secs
lola: 140190777 markings, 161365970 edges, 420325 markings/sec, 230 secs
lola: 142573677 markings, 164094457 edges, 476580 markings/sec, 235 secs
lola: 143506607 markings, 165168661 edges, 186586 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((p22 <= p5)) AND F ((p23 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p23 <= p2))
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: (p2 + 1 <= p23)
lola: processed formula length: 15
lola: 43 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: ...considering subproblem: G ((p22 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 <= p5))
lola: processed formula length: 15
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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: 187 markings, 187 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no unknown no no no
lola:
preliminary result: no yes no no no unknown no no no
lola: memory consumption: 3812 KB
lola: time consumption: 483 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-N0020P2"
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-N0020P2, 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-162038334600093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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