Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231300401.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ShieldPPPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231300401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 201K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621180468945

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 15:54:30] [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-16 15:54:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:54:30] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-16 15:54:30] [INFO ] Transformed 753 places.
[2021-05-16 15:54:30] [INFO ] Transformed 543 transitions.
[2021-05-16 15:54:30] [INFO ] Found NUPN structural information;
[2021-05-16 15:54:30] [INFO ] Parsed PT model containing 753 places and 543 transitions in 147 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 784 ms. (steps per millisecond=127 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 542 rows 753 cols
[2021-05-16 15:54:31] [INFO ] Computed 331 place invariants in 15 ms
[2021-05-16 15:54:31] [INFO ] [Real]Absence check using 331 positive place invariants in 156 ms returned sat
[2021-05-16 15:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:32] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2021-05-16 15:54:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:32] [INFO ] [Nat]Absence check using 331 positive place invariants in 27 ms returned unsat
[2021-05-16 15:54:33] [INFO ] [Real]Absence check using 331 positive place invariants in 145 ms returned sat
[2021-05-16 15:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:34] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2021-05-16 15:54:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:34] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2021-05-16 15:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:35] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2021-05-16 15:54:35] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 34 ms.
[2021-05-16 15:54:40] [INFO ] Added : 532 causal constraints over 108 iterations in 5519 ms. Result :sat
[2021-05-16 15:54:41] [INFO ] [Real]Absence check using 331 positive place invariants in 149 ms returned sat
[2021-05-16 15:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:42] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2021-05-16 15:54:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:42] [INFO ] [Nat]Absence check using 331 positive place invariants in 141 ms returned sat
[2021-05-16 15:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:43] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2021-05-16 15:54:43] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 30 ms.
[2021-05-16 15:54:48] [INFO ] Added : 522 causal constraints over 105 iterations in 4819 ms. Result :sat
[2021-05-16 15:54:48] [INFO ] [Real]Absence check using 331 positive place invariants in 146 ms returned sat
[2021-05-16 15:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:49] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2021-05-16 15:54:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:49] [INFO ] [Nat]Absence check using 331 positive place invariants in 17 ms returned unsat
[2021-05-16 15:54:49] [INFO ] [Real]Absence check using 331 positive place invariants in 147 ms returned sat
[2021-05-16 15:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:50] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2021-05-16 15:54:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:50] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2021-05-16 15:54:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:51] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2021-05-16 15:54:51] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 30 ms.
[2021-05-16 15:54:56] [INFO ] Added : 532 causal constraints over 108 iterations in 4514 ms. Result :sat
[2021-05-16 15:54:56] [INFO ] [Real]Absence check using 331 positive place invariants in 148 ms returned sat
[2021-05-16 15:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:57] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2021-05-16 15:54:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:54:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 141 ms returned sat
[2021-05-16 15:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:54:58] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2021-05-16 15:54:58] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 28 ms.
[2021-05-16 15:55:03] [INFO ] Added : 529 causal constraints over 108 iterations in 5147 ms. Result :sat
[2021-05-16 15:55:04] [INFO ] [Real]Absence check using 331 positive place invariants in 145 ms returned sat
[2021-05-16 15:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:55:05] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2021-05-16 15:55:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:55:05] [INFO ] [Nat]Absence check using 331 positive place invariants in 141 ms returned sat
[2021-05-16 15:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:55:06] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2021-05-16 15:55:06] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 33 ms.
[2021-05-16 15:55:12] [INFO ] Added : 529 causal constraints over 106 iterations in 5736 ms. Result :sat
[2021-05-16 15:55:12] [INFO ] [Real]Absence check using 331 positive place invariants in 151 ms returned sat
[2021-05-16 15:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:55:13] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2021-05-16 15:55:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:55:13] [INFO ] [Nat]Absence check using 331 positive place invariants in 17 ms returned unsat
[2021-05-16 15:55:13] [INFO ] [Real]Absence check using 331 positive place invariants in 150 ms returned sat
[2021-05-16 15:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:55:14] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2021-05-16 15:55:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:55:14] [INFO ] [Nat]Absence check using 331 positive place invariants in 17 ms returned unsat
[2021-05-16 15:55:14] [INFO ] [Real]Absence check using 331 positive place invariants in 145 ms returned sat
[2021-05-16 15:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:55:15] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2021-05-16 15:55:15] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 26 ms.
[2021-05-16 15:55:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:55:16] [INFO ] [Nat]Absence check using 331 positive place invariants in 144 ms returned sat
[2021-05-16 15:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:55:17] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2021-05-16 15:55:17] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints in 38 ms.
[2021-05-16 15:55:22] [INFO ] Added : 519 causal constraints over 104 iterations in 5135 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2021-05-16 15:55:22] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-16 15:55:22] [INFO ] Flatten gal took : 156 ms
FORMULA ShieldPPPt-PT-030A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:55:22] [INFO ] Applying decomposition
[2021-05-16 15:55:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 15:55:22] [INFO ] Flatten gal took : 58 ms
[2021-05-16 15:55:22] [INFO ] Decomposing Gal with order
[2021-05-16 15:55:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:55:23] [INFO ] Removed a total of 180 redundant transitions.
[2021-05-16 15:55:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 15:55:23] [INFO ] Flatten gal took : 101 ms
[2021-05-16 15:55:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2021-05-16 15:55:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-030A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:55:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 15:55:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-030A @ 3570 seconds

FORMULA ShieldPPPt-PT-030A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for LTLCardinality @ ShieldPPPt-PT-030A

{
"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": "Sun May 16 15:55:24 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 5,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((X (X (X (F ((((p542 <= 0)) OR ((1 <= p175))))))) AND F (G (((p592 <= 0))))))))",
"processed_size": 89,
"rewrites": 56
},
"result":
{
"edges": 501,
"markings": 499,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 594
},
"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 ((((p532 <= 0)) OR ((1 <= p669)))))",
"processed_size": 41,
"rewrites": 56
},
"result":
{
"edges": 1693536,
"markings": 632878,
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((((1 <= p651)) AND ((p616 <= 0))) OR (((1 <= p45)) AND ((p110 <= 0))))))",
"processed_size": 80,
"rewrites": 56
},
"result":
{
"edges": 489,
"markings": 489,
"produced_by": "LTL model checker",
"value": false
},
"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": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((p555 <= 0)) OR ((1 <= p2)))))",
"processed_size": 39,
"rewrites": 56
},
"result":
{
"edges": 489,
"markings": 489,
"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": 1185
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1185
},
"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": "G (F ((((p469 <= 0)) OR ((1 <= p661)))))",
"processed_size": 41,
"rewrites": 56
},
"result":
{
"edges": 163,
"markings": 155,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(((1 <= p469)) AND ((p661 <= 0)))",
"processed_size": 33,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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 (((1 <= p446)))",
"processed_size": 17,
"rewrites": 56
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"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 ((((p253 <= 0)) OR ((1 <= p516)))))",
"processed_size": 41,
"rewrites": 56
},
"result":
{
"edges": 10,
"markings": 9,
"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": 3557
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "G (((1 <= p644)))",
"processed_size": 17,
"rewrites": 56
},
"result":
{
"edges": 8,
"markings": 8,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"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": "(((p704 <= 0)) OR ((1 <= p665)))",
"processed_size": 33,
"rewrites": 58
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 29276,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G((X(X(X(F(**)))) AND F(G(*)))))) : (F(*) AND (F(**) OR G(**))) : X(G(**)) : F(G(**)) : X(G(*)) : X(G(*)) : (F(**) AND (G(F(**)) OR X(**)))"
},
"net":
{
"arcs": 2164,
"conflict_clusters": 333,
"places": 753,
"places_significant": 422,
"singleton_clusters": 0,
"transitions": 542
},
"result":
{
"preliminary_value": "no no no no no no yes ",
"value": "no no no no 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: 1295/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 753
lola: finding significant places
lola: 753 places, 542 transitions, 422 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: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p592 <= 1)
lola: LP says that atomic proposition is always true: (p665 <= 1)
lola: LP says that atomic proposition is always true: (p610 <= 1)
lola: LP says that atomic proposition is always true: (p610 <= 1)
lola: LP says that atomic proposition is always true: (p644 <= 1)
lola: LP says that atomic proposition is always true: (p669 <= 1)
lola: LP says that atomic proposition is always true: (p516 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p616 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p661 <= 1)
lola: LP says that atomic proposition is always true: (p661 <= 1)
lola: LP says that atomic proposition is always true: (p446 <= 1)
lola: X (G (X ((NOT(X (X (X (NOT(F ((((p542 <= 0)) OR ((1 <= p175))))))))) AND NOT(G (X (F (((1 <= p592)))))))))) : (NOT(G ((((p704 <= 0)) OR ((1 <= p665))))) AND (F (((((p254 <= 0)) OR ((1 <= p610))) U F ((((p254 <= 0)) OR ((1 <= p610)))))) OR NOT(F (NOT(G (((1 <= p644)))))))) : X (G ((((p532 <= 0)) OR ((1 <= p669))))) : F (X (G (NOT(F (NOT(X (X ((((p253 <= 0)) OR ((1 <= p516))))))))))) : NOT(F (((0 <= 0) U X (((((p45 <= 0)) OR ((1 <= p110))) U ((((p651 <= 0)) OR ((1 <= p616))) AND (((p45 <= 0)) OR ((1 <= p110))))))))) : G (NOT(X ((((1 <= p555)) AND ((p2 <= 0)))))) : (F ((((p469 <= 0)) OR ((1 <= p661)))) AND (X (G (F (X ((((p469 <= 0)) OR ((1 <= p661))))))) OR X (((1 <= p446)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (X (X (F ((((p542 <= 0)) OR ((1 <= p175))))))) AND F (G (((p592 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (X (X (F ((((p542 <= 0)) OR ((1 <= p175))))))) AND F (G (((p592 <= 0))))))))
lola: processed formula length: 89
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 499 markings, 501 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p532 <= 0)) OR ((1 <= p669)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p532 <= 0)) OR ((1 <= p669)))))
lola: processed formula length: 41
lola: 56 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: 422043 markings, 1095625 edges, 84409 markings/sec, 0 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: 632878 markings, 1693536 edges
lola: ========================================
lola: subprocess 2 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((1 <= p651)) AND ((p616 <= 0))) OR (((1 <= p45)) AND ((p110 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((1 <= p651)) AND ((p616 <= 0))) OR (((1 <= p45)) AND ((p110 <= 0))))))
lola: processed formula length: 80
lola: 56 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: 489 markings, 489 edges
lola: ========================================
lola: subprocess 3 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p555 <= 0)) OR ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p555 <= 0)) OR ((1 <= p2)))))
lola: processed formula length: 39
lola: 56 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: 489 markings, 489 edges
lola: ========================================
lola: subprocess 4 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p469 <= 0)) OR ((1 <= p661)))) AND (G (F ((((p469 <= 0)) OR ((1 <= p661))))) OR X (((1 <= p446)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p469 <= 0)) OR ((1 <= p661)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p469 <= 0)) OR ((1 <= p661)))))
lola: processed formula length: 41
lola: 56 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: 155 markings, 163 edges
lola: ========================================
lola: subprocess 5 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p469 <= 0)) OR ((1 <= p661))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p469)) AND ((p661 <= 0)))
lola: processed formula length: 33
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p446)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p446)))
lola: processed formula length: 17
lola: 56 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 5 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p253 <= 0)) OR ((1 <= p516)))))
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 ((((p253 <= 0)) OR ((1 <= p516)))))
lola: processed formula length: 41
lola: 56 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 6 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p704)) AND ((p665 <= 0)))) AND (F ((((p254 <= 0)) OR ((1 <= p610)))) OR G (((1 <= p644)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p644)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p644)))
lola: processed formula length: 17
lola: 56 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: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p704)) AND ((p665 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p704 <= 0)) OR ((1 <= p665)))
lola: processed formula length: 33
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes
lola:
preliminary result: no no no no no no yes
lola: memory consumption: 29276 KB
lola: time consumption: 13 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="ShieldPPPt-PT-030A"
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 ShieldPPPt-PT-030A, 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 r227-tall-162098231300401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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