Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389500065.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SmallOperatingSystem-PT-MT0256DC0128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389500065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.2K Apr 12 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 20:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 20:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 10 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 10 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 24 05:38 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 SmallOperatingSystem-PT-MT0256DC0128-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0128-15

=== Now, execution of the tool begins

BK_START 1591199146613

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:45:49] [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]
[2020-06-03 15:45:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:45:49] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2020-06-03 15:45:49] [INFO ] Transformed 9 places.
[2020-06-03 15:45:49] [INFO ] Transformed 8 transitions.
[2020-06-03 15:45:49] [INFO ] Parsed PT model containing 9 places and 8 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=1785 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1]
// Phase 1: matrix 8 rows 9 cols
[2020-06-03 15:45:49] [INFO ] Computed 4 place invariants in 3 ms
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned unsat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2020-06-03 15:45:49] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-03 15:45:49] [INFO ] Flatten gal took : 47 ms
FORMULA SmallOperatingSystem-PT-MT0256DC0128-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:45:49] [INFO ] Flatten gal took : 4 ms
[2020-06-03 15:45:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 15:45:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT0256DC0128 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT0256DC0128-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0128-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0128-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0128-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0128-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0128-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ SmallOperatingSystem-PT-MT0256DC0128

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p6 <= p0) U (X (G ((1 <= p7))) OR (G ((F ((p5 <= p7)) AND (F ((2 <= p1)) OR (p5 <= p7)))) AND F (G ((1 <= p7))))))",
"processed_size": 116,
"rewrites": 25
},
"result":
{
"edges": 30,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 64
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 5,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F ((p3 <= p5)) OR ((X ((p4 <= 2)) AND ((p4 <= 2) AND (p5 + 1 <= p3))) OR (G ((1 <= p3)) AND F ((F ((p3 <= p5)) OR (X ((p4 <= 2)) AND ((p4 <= 2) AND (p5 + 1 <= p3))))))))))",
"processed_size": 178,
"rewrites": 25
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 891
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p2 <= p8))",
"processed_size": 14,
"rewrites": 25
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "X ((p2 <= p6))",
"processed_size": 14,
"rewrites": 25
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((2 <= p2)))",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 89281,
"markings": 48769,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p3 <= 0))",
"processed_size": 13,
"rewrites": 25
},
"result":
{
"edges": 11,
"markings": 9,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((G ((G ((p4 <= 1)) AND ((p4 <= 1) OR (p6 + 1 <= p2)))) OR (p2 <= p6)) U (G ((3 <= p4)) OR (3 <= p4)))",
"processed_size": 103,
"rewrites": 25
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 19252,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((G((G(*) AND *)) OR **) U (G(**) OR **)) : (** U (X(G(**)) OR (G((F(**) AND (F(**) OR **))) AND F(G(**))))) : X(X((F(**) OR ((X(*) AND (** AND **)) OR (G(**) AND F((F(**) OR (X(*) AND (** AND **))))))))) : (X(**) OR G(**)) : G(*) : F(G(**))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no yes yes no no ",
"value": "no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: ((NOT(F ((F ((2 <= p4)) OR ((2 <= p4) AND (p2 <= p6))))) OR (p2 <= p6)) U (G ((3 <= p4)) OR (3 <= p4))) : ((p6 <= p0) U (G ((F ((2 <= p1)) U (p5 <= p7))) U X (G ((1 <= p7))))) : X (X ((G ((1 <= p3)) U (F ((p3 <= p5)) OR ((NOT(X ((3 <= p4))) AND (p4 <= 2)) AND (p5 + 1 <= p3)))))) : (X ((p2 <= p6)) OR G ((p2 <= p8))) : G (NOT(F ((1 <= p3)))) : F ((NOT(G ((G ((2 <= p2)) AND (3 <= p8)))) U F (G ((2 <= p2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= p0) U (X (G ((1 <= p7))) OR (G ((F ((p5 <= p7)) AND (F ((2 <= p1)) OR (p5 <= p7)))) AND F (G ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 <= p0) U (X (G ((1 <= p7))) OR (G ((F ((p5 <= p7)) AND (F ((2 <= p1)) OR (p5 <= p7)))) AND F (G ((1 <= p7))))))
lola: processed formula length: 116
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 64 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: 20 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p3 <= p5)) OR ((X ((p4 <= 2)) AND ((p4 <= 2) AND (p5 + 1 <= p3))) OR (G ((1 <= p3)) AND F ((F ((p3 <= p5)) OR (X ((p4 <= 2)) AND ((p4 <= 2) AND (p5 + 1 <= p3))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p3 <= p5)) OR ((X ((p4 <= 2)) AND ((p4 <= 2) AND (p5 + 1 <= p3))) OR (G ((1 <= p3)) AND F ((F ((p3 <= p5)) OR (X ((p4 <= 2)) AND ((p4 <= 2) AND (p5 + 1 <= p3))))))))))
lola: processed formula length: 178
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p2 <= p6)) OR G ((p2 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p2 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p2 <= p8))
lola: processed formula length: 14
lola: 25 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p2 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p2 <= p6))
lola: processed formula length: 14
lola: 25 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p2)))
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 ((2 <= p2)))
lola: processed formula length: 17
lola: 25 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: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
lola: add low 2
lola: add low 7
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: 48769 markings, 89281 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p3 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p3 <= 0))
lola: processed formula length: 13
lola: 25 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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((G ((p4 <= 1)) AND ((p4 <= 1) OR (p6 + 1 <= p2)))) OR (p2 <= p6)) U (G ((3 <= p4)) OR (3 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((G ((p4 <= 1)) AND ((p4 <= 1) OR (p6 + 1 <= p2)))) OR (p2 <= p6)) U (G ((3 <= p4)) OR (3 <= p4)))
lola: processed formula length: 103
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no
lola:
preliminary result: no no yes yes no no
lola: memory consumption: 19252 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="SmallOperatingSystem-PT-MT0256DC0128"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is SmallOperatingSystem-PT-MT0256DC0128, 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 r194-csrt-159033389500065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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