About the Execution of 2020-gold for UtilityControlRoom-COL-Z4T4N06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4282.464 | 3600000.00 | 11652.00 | 229.50 | FFTFFFTFTFTFFFFT | 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-162132128100249.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-Z4T4N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128100249
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.3K May 12 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 11 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 18:14 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-Z4T4N06-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-15
=== Now, execution of the tool begins
BK_START 1621451322796
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:08:44] [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:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:08:44] [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:08:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 549 ms
[2021-05-19 19:08:45] [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:08:45] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignNearZone
[2021-05-19 19:08:45] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition move_between_Municipalities
[2021-05-19 19:08:45] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition assignFar
[2021-05-19 19:08:45] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 135 PT places and 240.0 transition bindings in 24 ms.
[2021-05-19 19:08:45] [INFO ] Computed order based on color domains.
[2021-05-19 19:08:45] [INFO ] Unfolded HLPN to a Petri net with 135 places and 240 transitions in 16 ms.
[2021-05-19 19:08:45] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 104 places in 2 ms
Reduce places removed 104 places and 192 transitions.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 343 ms. (steps per millisecond=291 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 39 rows 31 cols
[2021-05-19 19:08:45] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-19 19:08:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
Successfully simplified 19 atomic propositions for a total of 22 simplifications.
[2021-05-19 19:08:46] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-19 19:08:46] [INFO ] Flatten gal took : 22 ms
FORMULA UtilityControlRoom-COL-Z4T4N06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:08:46] [INFO ] Applying decomposition
[2021-05-19 19:08:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 19:08:46] [INFO ] Flatten gal took : 7 ms
[2021-05-19 19:08:46] [INFO ] Decomposing Gal with order
[2021-05-19 19:08:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:08:46] [INFO ] Removed a total of 45 redundant transitions.
[2021-05-19 19:08:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 19:08:46] [INFO ] Flatten gal took : 64 ms
[2021-05-19 19:08:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-19 19:08:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:08:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 10 ms.
[2021-05-19 19:08:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ UtilityControlRoom-COL-Z4T4N06 @ 3570 seconds
FORMULA UtilityControlRoom-COL-Z4T4N06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N06-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N06-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N06-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA UtilityControlRoom-COL-Z4T4N06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ UtilityControlRoom-COL-Z4T4N06
{
"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:08:47 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (X (G ((X (X (G ((p29 + p28 + p30 <= 0)))) OR (p25 <= p24))))) U (p24 + 1 <= p25))",
"processed_size": 85,
"rewrites": 39
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p4 + p5 + p6)))",
"processed_size": 77,
"rewrites": 39
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((p0 + p1 + p2 + 1 <= p7 + p8 + p9)))",
"processed_size": 42,
"rewrites": 39
},
"result":
{
"edges": 28,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((p7 + p8 + p9 <= 0)))",
"processed_size": 27,
"rewrites": 39
},
"result":
{
"edges": 21,
"markings": 17,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21)))",
"processed_size": 80,
"rewrites": 39
},
"result":
{
"edges": 132,
"markings": 75,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))",
"processed_size": 77,
"rewrites": 39
},
"result":
{
"edges": 108,
"markings": 69,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((F ((F ((p24 <= p19 + p20 + p21)) AND F ((p29 + p28 + p30 <= p19 + p20 + p21)))) AND (G ((p29 + p28 + p30 <= p22)) AND F ((p29 + p28 + p30 <= p22)))))",
"processed_size": 153,
"rewrites": 39
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"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": 18748,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(G((X(X(G(**))) OR **)))) U **) : G(F(**)) : F((F((F(**) AND F(**))) AND (G(**) AND F(**)))) : X(G(**)) : G(F(**)) : F(G(*)) : X(F(*))"
},
"net":
{
"arcs": 117,
"conflict_clusters": 18,
"places": 31,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 39
},
"result":
{
"preliminary_value": "no yes no no yes no yes ",
"value": "no yes 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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 992
lola: finding significant places
lola: 31 places, 39 transitions, 26 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (X (X (G ((X (G (X ((p29 + p28 + p30 <= 0)))) OR (p25 <= p24))))) U (p24 + 1 <= p25)) : G (NOT(G (F ((F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21)) U X (G (X (NOT(((1 <= 0) U X ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21)))))))))))) : F (((p29 + p28 + p30 <= p22) U ((F ((F ((p24 <= p19 + p20 + p21)) AND F ((p29 + p28 + p30 <= p19 + p20 + p21)))) AND G ((p29 + p28 + p30 <= p22))) AND F ((p29 + p28 + p30 <= p22))))) : X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p4 + p5 + p6))) : F (X (F (X (G (((1 <= 0) U F ((p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))))) : NOT(G (F ((1 <= p7 + p8 + p9)))) : F ((F (X (((p19 + p20 + p21 <= p7 + p8 + p9) U (0 <= 0)))) AND NOT(X ((p7 + p8 + p9 <= p0 + p1 + p2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((X (X (G ((p29 + p28 + p30 <= 0)))) OR (p25 <= p24))))) U (p24 + 1 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G ((X (X (G ((p29 + p28 + p30 <= 0)))) OR (p25 <= p24))))) U (p24 + 1 <= p25))
lola: processed formula length: 85
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p4 + p5 + p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p4 + p5 + p6)))
lola: processed formula length: 77
lola: 39 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p0 + p1 + p2 + 1 <= p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p0 + p1 + p2 + 1 <= p7 + p8 + p9)))
lola: processed formula length: 42
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p7 + p8 + p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p7 + p8 + p9 <= 0)))
lola: processed formula length: 27
lola: 39 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: 17 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21)))
lola: processed formula length: 80
lola: 39 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: 75 markings, 132 edges
lola: ========================================
lola: subprocess 5 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))
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 ((p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))
lola: processed formula length: 77
lola: 39 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: 69 markings, 108 edges
lola: ========================================
lola: subprocess 6 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((F ((p24 <= p19 + p20 + p21)) AND F ((p29 + p28 + p30 <= p19 + p20 + p21)))) AND (G ((p29 + p28 + p30 <= p22)) AND F ((p29 + p28 + p30 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((F ((p24 <= p19 + p20 + p21)) AND F ((p29 + p28 + p30 <= p19 + p20 + p21)))) AND (G ((p29 + p28 + p30 <= p22)) AND F ((p29 + p28 + p30 <= p22)))))
lola: processed formula length: 153
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 13 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no yes
lola:
preliminary result: no yes no no yes no yes
lola: memory consumption: 18748 KB
lola: time consumption: 2 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-Z4T4N06"
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-Z4T4N06, 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-162132128100249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z4T4N06.tgz
mv UtilityControlRoom-COL-Z4T4N06 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 ;