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.r151-tall-162089151200194.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 ParamProductionCell-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-3-00
FORMULA_NAME ParamProductionCell-PT-3-01
FORMULA_NAME ParamProductionCell-PT-3-02
FORMULA_NAME ParamProductionCell-PT-3-03
FORMULA_NAME ParamProductionCell-PT-3-04
FORMULA_NAME ParamProductionCell-PT-3-05
FORMULA_NAME ParamProductionCell-PT-3-06
FORMULA_NAME ParamProductionCell-PT-3-07
FORMULA_NAME ParamProductionCell-PT-3-08
FORMULA_NAME ParamProductionCell-PT-3-09
FORMULA_NAME ParamProductionCell-PT-3-10
FORMULA_NAME ParamProductionCell-PT-3-11
FORMULA_NAME ParamProductionCell-PT-3-12
FORMULA_NAME ParamProductionCell-PT-3-13
FORMULA_NAME ParamProductionCell-PT-3-14
FORMULA_NAME ParamProductionCell-PT-3-15

=== Now, execution of the tool begins

BK_START 1621005928019

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 15:25:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 15:25:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:25:29] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2021-05-14 15:25:29] [INFO ] Transformed 231 places.
[2021-05-14 15:25:29] [INFO ] Transformed 202 transitions.
[2021-05-14 15:25:29] [INFO ] Found NUPN structural information;
[2021-05-14 15:25:29] [INFO ] Parsed PT model containing 231 places and 202 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 326 ms. (steps per millisecond=306 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 15:25:30] [INFO ] Computed 59 place invariants in 26 ms
[2021-05-14 15:25:30] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2021-05-14 15:25:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:25:30] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-14 15:25:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 15:25:30] [INFO ] [Real]Added 68 Read/Feed constraints in 24 ms returned sat
[2021-05-14 15:25:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:25:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2021-05-14 15:25:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:25:30] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-14 15:25:30] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2021-05-14 15:25:30] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2021-05-14 15:25:30] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2021-05-14 15:25:30] [INFO ] Deduced a trap composed of 10 places in 46 ms
[2021-05-14 15:25:31] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2021-05-14 15:25:31] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2021-05-14 15:25:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 365 ms
[2021-05-14 15:25:31] [INFO ] Computed and/alt/rep : 199/572/199 causal constraints in 12 ms.
[2021-05-14 15:25:31] [INFO ] Added : 199 causal constraints over 40 iterations in 633 ms. Result :sat
[2021-05-14 15:25:31] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2021-05-14 15:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2021-05-14 15:25:31] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-14 15:25:31] [INFO ] Flatten gal took : 52 ms
FORMULA ParamProductionCell-PT-3-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:25:31] [INFO ] Applying decomposition
[2021-05-14 15:25:32] [INFO ] Flatten gal took : 18 ms
[2021-05-14 15:25:32] [INFO ] Decomposing Gal with order
[2021-05-14 15:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:25:32] [INFO ] Removed a total of 137 redundant transitions.
[2021-05-14 15:25:32] [INFO ] Flatten gal took : 82 ms
[2021-05-14 15:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 11 ms.
[2021-05-14 15:25:32] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-14 15:25:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ParamProductionCell-PT-3 @ 3570 seconds

FORMULA ParamProductionCell-PT-3-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-3-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for LTLFireability @ ParamProductionCell-PT-3

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 15:25:33 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((((1 <= p201) AND (1 <= p202)) U X (G (((p62 <= 0) OR (p70 <= 0))))) AND (((1 <= p201)) AND ((1 <= p202))))))",
"processed_size": 117,
"rewrites": 73
},
"result":
{
"edges": 399,
"markings": 399,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p64) AND (1 <= p71))) OR (G ((((p47 <= 0) OR (p54 <= 0)) OR (G (((1 <= p47) AND (1 <= p54))) AND F (((p47 <= 0) OR (p54 <= 0)))))) AND X (F (((1 <= p64) AND (1 <= p71)))))))",
"processed_size": 189,
"rewrites": 73
},
"result":
{
"edges": 3767247,
"markings": 982550,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 56400,
"runtime": 3571.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND F(G(**))) : G(F(((** U X(G(*))) AND (* AND *)))) : X((X(**) OR (G((** OR (G(**) AND F(**)))) AND X(F(**))))) : ((G(((** U X(**)) OR (** OR **))) OR (G(**) AND F(G(((** U X(**)) OR (** OR **)))))) AND **) : ((X(G(**)) U **) OR (G(**) OR **)) : F(**) : (G(F(**)) OR F(**)) : X(F(**)) : F(G(**)) : (X(G(((X(**) U **) AND *))) OR **) : ((** U **) OR (** OR (F(**) AND **))) : (X((G(**) AND (** AND (** AND (** AND (** AND **)))))) OR (** OR (G(**) AND **))) : (X(*) OR ((G(F(**)) AND X(F(*))) OR (** U **)))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"interim_value": "unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: (F ((((1 <= p104) AND (1 <= p186)) U F (((1 <= p104) AND (1 <= p186))))) AND X (F (G (((p39 <= 0) OR (p41 <= 0) OR (p58 <= 0)))))) : G (NOT(F (G (((NOT((((1 <= p201) AND (1 <= p202)) U NOT(X (F (((1 <= p62) AND (1 <= p70))))))) OR ((p201 <= 0))) OR ((p202 <= 0))))))) : (G ((G (X (((1 <= p47) AND (1 <= p54)))) U X (((p47 <= 0) OR (p54 <= 0))))) U X (X (((1 <= p64) AND (1 <= p71))))) : ((G (((1 <= p45) AND (1 <= p46) AND (1 <= p51))) U G ((((((1 <= p116) AND (1 <= p120)) U X (((1 <= p96) AND (1 <= p177)))) OR ((p96 <= 0))) OR ((p177 <= 0))))) AND ((p204 <= 0) OR (p215 <= 0))) : (((G (X (((1 <= p46) AND (1 <= p50)))) U ((1 <= p19) AND (1 <= p26))) OR G (((1 <= p137) AND (1 <= p141)))) OR ((1 <= p46) AND (1 <= p50) AND (1 <= p19) AND (1 <= p26))) : F ((X (X (F (((1 <= p4) AND (1 <= p15))))) U ((1 <= p63) AND (1 <= p72) AND ((p164 <= 0) OR (p171 <= 0))))) : ((((1 <= p97) AND (1 <= p159)) U G (F (((1 <= p114) AND (1 <= p140))))) OR F (((1 <= p113) AND (1 <= p114) AND (1 <= p141)))) : X (F (((1 <= p99) AND (1 <= p154)))) : F (G (X (G (((1 <= p0) AND (1 <= p194)))))) : (NOT(F (X ((((1 <= p97) AND (1 <= p157)) U F ((NOT((X (((1 <= p63) AND (1 <= p64) AND (1 <= p70))) U ((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) OR ((1 <= p205) AND (1 <= p206) AND (1 <= p215)))))))) OR ((1 <= p112) AND (1 <= p122))) : (((((1 <= p24) AND (1 <= p25) AND (1 <= p29)) U ((1 <= p148))) OR ((1 <= p105) AND (1 <= p151))) OR (F (((1 <= p105) AND (1 <= p151))) AND ((p24 <= 0) OR (p25 <= 0) OR (p29 <= 0)))) : ((X ((((((G (((1 <= p63) AND (1 <= p64) AND (1 <= p70))) AND ((1 <= p63))) AND ((1 <= p64))) AND ((1 <= p70))) AND ((1 <= p63))) AND ((1 <= p72)))) OR ((1 <= p98) AND (1 <= p105) AND (1 <= p111))) OR (G (((1 <= p98) AND (1 <= p105) AND (1 <= p111))) AND ((p199 <= 0) OR (p217 <= 0)))) : ((G (F (((1 <= p167) AND (1 <= p192)))) U NOT(X (((1 <= p14) AND (1 <= p88))))) OR (((p14 <= 0) OR (p88 <= 0)) U ((1 <= p113) AND (1 <= p114) AND (1 <= p122))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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: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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p201) AND (1 <= p202)) U X (G (((p62 <= 0) OR (p70 <= 0))))) AND (((1 <= p201)) AND ((1 <= p202))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p201) AND (1 <= p202)) U X (G (((p62 <= 0) OR (p70 <= 0))))) AND (((1 <= p201)) AND ((1 <= p202))))))
lola: processed formula length: 117
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 399 markings, 399 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p64) AND (1 <= p71))) OR (G ((((p47 <= 0) OR (p54 <= 0)) OR (G (((1 <= p47) AND (1 <= p54))) AND F (((p47 <= 0) OR (p54 <= 0)))))) AND X (F (((1 <= p64) AND (1 <= p71)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p64) AND (1 <= p71))) OR (G ((((p47 <= 0) OR (p54 <= 0)) OR (G (((1 <= p47) AND (1 <= p54))) AND F (((p47 <= 0) OR (p54 <= 0)))))) AND X (F (((1 <= p64) AND (1 <= p71)))))))
lola: processed formula length: 189
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 726576 markings, 2702100 edges, 145315 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 982550 markings, 3767247 edges
lola: ========================================
lola: subprocess 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((((1 <= p116) AND (1 <= p120)) U X (((1 <= p96) AND (1 <= p177)))) OR (((p96 <= 0)) OR ((p177 <= 0))))) OR (G (((1 <= p45) AND (1 <= p46) AND (1 <= p51))) AND F (G (((((1 <= p116) AND (1 <= p120)) U X (((1 <= p96) AND (1 <= p177)))) OR (((p96 <= 0)) OR ((p177 <= 0)))))))) AND ((p204 <= 0) OR (p215 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 56400 KB
lola: time consumption: 334 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 56400 KB
lola: time consumption: 3571 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16090752 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16090744 kB

--------------------
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="ParamProductionCell-PT-3"
export BK_EXAMINATION="LTLFireability"
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 ParamProductionCell-PT-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-tall-162089151200194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;