fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r011-tall-162038005900093
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for AirplaneLD-COL-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4277.163 3600000.00 177846.00 709.30 FTFFTTTTTTTFTFFF normal

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.r011-tall-162038005900093.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 AirplaneLD-COL-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005900093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 01:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 01:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 46K 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 AirplaneLD-COL-0050-00
FORMULA_NAME AirplaneLD-COL-0050-01
FORMULA_NAME AirplaneLD-COL-0050-02
FORMULA_NAME AirplaneLD-COL-0050-03
FORMULA_NAME AirplaneLD-COL-0050-04
FORMULA_NAME AirplaneLD-COL-0050-05
FORMULA_NAME AirplaneLD-COL-0050-06
FORMULA_NAME AirplaneLD-COL-0050-07
FORMULA_NAME AirplaneLD-COL-0050-08
FORMULA_NAME AirplaneLD-COL-0050-09
FORMULA_NAME AirplaneLD-COL-0050-10
FORMULA_NAME AirplaneLD-COL-0050-11
FORMULA_NAME AirplaneLD-COL-0050-12
FORMULA_NAME AirplaneLD-COL-0050-13
FORMULA_NAME AirplaneLD-COL-0050-14
FORMULA_NAME AirplaneLD-COL-0050-15

=== Now, execution of the tool begins

BK_START 1620418895494

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 20:21:37] [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-07 20:21:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 20:21:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-07 20:21:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2021-05-07 20:21:37] [INFO ] sort/places :
Speed->SpeedPossibleVal,Speed_Left_Wheel,Speed_Right_Wheel,
Signal->Plane_On_Ground_Signal_no,
Dot->stp5,stp4,stp3,stp2,stp1,P5,P4,P3,P2,P6,P1,
Weight->WeightPossibleVal,Weight_Right_Wheel,Weight_Left_Wheel,
Altitude->AltitudePossibleVal,TheAltitude,

[2021-05-07 20:21:37] [INFO ] Detected 3 constant HL places corresponding to 152 PT places.
[2021-05-07 20:21:37] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 369 PT places and 612.0 transition bindings in 18 ms.
[2021-05-07 20:21:37] [INFO ] Computed order based on color domains.
[2021-05-07 20:21:37] [INFO ] Unfolded HLPN to a Petri net with 369 places and 408 transitions in 12 ms.
[2021-05-07 20:21:37] [INFO ] Unfolded HLPN properties in 0 ms.
Reduce places removed 152 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 12617 resets, run finished after 670 ms. (steps per millisecond=149 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0]
// Phase 1: matrix 408 rows 217 cols
[2021-05-07 20:21:38] [INFO ] Computed 3 place invariants in 28 ms
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-07 20:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2021-05-07 20:21:38] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using state equation in 190 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-07 20:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using state equation in 104 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-07 20:21:39] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 21 simplifications.
[2021-05-07 20:21:39] [INFO ] Initial state reduction rules for CTL removed 14 formulas.
[2021-05-07 20:21:39] [INFO ] Flatten gal took : 69 ms
FORMULA AirplaneLD-COL-0050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0050-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 20:21:39] [INFO ] Applying decomposition
[2021-05-07 20:21:39] [INFO ] Flatten gal took : 31 ms
[2021-05-07 20:21:39] [INFO ] Decomposing Gal with order
[2021-05-07 20:21:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 20:21:40] [INFO ] Removed a total of 720 redundant transitions.
[2021-05-07 20:21:40] [INFO ] Flatten gal took : 76 ms
[2021-05-07 20:21:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-07 20:21:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2021-05-07 20:21:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AirplaneLD-COL-0050 @ 3570 seconds

FORMULA AirplaneLD-COL-0050-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0050-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3407
rslt: Output for LTLCardinality @ AirplaneLD-COL-0050

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"child":
[

{
"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": 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": "G ((1 <= p10))",
"processed_size": 14,
"rewrites": 9
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p7 <= 0)))",
"processed_size": 17,
"rewrites": 9
},
"result":
{
"edges": 204,
"markings": 205,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 53,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 53,
"visible_transitions": 0
},
"processed": "F (G (((p1 <= p5) AND (p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p9))))",
"processed_size": 380,
"rewrites": 9
},
"result":
{
"edges": 54908054,
"markings": 6315435,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 19164,
"runtime": 163.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(*)) OR (G(**) AND X(F(*)))) : F(G(**))"
},
"net":
{
"arcs": 1145,
"conflict_clusters": 13,
"places": 217,
"places_significant": 214,
"singleton_clusters": 0,
"transitions": 408
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"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: 625/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 217
lola: finding significant places
lola: 217 places, 408 transitions, 214 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: (G ((1 <= p10)) U F (NOT(X ((1 <= p7))))) : G (F (G (((1 <= 0) U ((p1 <= p5) AND (p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p9))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p7 <= 0))) OR (G ((1 <= p10)) AND X (F ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p10))
lola: processed formula length: 14
lola: 9 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, 9 edges
lola: ========================================
lola: subprocess 1 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p7 <= 0)))
lola: processed formula length: 17
lola: 9 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 205 markings, 204 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1 <= p5) AND (p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p9))))
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 (((p1 <= p5) AND (p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p9))))
lola: processed formula length: 380
lola: 9 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: 278822 markings, 1631468 edges, 55764 markings/sec, 0 secs
lola: 513641 markings, 3007880 edges, 46964 markings/sec, 5 secs
lola: 531962 markings, 4396122 edges, 3664 markings/sec, 10 secs
lola: 696605 markings, 6197377 edges, 32929 markings/sec, 15 secs
lola: 974188 markings, 7869309 edges, 55517 markings/sec, 20 secs
lola: 1175766 markings, 10121322 edges, 40316 markings/sec, 25 secs
lola: 1502025 markings, 12081116 edges, 65252 markings/sec, 30 secs
lola: 1689740 markings, 14218222 edges, 37543 markings/sec, 35 secs
lola: 1978211 markings, 15936543 edges, 57694 markings/sec, 40 secs
lola: 2246083 markings, 17534485 edges, 53574 markings/sec, 45 secs
lola: 2493375 markings, 19020076 edges, 49458 markings/sec, 50 secs
lola: 2626908 markings, 20305080 edges, 26707 markings/sec, 55 secs
lola: 2634382 markings, 21783218 edges, 1495 markings/sec, 60 secs
lola: 2787278 markings, 23664948 edges, 30579 markings/sec, 65 secs
lola: 2965508 markings, 25112272 edges, 35646 markings/sec, 70 secs
lola: 3160073 markings, 27138343 edges, 38913 markings/sec, 75 secs
lola: 3410177 markings, 29195988 edges, 50021 markings/sec, 80 secs
lola: 3709859 markings, 30986193 edges, 59936 markings/sec, 85 secs
lola: 3987085 markings, 32618990 edges, 55445 markings/sec, 90 secs
lola: 4197368 markings, 34110479 edges, 42057 markings/sec, 95 secs
lola: 4208941 markings, 35567978 edges, 2315 markings/sec, 100 secs
lola: 4354229 markings, 37421890 edges, 29058 markings/sec, 105 secs
lola: 4616873 markings, 38998279 edges, 52529 markings/sec, 110 secs
lola: 4801027 markings, 41147326 edges, 36831 markings/sec, 115 secs
lola: 5092100 markings, 42875231 edges, 58215 markings/sec, 120 secs
lola: 5366868 markings, 44489128 edges, 54954 markings/sec, 125 secs
lola: 5620836 markings, 45980040 edges, 50794 markings/sec, 130 secs
lola: 5777798 markings, 47361996 edges, 31392 markings/sec, 135 secs
lola: 5786795 markings, 48923562 edges, 1799 markings/sec, 140 secs
lola: 5945157 markings, 50848729 edges, 31672 markings/sec, 145 secs
lola: 6144325 markings, 52464994 edges, 39834 markings/sec, 150 secs
lola: 6314045 markings, 54606115 edges, 33944 markings/sec, 155 secs
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: 6315435 markings, 54908054 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 19164 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="AirplaneLD-COL-0050"
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 AirplaneLD-COL-0050, 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 r011-tall-162038005900093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0050.tgz
mv AirplaneLD-COL-0050 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 ;