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.r113-smll-162075355600001.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 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 gold2020
Input is FlexibleBarrier-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355600001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 23K 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 FlexibleBarrier-PT-04a-00
FORMULA_NAME FlexibleBarrier-PT-04a-01
FORMULA_NAME FlexibleBarrier-PT-04a-02
FORMULA_NAME FlexibleBarrier-PT-04a-03
FORMULA_NAME FlexibleBarrier-PT-04a-04
FORMULA_NAME FlexibleBarrier-PT-04a-05
FORMULA_NAME FlexibleBarrier-PT-04a-06
FORMULA_NAME FlexibleBarrier-PT-04a-07
FORMULA_NAME FlexibleBarrier-PT-04a-08
FORMULA_NAME FlexibleBarrier-PT-04a-09
FORMULA_NAME FlexibleBarrier-PT-04a-10
FORMULA_NAME FlexibleBarrier-PT-04a-11
FORMULA_NAME FlexibleBarrier-PT-04a-12
FORMULA_NAME FlexibleBarrier-PT-04a-13
FORMULA_NAME FlexibleBarrier-PT-04a-14
FORMULA_NAME FlexibleBarrier-PT-04a-15

=== Now, execution of the tool begins

BK_START 1620898405237

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:33:29] [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-13 09:33:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:33:29] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-13 09:33:29] [INFO ] Transformed 51 places.
[2021-05-13 09:33:29] [INFO ] Transformed 88 transitions.
[2021-05-13 09:33:29] [INFO ] Found NUPN structural information;
[2021-05-13 09:33:29] [INFO ] Parsed PT model containing 51 places and 88 transitions in 155 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 275 ms. (steps per millisecond=363 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2021-05-13 09:33:30] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
// Phase 1: matrix 74 rows 51 cols
[2021-05-13 09:33:30] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-13 09:33:30] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2021-05-13 09:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:33:30] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-13 09:33:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:33:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned unsat
[2021-05-13 09:33:30] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 09:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:33:30] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-13 09:33:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:33:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned unsat
[2021-05-13 09:33:31] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 09:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:33:31] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-13 09:33:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:33:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned unsat
[2021-05-13 09:33:31] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-13 09:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:33:31] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-13 09:33:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:33:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-13 09:33:31] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 09:33:31] [INFO ] Flatten gal took : 73 ms
FORMULA FlexibleBarrier-PT-04a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:33:31] [INFO ] Applying decomposition
[2021-05-13 09:33:31] [INFO ] Flatten gal took : 23 ms
[2021-05-13 09:33:31] [INFO ] Decomposing Gal with order
[2021-05-13 09:33:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:33:31] [INFO ] Removed a total of 46 redundant transitions.
[2021-05-13 09:33:31] [INFO ] Flatten gal took : 73 ms
[2021-05-13 09:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 7 ms.
[2021-05-13 09:33:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2021-05-13 09:33:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FlexibleBarrier-PT-04a @ 3570 seconds

FORMULA FlexibleBarrier-PT-04a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04a-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-04a

{
"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": "Thu May 13 09:33:35 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 3,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p38)))) AND ((((p50 <= 0)) OR ((1 <= p27))) R (((1 <= p45)) AND ((p14 <= 0))))))",
"processed_size": 98,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p10 <= 0)) OR ((1 <= p2)))",
"processed_size": 30,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p6)) AND ((p20 <= 0)))",
"processed_size": 30,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((((1 <= p6)) AND ((p20 <= 0))) U (((p6 <= 0)) OR ((1 <= p20)))))",
"processed_size": 69,
"rewrites": 52
},
"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": 1,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 32160,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : X((X(G(**)) AND (* R *))) : (F(**) AND (X((** U **)) AND **)) : (X((** U X(**))) AND (F(*) U X(**))) : X(X(X(X(G((* R *)))))) : X(F(**)) : X(F(**)) : X((X(X((X(X(G(**))) OR (** OR **)))) AND F((X(**) OR (** OR **))))) : F(G(**)) : (G(*) OR F(G(*))) : G((G(F(**)) AND (X(**) OR **)))"
},
"net":
{
"arcs": 253,
"conflict_clusters": 20,
"places": 51,
"places_significant": 45,
"singleton_clusters": 0,
"transitions": 78
},
"result":
{
"interim_value": "unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown no yes 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: 129/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 51
lola: finding significant places
lola: 51 places, 78 transitions, 45 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: NOT((((1 <= p34)) U G (F ((((p9 <= 0)) OR ((1 <= p34)) OR (((1 <= p7)) AND ((p21 <= 0)))))))) : X ((G (X (((1 <= p38)))) AND NOT(((((1 <= p50)) AND ((p27 <= 0))) U (((p45 <= 0)) OR ((1 <= p14))))))) : ((F ((((p6 <= 0)) OR ((1 <= p20)))) AND X (((((1 <= p6)) AND ((p20 <= 0))) U (((p6 <= 0)) OR ((1 <= p20)))))) AND (((p10 <= 0)) OR ((1 <= p2)))) : (X ((((1 <= p45)) U X (((1 <= p23))))) AND (NOT(G (((1 <= p45)))) U X (((1 <= p9))))) : G (NOT(X (X (X (X (((1 <= 0) U ((((p49 <= 0)) OR ((1 <= p39))) U ((1 <= p17)))))))))) : (X (F ((((p27 <= 0)) OR ((1 <= p44))))) AND F (NOT(X ((NOT(G (((((p27 <= 0)) OR ((1 <= p44))) AND (((p46 <= 0)) OR ((1 <= p5)))))) U (1 <= 0)))))) : X (((0 <= 0) U ((1 <= p42)))) : X ((X (X (((X (X (G ((((p39 <= 0)) OR ((1 <= p16)))))) OR ((p8 <= 0))) OR ((1 <= p8))))) AND F (((X ((((p12 <= 0)) OR ((1 <= p30)))) OR ((p8 <= 0))) OR ((1 <= p8)))))) : X (F (((0 <= 0) U G (((1 <= p14)))))) : (NOT(F (((1 <= p22)))) OR NOT(X (G (((1 <= 0) U F (((1 <= p28)))))))) : G ((X (G (F (X (((p19 <= 0)))))) AND (X ((((p9 <= 0)) OR ((1 <= p5)))) OR (((1 <= p32)) AND ((p15 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p38)))) AND ((((p50 <= 0)) OR ((1 <= p27))) R (((1 <= p45)) AND ((p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p38)))) AND ((((p50 <= 0)) OR ((1 <= p27))) R (((1 <= p45)) AND ((p14 <= 0))))))
lola: processed formula length: 98
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p6 <= 0)) OR ((1 <= p20)))) AND (X (((((1 <= p6)) AND ((p20 <= 0))) U (((p6 <= 0)) OR ((1 <= p20))))) AND (((p10 <= 0)) OR ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p10 <= 0)) OR ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p10 <= 0)) OR ((1 <= p2)))
lola: processed formula length: 30
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p6 <= 0)) OR ((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p6)) AND ((p20 <= 0)))
lola: processed formula length: 30
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p6)) AND ((p20 <= 0))) U (((p6 <= 0)) OR ((1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p6)) AND ((p20 <= 0))) U (((p6 <= 0)) OR ((1 <= p20)))))
lola: processed formula length: 69
lola: 52 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 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p45)) U X (((1 <= p23))))) AND (F (((p45 <= 0))) U X (((1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 32160 KB
lola: time consumption: 399 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 32160 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16116992 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16117040 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="FlexibleBarrier-PT-04a"
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 FlexibleBarrier-PT-04a, 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 r113-smll-162075355600001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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