About the Execution of 2020-gold for ServersAndClients-PT-100080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5025.460 | 3600000.00 | 894551.00 | 7140.90 | TFFTFFFFFFFTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r322-tall-162132127800069.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ServersAndClients-PT-100080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127800069
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 17:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 17:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 16M May 12 08:13 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ServersAndClients-PT-100080-00
FORMULA_NAME ServersAndClients-PT-100080-01
FORMULA_NAME ServersAndClients-PT-100080-02
FORMULA_NAME ServersAndClients-PT-100080-03
FORMULA_NAME ServersAndClients-PT-100080-04
FORMULA_NAME ServersAndClients-PT-100080-05
FORMULA_NAME ServersAndClients-PT-100080-06
FORMULA_NAME ServersAndClients-PT-100080-07
FORMULA_NAME ServersAndClients-PT-100080-08
FORMULA_NAME ServersAndClients-PT-100080-09
FORMULA_NAME ServersAndClients-PT-100080-10
FORMULA_NAME ServersAndClients-PT-100080-11
FORMULA_NAME ServersAndClients-PT-100080-12
FORMULA_NAME ServersAndClients-PT-100080-13
FORMULA_NAME ServersAndClients-PT-100080-14
FORMULA_NAME ServersAndClients-PT-100080-15
=== Now, execution of the tool begins
BK_START 1621439013980
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 15:43:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 15:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 15:43:36] [INFO ] Load time of PNML (sax parser for PT used): 524 ms
[2021-05-19 15:43:36] [INFO ] Transformed 8481 places.
[2021-05-19 15:43:36] [INFO ] Transformed 16200 transitions.
[2021-05-19 15:43:36] [INFO ] Found NUPN structural information;
[2021-05-19 15:43:36] [INFO ] Parsed PT model containing 8481 places and 16200 transitions in 647 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 157 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1862 ms. (steps per millisecond=53 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16200 rows 8481 cols
[2021-05-19 15:43:38] [INFO ] Computed 281 place invariants in 471 ms
[2021-05-19 15:43:41] [INFO ] [Real]Absence check using 181 positive place invariants in 1480 ms returned sat
[2021-05-19 15:43:42] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 680 ms returned sat
[2021-05-19 15:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 15:43:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 15:43:58] [INFO ] [Real]Absence check using state equation in 16481 ms returned (error "Failed to check-sat")
[2021-05-19 15:44:01] [INFO ] [Real]Absence check using 181 positive place invariants in 1498 ms returned sat
[2021-05-19 15:44:01] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 668 ms returned sat
[2021-05-19 15:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 15:44:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 15:44:18] [INFO ] [Real]Absence check using state equation in 16853 ms returned (error "Failed to check-sat")
[2021-05-19 15:44:21] [INFO ] [Real]Absence check using 181 positive place invariants in 1480 ms returned sat
[2021-05-19 15:44:21] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 620 ms returned sat
[2021-05-19 15:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 15:44:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 15:44:38] [INFO ] [Real]Absence check using state equation in 16997 ms returned unknown
[2021-05-19 15:44:41] [INFO ] [Real]Absence check using 181 positive place invariants in 1509 ms returned sat
[2021-05-19 15:44:42] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 766 ms returned sat
[2021-05-19 15:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 15:44:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 15:44:58] [INFO ] [Real]Absence check using state equation in 16678 ms returned (error "Failed to check-sat")
[2021-05-19 15:45:01] [INFO ] [Real]Absence check using 181 positive place invariants in 1450 ms returned sat
[2021-05-19 15:45:02] [INFO ] [Real]Absence check using 181 positive and 100 generalized place invariants in 635 ms returned sat
[2021-05-19 15:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 15:45:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 15:45:18] [INFO ] [Real]Absence check using state equation in 16864 ms returned unknown
[2021-05-19 15:45:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-19 15:45:19] [INFO ] Flatten gal took : 774 ms
FORMULA ServersAndClients-PT-100080-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 15:45:19] [INFO ] Applying decomposition
[2021-05-19 15:45:20] [INFO ] Flatten gal took : 550 ms
[2021-05-19 15:45:20] [INFO ] Decomposing Gal with order
[2021-05-19 15:45:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 15:48:36] [INFO ] Removed a total of 15840 redundant transitions.
[2021-05-19 15:48:41] [INFO ] Flatten gal took : 199972 ms
[2021-05-19 15:48:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 16000 labels/synchronizations in 4235 ms.
[2021-05-19 15:48:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 15:48:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 79 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ServersAndClients-PT-100080 @ 3570 seconds
FORMULA ServersAndClients-PT-100080-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ServersAndClients-PT-100080-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3017
rslt: Output for LTLCardinality @ ServersAndClients-PT-100080
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 15:48:53 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 6,
"aneg": 0,
"comp": 7,
"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": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p4231)) U X (X (G ((F ((((1 <= p176)) AND ((p4609 <= 0)))) AND ((((1 <= p176)) AND ((p4609 <= 0))) OR (((1 <= p176)) AND ((p4609 <= 0)))))))))",
"processed_size": 150,
"rewrites": 47
},
"result":
{
"edges": 1795,
"markings": 915,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (X (G ((((p323 <= 0)) OR ((1 <= p2442)))))) AND (F ((((1 <= p3442)) AND ((p3730 <= 0)))) OR (((p4115 <= 0)) OR ((1 <= p4115))))))",
"processed_size": 136,
"rewrites": 47
},
"result":
{
"edges": 6162,
"markings": 3122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 431
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p7537))",
"processed_size": 14,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((((1 <= p3767)) AND ((p7723 <= 0))))",
"processed_size": 37,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p3767 <= 0)) OR ((1 <= p7723))))",
"processed_size": 39,
"rewrites": 47
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((X (((p2308 <= 0))) AND (F (((p2308 <= 0))) OR (G (((p8247 <= 0))) OR G ((((1 <= p5019)) AND ((p3371 <= 0)))))))))",
"processed_size": 120,
"rewrites": 47
},
"result":
{
"edges": 8103,
"markings": 8104,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p1128 <= 0)) OR ((1 <= p4700)))))",
"processed_size": 43,
"rewrites": 47
},
"result":
{
"edges": 12886,
"markings": 6528,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 754
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p4350 <= 0)) OR ((1 <= p1175)))",
"processed_size": 35,
"rewrites": 49
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1006
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((p5423 <= 0)))",
"processed_size": 18,
"rewrites": 47
},
"result":
{
"edges": 11703,
"markings": 5928,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 6,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G ((((1 <= p3304)) AND ((p4068 <= 0)))) AND ((((1 <= p3304)) AND ((p4068 <= 0))) OR (((1 <= p7734)) AND ((p6541 <= 0)))))))",
"processed_size": 131,
"rewrites": 47
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 3018
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p3733 <= 0)) OR ((1 <= p7338)))))",
"processed_size": 43,
"rewrites": 47
},
"result":
{
"edges": 16201,
"markings": 8202,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 767984,
"runtime": 553.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : (** U X(X(G((F(**) AND (** OR **)))))) : (G(F(**)) OR G((** AND (F(**) AND (** OR **))))) : G(*) : G(F((G(*) AND **))) : F(**) : F((X(X(G(**))) AND (F(*) OR (** OR **)))) : (F(**) AND (X(**) OR **)) : X(F((X(*) AND (F(*) OR (G(*) OR G(*)))))) : X(G(**))"
},
"net":
{
"arcs": 48800,
"conflict_clusters": 8102,
"places": 8481,
"places_significant": 8200,
"singleton_clusters": 0,
"transitions": 16200
},
"result":
{
"preliminary_value": "yes no yes no no no no yes yes no ",
"value": "yes no yes no no no no yes yes 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: 24681/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 271392
lola: finding significant places
lola: 8481 places, 16200 transitions, 8200 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: LP says that atomic proposition is always true: (p3347 <= 1)
lola: LP says that atomic proposition is always true: (p4445 <= 1)
lola: LP says that atomic proposition is always true: (p4231 <= 1)
lola: LP says that atomic proposition is always true: (p4609 <= 1)
lola: LP says that atomic proposition is always true: (p4609 <= 1)
lola: LP says that atomic proposition is always true: (p3222 <= 1)
lola: LP says that atomic proposition is always true: (p7338 <= 1)
lola: LP says that atomic proposition is always true: (p7338 <= 1)
lola: LP says that atomic proposition is always true: (p3222 <= 1)
lola: LP says that atomic proposition is always true: (p7711 <= 1)
lola: LP says that atomic proposition is always true: (p3568 <= 1)
lola: LP says that atomic proposition is always true: (p930 <= 1)
lola: LP says that atomic proposition is always true: (p5423 <= 1)
lola: LP says that atomic proposition is always true: (p2357 <= 1)
lola: LP says that atomic proposition is always true: (p4911 <= 1)
lola: LP says that atomic proposition is always true: (p4068 <= 1)
lola: LP says that atomic proposition is always true: (p4068 <= 1)
lola: LP says that atomic proposition is always true: (p6541 <= 1)
lola: LP says that atomic proposition is always true: (p1175 <= 1)
lola: LP says that atomic proposition is always true: (p8166 <= 1)
lola: LP says that atomic proposition is always true: (p1175 <= 1)
lola: LP says that atomic proposition is always true: (p2442 <= 1)
lola: LP says that atomic proposition is always true: (p3730 <= 1)
lola: LP says that atomic proposition is always true: (p4115 <= 1)
lola: LP says that atomic proposition is always true: (p2056 <= 1)
lola: LP says that atomic proposition is always true: (p2056 <= 1)
lola: LP says that atomic proposition is always true: (p7723 <= 1)
lola: LP says that atomic proposition is always true: (p7723 <= 1)
lola: LP says that atomic proposition is always true: (p7537 <= 1)
lola: LP says that atomic proposition is always true: (p2308 <= 1)
lola: LP says that atomic proposition is always true: (p2308 <= 1)
lola: LP says that atomic proposition is always true: (p8247 <= 1)
lola: LP says that atomic proposition is always true: (p3371 <= 1)
lola: LP says that atomic proposition is always true: (p4700 <= 1)
lola: (NOT(G (NOT(F ((((1 <= p6142)) AND ((p3347 <= 0))))))) OR G (())) : (((1 <= p4231)) U X (G ((X ((((1 <= p176)) AND ((p4609 <= 0)))) U X ((((1 <= p176)) AND ((p4609 <= 0)))))))) : (G (((((p7338 <= 0)) OR ((1 <= p3222))) U F ((((p3733 <= 0)) OR ((1 <= p7338)))))) OR (G ((((p3733 <= 0)) OR ((1 <= p7338)))) AND G (((((p7338 <= 0)) OR ((1 <= p3222))) U ((1 <= p7711)))))) : (NOT(((G ((((1 <= p6940)) AND ((p3568 <= 0)))) U (((p1717 <= 0)) OR ((1 <= p930)))) U F (((1 <= p5423))))) OR ((NOT(F (())) AND ((1 <= p3479))) AND ((p4911 <= 0)))) : G (F ((NOT(F ((((p3304 <= 0)) OR ((1 <= p4068))))) AND ((((1 <= p3304)) AND ((p4068 <= 0))) OR (((1 <= p7734)) AND ((p6541 <= 0))))))) : ((((p4350 <= 0)) OR ((1 <= p1175)) OR ((p6455 <= 0)) OR ((1 <= p8166))) U F ((((1 <= p4350)) AND ((p1175 <= 0))))) : F ((G (X (X ((((p323 <= 0)) OR ((1 <= p2442)))))) AND ((NOT(G ((((p3442 <= 0)) OR ((1 <= p3730))))) OR ((p4115 <= 0))) OR ((1 <= p4115))))) : (F ((() U ((((p3767 <= 0)) OR ((1 <= p7723)))))) AND (X ((((p3767 <= 0)) OR ((1 <= p7723)))) OR ((1 <= p7537)))) : X (F ((NOT(X (((1 <= p2308)))) AND ((NOT(G (((1 <= p2308)))) OR NOT(F (((1 <= p8247))))) OR NOT(F ((((p5019 <= 0)) OR ((1 <= p3371))))))))) : G (X ((((p1128 <= 0)) OR ((1 <= p4700)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p4231)) U X (X (G ((F ((((1 <= p176)) AND ((p4609 <= 0)))) AND ((((1 <= p176)) AND ((p4609 <= 0))) OR (((1 <= p176)) AND ((p4609 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p4231)) U X (X (G ((F ((((1 <= p176)) AND ((p4609 <= 0)))) AND ((((1 <= p176)) AND ((p4609 <= 0))) OR (((1 <= p176)) AND ((p4609 <= 0)))))))))
lola: processed formula length: 150
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 915 markings, 1795 edges
lola: ========================================
lola: subprocess 2 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (G ((((p323 <= 0)) OR ((1 <= p2442)))))) AND (F ((((1 <= p3442)) AND ((p3730 <= 0)))) OR (((p4115 <= 0)) OR ((1 <= p4115))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (G ((((p323 <= 0)) OR ((1 <= p2442)))))) AND (F ((((1 <= p3442)) AND ((p3730 <= 0)))) OR (((p4115 <= 0)) OR ((1 <= p4115))))))
lola: processed formula length: 136
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 12368
lola: add low 16188
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: 3122 markings, 6162 edges
lola: ========================================
lola: subprocess 3 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((((p3767 <= 0)) OR ((1 <= p7723))))) AND (X ((((p3767 <= 0)) OR ((1 <= p7723)))) OR ((1 <= p7537))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p7537))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p7537))
lola: processed formula length: 14
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((p3767 <= 0)) OR ((1 <= p7723)))))
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: ((((1 <= p3767)) AND ((p7723 <= 0))))
lola: processed formula length: 37
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p3767 <= 0)) OR ((1 <= p7723))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p3767 <= 0)) OR ((1 <= p7723))))
lola: processed formula length: 39
lola: 47 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: 101 markings, 100 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((p2308 <= 0))) AND (F (((p2308 <= 0))) OR (G (((p8247 <= 0))) OR G ((((1 <= p5019)) AND ((p3371 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((p2308 <= 0))) AND (F (((p2308 <= 0))) OR (G (((p8247 <= 0))) OR G ((((1 <= p5019)) AND ((p3371 <= 0)))))))))
lola: processed formula length: 120
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 8104 markings, 8103 edges
lola: ========================================
lola: subprocess 5 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p1128 <= 0)) OR ((1 <= p4700)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p1128 <= 0)) OR ((1 <= p4700)))))
lola: processed formula length: 43
lola: 47 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: 6528 markings, 12886 edges
lola: ========================================
lola: subprocess 6 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p4350)) AND ((p1175 <= 0))))
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: (((p4350 <= 0)) OR ((1 <= p1175)))
lola: processed formula length: 35
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p5423 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p5423 <= 0)))
lola: processed formula length: 18
lola: 47 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: 5928 markings, 11703 edges
lola: ========================================
lola: subprocess 8 will run for 1509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p3304)) AND ((p4068 <= 0)))) AND ((((1 <= p3304)) AND ((p4068 <= 0))) OR (((1 <= p7734)) AND ((p6541 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p3304)) AND ((p4068 <= 0)))) AND ((((1 <= p3304)) AND ((p4068 <= 0))) OR (((1 <= p7734)) AND ((p6541 <= 0)))))))
lola: processed formula length: 131
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 3018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((p3733 <= 0)) OR ((1 <= p7338))))) OR G (((((p3733 <= 0)) OR ((1 <= p7338))) AND (F (((1 <= p7711))) AND ((((p7338 <= 0)) OR ((1 <= p3222))) OR ((1 <= p7711)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p3733 <= 0)) OR ((1 <= p7338)))))
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 ((((p3733 <= 0)) OR ((1 <= p7338)))))
lola: processed formula length: 43
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8202 markings, 16201 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes yes no
lola:
preliminary result: yes no yes no no no no yes yes no
lola: ========================================
lola: memory consumption: 767984 KB
lola: time consumption: 553 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ServersAndClients-PT-100080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ServersAndClients-PT-100080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r322-tall-162132127800069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ServersAndClients-PT-100080.tgz
mv ServersAndClients-PT-100080 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 ;