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-162039097500277.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 DNAwalker-PT-04track28LL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097500277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K 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.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 17:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 17:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 12 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 108K 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 DNAwalker-PT-04track28LL-00
FORMULA_NAME DNAwalker-PT-04track28LL-01
FORMULA_NAME DNAwalker-PT-04track28LL-02
FORMULA_NAME DNAwalker-PT-04track28LL-03
FORMULA_NAME DNAwalker-PT-04track28LL-04
FORMULA_NAME DNAwalker-PT-04track28LL-05
FORMULA_NAME DNAwalker-PT-04track28LL-06
FORMULA_NAME DNAwalker-PT-04track28LL-07
FORMULA_NAME DNAwalker-PT-04track28LL-08
FORMULA_NAME DNAwalker-PT-04track28LL-09
FORMULA_NAME DNAwalker-PT-04track28LL-10
FORMULA_NAME DNAwalker-PT-04track28LL-11
FORMULA_NAME DNAwalker-PT-04track28LL-12
FORMULA_NAME DNAwalker-PT-04track28LL-13
FORMULA_NAME DNAwalker-PT-04track28LL-14
FORMULA_NAME DNAwalker-PT-04track28LL-15

=== Now, execution of the tool begins

BK_START 1620557753062

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 10:55:54] [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 10:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 10:55:54] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-09 10:55:54] [INFO ] Transformed 34 places.
[2021-05-09 10:55:54] [INFO ] Transformed 250 transitions.
[2021-05-09 10:55:54] [INFO ] Parsed PT model containing 34 places and 250 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6398 resets, run finished after 526 ms. (steps per millisecond=190 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
[2021-05-09 10:55:55] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2021-05-09 10:55:55] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-09 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:55] [INFO ] [Real]Absence check using state equation in 102 ms returned unsat
[2021-05-09 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:55] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-09 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:55] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-09 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-09 10:55:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 10:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Nat]Absence check using state equation in 154 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Nat]Absence check using state equation in 125 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-09 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Nat]Absence check using state equation in 228 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-09 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:56] [INFO ] [Nat]Absence check using state equation in 126 ms returned unsat
[2021-05-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:57] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 10:55:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 10:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:57] [INFO ] [Nat]Absence check using state equation in 118 ms returned unsat
[2021-05-09 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:57] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
[2021-05-09 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:57] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-09 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:57] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2021-05-09 10:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 10:55:57] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 17 simplifications.
[2021-05-09 10:55:57] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-09 10:55:57] [INFO ] Flatten gal took : 59 ms
FORMULA DNAwalker-PT-04track28LL-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-04track28LL-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 10:55:57] [INFO ] Flatten gal took : 17 ms
[2021-05-09 10:55:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-09 10:55:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DNAwalker-PT-04track28LL @ 3570 seconds

FORMULA DNAwalker-PT-04track28LL-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-04track28LL-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3407
rslt: Output for LTLCardinality @ DNAwalker-PT-04track28LL

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 9 10:55:58 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G ((p29 + 1 <= p6))) R (p19 + 1 <= p26)))",
"processed_size": 48,
"rewrites": 41
},
"result":
{
"edges": 495,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((((p1 <= p7) U (p23 <= p11)) OR (p1 <= p7))))",
"processed_size": 51,
"rewrites": 41
},
"result":
{
"edges": 25546,
"markings": 5122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 852
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((X (G ((p20 <= p14))) OR (1 <= p29))))",
"processed_size": 44,
"rewrites": 41
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1136
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((G ((p1 <= 1)) R X (X (F (((p1 <= 1) AND (F ((p11 <= 0)) OR G ((p1 <= 1))))))))))",
"processed_size": 87,
"rewrites": 41
},
"result":
{
"edges": 196243,
"markings": 40854,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1703
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p26 <= 0)))",
"processed_size": 18,
"rewrites": 41
},
"result":
{
"edges": 14,
"markings": 13,
"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": 3407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((1 <= p20) OR (p10 <= p14)) AND ((1 <= p20) OR (p27 <= p15))))",
"processed_size": 69,
"rewrites": 41
},
"result":
{
"edges": 17,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 22564,
"runtime": 163.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(G(*)) R *)) : F(G(*)) : X(G(((** U **) OR **))) : G(**) : X(X((X(G(**)) OR **))) : F(G((G(*) R X(X(F((* AND (F(*) OR G(*)))))))))"
},
"net":
{
"arcs": 728,
"conflict_clusters": 7,
"places": 34,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 250
},
"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: 284/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1088
lola: finding significant places
lola: 34 places, 250 transitions, 34 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X (NOT((X (((0 <= 0) U (p6 <= p29))) U (p26 <= p19)))) : X (F (NOT(X (X (F ((1 <= p26))))))) : X (G ((((1 <= 0) U ((p1 <= p7) U (p23 <= p11))) OR (p1 <= p7)))) : G ((((1 <= p20) OR (p10 <= p14)) AND ((1 <= p20) OR (p27 <= p15)))) : X ((((p20 <= p14) U (0 <= 0)) AND (G (X (X ((p20 <= p14)))) OR X ((1 <= p29))))) : G (F (G (NOT((F ((2 <= p1)) U G (X (X ((G ((1 <= p11)) U (2 <= p1))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p29 + 1 <= p6))) R (p19 + 1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p29 + 1 <= p6))) R (p19 + 1 <= p26)))
lola: processed formula length: 48
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 126 markings, 495 edges
lola: ========================================
lola: subprocess 1 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p1 <= p7) U (p23 <= p11)) OR (p1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p1 <= p7) U (p23 <= p11)) OR (p1 <= p7))))
lola: processed formula length: 51
lola: 41 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: 5122 markings, 25546 edges
lola: ========================================
lola: subprocess 2 will run for 852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G ((p20 <= p14))) OR (1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G ((p20 <= p14))) OR (1 <= p29))))
lola: processed formula length: 44
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p1 <= 1)) R X (X (F (((p1 <= 1) AND (F ((p11 <= 0)) OR G ((p1 <= 1))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p1 <= 1)) R X (X (F (((p1 <= 1) AND (F ((p11 <= 0)) OR G ((p1 <= 1))))))))))
lola: processed formula length: 87
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40854 markings, 196243 edges
lola: ========================================
lola: subprocess 4 will run for 1703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p26 <= 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 ((p26 <= 0)))
lola: processed formula length: 18
lola: 41 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: 13 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 3407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p20) OR (p10 <= p14)) AND ((1 <= p20) OR (p27 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p20) OR (p10 <= p14)) AND ((1 <= p20) OR (p27 <= p15))))
lola: processed formula length: 69
lola: 41 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: 12 markings, 17 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: memory consumption: 22564 KB
lola: time consumption: 163 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="DNAwalker-PT-04track28LL"
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 DNAwalker-PT-04track28LL, 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-162039097500277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-04track28LL.tgz
mv DNAwalker-PT-04track28LL 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 ;