Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478301049.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldRVt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.0K May 14 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 109K May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591339265809

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:41:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:41:09] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2020-06-05 06:41:09] [INFO ] Transformed 323 places.
[2020-06-05 06:41:09] [INFO ] Transformed 323 transitions.
[2020-06-05 06:41:09] [INFO ] Found NUPN structural information;
[2020-06-05 06:41:09] [INFO ] Parsed PT model containing 323 places and 323 transitions in 118 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 472 ms. (steps per millisecond=211 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 322 rows 323 cols
[2020-06-05 06:41:09] [INFO ] Computed 161 place invariants in 10 ms
[2020-06-05 06:41:09] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:10] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2020-06-05 06:41:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 45 ms.
[2020-06-05 06:41:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-06-05 06:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:10] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2020-06-05 06:41:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 37 ms.
[2020-06-05 06:41:12] [INFO ] Added : 317 causal constraints over 64 iterations in 1674 ms. Result :sat
[2020-06-05 06:41:12] [INFO ] [Real]Absence check using 161 positive place invariants in 60 ms returned sat
[2020-06-05 06:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:12] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-06-05 06:41:12] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:41:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 55 ms returned sat
[2020-06-05 06:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:13] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-06-05 06:41:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 38 ms.
[2020-06-05 06:41:14] [INFO ] Added : 317 causal constraints over 64 iterations in 1574 ms. Result :sat
[2020-06-05 06:41:15] [INFO ] [Real]Absence check using 161 positive place invariants in 40 ms returned sat
[2020-06-05 06:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:15] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2020-06-05 06:41:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2020-06-05 06:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:15] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2020-06-05 06:41:15] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:41:17] [INFO ] Added : 314 causal constraints over 63 iterations in 1502 ms. Result :sat
[2020-06-05 06:41:17] [INFO ] [Real]Absence check using 161 positive place invariants in 50 ms returned sat
[2020-06-05 06:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:17] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2020-06-05 06:41:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned unsat
[2020-06-05 06:41:18] [INFO ] [Real]Absence check using 161 positive place invariants in 67 ms returned sat
[2020-06-05 06:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:18] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-06-05 06:41:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:18] [INFO ] [Nat]Absence check using 161 positive place invariants in 60 ms returned sat
[2020-06-05 06:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:18] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-06-05 06:41:18] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:41:20] [INFO ] Added : 317 causal constraints over 64 iterations in 1807 ms. Result :sat
[2020-06-05 06:41:20] [INFO ] [Real]Absence check using 161 positive place invariants in 42 ms returned sat
[2020-06-05 06:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:20] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2020-06-05 06:41:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 18 ms.
[2020-06-05 06:41:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:21] [INFO ] [Nat]Absence check using 161 positive place invariants in 55 ms returned sat
[2020-06-05 06:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:21] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2020-06-05 06:41:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:41:23] [INFO ] Added : 317 causal constraints over 64 iterations in 1803 ms. Result :sat
[2020-06-05 06:41:23] [INFO ] [Real]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-06-05 06:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:23] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-06-05 06:41:23] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-06-05 06:41:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2020-06-05 06:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:24] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-06-05 06:41:24] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 22 ms.
[2020-06-05 06:41:25] [INFO ] Added : 317 causal constraints over 64 iterations in 1672 ms. Result :sat
[2020-06-05 06:41:25] [INFO ] [Real]Absence check using 161 positive place invariants in 55 ms returned sat
[2020-06-05 06:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:26] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-06-05 06:41:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 52 ms returned sat
[2020-06-05 06:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:26] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2020-06-05 06:41:26] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 15 ms.
[2020-06-05 06:41:28] [INFO ] Added : 317 causal constraints over 64 iterations in 1875 ms. Result :sat
[2020-06-05 06:41:28] [INFO ] [Real]Absence check using 161 positive place invariants in 55 ms returned sat
[2020-06-05 06:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:28] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2020-06-05 06:41:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 14 ms returned unsat
[2020-06-05 06:41:29] [INFO ] [Real]Absence check using 161 positive place invariants in 45 ms returned sat
[2020-06-05 06:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:29] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2020-06-05 06:41:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:29] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2020-06-05 06:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:29] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-06-05 06:41:29] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 19 ms.
[2020-06-05 06:41:31] [INFO ] Added : 319 causal constraints over 64 iterations in 2352 ms. Result :sat
[2020-06-05 06:41:32] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-06-05 06:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:32] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2020-06-05 06:41:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 62 ms returned sat
[2020-06-05 06:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:32] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2020-06-05 06:41:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-06-05 06:41:34] [INFO ] Added : 318 causal constraints over 64 iterations in 1905 ms. Result :sat
[2020-06-05 06:41:34] [INFO ] [Real]Absence check using 161 positive place invariants in 65 ms returned sat
[2020-06-05 06:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:35] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-06-05 06:41:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2020-06-05 06:41:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 06:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:35] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-06-05 06:41:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 16 ms.
[2020-06-05 06:41:37] [INFO ] Added : 316 causal constraints over 64 iterations in 2098 ms. Result :sat
[2020-06-05 06:41:37] [INFO ] [Real]Absence check using 161 positive place invariants in 77 ms returned sat
[2020-06-05 06:41:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:38] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-05 06:41:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:41:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 45 ms returned sat
[2020-06-05 06:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:41:38] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2020-06-05 06:41:38] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-06-05 06:41:40] [INFO ] Added : 318 causal constraints over 64 iterations in 1792 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-05 06:41:40] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 06:41:40] [INFO ] Flatten gal took : 181 ms
FORMULA ShieldRVt-PT-040A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:41:40] [INFO ] Applying decomposition
[2020-06-05 06:41:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 06:41:40] [INFO ] Flatten gal took : 46 ms
[2020-06-05 06:41:40] [INFO ] Decomposing Gal with order
[2020-06-05 06:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 06:41:41] [INFO ] Removed a total of 120 redundant transitions.
[2020-06-05 06:41:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 06:41:41] [INFO ] Flatten gal took : 138 ms
[2020-06-05 06:41:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2020-06-05 06:41:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-040A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:41:41] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-05 06:41:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-040A @ 3570 seconds

FORMULA ShieldRVt-PT-040A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldRVt-PT-040A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((((p132 <= 0)) OR ((1 <= p126)))))",
"processed_size": 41,
"rewrites": 47
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((((p303 <= 0)) OR ((1 <= p163)))) OR F ((((p142 <= 0)) OR ((1 <= p80)))))))",
"processed_size": 87,
"rewrites": 47
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (X (G ((((1 <= p14)) AND ((p253 <= 0)))))) OR (((p14 <= 0)) OR ((1 <= p253)))))",
"processed_size": 85,
"rewrites": 47
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(((p321 <= 0)) OR ((1 <= p269)))",
"processed_size": 33,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1152
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((((1 <= p39)) AND ((p4 <= 0)))))",
"processed_size": 38,
"rewrites": 47
},
"result":
{
"edges": 7,
"markings": 6,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1728
},
"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 ((((p229 <= 0)) OR ((1 <= p149)))))",
"processed_size": 41,
"rewrites": 47
},
"result":
{
"edges": 9876,
"markings": 5732,
"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": 3455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F ((((1 <= p20)) AND ((p257 <= 0)))) AND G ((F ((F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15)))) AND ((((p20 <= 0)) OR ((1 <= p257))) OR (F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15))))))))",
"processed_size": 208,
"rewrites": 47
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"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": "(((p321 <= 0)) OR ((1 <= p269)))",
"processed_size": 33,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3644,
"runtime": 234.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(*)) : F((F(**) AND G((F((F(**) OR **)) AND (** OR (F(**) OR **)))))) : F(G(**)) : X(F((G(**) OR F(**)))) : G((X(X(G(*))) OR (** OR **))) : X(X(X(G(**)))) : X(F(**)) : F(G(*)) : (X((F(*) AND ((X(**) OR (* OR *)) R F(*)))) AND **)"
},
"net":
{
"arcs": 1364,
"conflict_clusters": 83,
"places": 323,
"places_significant": 162,
"singleton_clusters": 0,
"transitions": 322
},
"result":
{
"preliminary_value": "yes no no yes no no no no unknown ",
"value": "yes no no yes no no 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: 645/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10336
lola: finding significant places
lola: 323 places, 322 transitions, 162 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: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p320 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: X ((NOT(X (((((p132 <= 0)) OR ((1 <= p126))) U (1 <= 0)))) AND NOT(G ((((1 <= p132)) AND ((p126 <= 0))))))) : F ((F ((((p15 <= 0)) U (((1 <= p20)) AND ((p257 <= 0))))) AND G (((((p20 <= 0)) OR ((1 <= p257))) U (F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15))))))) : F ((NOT(((((p229 <= 0)) OR ((1 <= p149))) U (0 <= 0))) OR G ((((p229 <= 0)) OR ((1 <= p149)))))) : X (F ((G ((((p303 <= 0)) OR ((1 <= p163)))) OR F ((((p142 <= 0)) OR ((1 <= p80))))))) : G (((X (X (NOT(F ((((p14 <= 0)) OR ((1 <= p253))))))) OR ((p14 <= 0))) OR ((1 <= p253)))) : X (G (X (X ((((p175 <= 0)) OR ((1 <= p239))))))) : X (F ((((1 <= p103)) AND ((p38 <= 0))))) : X (F (NOT(G (F (NOT(G (NOT((((((p237 <= 0)) OR ((1 <= p230)))) U F ((((p39 <= 0)) OR ((1 <= p4))))))))))))) : (NOT(X ((G ((((p278 <= 0)) OR ((1 <= p52)))) OR (((NOT(X ((((p236 <= 0)) OR ((1 <= p83))))) AND ((1 <= p30))) AND ((p131 <= 0))) U G ((((p236 <= 0)) OR ((1 <= p83)))))))) AND (((p321 <= 0)) OR ((1 <= p269))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p132 <= 0)) OR ((1 <= p126)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p132 <= 0)) OR ((1 <= p126)))))
lola: processed formula length: 41
lola: 47 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: 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 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((p303 <= 0)) OR ((1 <= p163)))) OR F ((((p142 <= 0)) OR ((1 <= p80)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((((p303 <= 0)) OR ((1 <= p163)))) OR F ((((p142 <= 0)) OR ((1 <= p80)))))))
lola: processed formula length: 87
lola: 47 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 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G ((((1 <= p14)) AND ((p253 <= 0)))))) OR (((p14 <= 0)) OR ((1 <= p253)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G ((((1 <= p14)) AND ((p253 <= 0)))))) OR (((p14 <= 0)) OR ((1 <= p253)))))
lola: processed formula length: 85
lola: 47 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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((p175 <= 0)) OR ((1 <= p239)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((p175 <= 0)) OR ((1 <= p239)))))))
lola: processed formula length: 49
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 254 markings, 254 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p103)) AND ((p38 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p103)) AND ((p38 <= 0)))))
lola: processed formula length: 40
lola: 47 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: 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: 364 markings, 364 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((((1 <= p278)) AND ((p52 <= 0)))) AND ((X ((((p236 <= 0)) OR ((1 <= p83)))) OR (((p30 <= 0)) OR ((1 <= p131)))) R F ((((1 <= p236)) AND ((p83 <= 0))))))) AND (((p321 <= 0)) OR ((1 <= p269))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p321 <= 0)) OR ((1 <= p269)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p321 <= 0)) OR ((1 <= p269)))
lola: processed formula length: 33
lola: 47 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 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((1 <= p278)) AND ((p52 <= 0)))) AND ((X ((((p236 <= 0)) OR ((1 <= p83)))) OR (((p30 <= 0)) OR ((1 <= p131)))) R F ((((1 <= p236)) AND ((p83 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((1 <= p278)) AND ((p52 <= 0)))) AND ((X ((((p236 <= 0)) OR ((1 <= p83)))) OR (((p30 <= 0)) OR ((1 <= p131)))) R F ((((1 <= p236)) AND ((p83 <= 0)))))))
lola: processed formula length: 161
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1964419 markings, 2015820 edges, 392884 markings/sec, 0 secs
lola: 3878657 markings, 3979862 edges, 382848 markings/sec, 5 secs
lola: 5838918 markings, 5988614 edges, 392052 markings/sec, 10 secs
lola: 7623469 markings, 7818472 edges, 356910 markings/sec, 15 secs
lola: 9513808 markings, 9758094 edges, 378068 markings/sec, 20 secs
lola: 11397996 markings, 11691556 edges, 376838 markings/sec, 25 secs
lola: 13289727 markings, 13631487 edges, 378346 markings/sec, 30 secs
lola: 15271253 markings, 15663093 edges, 396305 markings/sec, 35 secs
lola: 17262949 markings, 17706745 edges, 398339 markings/sec, 40 secs
lola: 19243123 markings, 19737355 edges, 396035 markings/sec, 45 secs
lola: 21210275 markings, 21754369 edges, 393430 markings/sec, 50 secs
lola: 23173327 markings, 23768792 edges, 392610 markings/sec, 55 secs
lola: 25145544 markings, 25790512 edges, 394443 markings/sec, 60 secs
lola: 27000004 markings, 27692512 edges, 370892 markings/sec, 65 secs
lola: 28093418 markings, 28814776 edges, 218683 markings/sec, 70 secs
lola: 29117725 markings, 29865675 edges, 204861 markings/sec, 75 secs
lola: 30036110 markings, 30808198 edges, 183677 markings/sec, 80 secs
lola: 30893967 markings, 31686968 edges, 171571 markings/sec, 85 secs
lola: 31915581 markings, 32735140 edges, 204323 markings/sec, 90 secs
lola: 32622676 markings, 33460769 edges, 141419 markings/sec, 95 secs
lola: 33819617 markings, 34687493 edges, 239388 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 6 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p39)) AND ((p4 <= 0)))))
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 ((((1 <= p39)) AND ((p4 <= 0)))))
lola: processed formula length: 38
lola: 47 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 1728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p229 <= 0)) OR ((1 <= p149)))))
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 ((((p229 <= 0)) OR ((1 <= p149)))))
lola: processed formula length: 41
lola: 47 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: 5732 markings, 9876 edges
lola: ========================================
lola: subprocess 8 will run for 3455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((1 <= p20)) AND ((p257 <= 0)))) AND G ((F ((F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15)))) AND ((((p20 <= 0)) OR ((1 <= p257))) OR (F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((1 <= p20)) AND ((p257 <= 0)))) AND G ((F ((F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15)))) AND ((((p20 <= 0)) OR ((1 <= p257))) OR (F ((((p20 <= 0)) OR ((1 <= p257)))) OR ((1 <= p15))))))))
lola: processed formula length: 208
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X ((F ((((1 <= p278)) AND ((p52 <= 0)))) AND ((X ((((p236 <= 0)) OR ((1 <= p83)))) OR (((p30 <= 0)) OR ((1 <= p131)))) R F ((((1 <= p236)) AND ((p83 <= 0))))))) AND (((p321 <= 0)) OR ((1 <= p269))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p321 <= 0)) OR ((1 <= p269)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p321 <= 0)) OR ((1 <= p269)))
lola: processed formula length: 33
lola: 47 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: ========================================
lola: ...considering subproblem: X ((F ((((1 <= p278)) AND ((p52 <= 0)))) AND ((X ((((p236 <= 0)) OR ((1 <= p83)))) OR (((p30 <= 0)) OR ((1 <= p131)))) R F ((((1 <= p236)) AND ((p83 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((1 <= p278)) AND ((p52 <= 0)))) AND ((X ((((p236 <= 0)) OR ((1 <= p83)))) OR (((p30 <= 0)) OR ((1 <= p131)))) R F ((((1 <= p236)) AND ((p83 <= 0)))))))
lola: processed formula length: 161
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1620456 markings, 1662871 edges, 324091 markings/sec, 0 secs
lola: 3684394 markings, 3780734 edges, 412788 markings/sec, 5 secs
lola: 5734809 markings, 5881791 edges, 410083 markings/sec, 10 secs
lola: 7772302 markings, 7971070 edges, 407499 markings/sec, 15 secs
lola: 9775605 markings, 10026732 edges, 400661 markings/sec, 20 secs
lola: 11642509 markings, 11942446 edges, 373381 markings/sec, 25 secs
lola: 13508068 markings, 13855071 edges, 373112 markings/sec, 30 secs
lola: 15541477 markings, 15940375 edges, 406682 markings/sec, 35 secs
lola: 17465948 markings, 17914568 edges, 384894 markings/sec, 40 secs
lola: 19458159 markings, 19957988 edges, 398442 markings/sec, 45 secs
lola: 21272850 markings, 21818614 edges, 362938 markings/sec, 50 secs
lola: 23138477 markings, 23733016 edges, 373125 markings/sec, 55 secs
lola: 25162996 markings, 25808374 edges, 404904 markings/sec, 60 secs
lola: 27110745 markings, 27806161 edges, 389550 markings/sec, 65 secs
lola: 28121803 markings, 28845634 edges, 202212 markings/sec, 70 secs
lola: 29080294 markings, 29827727 edges, 191698 markings/sec, 75 secs
lola: 29905533 markings, 30674169 edges, 165048 markings/sec, 80 secs
lola: 30790272 markings, 31580413 edges, 176948 markings/sec, 85 secs
lola: 31531423 markings, 32340918 edges, 148230 markings/sec, 90 secs
lola: 32312913 markings, 33142885 edges, 156298 markings/sec, 95 secs
lola: 33093174 markings, 33943542 edges, 156052 markings/sec, 100 secs
lola: 34049919 markings, 34923326 edges, 191349 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no no unknown
lola:
preliminary result: yes no no yes no no no no unknown
lola: memory consumption: 3644 KB
lola: time consumption: 234 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-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478301049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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