Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477700636.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldPPPt-PT-005A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.7K May 14 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 33K May 12 20:42 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 ShieldPPPt-PT-005A-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-005A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591317592822

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:39:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 00:39:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:39:54] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-05 00:39:54] [INFO ] Transformed 128 places.
[2020-06-05 00:39:54] [INFO ] Transformed 93 transitions.
[2020-06-05 00:39:54] [INFO ] Found NUPN structural information;
[2020-06-05 00:39:54] [INFO ] Parsed PT model containing 128 places and 93 transitions in 104 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 207 ms. (steps per millisecond=483 ) properties seen :[1, 1, 1, 1, 1, 1, 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]
// Phase 1: matrix 92 rows 128 cols
[2020-06-05 00:39:54] [INFO ] Computed 56 place invariants in 5 ms
[2020-06-05 00:39:55] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 00:39:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:39:55] [INFO ] Flatten gal took : 51 ms
[2020-06-05 00:39:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:39:55] [INFO ] Flatten gal took : 17 ms
FORMULA ShieldPPPt-PT-005A-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:39:55] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-05 00:39:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldPPPt-PT-005A @ 3570 seconds
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ ShieldPPPt-PT-005A

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 00:39:55 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"memory": 10095036,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(E(G(**)))) OR (A(F(**)) AND A(G(*)))) : E(F(*)) : (A(G(E(X(*)))) OR (A(G(**)) OR **)) : (A(F(**)) AND (A(F(**)) AND (** OR (E(F(*)) OR (** OR **))))) : (E(F(**)) AND ((E(X(E(F(**)))) OR E(X(**))) AND **)) : E(F((A(G(**)) AND E(F(**))))) : A((* R *)) : E(F(A(G(**)))) : E(G(E(F(**)))) : A(F(E((** U **)))) : (E(F(**)) OR (** AND (E(X(**)) AND (E((** U **)) AND **)))) : (E(F(A(G(*)))) OR E(F((E(F(**)) AND E(X(**)))))) : (E(X(A(F(**)))) OR A(F(**))) : A(G(E(X(**)))) : E(G((A(G(*)) AND *)))"
},
"net":
{
"arcs": 364,
"conflict_clusters": 58,
"places": 128,
"places_significant": 72,
"singleton_clusters": 0,
"transitions": 92
},
"result":
{
"preliminary_value": "unknown unknown unknown unknown unknown 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: 220/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 92 transitions, 72 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: (E (F (E (G (((1 <= p62) AND (1 <= p64) AND (1 <= p66) AND (1 <= p77)))))) OR (A (F (((1 <= p32) AND (1 <= p34)))) AND NOT(E (F ((((1 <= p120)) OR ((1 <= p20) AND (1 <= p35)))))))) : NOT(A (G (((p95 <= 0) OR (p110 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p92 <= 0) OR (p94 <= 0))))) : ((NOT(E (F (A (X (((1 <= p3) AND (1 <= p26))))))) OR A (G (((1 <= p68) AND (1 <= p75))))) OR ((1 <= p61) AND (1 <= p71) AND (((1 <= p8) AND (1 <= p25)) OR ((1 <= p90) AND (1 <= p124))))) : ((A (F (((p93 <= 0) OR (p100 <= 0) OR (p41 <= 0) OR (p52 <= 0)))) AND A (F ((((1 <= p72)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p103) AND (1 <= p126)))))) AND (((((1 <= p95)) OR NOT(A (G (((1 <= p45)))))) OR ((p70 <= 0))) OR ((p85 <= 0)))) : ((E (F (((1 <= p101) AND (1 <= p16) AND (1 <= p27) AND ((p93 <= 0) OR (p100 <= 0))))) AND E (X ((E (F (((1 <= p37) AND (1 <= p39)))) OR ((1 <= p45)))))) AND ((p45 <= 0) OR (p60 <= 0))) : E (F ((A (G (((1 <= p61) AND (1 <= p71)))) AND E (F (((1 <= p108) AND (1 <= p125))))))) : NOT(E (((((p80 <= 0) OR (p97 <= 0)) AND ((p37 <= 0) OR (p39 <= 0))) U ((1 <= p112) AND (1 <= p114))))) : E (F (A (G (((1 <= p107) AND (1 <= p109)))))) : E (G (E (G (E (F (((1 <= p11) AND (1 <= p21)))))))) : A (F (E ((((p103 <= 0) OR (p126 <= 0)) U ((1 <= p47) AND (1 <= p41) AND (1 <= p52)))))) : (E ((((1 <= p79) AND (1 <= p98)) U E (F (((1 <= p8) AND (1 <= p25)))))) OR (((((1 <= p117) AND (1 <= p119) AND (1 <= p16) AND (1 <= p27) AND (1 <= p5) AND (1 <= p22)) AND E (X (((1 <= p40) AND (1 <= p74))))) AND E ((((1 <= p83) AND (1 <= p100)) U ((1 <= p6) AND (1 <= p21))))) AND ((p79 <= 0) OR (p98 <= 0) OR ((1 <= p33) AND (1 <= p50))))) : E (F ((NOT(E (F (((1 <= p120))))) OR (E (F (((1 <= p120)))) AND E (X (((1 <= p70)))))))) : (E (X (A (F (((1 <= p126)))))) OR A (F (((1 <= p105) AND (1 <= p122))))) : A (G (E (X (((p74 <= 0) OR ((1 <= p61) AND (1 <= p71)) OR ((1 <= p87) AND (1 <= p89))))))) : NOT(A (F ((E (F (((1 <= p12) AND (1 <= p14)))) OR ((1 <= p4) AND ((p42 <= 0) OR (p44 <= 0)) AND (1 <= p23) AND (1 <= p43) AND (1 <= p50))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:461
lola: rewrite Frontend/Parser/formula_rewrite.k:473
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (((p3 <= 0) OR (p26 <= 0)))))) OR (A (G (((1 <= p68) AND (1 <= p75)))) OR ((1 <= p61) AND (1 <= p71) AND (((1 <= p8) AND (1 <= p25)) OR ((1 <= p90) AND (1 <= p124))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p61) AND (1 <= p71) AND (((1 <= p8) AND (1 <= p25)) OR ((1 <= p90) AND (1 <= p124))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p61) AND (1 <= p71) AND (((1 <= p8) AND (1 <= p25)) OR ((1 <= p90) AND (1 <= p124))))
lola: processed formula length: 93
lola: 41 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p68) AND (1 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p68) AND (1 <= p75))))
lola: processed formula length: 35
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p68 <= 0) OR (p75 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p3 <= 0) OR (p26 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p3 <= 0) OR (p26 <= 0))))
lola: processed formula length: 34
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1130132 markings, 3146780 edges, 226026 markings/sec, 0 secs
lola: 2220636 markings, 6480476 edges, 218101 markings/sec, 5 secs
lola: 3273355 markings, 9826101 edges, 210544 markings/sec, 10 secs
lola: 4289086 markings, 13124473 edges, 203146 markings/sec, 15 secs
lola: 5268559 markings, 16344544 edges, 195895 markings/sec, 20 secs
lola: 6220092 markings, 19515990 edges, 190307 markings/sec, 25 secs
lola: 7137372 markings, 22583367 edges, 183456 markings/sec, 30 secs
lola: 8011146 markings, 25562870 edges, 174755 markings/sec, 35 secs
lola: 8884010 markings, 28549642 edges, 174573 markings/sec, 40 secs
lola: 9738052 markings, 31494952 edges, 170808 markings/sec, 45 secs
lola: 10686551 markings, 34216583 edges, 189700 markings/sec, 50 secs
lola: 11600987 markings, 36960332 edges, 182887 markings/sec, 55 secs
lola: 12425208 markings, 39539496 edges, 164844 markings/sec, 60 secs
lola: 13278277 markings, 42248807 edges, 170614 markings/sec, 65 secs
lola: 14114546 markings, 44967851 edges, 167254 markings/sec, 70 secs
lola: 14938726 markings, 47686187 edges, 164836 markings/sec, 75 secs
lola: 15754645 markings, 50404264 edges, 163184 markings/sec, 80 secs
lola: 16551293 markings, 53080114 edges, 159330 markings/sec, 85 secs
lola: 17342902 markings, 55742810 edges, 158322 markings/sec, 90 secs
lola: 18132288 markings, 58437858 edges, 157877 markings/sec, 95 secs
lola: 18907432 markings, 61098791 edges, 155029 markings/sec, 100 secs
lola: 19680250 markings, 63778201 edges, 154564 markings/sec, 105 secs
lola: 20448663 markings, 66435941 edges, 153683 markings/sec, 110 secs
lola: 21209935 markings, 69088160 edges, 152254 markings/sec, 115 secs
lola: 21967392 markings, 71747548 edges, 151491 markings/sec, 120 secs
lola: 22519475 markings, 73680734 edges, 110417 markings/sec, 125 secs
lola: 23010397 markings, 75411840 edges, 98184 markings/sec, 130 secs
lola: 23488341 markings, 77105115 edges, 95589 markings/sec, 135 secs
lola: 24001277 markings, 78929763 edges, 102587 markings/sec, 140 secs
lola: 24692436 markings, 81392701 edges, 138232 markings/sec, 145 secs
lola: 25404376 markings, 83928517 edges, 142388 markings/sec, 150 secs
lola: 26122195 markings, 86499300 edges, 143564 markings/sec, 155 secs
lola: 26846543 markings, 89104412 edges, 144870 markings/sec, 160 secs
lola: 27624717 markings, 91769499 edges, 155635 markings/sec, 165 secs
lola: 28656025 markings, 94637674 edges, 206262 markings/sec, 170 secs
lola: 29640684 markings, 97553793 edges, 196932 markings/sec, 175 secs
lola: 30576347 markings, 100417941 edges, 187133 markings/sec, 180 secs
lola: 31438703 markings, 103187932 edges, 172471 markings/sec, 185 secs
lola: 32144158 markings, 105736857 edges, 141091 markings/sec, 190 secs
lola: 32911929 markings, 108388869 edges, 153554 markings/sec, 195 secs
lola: 33698666 markings, 111032450 edges, 157347 markings/sec, 200 secs
lola: 34514341 markings, 113693243 edges, 163135 markings/sec, 205 secs
lola: 35268271 markings, 116190470 edges, 150786 markings/sec, 210 secs
lola: 35954327 markings, 118592613 edges, 137211 markings/sec, 215 secs
lola: 36610646 markings, 120978669 edges, 131264 markings/sec, 220 secs
lola: 37318093 markings, 123525727 edges, 141489 markings/sec, 225 secs
lola: 38059839 markings, 126105728 edges, 148349 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10094808 KB
lola: time consumption: 241 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10095036 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 6035572 kB
After kill :
MemTotal: 16427456 kB
MemFree: 6035456 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="ShieldPPPt-PT-005A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldPPPt-PT-005A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477700636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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