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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 08:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 08:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 566K 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 DLCround-PT-09a-00
FORMULA_NAME DLCround-PT-09a-01
FORMULA_NAME DLCround-PT-09a-02
FORMULA_NAME DLCround-PT-09a-03
FORMULA_NAME DLCround-PT-09a-04
FORMULA_NAME DLCround-PT-09a-05
FORMULA_NAME DLCround-PT-09a-06
FORMULA_NAME DLCround-PT-09a-07
FORMULA_NAME DLCround-PT-09a-08
FORMULA_NAME DLCround-PT-09a-09
FORMULA_NAME DLCround-PT-09a-10
FORMULA_NAME DLCround-PT-09a-11
FORMULA_NAME DLCround-PT-09a-12
FORMULA_NAME DLCround-PT-09a-13
FORMULA_NAME DLCround-PT-09a-14
FORMULA_NAME DLCround-PT-09a-15

=== Now, execution of the tool begins

BK_START 1620539397932

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 05:49:59] [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-09 05:49:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 05:49:59] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2021-05-09 05:49:59] [INFO ] Transformed 299 places.
[2021-05-09 05:49:59] [INFO ] Transformed 2243 transitions.
[2021-05-09 05:49:59] [INFO ] Found NUPN structural information;
[2021-05-09 05:49:59] [INFO ] Parsed PT model containing 299 places and 2243 transitions in 178 ms.
Ensure Unique test removed 216 transitions
Reduce redundant transitions removed 216 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 837 ms. (steps per millisecond=119 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1]
[2021-05-09 05:50:00] [INFO ] Flow matrix only has 202 transitions (discarded 1825 similar events)
// Phase 1: matrix 202 rows 299 cols
[2021-05-09 05:50:00] [INFO ] Computed 184 place invariants in 9 ms
[2021-05-09 05:50:00] [INFO ] [Real]Absence check using 184 positive place invariants in 77 ms returned sat
[2021-05-09 05:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:01] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-09 05:50:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:01] [INFO ] [Nat]Absence check using 184 positive place invariants in 44 ms returned unsat
[2021-05-09 05:50:01] [INFO ] [Real]Absence check using 184 positive place invariants in 61 ms returned sat
[2021-05-09 05:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:01] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-09 05:50:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:01] [INFO ] [Nat]Absence check using 184 positive place invariants in 27 ms returned unsat
[2021-05-09 05:50:01] [INFO ] [Real]Absence check using 184 positive place invariants in 60 ms returned sat
[2021-05-09 05:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:02] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-09 05:50:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:02] [INFO ] [Nat]Absence check using 184 positive place invariants in 27 ms returned unsat
[2021-05-09 05:50:02] [INFO ] [Real]Absence check using 184 positive place invariants in 56 ms returned sat
[2021-05-09 05:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:02] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-09 05:50:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:02] [INFO ] [Nat]Absence check using 184 positive place invariants in 48 ms returned unsat
[2021-05-09 05:50:02] [INFO ] [Real]Absence check using 184 positive place invariants in 53 ms returned sat
[2021-05-09 05:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:02] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-09 05:50:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:02] [INFO ] [Nat]Absence check using 184 positive place invariants in 9 ms returned unsat
[2021-05-09 05:50:03] [INFO ] [Real]Absence check using 184 positive place invariants in 55 ms returned sat
[2021-05-09 05:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:03] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-09 05:50:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:03] [INFO ] [Nat]Absence check using 184 positive place invariants in 8 ms returned unsat
[2021-05-09 05:50:03] [INFO ] [Real]Absence check using 184 positive place invariants in 55 ms returned sat
[2021-05-09 05:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:03] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-09 05:50:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:03] [INFO ] [Nat]Absence check using 184 positive place invariants in 44 ms returned unsat
[2021-05-09 05:50:03] [INFO ] [Real]Absence check using 184 positive place invariants in 57 ms returned sat
[2021-05-09 05:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:04] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 05:50:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:04] [INFO ] [Nat]Absence check using 184 positive place invariants in 16 ms returned unsat
[2021-05-09 05:50:04] [INFO ] [Real]Absence check using 184 positive place invariants in 113 ms returned sat
[2021-05-09 05:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:04] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-09 05:50:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:04] [INFO ] [Nat]Absence check using 184 positive place invariants in 59 ms returned unsat
[2021-05-09 05:50:04] [INFO ] [Real]Absence check using 184 positive place invariants in 55 ms returned sat
[2021-05-09 05:50:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 05:50:04] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-09 05:50:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 05:50:05] [INFO ] [Nat]Absence check using 184 positive place invariants in 28 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
[2021-05-09 05:50:05] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2021-05-09 05:50:05] [INFO ] Flatten gal took : 203 ms
FORMULA DLCround-PT-09a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 05:50:05] [INFO ] Applying decomposition
[2021-05-09 05:50:05] [INFO ] Flatten gal took : 73 ms
[2021-05-09 05:50:05] [INFO ] Decomposing Gal with order
[2021-05-09 05:50:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 05:50:05] [INFO ] Removed a total of 3366 redundant transitions.
[2021-05-09 05:50:05] [INFO ] Flatten gal took : 168 ms
[2021-05-09 05:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 53 ms.
[2021-05-09 05:50:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-09 05:50:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 25 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCround-PT-09a @ 3570 seconds

FORMULA DLCround-PT-09a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-09a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-09a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-09a-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 @ DLCround-PT-09a

{
"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 9 05:50:06 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"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": "((((1 <= p170)) AND ((p51 <= 0))) R X (F (((p195 <= 0)))))",
"processed_size": 58,
"rewrites": 19
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1188
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((((p221 <= 0)) OR ((1 <= p107))))",
"processed_size": 37,
"rewrites": 19
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "(X ((((p221 <= 0)) OR ((1 <= p107)))) U ((1 <= p255)))",
"processed_size": 55,
"rewrites": 19
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 4,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (F ((((p56 <= 0)) OR ((1 <= p97))))) AND (((1 <= p56)) AND ((p97 <= 0)))))",
"processed_size": 81,
"rewrites": 19
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p108) AND ((((1 <= p127)) AND ((p27 <= 0))) OR ((1 <= p108)))))))",
"processed_size": 82,
"rewrites": 19
},
"result":
{
"edges": 195,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 33316,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(* R X(F(*))) : ((X(**) U **) OR G(**)) : F((X(F(*)) AND (** AND **))) : X(X(G(**)))"
},
"net":
{
"arcs": 7917,
"conflict_clusters": 24,
"places": 299,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 2027
},
"result":
{
"preliminary_value": "no no no no ",
"value": "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: 2326/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 299
lola: finding significant places
lola: 299 places, 2027 transitions, 115 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: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: NOT(((((p170 <= 0)) OR ((1 <= p51))) U G (X (((1 <= p195)))))) : ((X ((((p221 <= 0)) OR ((1 <= p107)))) U ((1 <= p255))) OR G ((((p221 <= 0)) OR ((1 <= p107))))) : F (((NOT(G (X ((((1 <= p56)) AND ((p97 <= 0)))))) AND ((1 <= p56))) AND ((p97 <= 0)))) : NOT(F (X (NOT(X (((1 <= p108) AND ((((1 <= p127)) AND ((p27 <= 0))) OR ((1 <= p108)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p170)) AND ((p51 <= 0))) R X (F (((p195 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p170)) AND ((p51 <= 0))) R X (F (((p195 <= 0)))))
lola: processed formula length: 58
lola: 19 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((((p221 <= 0)) OR ((1 <= p107)))) U ((1 <= p255))) OR G ((((p221 <= 0)) OR ((1 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p221 <= 0)) OR ((1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p221 <= 0)) OR ((1 <= p107))))
lola: processed formula length: 37
lola: 19 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p221 <= 0)) OR ((1 <= p107)))) U ((1 <= p255)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((((p221 <= 0)) OR ((1 <= p107)))) U ((1 <= p255)))
lola: processed formula length: 55
lola: 19 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((((p56 <= 0)) OR ((1 <= p97))))) AND (((1 <= p56)) AND ((p97 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((((p56 <= 0)) OR ((1 <= p97))))) AND (((1 <= p56)) AND ((p97 <= 0)))))
lola: processed formula length: 81
lola: 19 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p108) AND ((((1 <= p127)) AND ((p27 <= 0))) OR ((1 <= p108)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p108) AND ((((1 <= p127)) AND ((p27 <= 0))) OR ((1 <= p108)))))))
lola: processed formula length: 82
lola: 19 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 195 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no
lola:
preliminary result: no no no no
lola: memory consumption: 33316 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="DLCround-PT-09a"
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 DLCround-PT-09a, 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-162039097300185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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