About the Execution of 2020-gold for Kanban-PT-00500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15961.352 | 3600000.00 | 129688.00 | 3587.90 | FFFFFFFTTFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428400265.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Kanban-PT-00500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428400265
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00500-00
FORMULA_NAME Kanban-PT-00500-01
FORMULA_NAME Kanban-PT-00500-02
FORMULA_NAME Kanban-PT-00500-03
FORMULA_NAME Kanban-PT-00500-04
FORMULA_NAME Kanban-PT-00500-05
FORMULA_NAME Kanban-PT-00500-06
FORMULA_NAME Kanban-PT-00500-07
FORMULA_NAME Kanban-PT-00500-08
FORMULA_NAME Kanban-PT-00500-09
FORMULA_NAME Kanban-PT-00500-10
FORMULA_NAME Kanban-PT-00500-11
FORMULA_NAME Kanban-PT-00500-12
FORMULA_NAME Kanban-PT-00500-13
FORMULA_NAME Kanban-PT-00500-14
FORMULA_NAME Kanban-PT-00500-15
=== Now, execution of the tool begins
BK_START 1620925755743
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 17:09:17] [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 17:09:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:09:17] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 17:09:17] [INFO ] Transformed 16 places.
[2021-05-13 17:09:17] [INFO ] Transformed 16 transitions.
[2021-05-13 17:09:17] [INFO ] Parsed PT model containing 16 places and 16 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100202 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=2178 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 17:09:17] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 17:09:17] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned unsat
[2021-05-13 17:09:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-13 17:09:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-13 17:09:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-13 17:09:17] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 17:09:17] [INFO ] Flatten gal took : 22 ms
FORMULA Kanban-PT-00500-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00500-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:09:17] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:09:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 17:09:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-00500 @ 3570 seconds
FORMULA Kanban-PT-00500-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00500-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3447
rslt: Output for LTLCardinality @ Kanban-PT-00500
{
"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 17:09:23 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((X (F ((2 <= p9))) OR (((p15 <= p0) U (2 <= p9)) AND X ((p15 <= p3))))))",
"processed_size": 78,
"rewrites": 54
},
"result":
{
"edges": 20948,
"markings": 14972,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((3 <= p9))",
"processed_size": 13,
"rewrites": 54
},
"result":
{
"edges": 15457,
"markings": 11969,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "(((3 <= p0) AND (1 <= p10)) U (F ((p13 <= p8)) OR (p13 <= p8)))",
"processed_size": 63,
"rewrites": 54
},
"result":
{
"edges": 502,
"markings": 502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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 (G (((p8 + 1 <= p13) AND (p10 <= 0))))",
"processed_size": 40,
"rewrites": 54
},
"result":
{
"edges": 3004,
"markings": 3004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((X (G ((((2 <= p7) R (p3 + 1 <= p8)) OR (p4 <= p14)))) AND (p8 <= p3))))",
"processed_size": 78,
"rewrites": 54
},
"result":
{
"edges": 3005,
"markings": 3005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p14 <= p8)))",
"processed_size": 19,
"rewrites": 54
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((p5 <= p15)) AND (2 <= p9)))",
"processed_size": 35,
"rewrites": 54
},
"result":
{
"edges": 4004,
"markings": 4004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (((p2 <= 0) R X (G ((p8 + 1 <= p5)))))",
"processed_size": 40,
"rewrites": 54
},
"result":
{
"edges": 3004,
"markings": 3004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "((X ((p11 <= p7)) AND F ((3 <= p8))) U X (G ((3 <= p8))))",
"processed_size": 57,
"rewrites": 54
},
"result":
{
"edges": 3005,
"markings": 3005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p13 <= 0)))",
"processed_size": 18,
"rewrites": 54
},
"result":
{
"edges": 502,
"markings": 502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G ((p6 <= p11)) OR (p15 <= p10)))",
"processed_size": 37,
"rewrites": 54
},
"result":
{
"edges": 129706702,
"markings": 86495768,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1724
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F (((G ((p1 + 1 <= p7)) R ((p1 + 1 <= p7) OR (p2 <= p8))) AND (p13 + 1 <= p3))))",
"processed_size": 84,
"rewrites": 54
},
"result":
{
"edges": 1255205,
"markings": 661615,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 10,
"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": 3447
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3447
},
"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 ((p13 <= p15))",
"processed_size": 16,
"rewrites": 54
},
"result":
{
"edges": 502,
"markings": 502,
"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": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"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 ((p13 <= p15))",
"processed_size": 16,
"rewrites": 54
},
"result":
{
"edges": 502,
"markings": 502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"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": "(p5 <= p0)",
"processed_size": 10,
"rewrites": 56
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22436,
"runtime": 123.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((X(F(**)) OR ((** U **) AND X(**))))) : (X(F((G(*) OR (* AND *)))) AND G(**)) : (X(G(**)) OR (** U (F(**) OR **))) : X(X((X(G(((* R *) OR **))) AND **))) : G(F(*)) : G((G(**) OR **)) : X(F(**)) : F((X(**) AND **)) : X((* R X(G(*)))) : (F(**) OR G(**)) : ((X(**) AND F(**)) U X(G(**))) : G(F(((G(*) R *) AND *)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no no no no yes no no no no no ",
"value": "no no no no no no yes 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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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: G (F (X ((X (F ((2 <= p9))) OR (((p15 <= p0) U (2 <= p9)) AND X ((p15 <= p3))))))) : ((NOT(G (X (((3 <= p9) U (1 <= p1))))) AND G ((3 <= p9))) AND (((1 <= p1) U (0 <= 0)) OR (1 <= p15))) : (X (G (((p8 + 1 <= p13) AND (p10 <= 0)))) OR (((3 <= p0) AND (1 <= p10)) U (F ((p13 <= p8)) OR (p13 <= p8)))) : X (X ((G (X (G ((NOT(((p7 <= 1) U (p8 <= p3))) OR (p4 <= p14))))) AND (p8 <= p3)))) : NOT(G (F (((X ((p1 <= p6)) AND (p2 <= p0)) U G (X ((1 <= p13))))))) : G ((G ((p6 <= p11)) OR (p15 <= p10))) : X (F ((p14 <= p8))) : F ((X ((p5 <= p15)) AND (2 <= p9))) : NOT(X (((1 <= p2) U NOT(X (NOT(F ((p5 <= p8)))))))) : (F ((p0 + 1 <= p5)) OR G ((p13 <= p15))) : ((X ((p11 <= p7)) AND F ((3 <= p8))) U G (X ((3 <= p8)))) : G (F (NOT(X (((F ((p7 <= p1)) U ((p7 <= p1) AND (p8 + 1 <= p2))) OR (p3 <= p13))))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((2 <= p9))) OR (((p15 <= p0) U (2 <= p9)) AND X ((p15 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((2 <= p9))) OR (((p15 <= p0) U (2 <= p9)) AND X ((p15 <= p3))))))
lola: processed formula length: 78
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14972 markings, 20948 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((p1 <= 0)) OR ((p9 <= 2) AND (p1 <= 0))))) AND G ((3 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p9))
lola: processed formula length: 13
lola: 54 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: 11969 markings, 15457 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p8 + 1 <= p13) AND (p10 <= 0)))) OR (((3 <= p0) AND (1 <= p10)) U (F ((p13 <= p8)) OR (p13 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= p0) AND (1 <= p10)) U (F ((p13 <= p8)) OR (p13 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((3 <= p0) AND (1 <= p10)) U (F ((p13 <= p8)) OR (p13 <= p8)))
lola: processed formula length: 63
lola: 54 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: 502 markings, 502 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p8 + 1 <= p13) AND (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p8 + 1 <= p13) AND (p10 <= 0))))
lola: processed formula length: 40
lola: 54 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: 3004 markings, 3004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G ((((2 <= p7) R (p3 + 1 <= p8)) OR (p4 <= p14)))) AND (p8 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G ((((2 <= p7) R (p3 + 1 <= p8)) OR (p4 <= p14)))) AND (p8 <= p3))))
lola: processed formula length: 78
lola: 54 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: 3005 markings, 3005 edges
lola: ========================================
lola: subprocess 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p14 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p14 <= p8)))
lola: processed formula length: 19
lola: 54 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: 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 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p5 <= p15)) AND (2 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p5 <= p15)) AND (2 <= p9)))
lola: processed formula length: 35
lola: 54 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: 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: 4004 markings, 4004 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p2 <= 0) R X (G ((p8 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p2 <= 0) R X (G ((p8 + 1 <= p5)))))
lola: processed formula length: 40
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3004 markings, 3004 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p11 <= p7)) AND F ((3 <= p8))) U X (G ((3 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((p11 <= p7)) AND F ((3 <= p8))) U X (G ((3 <= p8))))
lola: processed formula length: 57
lola: 54 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: 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: 3005 markings, 3005 edges
lola: ========================================
lola: subprocess 8 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p13 <= 0)))
lola: processed formula length: 18
lola: 54 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: 502 markings, 502 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p6 <= p11)) OR (p15 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p6 <= p11)) OR (p15 <= p10)))
lola: processed formula length: 37
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3944932 markings, 5904655 edges, 788986 markings/sec, 0 secs
lola: 7715800 markings, 11554822 edges, 754174 markings/sec, 5 secs
lola: 11455198 markings, 17158683 edges, 747880 markings/sec, 10 secs
lola: 15159030 markings, 22709465 edges, 740766 markings/sec, 15 secs
lola: 18833572 markings, 28216514 edges, 734908 markings/sec, 20 secs
lola: 22768047 markings, 34113234 edges, 786895 markings/sec, 25 secs
lola: 26702977 markings, 40010883 edges, 786986 markings/sec, 30 secs
lola: 30645715 markings, 45920023 edges, 788548 markings/sec, 35 secs
lola: 34629628 markings, 51890815 edges, 796783 markings/sec, 40 secs
lola: 38629563 markings, 57885669 edges, 799987 markings/sec, 45 secs
lola: 42620900 markings, 63867394 edges, 798267 markings/sec, 50 secs
lola: 46429326 markings, 69590352 edges, 761685 markings/sec, 55 secs
lola: 50053678 markings, 75029986 edges, 724870 markings/sec, 60 secs
lola: 53632765 markings, 80400909 edges, 715817 markings/sec, 65 secs
lola: 57195509 markings, 85746567 edges, 712549 markings/sec, 70 secs
lola: 60750222 markings, 91079936 edges, 710943 markings/sec, 75 secs
lola: 64304605 markings, 96412564 edges, 710877 markings/sec, 80 secs
lola: 67852626 markings, 101735371 edges, 709604 markings/sec, 85 secs
lola: 71431140 markings, 107103831 edges, 715703 markings/sec, 90 secs
lola: 75029663 markings, 112502092 edges, 719705 markings/sec, 95 secs
lola: 78675249 markings, 117970613 edges, 729117 markings/sec, 100 secs
lola: 82351160 markings, 123484699 edges, 735182 markings/sec, 105 secs
lola: 86048277 markings, 129036595 edges, 739423 markings/sec, 110 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: 86495768 markings, 129706702 edges
lola: ========================================
lola: subprocess 10 will run for 1724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G ((p1 + 1 <= p7)) R ((p1 + 1 <= p7) OR (p2 <= p8))) AND (p13 + 1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((G ((p1 + 1 <= p7)) R ((p1 + 1 <= p7) OR (p2 <= p8))) AND (p13 + 1 <= p3))))
lola: processed formula length: 84
lola: 54 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
lola: add low 13
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: 661615 markings, 1255205 edges
lola: ========================================
lola: subprocess 11 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p0 + 1 <= p5)) OR G ((p13 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p13 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p13 <= p15))
lola: processed formula length: 16
lola: 54 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: 502 markings, 502 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: (F ((p0 + 1 <= p5)) OR G ((p13 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p13 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p13 <= p15))
lola: processed formula length: 16
lola: 54 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: 502 markings, 502 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((p0 + 1 <= p5))
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: (p5 <= p0)
lola: processed formula length: 10
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no no no
lola:
preliminary result: no no no no no no yes no no no no no
lola: memory consumption: 22436 KB
lola: time consumption: 123 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="Kanban-PT-00500"
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 Kanban-PT-00500, 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 r132-tall-162075428400265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00500.tgz
mv Kanban-PT-00500 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 '
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 ;