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.r227-tall-162098231200349.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 ShieldPPPt-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231200349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 19K May 5 16:52 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 ShieldPPPt-PT-001B-00
FORMULA_NAME ShieldPPPt-PT-001B-01
FORMULA_NAME ShieldPPPt-PT-001B-02
FORMULA_NAME ShieldPPPt-PT-001B-03
FORMULA_NAME ShieldPPPt-PT-001B-04
FORMULA_NAME ShieldPPPt-PT-001B-05
FORMULA_NAME ShieldPPPt-PT-001B-06
FORMULA_NAME ShieldPPPt-PT-001B-07
FORMULA_NAME ShieldPPPt-PT-001B-08
FORMULA_NAME ShieldPPPt-PT-001B-09
FORMULA_NAME ShieldPPPt-PT-001B-10
FORMULA_NAME ShieldPPPt-PT-001B-11
FORMULA_NAME ShieldPPPt-PT-001B-12
FORMULA_NAME ShieldPPPt-PT-001B-13
FORMULA_NAME ShieldPPPt-PT-001B-14
FORMULA_NAME ShieldPPPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1621176022006

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 14:40:23] [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-16 14:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:40:23] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-16 14:40:23] [INFO ] Transformed 81 places.
[2021-05-16 14:40:23] [INFO ] Transformed 74 transitions.
[2021-05-16 14:40:23] [INFO ] Found NUPN structural information;
[2021-05-16 14:40:23] [INFO ] Parsed PT model containing 81 places and 74 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11 resets, run finished after 335 ms. (steps per millisecond=298 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 74 rows 81 cols
[2021-05-16 14:40:24] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2021-05-16 14:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-16 14:40:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:40:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned unsat
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 14:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-16 14:40:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:40:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned unsat
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 14:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-16 14:40:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:40:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 14:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-16 14:40:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:40:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned unsat
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 14:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:40:24] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-16 14:40:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:40:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-16 14:40:24] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-16 14:40:24] [INFO ] Flatten gal took : 32 ms
FORMULA ShieldPPPt-PT-001B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:40:24] [INFO ] Applying decomposition
[2021-05-16 14:40:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 14:40:24] [INFO ] Flatten gal took : 10 ms
[2021-05-16 14:40:24] [INFO ] Decomposing Gal with order
[2021-05-16 14:40:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:40:25] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 14:40:25] [INFO ] Flatten gal took : 30 ms
[2021-05-16 14:40:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 14:40:25] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldPPPt-PT-001B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:40:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 14:40:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-001B @ 3570 seconds

FORMULA ShieldPPPt-PT-001B-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ ShieldPPPt-PT-001B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 14:40:26 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((((p20 <= 0)) OR ((1 <= p50))) AND ((p74 <= 0)) AND (((p44 <= 0)) OR ((1 <= p40))))",
"processed_size": 86,
"rewrites": 16
},
"result":
{
"edges": 84,
"markings": 84,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((G ((((1 <= p22)) AND ((p30 <= 0)))) OR (((p41 <= 0)) OR ((1 <= p41))))))",
"processed_size": 79,
"rewrites": 14
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 3,
"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": "((((p8 <= 0)) OR ((1 <= p53))) U (X ((((1 <= p8)) AND ((p53 <= 0)))) AND (((p5 <= 0)) OR ((1 <= p13)))))",
"processed_size": 106,
"rewrites": 14
},
"result":
{
"edges": 40,
"markings": 31,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 0,
"U": 2,
"X": 3,
"aconj": 7,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((((((p42 <= 0)) OR ((1 <= p56))) U (((p20 <= 0)) OR ((1 <= p3)))) OR (((p20 <= 0)) OR ((1 <= p3)))) U X (X (((1 <= p45))))))",
"processed_size": 130,
"rewrites": 14
},
"result":
{
"edges": 62,
"markings": 62,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"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 ((((p49 <= 0)) OR ((1 <= p35)))))",
"processed_size": 39,
"rewrites": 14
},
"result":
{
"edges": 1513393,
"markings": 518441,
"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": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p43 <= 0)) OR ((1 <= p61)))",
"processed_size": 31,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p43 <= 0)) OR ((1 <= p61)))",
"processed_size": 31,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((((p43 <= 0)) OR ((1 <= p61)))))",
"processed_size": 39,
"rewrites": 14
},
"result":
{
"edges": 626,
"markings": 548,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27712,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(*) AND X(X(G(*)))) : G(F(**)) : X(X((G(**) OR (** OR **)))) : (** U (X(*) AND **)) : X((((** U **) OR (** OR **)) U X(X(**)))) : (G(F(**)) AND **)"
},
"net":
{
"arcs": 184,
"conflict_clusters": 67,
"places": 81,
"places_significant": 69,
"singleton_clusters": 0,
"transitions": 74
},
"result":
{
"preliminary_value": "no yes yes yes no no ",
"value": "no yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 155/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 81
lola: finding significant places
lola: 81 places, 74 transitions, 69 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: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: (NOT(G (((((p20 <= 0)) OR ((1 <= p50))) AND ((p74 <= 0)) AND (((p44 <= 0)) OR ((1 <= p40)))))) AND NOT(X (X (F ((((1 <= p20)) AND ((p50 <= 0)))))))) : G (F (G (F ((((p49 <= 0)) OR ((1 <= p35))))))) : X (X (((G ((((1 <= p22)) AND ((p30 <= 0)))) OR ((p41 <= 0))) OR ((1 <= p41))))) : ((((p8 <= 0)) OR ((1 <= p53))) U (NOT(X ((((p8 <= 0)) OR ((1 <= p53))))) AND (((p5 <= 0)) OR ((1 <= p13))))) : X ((((((((p42 <= 0)) OR ((1 <= p56))) U (((p20 <= 0)) OR ((1 <= p3)))) OR ((p20 <= 0))) OR ((1 <= p3))) U X (X (((1 <= p45)))))) : (G (X (F ((((p43 <= 0)) OR ((1 <= p61)))))) AND (((p43 <= 0)) OR ((1 <= p61))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: rewrite Frontend/Parser/formula_rewrite.k:377
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 (((((1 <= p20)) AND ((p50 <= 0))) OR ((1 <= p74)) OR (((1 <= p44)) AND ((p40 <= 0))))) AND X (X (G ((((p20 <= 0)) OR ((1 <= p50)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p20)) AND ((p50 <= 0))) OR ((1 <= p74)) OR (((1 <= p44)) AND ((p40 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((((p20 <= 0)) OR ((1 <= p50))) AND ((p74 <= 0)) AND (((p44 <= 0)) OR ((1 <= p40))))
lola: processed formula length: 86
lola: 16 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: 84 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((((1 <= p22)) AND ((p30 <= 0)))) OR (((p41 <= 0)) OR ((1 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((((1 <= p22)) AND ((p30 <= 0)))) OR (((p41 <= 0)) OR ((1 <= p41))))))
lola: processed formula length: 79
lola: 14 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p8 <= 0)) OR ((1 <= p53))) U (X ((((1 <= p8)) AND ((p53 <= 0)))) AND (((p5 <= 0)) OR ((1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p8 <= 0)) OR ((1 <= p53))) U (X ((((1 <= p8)) AND ((p53 <= 0)))) AND (((p5 <= 0)) OR ((1 <= p13)))))
lola: processed formula length: 106
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31 markings, 40 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((((p42 <= 0)) OR ((1 <= p56))) U (((p20 <= 0)) OR ((1 <= p3)))) OR (((p20 <= 0)) OR ((1 <= p3)))) U X (X (((1 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((((p42 <= 0)) OR ((1 <= p56))) U (((p20 <= 0)) OR ((1 <= p3)))) OR (((p20 <= 0)) OR ((1 <= p3)))) U X (X (((1 <= p45))))))
lola: processed formula length: 130
lola: 14 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 62 markings, 62 edges
lola: ========================================
lola: subprocess 4 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p49 <= 0)) OR ((1 <= p35)))))
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 ((((p49 <= 0)) OR ((1 <= p35)))))
lola: processed formula length: 39
lola: 14 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: 518441 markings, 1513393 edges
lola: ========================================
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((p43 <= 0)) OR ((1 <= p61))))) AND (((p43 <= 0)) OR ((1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p43 <= 0)) OR ((1 <= p61)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p43 <= 0)) OR ((1 <= p61)))
lola: processed formula length: 31
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((((p43 <= 0)) OR ((1 <= p61))))) AND (((p43 <= 0)) OR ((1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p43 <= 0)) OR ((1 <= p61)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p43 <= 0)) OR ((1 <= p61)))
lola: processed formula length: 31
lola: 14 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: G (F ((((p43 <= 0)) OR ((1 <= p61)))))
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 ((((p43 <= 0)) OR ((1 <= p61)))))
lola: processed formula length: 39
lola: 14 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: 548 markings, 626 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no
lola:
preliminary result: no yes yes yes no no
lola: memory consumption: 27712 KB
lola: time consumption: 4 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="ShieldPPPt-PT-001B"
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 ShieldPPPt-PT-001B, 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 r227-tall-162098231200349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001B.tgz
mv ShieldPPPt-PT-001B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;