About the Execution of 2020-gold for UtilityControlRoom-COL-Z2T4N04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4233.071 | 3600000.00 | 9271.00 | 251.20 | FFTFFTFFFTTFTTFT | 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-162132128000213.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 UtilityControlRoom-COL-Z2T4N04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128000213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.9K May 12 04:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 12 04:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_pt
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 5 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 29K 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 UtilityControlRoom-COL-Z2T4N04-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-15
=== Now, execution of the tool begins
BK_START 1621451009093
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:03:30] [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 19:03:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:03:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 19:03:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 528 ms
[2021-05-19 19:03:31] [INFO ] sort/places :
Cli->Clients,ControlRoomDispatch,Finished,ClientsWaiting,ClientsTimeout,
CxZ->OpenRequests,Assigned,StartSecuring,DoSecuring,
Dot->Idles,NumClientsReq,
Z->IdleTechs,
CxZxZ->MovetoZ,
[2021-05-19 19:03:31] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:03:31] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:03:31] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:03:31] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 33 PT places and 36.0 transition bindings in 19 ms.
[2021-05-19 19:03:31] [INFO ] Computed order based on color domains.
[2021-05-19 19:03:31] [INFO ] Unfolded HLPN to a Petri net with 33 places and 36 transitions in 5 ms.
[2021-05-19 19:03:31] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 24 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 263 ms. (steps per millisecond=380 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1]
// Phase 1: matrix 11 rows 13 cols
[2021-05-19 19:03:31] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:03:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 21 atomic propositions for a total of 30 simplifications.
[2021-05-19 19:03:31] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-19 19:03:31] [INFO ] Flatten gal took : 17 ms
FORMULA UtilityControlRoom-COL-Z2T4N04-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:03:31] [INFO ] Applying decomposition
[2021-05-19 19:03:31] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:03:31] [INFO ] Decomposing Gal with order
[2021-05-19 19:03:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:03:31] [INFO ] Removed a total of 3 redundant transitions.
[2021-05-19 19:03:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:03:31] [INFO ] Flatten gal took : 22 ms
[2021-05-19 19:03:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-19 19:03:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:03:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2021-05-19 19:03:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ UtilityControlRoom-COL-Z2T4N04 @ 3570 seconds
FORMULA UtilityControlRoom-COL-Z2T4N04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z2T4N04-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z2T4N04-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z2T4N04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z2T4N04-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z2T4N04-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ UtilityControlRoom-COL-Z2T4N04
{
"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 19:03:32 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((p12 <= p5)) U X ((F (G ((p5 + 1 <= p8))) OR X (X (G ((p8 <= p5)))))))",
"processed_size": 74,
"rewrites": 27
},
"result":
{
"edges": 24,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 <= p9)",
"processed_size": 10,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (F ((p2 + 1 <= p4))) R (p2 + 1 <= p4)))",
"processed_size": 45,
"rewrites": 27
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((G ((p4 <= p5)) AND (p3 <= p0)) U X ((F ((1 <= p3)) U X (F ((p5 <= p3)))))))",
"processed_size": 80,
"rewrites": 27
},
"result":
{
"edges": 21,
"markings": 15,
"produced_by": "LTL model checker",
"value": true
},
"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": 1189
},
"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 ((p4 <= p5))",
"processed_size": 14,
"rewrites": 27
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p4 <= p12)) OR (p4 <= p12)))",
"processed_size": 36,
"rewrites": 27
},
"result":
{
"edges": 21,
"markings": 15,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G (((p5 <= p6) AND ((p5 <= p9) R (p9 + 1 <= p5)))))",
"processed_size": 54,
"rewrites": 27
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 19572,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) U X((F(G(*)) OR X(X(G(**)))))) : (X((X(F(*)) R *)) OR **) : F(G((** AND (* R *)))) : G((F(**) OR **)) : G(**) : X(((G(**) AND **) U X((F(**) U X(F(**))))))"
},
"net":
{
"arcs": 33,
"conflict_clusters": 8,
"places": 13,
"places_significant": 8,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no yes no yes ",
"value": "no no no yes no yes "
},
"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: 24/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 416
lola: finding significant places
lola: 13 places, 11 transitions, 8 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: (F ((p12 <= p5)) U X ((F (G (NOT(X (X ((p8 <= p5)))))) OR X (G (X ((p8 <= p5))))))) : (X (NOT((X (G ((p4 <= p2))) U (p4 <= p2)))) OR (p0 <= p9)) : F (G (((p5 <= p6) AND NOT(((p9 + 1 <= p5) U (p5 <= p9)))))) : G ((F ((NOT(((0 <= 0) U (1 <= 0))) AND (p4 <= p12))) OR (p4 <= p12))) : G ((p4 <= p5)) : ((G (X ((p4 <= p5))) AND X ((p3 <= p0))) U X (X ((F ((1 <= p3)) U X (F ((p5 <= p3)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p12 <= p5)) U X ((F (G ((p5 + 1 <= p8))) OR X (X (G ((p8 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p12 <= p5)) U X ((F (G ((p5 + 1 <= p8))) OR X (X (G ((p8 <= p5)))))))
lola: processed formula length: 74
lola: 27 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 19 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (F ((p2 + 1 <= p4))) R (p2 + 1 <= p4))) OR (p0 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= p9)
lola: processed formula length: 10
lola: 27 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 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((p2 + 1 <= p4))) R (p2 + 1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((p2 + 1 <= p4))) R (p2 + 1 <= p4)))
lola: processed formula length: 45
lola: 27 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((p4 <= p5)) AND (p3 <= p0)) U X ((F ((1 <= p3)) U X (F ((p5 <= p3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((p4 <= p5)) AND (p3 <= p0)) U X ((F ((1 <= p3)) U X (F ((p5 <= p3)))))))
lola: processed formula length: 80
lola: 27 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 15 markings, 21 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p4 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p4 <= p5))
lola: processed formula length: 14
lola: 27 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p4 <= p12)) OR (p4 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p4 <= p12)) OR (p4 <= p12)))
lola: processed formula length: 36
lola: 27 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: 15 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= p6) AND ((p5 <= p9) R (p9 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p5 <= p6) AND ((p5 <= p9) R (p9 + 1 <= p5)))))
lola: processed formula length: 54
lola: 27 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes
lola:
preliminary result: no no no yes no yes
lola: memory consumption: 19572 KB
lola: time consumption: 3 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="UtilityControlRoom-COL-Z2T4N04"
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 UtilityControlRoom-COL-Z2T4N04, 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-162132128000213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T4N04.tgz
mv UtilityControlRoom-COL-Z2T4N04 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 ;