About the Execution of ITS-LoLa for DLCround-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15740.560 | 3600000.00 | 337418.00 | 1265.40 | ?T?????????TT?FF | normal |
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.r180-ebro-158987900300500.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 DLCround-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900300500
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 3.2K Mar 30 18:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 18:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 23:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 23:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 325K Mar 24 05:37 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 DLCround-PT-06a-CTLFireability-00
FORMULA_NAME DLCround-PT-06a-CTLFireability-01
FORMULA_NAME DLCround-PT-06a-CTLFireability-02
FORMULA_NAME DLCround-PT-06a-CTLFireability-03
FORMULA_NAME DLCround-PT-06a-CTLFireability-04
FORMULA_NAME DLCround-PT-06a-CTLFireability-05
FORMULA_NAME DLCround-PT-06a-CTLFireability-06
FORMULA_NAME DLCround-PT-06a-CTLFireability-07
FORMULA_NAME DLCround-PT-06a-CTLFireability-08
FORMULA_NAME DLCround-PT-06a-CTLFireability-09
FORMULA_NAME DLCround-PT-06a-CTLFireability-10
FORMULA_NAME DLCround-PT-06a-CTLFireability-11
FORMULA_NAME DLCround-PT-06a-CTLFireability-12
FORMULA_NAME DLCround-PT-06a-CTLFireability-13
FORMULA_NAME DLCround-PT-06a-CTLFireability-14
FORMULA_NAME DLCround-PT-06a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591238065998
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:34:29] [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-04 02:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:34:29] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2020-06-04 02:34:29] [INFO ] Transformed 197 places.
[2020-06-04 02:34:29] [INFO ] Transformed 1313 transitions.
[2020-06-04 02:34:29] [INFO ] Found NUPN structural information;
[2020-06-04 02:34:29] [INFO ] Parsed PT model containing 197 places and 1313 transitions in 331 ms.
Ensure Unique test removed 135 transitions
Reduce redundant transitions removed 135 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 63 ms.
Finished random walk after 812 steps, including 0 resets, run visited all 62 properties in 25 ms. (steps per millisecond=32 )
[2020-06-04 02:34:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 02:34:30] [INFO ] Flatten gal took : 208 ms
[2020-06-04 02:34:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 02:34:30] [INFO ] Flatten gal took : 101 ms
FORMULA DLCround-PT-06a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:34:30] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-04 02:34:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DLCround-PT-06a @ 3570 seconds
FORMULA DLCround-PT-06a-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ DLCround-PT-06a
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:34:30 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "((1 <= p69) AND (1 <= p182) AND (1 <= p36) AND (1 <= p102))",
"processed_size": 59,
"rewrites": 41
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 48288,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(E(F(**)))) AND (A(X(**)) AND A(X((** OR E(X(**))))))) : (E(F(E(G(**)))) OR E(X(A(G(**))))) : (A(G(E(F(*)))) AND (E(X(*)) OR (** OR (** OR **)))) : E(F(E(G(**)))) : E((E(X(**)) U A(X(**)))) : (A(G(E(F(**)))) OR (A(G(**)) OR **)) : (A(G(A(F(*)))) AND (A(X(*)) OR **)) : A(G(E(F(**)))) : (A(G(**)) OR **) : A(G((E(F(*)) OR (** OR **)))) : A(G((A(X(**)) OR (** OR (** OR (** OR (** OR **))))))) : E(F(**))"
},
"net":
{
"arcs": 4536,
"conflict_clusters": 21,
"places": 197,
"places_significant": 88,
"singleton_clusters": 0,
"transitions": 1178
},
"result":
{
"interim_value": "unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown yes 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: 1375/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 197
lola: finding significant places
lola: 197 places, 1178 transitions, 88 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: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: A (X (((E (F (((1 <= p54) AND (1 <= p122)))) AND ((p19 <= 0) OR ((1 <= p32) AND (1 <= p100)))) AND (((p11 <= 0) OR (p109 <= 0) OR (p37 <= 0) OR (p179 <= 0)) OR E (X (((1 <= p23) AND (1 <= p121)))))))) : (E (F (E (G (((1 <= p69) AND (1 <= p182) AND (1 <= p36) AND (1 <= p102)))))) OR E (X (A (G (((p51 <= 0) OR (p116 <= 0))))))) : (NOT(E (F (A (G (((1 <= p42) AND (1 <= p110))))))) AND (((NOT(A (X (((1 <= p70))))) OR ((1 <= p57) AND (1 <= p193))) OR ((1 <= p9) AND (1 <= p141))) OR ((1 <= p37) AND (1 <= p185) AND ((p56 <= 0) OR (p116 <= 0)) AND ((p53 <= 0) OR (p172 <= 0))))) : E (F (E (G (((1 <= p91) AND (1 <= p194)))))) : E ((E (X ((((1 <= p38)) OR ((1 <= p35) AND (1 <= p158))))) U A (X (((1 <= p6)))))) : ((A (G (E (F (((1 <= p61) AND (1 <= p124)))))) OR A (G (((1 <= p15) AND (1 <= p103))))) OR ((1 <= p67) AND (1 <= p129))) : (NOT(E (F (E (G (((1 <= p33) AND (1 <= p106))))))) AND (NOT(E (X (((1 <= p46) AND (1 <= p163))))) OR (((p28 <= 0) OR (p129 <= 0)) AND ((p43 <= 0) OR (p108 <= 0)) AND ((p59 <= 0) OR (p175 <= 0) OR (p21 <= 0) OR (p128 <= 0) OR ((1 <= p87) AND (1 <= p145)))))) : A (G (E (F (A (F (((1 <= p43) AND (1 <= p162)))))))) : (A (G (((p75 <= 0) OR (p138 <= 0) OR (p43 <= 0)))) OR ((1 <= p46) AND (1 <= p114))) : A (G (((NOT(A (G (((1 <= p96) AND (1 <= p196))))) OR ((p77 <= 0))) OR ((p133 <= 0))))) : A (G ((((((A (X (((1 <= p7) AND (1 <= p116)))) OR ((p97 <= 0))) OR ((p152 <= 0))) OR ((p34 <= 0))) OR ((p157 <= 0))) OR ((1 <= p18) AND (1 <= p111))))) : E (F (((1 <= p31) AND (1 <= p160))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:551
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:254
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:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F (((1 <= p54) AND (1 <= p122)))))) AND (A (X (((p19 <= 0) OR ((1 <= p32) AND (1 <= p100))))) AND A (X ((((p11 <= 0) OR (p109 <= 0) OR (p37 <= 0) OR (p179 <= 0)) OR E (X (((1 <= p23) AND (1 <= p121)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p19 <= 0) OR ((1 <= p32) AND (1 <= p100)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p19 <= 0) OR ((1 <= p32) AND (1 <= p100))))
lola: processed formula length: 49
lola: 39 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p54) AND (1 <= p122))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p54) AND (1 <= p122))))
lola: processed formula length: 36
lola: 40 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: 106621 markings, 3175697 edges, 21324 markings/sec, 0 secs
lola: 207386 markings, 6284711 edges, 20153 markings/sec, 5 secs
lola: 302204 markings, 9346335 edges, 18964 markings/sec, 10 secs
lola: 390920 markings, 12328501 edges, 17743 markings/sec, 15 secs
lola: 485659 markings, 15350829 edges, 18948 markings/sec, 20 secs
lola: 574923 markings, 18361892 edges, 17853 markings/sec, 25 secs
lola: 668556 markings, 21331668 edges, 18727 markings/sec, 30 secs
lola: 758357 markings, 24290826 edges, 17960 markings/sec, 35 secs
lola: 847249 markings, 27286539 edges, 17778 markings/sec, 40 secs
lola: 933027 markings, 30207025 edges, 17156 markings/sec, 45 secs
lola: 1018861 markings, 33134177 edges, 17167 markings/sec, 50 secs
lola: 1102993 markings, 36072526 edges, 16826 markings/sec, 55 secs
lola: 1186801 markings, 38904293 edges, 16762 markings/sec, 60 secs
lola: 1269386 markings, 41775943 edges, 16517 markings/sec, 65 secs
lola: 1354422 markings, 44716684 edges, 17007 markings/sec, 70 secs
lola: 1438719 markings, 47593486 edges, 16859 markings/sec, 75 secs
lola: 1520599 markings, 50431342 edges, 16376 markings/sec, 80 secs
lola: 1608992 markings, 53389996 edges, 17679 markings/sec, 85 secs
lola: 1692006 markings, 56240743 edges, 16603 markings/sec, 90 secs
lola: 1776160 markings, 59056940 edges, 16831 markings/sec, 95 secs
lola: 1858772 markings, 61955810 edges, 16522 markings/sec, 100 secs
lola: 1941405 markings, 64758720 edges, 16527 markings/sec, 105 secs
lola: 2019506 markings, 67429624 edges, 15620 markings/sec, 110 secs
lola: 2100056 markings, 70249517 edges, 16110 markings/sec, 115 secs
lola: 2180854 markings, 73075863 edges, 16160 markings/sec, 120 secs
lola: 2261117 markings, 75912452 edges, 16053 markings/sec, 125 secs
lola: 2339544 markings, 78711361 edges, 15685 markings/sec, 130 secs
lola: 2421163 markings, 81534131 edges, 16324 markings/sec, 135 secs
lola: 2500597 markings, 84360622 edges, 15887 markings/sec, 140 secs
lola: 2580464 markings, 87253886 edges, 15973 markings/sec, 145 secs
lola: 2659609 markings, 90123804 edges, 15829 markings/sec, 150 secs
lola: 2741592 markings, 92970223 edges, 16397 markings/sec, 155 secs
lola: 2823534 markings, 95783704 edges, 16388 markings/sec, 160 secs
lola: 2907311 markings, 98674325 edges, 16755 markings/sec, 165 secs
lola: 2986611 markings, 101565864 edges, 15860 markings/sec, 170 secs
lola: 3067076 markings, 104410339 edges, 16093 markings/sec, 175 secs
lola: 3149125 markings, 107251032 edges, 16410 markings/sec, 180 secs
lola: 3229210 markings, 110066179 edges, 16017 markings/sec, 185 secs
lola: 3309311 markings, 112918553 edges, 16020 markings/sec, 190 secs
lola: 3388310 markings, 115786776 edges, 15800 markings/sec, 195 secs
lola: 3468220 markings, 118609089 edges, 15982 markings/sec, 200 secs
lola: 3546395 markings, 121410343 edges, 15635 markings/sec, 205 secs
lola: 3623911 markings, 124209673 edges, 15503 markings/sec, 210 secs
lola: 3701784 markings, 126990952 edges, 15575 markings/sec, 215 secs
lola: 3775595 markings, 129753564 edges, 14762 markings/sec, 220 secs
lola: 3852904 markings, 132535098 edges, 15462 markings/sec, 225 secs
lola: 3929518 markings, 135294536 edges, 15323 markings/sec, 230 secs
lola: 4009247 markings, 138113125 edges, 15946 markings/sec, 235 secs
lola: 4086577 markings, 140936285 edges, 15466 markings/sec, 240 secs
lola: 4159240 markings, 143707823 edges, 14533 markings/sec, 245 secs
lola: 4235725 markings, 146508611 edges, 15297 markings/sec, 250 secs
lola: 4317463 markings, 149319075 edges, 16348 markings/sec, 255 secs
lola: 4393379 markings, 152083521 edges, 15183 markings/sec, 260 secs
lola: 4466596 markings, 154823754 edges, 14643 markings/sec, 265 secs
lola: 4543568 markings, 157601550 edges, 15394 markings/sec, 270 secs
lola: 4620500 markings, 160386504 edges, 15386 markings/sec, 275 secs
lola: 4699974 markings, 163172878 edges, 15895 markings/sec, 280 secs
lola: 4775919 markings, 165923461 edges, 15189 markings/sec, 285 secs
lola: 4848667 markings, 168661618 edges, 14550 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2929036 KB
lola: time consumption: 305 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
lola: memory consumption: 2929036 KB
lola: time consumption: 305 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((1 <= p69) AND (1 <= p182) AND (1 <= p36) AND (1 <= p102)))))) OR E (X (A (G (((p51 <= 0) OR (p116 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p69) AND (1 <= p182) AND (1 <= p36) AND (1 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p69) AND (1 <= p182) AND (1 <= p36) AND (1 <= p102))
lola: processed formula length: 59
lola: 41 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: state equation task get result unparse finished++ id 1
lola: 5 markings, 5 edges
lola: ========================================
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((p42 <= 0) OR (p110 <= 0)))))) AND (E (X (((p70 <= 0)))) OR (((1 <= p57) AND (1 <= p193)) OR (((1 <= p9) AND (1 <= p141)) OR ((1 <= p37) AND (1 <= p185) AND ((p56 <= 0) OR (p116 <= 0)) AND ((p53 <= 0) OR (p172 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 48288 KB
lola: time consumption: 632 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 48288 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: 16112664 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16112900 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="DLCround-PT-06a"
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 DLCround-PT-06a, 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 r180-ebro-158987900300500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06a.tgz
mv DLCround-PT-06a 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 '
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 ;