Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477300313.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 ShieldIIPt-PT-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.2K May 14 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 105K May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-020A-00
FORMULA_NAME ShieldIIPt-PT-020A-01
FORMULA_NAME ShieldIIPt-PT-020A-02
FORMULA_NAME ShieldIIPt-PT-020A-03
FORMULA_NAME ShieldIIPt-PT-020A-04
FORMULA_NAME ShieldIIPt-PT-020A-05
FORMULA_NAME ShieldIIPt-PT-020A-06
FORMULA_NAME ShieldIIPt-PT-020A-07
FORMULA_NAME ShieldIIPt-PT-020A-08
FORMULA_NAME ShieldIIPt-PT-020A-09
FORMULA_NAME ShieldIIPt-PT-020A-10
FORMULA_NAME ShieldIIPt-PT-020A-11
FORMULA_NAME ShieldIIPt-PT-020A-12
FORMULA_NAME ShieldIIPt-PT-020A-13
FORMULA_NAME ShieldIIPt-PT-020A-14
FORMULA_NAME ShieldIIPt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1591298883783

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:28:05] [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-04 19:28:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:28:05] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-06-04 19:28:05] [INFO ] Transformed 383 places.
[2020-06-04 19:28:05] [INFO ] Transformed 283 transitions.
[2020-06-04 19:28:05] [INFO ] Found NUPN structural information;
[2020-06-04 19:28:05] [INFO ] Parsed PT model containing 383 places and 283 transitions in 105 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 437 ms. (steps per millisecond=228 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 282 rows 383 cols
[2020-06-04 19:28:06] [INFO ] Computed 181 place invariants in 11 ms
[2020-06-04 19:28:06] [INFO ] [Real]Absence check using 181 positive place invariants in 100 ms returned sat
[2020-06-04 19:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:06] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2020-06-04 19:28:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:06] [INFO ] [Nat]Absence check using 181 positive place invariants in 19 ms returned unsat
[2020-06-04 19:28:06] [INFO ] [Real]Absence check using 181 positive place invariants in 55 ms returned sat
[2020-06-04 19:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:07] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2020-06-04 19:28:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 9 ms returned unsat
[2020-06-04 19:28:07] [INFO ] [Real]Absence check using 181 positive place invariants in 51 ms returned sat
[2020-06-04 19:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:07] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2020-06-04 19:28:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 56 ms returned sat
[2020-06-04 19:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:07] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2020-06-04 19:28:07] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 25 ms.
[2020-06-04 19:28:09] [INFO ] Added : 276 causal constraints over 56 iterations in 1425 ms. Result :sat
[2020-06-04 19:28:09] [INFO ] [Real]Absence check using 181 positive place invariants in 62 ms returned sat
[2020-06-04 19:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:09] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2020-06-04 19:28:09] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 21 ms.
[2020-06-04 19:28:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:09] [INFO ] [Nat]Absence check using 181 positive place invariants in 68 ms returned sat
[2020-06-04 19:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:10] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2020-06-04 19:28:10] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 14 ms.
[2020-06-04 19:28:11] [INFO ] Added : 277 causal constraints over 57 iterations in 1350 ms. Result :sat
[2020-06-04 19:28:11] [INFO ] [Real]Absence check using 181 positive place invariants in 71 ms returned sat
[2020-06-04 19:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:12] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-06-04 19:28:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:12] [INFO ] [Nat]Absence check using 181 positive place invariants in 96 ms returned sat
[2020-06-04 19:28:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:12] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-06-04 19:28:12] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2020-06-04 19:28:14] [INFO ] Added : 278 causal constraints over 57 iterations in 1417 ms. Result :sat
[2020-06-04 19:28:14] [INFO ] [Real]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-06-04 19:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:14] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-06-04 19:28:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:14] [INFO ] [Nat]Absence check using 181 positive place invariants in 57 ms returned sat
[2020-06-04 19:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:15] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2020-06-04 19:28:15] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 21 ms.
[2020-06-04 19:28:16] [INFO ] Added : 280 causal constraints over 59 iterations in 1456 ms. Result :sat
[2020-06-04 19:28:16] [INFO ] [Real]Absence check using 181 positive place invariants in 57 ms returned sat
[2020-06-04 19:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:28:16] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2020-06-04 19:28:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:28:17] [INFO ] [Nat]Absence check using 181 positive place invariants in 15 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-06-04 19:28:17] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 19:28:17] [INFO ] Flatten gal took : 92 ms
FORMULA ShieldIIPt-PT-020A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:28:17] [INFO ] Applying decomposition
[2020-06-04 19:28:17] [INFO ] Flatten gal took : 39 ms
[2020-06-04 19:28:17] [INFO ] Decomposing Gal with order
[2020-06-04 19:28:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 19:28:17] [INFO ] Removed a total of 80 redundant transitions.
[2020-06-04 19:28:17] [INFO ] Flatten gal took : 77 ms
[2020-06-04 19:28:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2020-06-04 19:28:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 19:28:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-020A @ 3570 seconds

FORMULA ShieldIIPt-PT-020A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for LTLCardinality @ ShieldIIPt-PT-020A

{
"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": "Thu Jun 4 19:28:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 2,
"aconj": 7,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X ((X (((1 <= p125))) AND (((p259 <= 0)) OR ((1 <= p374))))) OR (G (((1 <= p125))) OR (G (F ((((1 <= p259)) AND ((p374 <= 0))))) AND F (G (((1 <= p125))))))))",
"processed_size": 163,
"rewrites": 36
},
"result":
{
"edges": 2332,
"markings": 2332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 26
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F (((((1 <= p23)) AND ((p173 <= 0))) AND (F ((((1 <= p23)) AND ((p173 <= 0)))) OR G ((((1 <= p23)) AND ((p173 <= 0)))))))))",
"processed_size": 129,
"rewrites": 36
},
"result":
{
"edges": 3122,
"markings": 3122,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"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 (X (F ((((1 <= p259)) AND ((p71 <= 0))))))",
"processed_size": 44,
"rewrites": 36
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((F ((((p374 <= 0)) OR ((1 <= p42)))) AND (((p134 <= 0)) OR ((1 <= p23))))))",
"processed_size": 83,
"rewrites": 36
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((p342 <= 0)) OR ((1 <= p127)))))",
"processed_size": 41,
"rewrites": 36
},
"result":
{
"edges": 10,
"markings": 9,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "F (G ((((p170 <= 0)) OR ((1 <= p318)))))",
"processed_size": 41,
"rewrites": 36
},
"result":
{
"edges": 16358,
"markings": 15165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((((p168 <= 0)) OR ((1 <= p325))))",
"processed_size": 37,
"rewrites": 36
},
"result":
{
"edges": 788026,
"markings": 787842,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G ((((1 <= p376)) AND ((p346 <= 0)))) R ((p192 <= 0))))",
"processed_size": 59,
"rewrites": 36
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 30848,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X((X(**) AND **)) OR (G(**) OR (G(F(*)) AND F(G(**)))))) : X(X(F((* AND (F(*) OR G(*)))))) : F(G(*)) : G((G(*) R *)) : X(X(F(**))) : F(G(**)) : G(**) : X(X((F(**) AND **)))"
},
"net":
{
"arcs": 1204,
"conflict_clusters": 143,
"places": 383,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 282
},
"result":
{
"preliminary_value": "no no no no yes no no yes ",
"value": "no 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: 665/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12256
lola: finding significant places
lola: 383 places, 282 transitions, 202 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: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p342 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p318 <= 1)
lola: LP says that atomic proposition is always true: (p318 <= 1)
lola: LP says that atomic proposition is always true: (p346 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p325 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: G ((X ((X (((1 <= p125))) AND (((p259 <= 0)) OR ((1 <= p374))))) OR (X (NOT(F (G ((((p259 <= 0)) OR ((1 <= p374))))))) U G (((1 <= p125)))))) : F (NOT(X ((((((p14 <= 0)) OR ((1 <= p342))) U (1 <= 0)) U X ((G ((((p23 <= 0)) OR ((1 <= p173)))) U (((p23 <= 0)) OR ((1 <= p173))))))))) : NOT(G (((((p170 <= 0)) OR ((1 <= p318))) U F ((((1 <= p170)) AND ((p318 <= 0))))))) : G (NOT((F ((((p376 <= 0)) OR ((1 <= p346)))) U ((1 <= p192))))) : X (X (F (((1 <= 0) U (((1 <= p259)) AND ((p71 <= 0))))))) : G ((G (((((p342 <= 0)) OR ((1 <= p127))) U G (((((p342 <= 0)) OR ((1 <= p127))))))) U ((0 <= 0) U G ((((p342 <= 0)) OR ((1 <= p127))))))) : G ((((p168 <= 0)) OR ((1 <= p325)))) : X (X ((F ((((p374 <= 0)) OR ((1 <= p42)))) AND (((p134 <= 0)) OR ((1 <= p23))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:338
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((X (((1 <= p125))) AND (((p259 <= 0)) OR ((1 <= p374))))) OR (G (((1 <= p125))) OR (G (F ((((1 <= p259)) AND ((p374 <= 0))))) AND F (G (((1 <= p125))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((X (((1 <= p125))) AND (((p259 <= 0)) OR ((1 <= p374))))) OR (G (((1 <= p125))) OR (G (F ((((1 <= p259)) AND ((p374 <= 0))))) AND F (G (((1 <= p125))))))))
lola: processed formula length: 163
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 26 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: 2332 markings, 2332 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((((1 <= p23)) AND ((p173 <= 0))) AND (F ((((1 <= p23)) AND ((p173 <= 0)))) OR G ((((1 <= p23)) AND ((p173 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((((1 <= p23)) AND ((p173 <= 0))) AND (F ((((1 <= p23)) AND ((p173 <= 0)))) OR G ((((1 <= p23)) AND ((p173 <= 0)))))))))
lola: processed formula length: 129
lola: 36 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: 3122 markings, 3122 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p259)) AND ((p71 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p259)) AND ((p71 <= 0))))))
lola: processed formula length: 44
lola: 36 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((((p374 <= 0)) OR ((1 <= p42)))) AND (((p134 <= 0)) OR ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((((p374 <= 0)) OR ((1 <= p42)))) AND (((p134 <= 0)) OR ((1 <= p23))))))
lola: processed formula length: 83
lola: 36 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p342 <= 0)) OR ((1 <= p127)))))
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 ((((p342 <= 0)) OR ((1 <= p127)))))
lola: processed formula length: 41
lola: 36 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p170 <= 0)) OR ((1 <= p318)))))
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 ((((p170 <= 0)) OR ((1 <= p318)))))
lola: processed formula length: 41
lola: 36 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: 15165 markings, 16358 edges
lola: ========================================
lola: subprocess 6 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p168 <= 0)) OR ((1 <= p325))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p168 <= 0)) OR ((1 <= p325))))
lola: processed formula length: 37
lola: 36 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: 787842 markings, 788026 edges
lola: ========================================
lola: subprocess 7 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((1 <= p376)) AND ((p346 <= 0)))) R ((p192 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((1 <= p376)) AND ((p346 <= 0)))) R ((p192 <= 0))))
lola: processed formula length: 59
lola: 36 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: 8 markings, 8 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes
lola:
preliminary result: no no no no yes no no yes
lola: memory consumption: 30848 KB
lola: time consumption: 9 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="ShieldIIPt-PT-020A"
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 ShieldIIPt-PT-020A, 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 r211-tajo-159033477300313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020A.tgz
mv ShieldIIPt-PT-020A 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 ;