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.r246-smll-162106594400161.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldRVt-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.1K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 19:16 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 136K 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 ShieldRVt-PT-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1621329600315

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 09:20:02] [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-18 09:20:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:20:03] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2021-05-18 09:20:03] [INFO ] Transformed 403 places.
[2021-05-18 09:20:03] [INFO ] Transformed 403 transitions.
[2021-05-18 09:20:03] [INFO ] Found NUPN structural information;
[2021-05-18 09:20:03] [INFO ] Parsed PT model containing 403 places and 403 transitions in 204 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 728 ms. (steps per millisecond=137 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 402 rows 403 cols
[2021-05-18 09:20:03] [INFO ] Computed 201 place invariants in 18 ms
[2021-05-18 09:20:04] [INFO ] [Real]Absence check using 201 positive place invariants in 132 ms returned sat
[2021-05-18 09:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:04] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2021-05-18 09:20:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:05] [INFO ] [Nat]Absence check using 201 positive place invariants in 117 ms returned sat
[2021-05-18 09:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:05] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-18 09:20:05] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 53 ms.
[2021-05-18 09:20:09] [INFO ] Added : 396 causal constraints over 80 iterations in 3816 ms. Result :sat
[2021-05-18 09:20:09] [INFO ] [Real]Absence check using 201 positive place invariants in 121 ms returned sat
[2021-05-18 09:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:10] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2021-05-18 09:20:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 16 ms returned unsat
[2021-05-18 09:20:10] [INFO ] [Real]Absence check using 201 positive place invariants in 93 ms returned sat
[2021-05-18 09:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:11] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2021-05-18 09:20:11] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 37 ms.
[2021-05-18 09:20:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:12] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2021-05-18 09:20:12] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 39 ms.
[2021-05-18 09:20:15] [INFO ] Added : 392 causal constraints over 79 iterations in 3855 ms. Result :sat
[2021-05-18 09:20:16] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:16] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2021-05-18 09:20:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 100 ms returned sat
[2021-05-18 09:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:17] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2021-05-18 09:20:17] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2021-05-18 09:20:20] [INFO ] Added : 396 causal constraints over 80 iterations in 3465 ms. Result :sat
[2021-05-18 09:20:21] [INFO ] [Real]Absence check using 201 positive place invariants in 102 ms returned sat
[2021-05-18 09:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:21] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2021-05-18 09:20:21] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:20:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 100 ms returned sat
[2021-05-18 09:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:22] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-18 09:20:22] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2021-05-18 09:20:26] [INFO ] Added : 400 causal constraints over 81 iterations in 3772 ms. Result :sat
[2021-05-18 09:20:26] [INFO ] [Real]Absence check using 201 positive place invariants in 103 ms returned sat
[2021-05-18 09:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:27] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2021-05-18 09:20:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:20:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:27] [INFO ] [Nat]Absence check using 201 positive place invariants in 109 ms returned sat
[2021-05-18 09:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:27] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2021-05-18 09:20:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 34 ms.
[2021-05-18 09:20:33] [INFO ] Added : 399 causal constraints over 81 iterations in 5564 ms. Result :sat
[2021-05-18 09:20:33] [INFO ] [Real]Absence check using 201 positive place invariants in 101 ms returned sat
[2021-05-18 09:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:34] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2021-05-18 09:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:34] [INFO ] [Nat]Absence check using 201 positive place invariants in 15 ms returned unsat
[2021-05-18 09:20:34] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:34] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2021-05-18 09:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:35] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2021-05-18 09:20:35] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 34 ms.
[2021-05-18 09:20:40] [INFO ] Added : 396 causal constraints over 81 iterations in 4463 ms. Result :sat
[2021-05-18 09:20:40] [INFO ] [Real]Absence check using 201 positive place invariants in 103 ms returned sat
[2021-05-18 09:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:40] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2021-05-18 09:20:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:41] [INFO ] [Nat]Absence check using 201 positive place invariants in 15 ms returned unsat
[2021-05-18 09:20:41] [INFO ] [Real]Absence check using 201 positive place invariants in 94 ms returned sat
[2021-05-18 09:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:41] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2021-05-18 09:20:42] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2021-05-18 09:20:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 162 ms returned sat
[2021-05-18 09:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:43] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2021-05-18 09:20:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 48 ms.
[2021-05-18 09:20:49] [INFO ] Added : 392 causal constraints over 80 iterations in 6077 ms. Result :sat
[2021-05-18 09:20:49] [INFO ] [Real]Absence check using 201 positive place invariants in 155 ms returned sat
[2021-05-18 09:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:50] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2021-05-18 09:20:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 46 ms.
[2021-05-18 09:20:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 157 ms returned sat
[2021-05-18 09:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:51] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2021-05-18 09:20:51] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 40 ms.
[2021-05-18 09:20:57] [INFO ] Added : 396 causal constraints over 80 iterations in 5356 ms. Result :sat
[2021-05-18 09:20:57] [INFO ] [Real]Absence check using 201 positive place invariants in 197 ms returned sat
[2021-05-18 09:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:58] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2021-05-18 09:20:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:20:58] [INFO ] [Nat]Absence check using 201 positive place invariants in 92 ms returned sat
[2021-05-18 09:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:20:58] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2021-05-18 09:20:58] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:21:05] [INFO ] Added : 397 causal constraints over 81 iterations in 6790 ms. Result :sat
[2021-05-18 09:21:05] [INFO ] [Real]Absence check using 201 positive place invariants in 110 ms returned sat
[2021-05-18 09:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:21:06] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-18 09:21:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:21:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 154 ms returned sat
[2021-05-18 09:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:21:07] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2021-05-18 09:21:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2021-05-18 09:21:13] [INFO ] Added : 397 causal constraints over 80 iterations in 6159 ms. Result :sat
[2021-05-18 09:21:13] [INFO ] [Real]Absence check using 201 positive place invariants in 98 ms returned sat
[2021-05-18 09:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:21:14] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2021-05-18 09:21:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:21:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 95 ms returned sat
[2021-05-18 09:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:21:15] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2021-05-18 09:21:15] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 31 ms.
[2021-05-18 09:21:18] [INFO ] Added : 399 causal constraints over 80 iterations in 3814 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-18 09:21:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-18 09:21:19] [INFO ] Flatten gal took : 165 ms
FORMULA ShieldRVt-PT-050A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 09:21:19] [INFO ] Applying decomposition
[2021-05-18 09:21:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 09:21:19] [INFO ] Flatten gal took : 60 ms
[2021-05-18 09:21:19] [INFO ] Decomposing Gal with order
[2021-05-18 09:21:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:21:19] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-18 09:21:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 09:21:20] [INFO ] Flatten gal took : 312 ms
[2021-05-18 09:21:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 41 ms.
[2021-05-18 09:21:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-050A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 09:21:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2021-05-18 09:21:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-050A @ 3570 seconds

FORMULA ShieldRVt-PT-050A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-050A-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3153
rslt: Output for LTLCardinality @ ShieldRVt-PT-050A

{
"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": "Tue May 18 09:21:21 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(((1 <= p370)) AND ((p109 <= 0)))",
"processed_size": 33,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 1,
"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": "((((1 <= p370)) AND ((p109 <= 0))) AND ((1 <= p198)) AND ((p51 <= 0)))",
"processed_size": 70,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p370)) AND ((p109 <= 0)))))",
"processed_size": 41,
"rewrites": 63
},
"result":
{
"edges": 314,
"markings": 314,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 ((((p7 <= 0)) OR ((1 <= p2))))",
"processed_size": 33,
"rewrites": 63
},
"result":
{
"edges": 225,
"markings": 159,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"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": "((((p170 <= 0)) OR ((1 <= p37))) U X (F ((((1 <= p49)) AND ((p247 <= 0))))))",
"processed_size": 77,
"rewrites": 63
},
"result":
{
"edges": 325,
"markings": 325,
"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": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 ((((p21 <= 0)) OR ((1 <= p28))))",
"processed_size": 35,
"rewrites": 63
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1122
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p198))))",
"processed_size": 21,
"rewrites": 63
},
"result":
{
"edges": 16640,
"markings": 10261,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1683
},
"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 ((((p66 <= 0)) OR ((1 <= p96)))))",
"processed_size": 39,
"rewrites": 63
},
"result":
{
"edges": 2126,
"markings": 1419,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3367
},
"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 ((((p180 <= 0)) OR ((1 <= p247))))",
"processed_size": 37,
"rewrites": 63
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 3676,
"runtime": 417.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F((** OR (* OR *))) AND (X(G(*)) OR **)) : G(F(**)) : (X(X(X(F(**)))) AND G(**)) : (X(X(G(*))) AND ((** U **) OR (** OR **))) : (** U X(F(*))) : ((F(**) U X(**)) AND X(**)) : G(**) : F(G(**)) : X(X((G((F(**) AND (** OR **))) OR **)))"
},
"net":
{
"arcs": 1704,
"conflict_clusters": 103,
"places": 403,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 402
},
"result":
{
"preliminary_value": "no no no no no yes no no unknown ",
"value": "no no no no no yes no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 805/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 403
lola: finding significant places
lola: 403 places, 402 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: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: (NOT(G (((NOT(((1 <= 0) U (((p370 <= 0)) OR ((1 <= p109))))) AND ((1 <= p198))) AND ((p51 <= 0))))) AND (NOT(X (F ((((p370 <= 0)) OR ((1 <= p109)))))) OR (((1 <= p370)) AND ((p109 <= 0))))) : F (F (G (X (F (((1 <= p198))))))) : (F (X (((1 <= 0) U X (X (((1 <= p68))))))) AND G ((((p7 <= 0)) OR ((1 <= p2))))) : (X (NOT(X (F ((((p204 <= 0)) OR ((1 <= p135))))))) AND ((((((p156 <= 0)) OR ((1 <= p146))) U ((1 <= p125))) OR ((p204 <= 0))) OR ((1 <= p135)))) : ((1 <= 0) U ((((p170 <= 0)) OR ((1 <= p37))) U F (NOT(X ((((p49 <= 0)) OR ((1 <= p247)))))))) : ((F ((((p21 <= 0)) OR ((1 <= p28)))) U X ((((p70 <= 0)) OR ((1 <= p260))))) AND X ((((p21 <= 0)) OR ((1 <= p28))))) : G ((((p180 <= 0)) OR ((1 <= p247)))) : F (NOT(X (F (X (F (NOT(X (G (X ((((p66 <= 0)) OR ((1 <= p96))))))))))))) : X ((G (X (((((p62 <= 0)) OR ((1 <= p105))) U ((1 <= 0) U (((p62 <= 0)) OR ((1 <= p105))))))) OR X ((((p62 <= 0)) OR ((1 <= p105))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((((p370 <= 0)) OR ((1 <= p109))) OR (((p198 <= 0)) OR ((1 <= p51))))) AND (X (G ((((1 <= p370)) AND ((p109 <= 0))))) OR (((1 <= p370)) AND ((p109 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p370)) AND ((p109 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p370)) AND ((p109 <= 0)))
lola: processed formula length: 33
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((p370 <= 0)) OR ((1 <= p109))) OR (((p198 <= 0)) OR ((1 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((((1 <= p370)) AND ((p109 <= 0))) AND ((1 <= p198)) AND ((p51 <= 0)))
lola: processed formula length: 70
lola: 72 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 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p370)) AND ((p109 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p370)) AND ((p109 <= 0)))))
lola: processed formula length: 41
lola: 63 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: 314 markings, 314 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (F (((1 <= p68)))))) AND G ((((p7 <= 0)) OR ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p7 <= 0)) OR ((1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p7 <= 0)) OR ((1 <= p2))))
lola: processed formula length: 33
lola: 63 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: 159 markings, 225 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((((1 <= p204)) AND ((p135 <= 0)))))) AND (((((p156 <= 0)) OR ((1 <= p146))) U ((1 <= p125))) OR (((p204 <= 0)) OR ((1 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p204 <= 0)) OR ((1 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((p204 <= 0)) OR ((1 <= p135)))
lola: processed formula length: 32
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p204)) AND ((p135 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p204)) AND ((p135 <= 0))))))
lola: processed formula length: 45
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 314 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p170 <= 0)) OR ((1 <= p37))) U X (F ((((1 <= p49)) AND ((p247 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p170 <= 0)) OR ((1 <= p37))) U X (F ((((1 <= p49)) AND ((p247 <= 0))))))
lola: processed formula length: 77
lola: 63 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: 325 markings, 325 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((((p21 <= 0)) OR ((1 <= p28)))) U X ((((p70 <= 0)) OR ((1 <= p260))))) AND X ((((p21 <= 0)) OR ((1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p21 <= 0)) OR ((1 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p21 <= 0)) OR ((1 <= p28))))
lola: processed formula length: 35
lola: 63 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: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p21 <= 0)) OR ((1 <= p28)))) U X ((((p70 <= 0)) OR ((1 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((p21 <= 0)) OR ((1 <= p28)))) U X ((((p70 <= 0)) OR ((1 <= p260)))))
lola: processed formula length: 76
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((F ((((p62 <= 0)) OR ((1 <= p105)))) AND ((((p62 <= 0)) OR ((1 <= p105))) OR (((p62 <= 0)) OR ((1 <= p105)))))) OR (((p62 <= 0)) OR ((1 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((F ((((p62 <= 0)) OR ((1 <= p105)))) AND ((((p62 <= 0)) OR ((1 <= p105))) OR (((p62 <= 0)) OR ((1 <= p105)))))) OR (((p62 <= 0)) OR ((1 <= p105))))))
lola: processed formula length: 163
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1227361 markings, 1227360 edges, 245472 markings/sec, 0 secs
lola: 2379557 markings, 2379557 edges, 230439 markings/sec, 5 secs
lola: 3519186 markings, 3519186 edges, 227926 markings/sec, 10 secs
lola: 4636610 markings, 4636610 edges, 223485 markings/sec, 15 secs
lola: 5751774 markings, 5751774 edges, 223033 markings/sec, 20 secs
lola: 6860625 markings, 6860624 edges, 221770 markings/sec, 25 secs
lola: 7931426 markings, 7931427 edges, 214160 markings/sec, 30 secs
lola: 9022016 markings, 9022016 edges, 218118 markings/sec, 35 secs
lola: 10093967 markings, 10093967 edges, 214390 markings/sec, 40 secs
lola: 11172545 markings, 11172545 edges, 215716 markings/sec, 45 secs
lola: 12256164 markings, 12256164 edges, 216724 markings/sec, 50 secs
lola: 13315532 markings, 13315532 edges, 211874 markings/sec, 55 secs
lola: 14379188 markings, 14379188 edges, 212731 markings/sec, 60 secs
lola: 15425451 markings, 15425451 edges, 209253 markings/sec, 65 secs
lola: 16480528 markings, 16480527 edges, 211015 markings/sec, 70 secs
lola: 17548568 markings, 17548567 edges, 213608 markings/sec, 75 secs
lola: 18595704 markings, 18595703 edges, 209427 markings/sec, 80 secs
lola: 19651144 markings, 19651144 edges, 211088 markings/sec, 85 secs
lola: 20687893 markings, 20687892 edges, 207350 markings/sec, 90 secs
lola: 21745646 markings, 21745646 edges, 211551 markings/sec, 95 secs
lola: 22798901 markings, 22798901 edges, 210651 markings/sec, 100 secs
lola: 23846239 markings, 23846240 edges, 209468 markings/sec, 105 secs
lola: 24906890 markings, 24906890 edges, 212130 markings/sec, 110 secs
lola: 25942106 markings, 25942106 edges, 207043 markings/sec, 115 secs
lola: 26963025 markings, 26963024 edges, 204184 markings/sec, 120 secs
lola: 27818093 markings, 27818367 edges, 171014 markings/sec, 125 secs
lola: 28297067 markings, 28297185 edges, 95795 markings/sec, 130 secs
lola: 28986496 markings, 28986885 edges, 137886 markings/sec, 135 secs
lola: 29605598 markings, 29605597 edges, 123820 markings/sec, 140 secs
lola: 30162370 markings, 30162369 edges, 111354 markings/sec, 145 secs
lola: 30942624 markings, 30942623 edges, 156051 markings/sec, 150 secs
lola: 31463564 markings, 31463564 edges, 104188 markings/sec, 155 secs
lola: 32189484 markings, 32189483 edges, 145184 markings/sec, 160 secs
lola: 32893208 markings, 32893208 edges, 140745 markings/sec, 165 secs
lola: 33574847 markings, 33574847 edges, 136328 markings/sec, 170 secs
lola: 33997382 markings, 33997382 edges, 84507 markings/sec, 175 secs
lola: 34490834 markings, 34490834 edges, 98690 markings/sec, 180 secs
lola: 34672759 markings, 34672758 edges, 36385 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p198))))
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 (((1 <= p198))))
lola: processed formula length: 21
lola: 63 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: 10261 markings, 16640 edges
lola: ========================================
lola: subprocess 7 will run for 1683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p66 <= 0)) OR ((1 <= p96)))))
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 ((((p66 <= 0)) OR ((1 <= p96)))))
lola: processed formula length: 39
lola: 63 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: 1419 markings, 2126 edges
lola: ========================================
lola: subprocess 8 will run for 3367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p180 <= 0)) OR ((1 <= p247))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p180 <= 0)) OR ((1 <= p247))))
lola: processed formula length: 37
lola: 63 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: ========================================
lola: ...considering subproblem: X (X ((G ((F ((((p62 <= 0)) OR ((1 <= p105)))) AND ((((p62 <= 0)) OR ((1 <= p105))) OR (((p62 <= 0)) OR ((1 <= p105)))))) OR (((p62 <= 0)) OR ((1 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((F ((((p62 <= 0)) OR ((1 <= p105)))) AND ((((p62 <= 0)) OR ((1 <= p105))) OR (((p62 <= 0)) OR ((1 <= p105)))))) OR (((p62 <= 0)) OR ((1 <= p105))))))
lola: processed formula length: 163
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1074550 markings, 1074549 edges, 214910 markings/sec, 0 secs
lola: 2183931 markings, 2183932 edges, 221876 markings/sec, 5 secs
lola: 3272497 markings, 3272497 edges, 217713 markings/sec, 10 secs
lola: 4336875 markings, 4336875 edges, 212876 markings/sec, 15 secs
lola: 5333330 markings, 5333329 edges, 199291 markings/sec, 20 secs
lola: 6332287 markings, 6332287 edges, 199791 markings/sec, 25 secs
lola: 7304823 markings, 7304823 edges, 194507 markings/sec, 30 secs
lola: 8277103 markings, 8277103 edges, 194456 markings/sec, 35 secs
lola: 9302571 markings, 9302571 edges, 205094 markings/sec, 40 secs
lola: 10336348 markings, 10336347 edges, 206755 markings/sec, 45 secs
lola: 11384938 markings, 11384938 edges, 209718 markings/sec, 50 secs
lola: 12436188 markings, 12436188 edges, 210250 markings/sec, 55 secs
lola: 13459680 markings, 13459680 edges, 204698 markings/sec, 60 secs
lola: 14485456 markings, 14485456 edges, 205155 markings/sec, 65 secs
lola: 15504173 markings, 15504172 edges, 203743 markings/sec, 70 secs
lola: 16535655 markings, 16535655 edges, 206296 markings/sec, 75 secs
lola: 17573952 markings, 17573951 edges, 207659 markings/sec, 80 secs
lola: 18591381 markings, 18591381 edges, 203486 markings/sec, 85 secs
lola: 19621495 markings, 19621495 edges, 206023 markings/sec, 90 secs
lola: 20624588 markings, 20624587 edges, 200619 markings/sec, 95 secs
lola: 21646214 markings, 21646214 edges, 204325 markings/sec, 100 secs
lola: 22668621 markings, 22668622 edges, 204481 markings/sec, 105 secs
lola: 23693673 markings, 23693673 edges, 205010 markings/sec, 110 secs
lola: 24728571 markings, 24728571 edges, 206980 markings/sec, 115 secs
lola: 25736753 markings, 25736753 edges, 201636 markings/sec, 120 secs
lola: 26724674 markings, 26724673 edges, 197584 markings/sec, 125 secs
lola: 27627005 markings, 27627138 edges, 180466 markings/sec, 130 secs
lola: 28344642 markings, 28344691 edges, 143527 markings/sec, 135 secs
lola: 28933260 markings, 28933260 edges, 117724 markings/sec, 140 secs
lola: 29593570 markings, 29593569 edges, 132062 markings/sec, 145 secs
lola: 30153755 markings, 30153754 edges, 112037 markings/sec, 150 secs
lola: 30699112 markings, 30699112 edges, 109071 markings/sec, 155 secs
lola: 31335491 markings, 31335491 edges, 127276 markings/sec, 160 secs
lola: 31780206 markings, 31780206 edges, 88943 markings/sec, 165 secs
lola: 32451560 markings, 32451559 edges, 134271 markings/sec, 170 secs
lola: 33049769 markings, 33049769 edges, 119642 markings/sec, 175 secs
lola: 33629291 markings, 33629290 edges, 115904 markings/sec, 180 secs
lola: 34129753 markings, 34129752 edges, 100092 markings/sec, 185 secs
lola: 34517243 markings, 34517243 edges, 77498 markings/sec, 190 secs
lola: 34632695 markings, 34632805 edges, 23090 markings/sec, 195 secs
lola: 34668070 markings, 34668070 edges, 7075 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes no no unknown
lola:
preliminary result: no no no no no yes no no unknown
lola: memory consumption: 3676 KB
lola: time consumption: 417 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="ShieldRVt-PT-050A"
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 ShieldRVt-PT-050A, 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 r246-smll-162106594400161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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