About the Execution of 2020-gold for PolyORBLF-PT-S06J06T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4298.151 | 3600000.00 | 226094.00 | 154.50 | TFTFTFFTTTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r170-oct2-162089287200169.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 PolyORBLF-PT-S06J06T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287200169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 67K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 284K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 587K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 27 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 27 09:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.5M 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 PolyORBLF-PT-S06J06T04-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-15
=== Now, execution of the tool begins
BK_START 1621383647439
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 00:20:49] [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-19 00:20:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:20:50] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2021-05-19 00:20:50] [INFO ] Transformed 506 places.
[2021-05-19 00:20:50] [INFO ] Transformed 7154 transitions.
[2021-05-19 00:20:50] [INFO ] Parsed PT model containing 506 places and 7154 transitions in 457 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 133 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 458 resets, run finished after 791 ms. (steps per millisecond=126 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1]
[2021-05-19 00:20:51] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2021-05-19 00:20:51] [INFO ] Computed 54 place invariants in 70 ms
[2021-05-19 00:20:51] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned unsat
[2021-05-19 00:20:51] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned unsat
[2021-05-19 00:20:51] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned unsat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive place invariants in 53 ms returned unsat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive place invariants in 124 ms returned sat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 61 ms returned unsat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned sat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 17 ms returned unsat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive place invariants in 103 ms returned sat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 27 ms returned unsat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned unsat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive place invariants in 157 ms returned sat
[2021-05-19 00:20:52] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 84 ms returned unsat
[2021-05-19 00:20:53] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2021-05-19 00:20:53] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned unsat
[2021-05-19 00:20:53] [INFO ] [Real]Absence check using 23 positive place invariants in 26 ms returned sat
[2021-05-19 00:20:53] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 40 ms returned unsat
[2021-05-19 00:20:53] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2021-05-19 00:20:53] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-19 00:20:53] [INFO ] Flatten gal took : 281 ms
FORMULA PolyORBLF-PT-S06J06T04-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:20:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 00:20:53] [INFO ] Flatten gal took : 112 ms
[2021-05-19 00:20:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S06J06T04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:20:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 00:20:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J06T04 @ 3570 seconds
FORMULA PolyORBLF-PT-S06J06T04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J06T04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J06T04-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J06T04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J06T04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3364
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J06T04
{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 00:20:54 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 697
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 697
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((p147 + p281 + p339 + p425 <= p216 + p310 + p388 + p389 + p411 + p485 + p14) U (p176 <= p377 + p386 + p430 + p498))",
"processed_size": 116,
"rewrites": 33
},
"result":
{
"edges": 11552318,
"markings": 5279121,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((p337 <= p40)) AND (F (((p40 + 1 <= p337) AND (p503 <= 0))) OR X ((p337 <= p40))))))",
"processed_size": 94,
"rewrites": 33
},
"result":
{
"edges": 9374,
"markings": 3607,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1121
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (X (G ((p198 + p313 + p410 + p479 + 1 <= p207 + p250 + p408 + p416))))",
"processed_size": 72,
"rewrites": 33
},
"result":
{
"edges": 367,
"markings": 367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 1682
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((p310 <= p51)) OR F (G ((p51 + 1 <= p310)))))",
"processed_size": 52,
"rewrites": 33
},
"result":
{
"edges": 367,
"markings": 367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3364
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G ((p216 + p310 + p388 + p389 + p411 + p485 + p14 + 1 <= p123 + p452 + p465 + p56)))",
"processed_size": 87,
"rewrites": 33
},
"result":
{
"edges": 30,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 41648,
"runtime": 206.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X((* AND (F(**) OR G(*))))) AND (** U **)) : F(G((F(**) AND (F(*) OR X(**))))) : F(G(**)) : X(X(G(*))) : X((G(**) OR F(G(*))))"
},
"net":
{
"arcs": 10564,
"conflict_clusters": 169,
"places": 506,
"places_significant": 452,
"singleton_clusters": 0,
"transitions": 1774
},
"result":
{
"preliminary_value": "no no no no no ",
"value": "no no no no no "
},
"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: 2280/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16192
lola: finding significant places
lola: 506 places, 1774 transitions, 452 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: (X (NOT(X ((NOT(F ((p365 <= p349 + p417 + p504 + p51))) U (p377 + p386 + p430 + p498 + 1 <= p176))))) AND ((p147 + p281 + p339 + p425 <= p216 + p310 + p388 + p389 + p411 + p485 + p14) U (p176 <= p377 + p386 + p430 + p498))) : F ((X (F ((1 <= p134))) U G ((F (NOT(G (((p337 <= p40) OR (1 <= p503))))) U X ((p337 <= p40)))))) : F (G (X ((p216 + p310 + p388 + p389 + p411 + p485 + p14 + 1 <= p123 + p452 + p465 + p56)))) : NOT(X (F (X ((p207 + p250 + p408 + p416 <= p198 + p313 + p410 + p479))))) : X ((G ((p310 <= p51)) OR F (X (G (F (NOT(F ((p310 <= p51)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((p176 <= p377 + p386 + p430 + p498) AND (F ((p365 <= p349 + p417 + p504 + p51)) OR G ((p176 <= p377 + p386 + p430 + p498)))))) AND ((p147 + p281 + p339 + p425 <= p216 + p310 + p388 + p389 + p411 + p485 + p14) U (p176 <= p377 + p386 + p430 + p498)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p147 + p281 + p339 + p425 <= p216 + p310 + p388 + p389 + p411 + p485 + p14) U (p176 <= p377 + p386 + p430 + p498))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p147 + p281 + p339 + p425 <= p216 + p310 + p388 + p389 + p411 + p485 + p14) U (p176 <= p377 + p386 + p430 + p498))
lola: processed formula length: 116
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 203097 markings, 372848 edges, 40619 markings/sec, 0 secs
lola: 428685 markings, 850771 edges, 45118 markings/sec, 5 secs
lola: 653763 markings, 1331938 edges, 45016 markings/sec, 10 secs
lola: 871632 markings, 1807041 edges, 43574 markings/sec, 15 secs
lola: 1080771 markings, 2257340 edges, 41828 markings/sec, 20 secs
lola: 1300542 markings, 2722903 edges, 43954 markings/sec, 25 secs
lola: 1509094 markings, 3184687 edges, 41710 markings/sec, 30 secs
lola: 1733582 markings, 3664452 edges, 44898 markings/sec, 35 secs
lola: 1954366 markings, 4140689 edges, 44157 markings/sec, 40 secs
lola: 2167658 markings, 4612044 edges, 42658 markings/sec, 45 secs
lola: 2392915 markings, 5097027 edges, 45051 markings/sec, 50 secs
lola: 2601844 markings, 5560934 edges, 41786 markings/sec, 55 secs
lola: 2820796 markings, 6032644 edges, 43790 markings/sec, 60 secs
lola: 3032030 markings, 6502002 edges, 42247 markings/sec, 65 secs
lola: 3237296 markings, 6955749 edges, 41053 markings/sec, 70 secs
lola: 3460970 markings, 7430035 edges, 44735 markings/sec, 75 secs
lola: 3670017 markings, 7891217 edges, 41809 markings/sec, 80 secs
lola: 3888148 markings, 8364846 edges, 43626 markings/sec, 85 secs
lola: 4106268 markings, 8845430 edges, 43624 markings/sec, 90 secs
lola: 4319177 markings, 9321488 edges, 42582 markings/sec, 95 secs
lola: 4532500 markings, 9794738 edges, 42665 markings/sec, 100 secs
lola: 4737681 markings, 10257401 edges, 41036 markings/sec, 105 secs
lola: 4936741 markings, 10702929 edges, 39812 markings/sec, 110 secs
lola: 5128874 markings, 11150192 edges, 38427 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5279121 markings, 11552318 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p337 <= p40)) AND (F (((p40 + 1 <= p337) AND (p503 <= 0))) OR X ((p337 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p337 <= p40)) AND (F (((p40 + 1 <= p337) AND (p503 <= 0))) OR X ((p337 <= p40))))))
lola: processed formula length: 94
lola: 33 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: 3607 markings, 9374 edges
lola: ========================================
lola: subprocess 2 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p198 + p313 + p410 + p479 + 1 <= p207 + p250 + p408 + p416))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p198 + p313 + p410 + p479 + 1 <= p207 + p250 + p408 + p416))))
lola: processed formula length: 72
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 3 will run for 1682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p310 <= p51)) OR F (G ((p51 + 1 <= p310)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p310 <= p51)) OR F (G ((p51 + 1 <= p310)))))
lola: processed formula length: 52
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 4 will run for 3364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p216 + p310 + p388 + p389 + p411 + p485 + p14 + 1 <= p123 + p452 + p465 + p56)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p216 + p310 + p388 + p389 + p411 + p485 + p14 + 1 <= p123 + p452 + p465 + p56)))
lola: processed formula length: 87
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 30 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no
lola:
preliminary result: no no no no no
lola: memory consumption: 41648 KB
lola: time consumption: 206 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J06T04"
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 PolyORBLF-PT-S06J06T04, 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 r170-oct2-162089287200169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 '
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 ;