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.r178-tajo-158987881800033.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 DLCshifumi-PT-4a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881800033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 3.4K Mar 30 23:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 23:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 27 02:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 27 02:24 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 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 DLCshifumi-PT-4a-00
FORMULA_NAME DLCshifumi-PT-4a-01
FORMULA_NAME DLCshifumi-PT-4a-02
FORMULA_NAME DLCshifumi-PT-4a-03
FORMULA_NAME DLCshifumi-PT-4a-04
FORMULA_NAME DLCshifumi-PT-4a-05
FORMULA_NAME DLCshifumi-PT-4a-06
FORMULA_NAME DLCshifumi-PT-4a-07
FORMULA_NAME DLCshifumi-PT-4a-08
FORMULA_NAME DLCshifumi-PT-4a-09
FORMULA_NAME DLCshifumi-PT-4a-10
FORMULA_NAME DLCshifumi-PT-4a-11
FORMULA_NAME DLCshifumi-PT-4a-12
FORMULA_NAME DLCshifumi-PT-4a-13
FORMULA_NAME DLCshifumi-PT-4a-14
FORMULA_NAME DLCshifumi-PT-4a-15

=== Now, execution of the tool begins

BK_START 1591199227913

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:47:09] [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]
[2020-06-03 15:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:47:09] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2020-06-03 15:47:09] [INFO ] Transformed 1178 places.
[2020-06-03 15:47:09] [INFO ] Transformed 7504 transitions.
[2020-06-03 15:47:09] [INFO ] Found NUPN structural information;
[2020-06-03 15:47:09] [INFO ] Parsed PT model containing 1178 places and 7504 transitions in 313 ms.
Ensure Unique test removed 924 transitions
Reduce redundant transitions removed 924 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2213 ms. (steps per millisecond=45 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 15:47:12] [INFO ] Flow matrix only has 816 transitions (discarded 5764 similar events)
// Phase 1: matrix 816 rows 1178 cols
[2020-06-03 15:47:12] [INFO ] Computed 691 place invariants in 31 ms
[2020-06-03 15:47:13] [INFO ] [Real]Absence check using 691 positive place invariants in 614 ms returned sat
[2020-06-03 15:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:16] [INFO ] [Real]Absence check using state equation in 3082 ms returned sat
[2020-06-03 15:47:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:16] [INFO ] [Nat]Absence check using 691 positive place invariants in 68 ms returned unsat
[2020-06-03 15:47:17] [INFO ] [Real]Absence check using 691 positive place invariants in 444 ms returned sat
[2020-06-03 15:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:20] [INFO ] [Real]Absence check using state equation in 2786 ms returned sat
[2020-06-03 15:47:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:20] [INFO ] [Nat]Absence check using 691 positive place invariants in 212 ms returned unsat
[2020-06-03 15:47:21] [INFO ] [Real]Absence check using 691 positive place invariants in 431 ms returned sat
[2020-06-03 15:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:23] [INFO ] [Real]Absence check using state equation in 2648 ms returned sat
[2020-06-03 15:47:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:24] [INFO ] [Nat]Absence check using 691 positive place invariants in 227 ms returned unsat
[2020-06-03 15:47:24] [INFO ] [Real]Absence check using 691 positive place invariants in 483 ms returned sat
[2020-06-03 15:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:27] [INFO ] [Real]Absence check using state equation in 2904 ms returned sat
[2020-06-03 15:47:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:28] [INFO ] [Nat]Absence check using 691 positive place invariants in 438 ms returned unsat
[2020-06-03 15:47:29] [INFO ] [Real]Absence check using 691 positive place invariants in 426 ms returned sat
[2020-06-03 15:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:32] [INFO ] [Real]Absence check using state equation in 3221 ms returned sat
[2020-06-03 15:47:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:32] [INFO ] [Nat]Absence check using 691 positive place invariants in 245 ms returned unsat
[2020-06-03 15:47:33] [INFO ] [Real]Absence check using 691 positive place invariants in 474 ms returned sat
[2020-06-03 15:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:36] [INFO ] [Real]Absence check using state equation in 3409 ms returned sat
[2020-06-03 15:47:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:37] [INFO ] [Nat]Absence check using 691 positive place invariants in 31 ms returned unsat
[2020-06-03 15:47:37] [INFO ] [Real]Absence check using 691 positive place invariants in 538 ms returned sat
[2020-06-03 15:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:40] [INFO ] [Real]Absence check using state equation in 2973 ms returned sat
[2020-06-03 15:47:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:41] [INFO ] [Nat]Absence check using 691 positive place invariants in 29 ms returned unsat
[2020-06-03 15:47:41] [INFO ] [Real]Absence check using 691 positive place invariants in 433 ms returned sat
[2020-06-03 15:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:44] [INFO ] [Real]Absence check using state equation in 2883 ms returned sat
[2020-06-03 15:47:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:45] [INFO ] [Nat]Absence check using 691 positive place invariants in 196 ms returned unsat
[2020-06-03 15:47:46] [INFO ] [Real]Absence check using 691 positive place invariants in 554 ms returned sat
[2020-06-03 15:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:48] [INFO ] [Real]Absence check using state equation in 2778 ms returned sat
[2020-06-03 15:47:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:49] [INFO ] [Nat]Absence check using 691 positive place invariants in 366 ms returned unsat
[2020-06-03 15:47:50] [INFO ] [Real]Absence check using 691 positive place invariants in 432 ms returned sat
[2020-06-03 15:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:47:52] [INFO ] [Real]Absence check using state equation in 2531 ms returned sat
[2020-06-03 15:47:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:47:52] [INFO ] [Nat]Absence check using 691 positive place invariants in 29 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2020-06-03 15:47:53] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 15:47:53] [INFO ] Flatten gal took : 495 ms
FORMULA DLCshifumi-PT-4a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:47:53] [INFO ] Applying decomposition
[2020-06-03 15:47:53] [INFO ] Flatten gal took : 226 ms
[2020-06-03 15:47:54] [INFO ] Decomposing Gal with order
[2020-06-03 15:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 15:47:55] [INFO ] Removed a total of 10578 redundant transitions.
[2020-06-03 15:47:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 15:47:55] [INFO ] Flatten gal took : 628 ms
[2020-06-03 15:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 423 labels/synchronizations in 323 ms.
[2020-06-03 15:47:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DLCshifumi-PT-4a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:47:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 15:47:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 69 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCshifumi-PT-4a @ 3570 seconds

FORMULA DLCshifumi-PT-4a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-4a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-4a-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-4a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-4a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-4a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-4a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3554
rslt: Output for LTLCardinality @ DLCshifumi-PT-4a

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p574 <= 0)) OR ((1 <= p466)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 710
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((p460 <= 0))))",
"processed_size": 21,
"rewrites": 26
},
"result":
{
"edges": 29115,
"markings": 752,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((((1 <= p376)) AND ((p540 <= 0)))))",
"processed_size": 41,
"rewrites": 26
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"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": 1777
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (F ((X (((1 <= p668))) OR F (((1 <= p888)))))) OR G (((p888 <= 0)))))",
"processed_size": 75,
"rewrites": 26
},
"result":
{
"edges": 3341,
"markings": 470,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"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": 3554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 2,
"comp": 4,
"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": "G ((G ((((p322 <= 0)) OR ((1 <= p260)))) OR (((1 <= p322)) AND ((p260 <= 0)))))",
"processed_size": 80,
"rewrites": 26
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 102640,
"runtime": 16.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G(*) OR *)) : F((F(G(*)) AND X(**))) : X(G(**)) : (X((** OR **)) AND **) : X(G(**)) : X(X(*)) : X((X(F((X(**) OR F(**)))) OR G(**)))"
},
"net":
{
"arcs": 25538,
"conflict_clusters": 231,
"places": 1178,
"places_significant": 487,
"singleton_clusters": 0,
"transitions": 6580
},
"result":
{
"preliminary_value": "no no no yes no no yes ",
"value": "no no no yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 7758/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1178
lola: finding significant places
lola: 1178 places, 6580 transitions, 487 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p483 <= 1)
lola: LP says that atomic proposition is always true: (p718 <= 1)
lola: LP says that atomic proposition is always true: (p409 <= 1)
lola: LP says that atomic proposition is always true: (p466 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p460 <= 1)
lola: LP says that atomic proposition is always true: (p540 <= 1)
lola: LP says that atomic proposition is always true: (p668 <= 1)
lola: LP says that atomic proposition is always true: (p888 <= 1)
lola: LP says that atomic proposition is always true: (p888 <= 1)
lola: NOT(F ((F ((((1 <= p322)) AND ((p260 <= 0)))) AND (((p322 <= 0)) OR ((1 <= p260)))))) : F ((G (NOT(G (F (((1 <= p718) AND (((p143 <= 0)) OR ((1 <= p483)))))))) AND X ((((p1046 <= 0)) OR ((1 <= p409)))))) : G (X ((((p574 <= 0)) OR ((1 <= p466))))) : (X (((F ((G ((((p579 <= 0)) OR ((1 <= p308)))) U (1 <= 0))) OR ((p579 <= 0))) OR ((1 <= p308)))) AND (((p579 <= 0)) OR ((1 <= p308)))) : G (X (((p460 <= 0)))) : X ((((0 <= 0) U (1 <= 0)) U NOT(X ((((p376 <= 0)) OR ((1 <= p540))))))) : X ((F (X ((X (((1 <= p668))) OR F (((1 <= p888)))))) OR G (((p888 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((p718 <= 0) OR (((1 <= p143)) AND ((p483 <= 0)))))) AND X ((((p1046 <= 0)) OR ((1 <= p409))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((p718 <= 0) OR (((1 <= p143)) AND ((p483 <= 0)))))) AND X ((((p1046 <= 0)) OR ((1 <= p409))))))
lola: processed formula length: 108
lola: 26 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p574 <= 0)) OR ((1 <= p466)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p574 <= 0)) OR ((1 <= p466)))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p579 <= 0)) OR ((1 <= p308)))) AND (((p579 <= 0)) OR ((1 <= p308))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p579 <= 0)) OR ((1 <= p308)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p579 <= 0)) OR ((1 <= p308)))
lola: processed formula length: 33
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p579 <= 0)) OR ((1 <= p308))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p579 <= 0)) OR ((1 <= p308))))
lola: processed formula length: 36
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p460 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p460 <= 0))))
lola: processed formula length: 21
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 752 markings, 29115 edges
lola: ========================================
lola: subprocess 4 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p376)) AND ((p540 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p376)) AND ((p540 <= 0)))))
lola: processed formula length: 41
lola: 26 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((X (((1 <= p668))) OR F (((1 <= p888)))))) OR G (((p888 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((X (((1 <= p668))) OR F (((1 <= p888)))))) OR G (((p888 <= 0)))))
lola: processed formula length: 75
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 470 markings, 3341 edges
lola: ========================================
lola: subprocess 6 will run for 3554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p322 <= 0)) OR ((1 <= p260)))) OR (((1 <= p322)) AND ((p260 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p322 <= 0)) OR ((1 <= p260)))) OR (((1 <= p322)) AND ((p260 <= 0)))))
lola: processed formula length: 80
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes
lola:
preliminary result: no no no yes no no yes
lola: memory consumption: 102640 KB
lola: time consumption: 16 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="DLCshifumi-PT-4a"
export BK_EXAMINATION="LTLCardinality"
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 DLCshifumi-PT-4a, 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 r178-tajo-158987881800033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-4a.tgz
mv DLCshifumi-PT-4a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;