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.r075-tall-162039097000001.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 DES-PT-00a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097000001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 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 2.8K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-00a-00
FORMULA_NAME DES-PT-00a-01
FORMULA_NAME DES-PT-00a-02
FORMULA_NAME DES-PT-00a-03
FORMULA_NAME DES-PT-00a-04
FORMULA_NAME DES-PT-00a-05
FORMULA_NAME DES-PT-00a-06
FORMULA_NAME DES-PT-00a-07
FORMULA_NAME DES-PT-00a-08
FORMULA_NAME DES-PT-00a-09
FORMULA_NAME DES-PT-00a-10
FORMULA_NAME DES-PT-00a-11
FORMULA_NAME DES-PT-00a-12
FORMULA_NAME DES-PT-00a-13
FORMULA_NAME DES-PT-00a-14
FORMULA_NAME DES-PT-00a-15

=== Now, execution of the tool begins

BK_START 1620498815084

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 18:33:36] [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-08 18:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 18:33:36] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-08 18:33:36] [INFO ] Transformed 115 places.
[2021-05-08 18:33:36] [INFO ] Transformed 76 transitions.
[2021-05-08 18:33:36] [INFO ] Found NUPN structural information;
[2021-05-08 18:33:36] [INFO ] Parsed PT model containing 115 places and 76 transitions in 93 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2246 resets, run finished after 388 ms. (steps per millisecond=257 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 62 rows 115 cols
[2021-05-08 18:33:37] [INFO ] Computed 57 place invariants in 8 ms
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 8 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-08 18:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned unsat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 8 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-08 18:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned unsat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-08 18:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned unsat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 6 ms returned sat
[2021-05-08 18:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:37] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-08 18:33:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned unsat
[2021-05-08 18:33:38] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2021-05-08 18:33:38] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-08 18:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:38] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-08 18:33:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned unsat
[2021-05-08 18:33:38] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2021-05-08 18:33:38] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 7 ms returned sat
[2021-05-08 18:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:38] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-08 18:33:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-08 18:33:38] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-08 18:33:38] [INFO ] Flatten gal took : 40 ms
FORMULA DES-PT-00a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 18:33:38] [INFO ] Applying decomposition
[2021-05-08 18:33:38] [INFO ] Flatten gal took : 14 ms
[2021-05-08 18:33:38] [INFO ] Decomposing Gal with order
[2021-05-08 18:33:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 18:33:38] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-08 18:33:38] [INFO ] Flatten gal took : 39 ms
[2021-05-08 18:33:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2021-05-08 18:33:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-08 18:33:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DES-PT-00a @ 3570 seconds

FORMULA DES-PT-00a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-00a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3222
rslt: Output for LTLCardinality @ DES-PT-00a

{
"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": "Sat May 8 18:33:39 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p48))) AND (X ((((p0 <= 0)) OR ((1 <= p44)))) OR F ((((p62 <= 0)) OR ((1 <= p26)))))))",
"processed_size": 102,
"rewrites": 24
},
"result":
{
"edges": 53770,
"markings": 13417,
"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": 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": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p27 <= 0))",
"processed_size": 12,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X ((G (((1 <= p27))) AND F ((((1 <= p77)) AND ((p24 <= 0))))))))",
"processed_size": 70,
"rewrites": 24
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F ((G (((1 <= p29))) OR (((p7 <= 0)) OR ((1 <= p52))))) AND (X (G (((1 <= p9)))) OR (G (((1 <= p29))) OR (((p7 <= 0)) OR ((1 <= p52))))))))",
"processed_size": 146,
"rewrites": 24
},
"result":
{
"edges": 83969834,
"markings": 9102219,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1161
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p55 <= 0))))",
"processed_size": 20,
"rewrites": 24
},
"result":
{
"edges": 273541720,
"markings": 23433356,
"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": 1611
},
"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": "F (G ((((p12 <= 0)) OR ((1 <= p0)))))",
"processed_size": 38,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (F ((((p92 <= 0)) OR ((1 <= p19))))) AND (((p48 <= 0)) OR ((1 <= p109)))))",
"processed_size": 82,
"rewrites": 24
},
"result":
{
"edges": 37115,
"markings": 16015,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 23848,
"runtime": 348.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F((G(F(**)) AND **)) : F(G(*)) : X((G(**) AND (X(**) OR F(**)))) : (X(X(X((G(*) AND F(*))))) AND **) : X(G((F((G(**) OR (** OR **))) AND (X(G(**)) OR (G(**) OR (** OR **))))))"
},
"net":
{
"arcs": 309,
"conflict_clusters": 46,
"places": 115,
"places_significant": 58,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no no no no no no ",
"value": "no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 177/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 115
lola: finding significant places
lola: 115 places, 62 transitions, 58 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: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: ((0 <= 0) U G (F (G ((((p12 <= 0)) OR ((1 <= p0))))))) : F (((((p48 <= 0)) OR ((1 <= p109))) U (X (G (F ((((p92 <= 0)) OR ((1 <= p19)))))) AND (((p48 <= 0)) OR ((1 <= p109)))))) : F (G (NOT(F (((1 <= p55)))))) : X ((G (((1 <= p48))) AND (X ((((p0 <= 0)) OR ((1 <= p44)))) OR F ((((p62 <= 0)) OR ((1 <= p26))))))) : (X (NOT(X ((F (X (((p27 <= 0)))) OR X (G ((((p77 <= 0)) OR ((1 <= p24))))))))) AND ((p27 <= 0))) : G (X ((G (X (G (((1 <= p9))))) U ((G (((1 <= p29))) OR ((p7 <= 0))) OR ((1 <= p52))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p48))) AND (X ((((p0 <= 0)) OR ((1 <= p44)))) OR F ((((p62 <= 0)) OR ((1 <= p26)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p48))) AND (X ((((p0 <= 0)) OR ((1 <= p44)))) OR F ((((p62 <= 0)) OR ((1 <= p26)))))))
lola: processed formula length: 102
lola: 24 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: 13417 markings, 53770 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X ((G (((1 <= p27))) AND F ((((1 <= p77)) AND ((p24 <= 0)))))))) AND ((p27 <= 0)))
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: ((p27 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p27 <= 0))
lola: processed formula length: 12
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((G (((1 <= p27))) AND F ((((1 <= p77)) AND ((p24 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((G (((1 <= p27))) AND F ((((1 <= p77)) AND ((p24 <= 0))))))))
lola: processed formula length: 70
lola: 24 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: 45 markings, 45 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 ((F ((G (((1 <= p29))) OR (((p7 <= 0)) OR ((1 <= p52))))) AND (X (G (((1 <= p9)))) OR (G (((1 <= p29))) OR (((p7 <= 0)) OR ((1 <= p52))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((G (((1 <= p29))) OR (((p7 <= 0)) OR ((1 <= p52))))) AND (X (G (((1 <= p9)))) OR (G (((1 <= p29))) OR (((p7 <= 0)) OR ((1 <= p52))))))))
lola: processed formula length: 146
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 706267 markings, 5452230 edges, 141253 markings/sec, 0 secs
lola: 1358581 markings, 10891951 edges, 130463 markings/sec, 5 secs
lola: 1951324 markings, 16355109 edges, 118549 markings/sec, 10 secs
lola: 2490199 markings, 21796488 edges, 107775 markings/sec, 15 secs
lola: 3038526 markings, 26680981 edges, 109665 markings/sec, 20 secs
lola: 3556748 markings, 30760049 edges, 103644 markings/sec, 25 secs
lola: 4109085 markings, 35488279 edges, 110467 markings/sec, 30 secs
lola: 4705343 markings, 40656879 edges, 119252 markings/sec, 35 secs
lola: 5293780 markings, 46003185 edges, 117687 markings/sec, 40 secs
lola: 5857557 markings, 51347013 edges, 112755 markings/sec, 45 secs
lola: 6361588 markings, 56660330 edges, 100806 markings/sec, 50 secs
lola: 6829669 markings, 61951984 edges, 93616 markings/sec, 55 secs
lola: 7330436 markings, 67197720 edges, 100153 markings/sec, 60 secs
lola: 7773877 markings, 71187743 edges, 88688 markings/sec, 65 secs
lola: 8178178 markings, 74922838 edges, 80860 markings/sec, 70 secs
lola: 8671803 markings, 79677742 edges, 98725 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9102219 markings, 83969834 edges
lola: ========================================
lola: subprocess 3 will run for 1161 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p55 <= 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 (((p55 <= 0))))
lola: processed formula length: 20
lola: 24 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: 586826 markings, 5663064 edges, 117365 markings/sec, 0 secs
lola: 1080208 markings, 10961383 edges, 98676 markings/sec, 5 secs
lola: 1566459 markings, 16272591 edges, 97250 markings/sec, 10 secs
lola: 1986063 markings, 21425758 edges, 83921 markings/sec, 15 secs
lola: 2418431 markings, 26440772 edges, 86474 markings/sec, 20 secs
lola: 2966543 markings, 31968575 edges, 109622 markings/sec, 25 secs
lola: 3446189 markings, 37292286 edges, 95929 markings/sec, 30 secs
lola: 3881205 markings, 42553962 edges, 87003 markings/sec, 35 secs
lola: 4323218 markings, 48075551 edges, 88403 markings/sec, 40 secs
lola: 4879823 markings, 53672061 edges, 111321 markings/sec, 45 secs
lola: 5409607 markings, 58965413 edges, 105957 markings/sec, 50 secs
lola: 5889227 markings, 63909348 edges, 95924 markings/sec, 55 secs
lola: 6446046 markings, 69246088 edges, 111364 markings/sec, 60 secs
lola: 6961550 markings, 74540301 edges, 103101 markings/sec, 65 secs
lola: 7404928 markings, 79696872 edges, 88676 markings/sec, 70 secs
lola: 7886990 markings, 85175674 edges, 96412 markings/sec, 75 secs
lola: 8393739 markings, 90817177 edges, 101350 markings/sec, 80 secs
lola: 8854265 markings, 96468162 edges, 92105 markings/sec, 85 secs
lola: 9290370 markings, 101990049 edges, 87221 markings/sec, 90 secs
lola: 9661590 markings, 107390503 edges, 74244 markings/sec, 95 secs
lola: 10180390 markings, 112703961 edges, 103760 markings/sec, 100 secs
lola: 10625656 markings, 117741100 edges, 89053 markings/sec, 105 secs
lola: 11064679 markings, 122606277 edges, 87805 markings/sec, 110 secs
lola: 11497213 markings, 127649570 edges, 86507 markings/sec, 115 secs
lola: 11880958 markings, 132547982 edges, 76749 markings/sec, 120 secs
lola: 12281208 markings, 137354230 edges, 80050 markings/sec, 125 secs
lola: 12694894 markings, 142555866 edges, 82737 markings/sec, 130 secs
lola: 13127045 markings, 147917312 edges, 86430 markings/sec, 135 secs
lola: 13558630 markings, 153154017 edges, 86317 markings/sec, 140 secs
lola: 14028032 markings, 158228084 edges, 93880 markings/sec, 145 secs
lola: 14489628 markings, 163292240 edges, 92319 markings/sec, 150 secs
lola: 14906788 markings, 168351881 edges, 83432 markings/sec, 155 secs
lola: 15317422 markings, 173535406 edges, 82127 markings/sec, 160 secs
lola: 15784756 markings, 178975106 edges, 93467 markings/sec, 165 secs
lola: 16261245 markings, 184101713 edges, 95298 markings/sec, 170 secs
lola: 16728994 markings, 189194648 edges, 93550 markings/sec, 175 secs
lola: 17213177 markings, 194472984 edges, 96837 markings/sec, 180 secs
lola: 17657625 markings, 199646165 edges, 88890 markings/sec, 185 secs
lola: 18051168 markings, 204646304 edges, 78709 markings/sec, 190 secs
lola: 18467668 markings, 209906445 edges, 83300 markings/sec, 195 secs
lola: 18849344 markings, 214908606 edges, 76335 markings/sec, 200 secs
lola: 19313647 markings, 220257800 edges, 92861 markings/sec, 205 secs
lola: 19730864 markings, 225646630 edges, 83443 markings/sec, 210 secs
lola: 20138899 markings, 231116115 edges, 81607 markings/sec, 215 secs
lola: 20598184 markings, 236472460 edges, 91857 markings/sec, 220 secs
lola: 21022678 markings, 241705698 edges, 84899 markings/sec, 225 secs
lola: 21431241 markings, 246949688 edges, 81713 markings/sec, 230 secs
lola: 21818608 markings, 252219359 edges, 77473 markings/sec, 235 secs
lola: 22174222 markings, 257426982 edges, 71123 markings/sec, 240 secs
lola: 22542791 markings, 262682034 edges, 73714 markings/sec, 245 secs
lola: 22990300 markings, 268084351 edges, 89502 markings/sec, 250 secs
lola: 23398842 markings, 273169194 edges, 81708 markings/sec, 255 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23433356 markings, 273541720 edges
lola: ========================================
lola: subprocess 4 will run for 1611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p12 <= 0)) OR ((1 <= p0)))))
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 ((((p12 <= 0)) OR ((1 <= p0)))))
lola: processed formula length: 38
lola: 24 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: 27 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 3222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((((p92 <= 0)) OR ((1 <= p19))))) AND (((p48 <= 0)) OR ((1 <= p109)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((((p92 <= 0)) OR ((1 <= p19))))) AND (((p48 <= 0)) OR ((1 <= p109)))))
lola: processed formula length: 82
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16015 markings, 37115 edges
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: ========================================
lola: memory consumption: 23848 KB
lola: time consumption: 348 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="DES-PT-00a"
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 DES-PT-00a, 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 r075-tall-162039097000001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00a.tgz
mv DES-PT-00a 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 ;