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-159033478301033.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-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.2K May 14 02:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K 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.2K May 13 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 82K 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-030A-00
FORMULA_NAME ShieldRVt-PT-030A-01
FORMULA_NAME ShieldRVt-PT-030A-02
FORMULA_NAME ShieldRVt-PT-030A-03
FORMULA_NAME ShieldRVt-PT-030A-04
FORMULA_NAME ShieldRVt-PT-030A-05
FORMULA_NAME ShieldRVt-PT-030A-06
FORMULA_NAME ShieldRVt-PT-030A-07
FORMULA_NAME ShieldRVt-PT-030A-08
FORMULA_NAME ShieldRVt-PT-030A-09
FORMULA_NAME ShieldRVt-PT-030A-10
FORMULA_NAME ShieldRVt-PT-030A-11
FORMULA_NAME ShieldRVt-PT-030A-12
FORMULA_NAME ShieldRVt-PT-030A-13
FORMULA_NAME ShieldRVt-PT-030A-14
FORMULA_NAME ShieldRVt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1591338717874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:31:59] [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:31:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:31:59] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-05 06:31:59] [INFO ] Transformed 243 places.
[2020-06-05 06:31:59] [INFO ] Transformed 243 transitions.
[2020-06-05 06:31:59] [INFO ] Found NUPN structural information;
[2020-06-05 06:31:59] [INFO ] Parsed PT model containing 243 places and 243 transitions in 105 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 442 ms. (steps per millisecond=226 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1]
// Phase 1: matrix 242 rows 243 cols
[2020-06-05 06:32:00] [INFO ] Computed 121 place invariants in 9 ms
[2020-06-05 06:32:00] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2020-06-05 06:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:00] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-05 06:32:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2020-06-05 06:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:01] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2020-06-05 06:32:01] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 29 ms.
[2020-06-05 06:32:02] [INFO ] Added : 239 causal constraints over 48 iterations in 1475 ms. Result :sat
[2020-06-05 06:32:03] [INFO ] [Real]Absence check using 121 positive place invariants in 54 ms returned sat
[2020-06-05 06:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:03] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-05 06:32:03] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2020-06-05 06:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:03] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2020-06-05 06:32:03] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 21 ms.
[2020-06-05 06:32:04] [INFO ] Added : 238 causal constraints over 49 iterations in 1118 ms. Result :sat
[2020-06-05 06:32:04] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:05] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-05 06:32:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2020-06-05 06:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:05] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-06-05 06:32:05] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-06-05 06:32:06] [INFO ] Added : 239 causal constraints over 49 iterations in 901 ms. Result :sat
[2020-06-05 06:32:06] [INFO ] [Real]Absence check using 121 positive place invariants in 70 ms returned sat
[2020-06-05 06:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:06] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2020-06-05 06:32:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 68 ms returned sat
[2020-06-05 06:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:07] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-06-05 06:32:07] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:08] [INFO ] Added : 240 causal constraints over 49 iterations in 1551 ms. Result :sat
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2020-06-05 06:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-05 06:32:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 10 ms returned unsat
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using 121 positive place invariants in 42 ms returned sat
[2020-06-05 06:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2020-06-05 06:32:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned unsat
[2020-06-05 06:32:10] [INFO ] [Real]Absence check using 121 positive place invariants in 163 ms returned sat
[2020-06-05 06:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:10] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-06-05 06:32:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 9 ms returned unsat
[2020-06-05 06:32:10] [INFO ] [Real]Absence check using 121 positive place invariants in 118 ms returned sat
[2020-06-05 06:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:11] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2020-06-05 06:32:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-06-05 06:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:11] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-06-05 06:32:11] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 21 ms.
[2020-06-05 06:32:13] [INFO ] Added : 237 causal constraints over 49 iterations in 1293 ms. Result :sat
[2020-06-05 06:32:13] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2020-06-05 06:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:13] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2020-06-05 06:32:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:14] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-06-05 06:32:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 18 ms.
[2020-06-05 06:32:15] [INFO ] Added : 240 causal constraints over 49 iterations in 959 ms. Result :sat
[2020-06-05 06:32:15] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-06-05 06:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:15] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-05 06:32:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned unsat
[2020-06-05 06:32:15] [INFO ] [Real]Absence check using 121 positive place invariants in 42 ms returned sat
[2020-06-05 06:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:16] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2020-06-05 06:32:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 31 ms.
[2020-06-05 06:32:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2020-06-05 06:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:16] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-06-05 06:32:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:17] [INFO ] Added : 237 causal constraints over 49 iterations in 972 ms. Result :sat
[2020-06-05 06:32:17] [INFO ] [Real]Absence check using 121 positive place invariants in 45 ms returned sat
[2020-06-05 06:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:17] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-05 06:32:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 42 ms returned sat
[2020-06-05 06:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:18] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2020-06-05 06:32:18] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 48 ms.
[2020-06-05 06:32:19] [INFO ] Added : 238 causal constraints over 48 iterations in 1288 ms. Result :sat
[2020-06-05 06:32:19] [INFO ] [Real]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-06-05 06:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:19] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-05 06:32:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 69 ms returned sat
[2020-06-05 06:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:20] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-06-05 06:32:20] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:21] [INFO ] Added : 237 causal constraints over 48 iterations in 987 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2020-06-05 06:32:21] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-05 06:32:21] [INFO ] Flatten gal took : 95 ms
FORMULA ShieldRVt-PT-030A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:32:21] [INFO ] Applying decomposition
[2020-06-05 06:32:21] [INFO ] Flatten gal took : 24 ms
[2020-06-05 06:32:21] [INFO ] Decomposing Gal with order
[2020-06-05 06:32:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 06:32:21] [INFO ] Removed a total of 90 redundant transitions.
[2020-06-05 06:32:21] [INFO ] Flatten gal took : 70 ms
[2020-06-05 06:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2020-06-05 06:32:21] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-05 06:32:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-030A @ 3570 seconds

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

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

FORMULA ShieldRVt-PT-030A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ShieldRVt-PT-030A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--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:32:22 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((((((p136 <= 0)) OR ((1 <= p89))) U X ((((p136 <= 0)) OR ((1 <= p89))))) OR (((p195 <= 0)) OR ((1 <= p97))))))",
"processed_size": 118,
"rewrites": 55
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((G ((((1 <= p220)) AND ((p30 <= 0)))) AND ((((p195 <= 0)) OR ((1 <= p22))) AND (((p97 <= 0)) OR ((1 <= p65)))))))",
"processed_size": 121,
"rewrites": 55
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (F ((((1 <= p0)) AND ((p23 <= 0)))))))",
"processed_size": 46,
"rewrites": 55
},
"result":
{
"edges": 194,
"markings": 194,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((((p2 <= 0)) OR ((1 <= p152))) U G ((((p110 <= 0)) OR ((1 <= p44))))) U X (X ((((p2 <= 0)) OR ((1 <= p152))))))",
"processed_size": 116,
"rewrites": 55
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p178 <= 0)) OR ((1 <= p73)))",
"processed_size": 32,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 861
},
"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 ((((p74 <= 0)) OR ((1 <= p223)))))",
"processed_size": 40,
"rewrites": 55
},
"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": 1148
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((((1 <= p116)) AND ((p190 <= 0)))))",
"processed_size": 41,
"rewrites": 55
},
"result":
{
"edges": 5,
"markings": 5,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1722
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (G (((1 <= p52)))) AND (((p166 <= 0)) OR ((1 <= p191)))))",
"processed_size": 64,
"rewrites": 55
},
"result":
{
"edges": 149,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3444
},
"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 <= p85))))",
"processed_size": 34,
"rewrites": 55
},
"result":
{
"edges": 132,
"markings": 96,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((((1 <= p7)) AND ((p85 <= 0))) OR (((1 <= p188)) AND ((p29 <= 0))))))",
"processed_size": 77,
"rewrites": 55
},
"result":
{
"edges": 129,
"markings": 96,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3640,
"runtime": 248.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(((** U X(**)) OR (** OR **)))) : X(G((G(*) AND (** AND **)))) : F(G((F(**) AND (X(**) OR **)))) : G(F(**)) : F(G(**)) : F((F(G(**)) AND **)) : X(X(X(F(*)))) : (G(**) OR (F(G(**)) AND F(G(*)))) : ((** U G(**)) U X(X(**))) : F(**)"
},
"net":
{
"arcs": 1024,
"conflict_clusters": 63,
"places": 243,
"places_significant": 122,
"singleton_clusters": 0,
"transitions": 242
},
"result":
{
"preliminary_value": "yes no unknown no no no no no yes yes ",
"value": "yes no unknown no no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 485/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7776
lola: finding significant places
lola: 243 places, 242 transitions, 122 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: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: X (X (((((((p136 <= 0)) OR ((1 <= p89))) U X ((((p136 <= 0)) OR ((1 <= p89))))) OR ((p195 <= 0))) OR ((1 <= p97))))) : X ((G (((NOT(F ((((p220 <= 0)) OR ((1 <= p30))))) AND (((p195 <= 0)) OR ((1 <= p22)))) AND (((p97 <= 0)) OR ((1 <= p65))))) AND ((1 <= 0) U (0 <= 0)))) : NOT(X (G (F (NOT((X (((((p222 <= 0)) OR ((1 <= p108))) AND (((p222 <= 0)) OR ((1 <= p108)) OR ((1 <= p70))))) U (((p222 <= 0)) OR ((1 <= p108))))))))) : X (G ((NOT(X (G ((((p88 <= 0)) OR ((1 <= p240)))))) U F ((((1 <= p116)) AND ((p190 <= 0))))))) : F (X (G (X ((((p74 <= 0)) OR ((1 <= p223))))))) : F ((((0 <= 0) U G (((1 <= p52)))) AND (((p166 <= 0)) OR ((1 <= p191))))) : F (X (F (((((1 <= p81)) AND ((p127 <= 0))) U X (NOT(X ((((p0 <= 0)) OR ((1 <= p23)))))))))) : (F (G (X (NOT(F (X (((((p7 <= 0)) OR ((1 <= p85))) AND (((p188 <= 0)) OR ((1 <= p29)))))))))) U G ((((p7 <= 0)) OR ((1 <= p85))))) : (((((p2 <= 0)) OR ((1 <= p152))) U G ((((p110 <= 0)) OR ((1 <= p44))))) U X (X ((((p2 <= 0)) OR ((1 <= p152)))))) : (((p234 <= 0)) U F ((((1 <= p178)) AND ((p73 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((((p136 <= 0)) OR ((1 <= p89))) U X ((((p136 <= 0)) OR ((1 <= p89))))) OR (((p195 <= 0)) OR ((1 <= p97))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((((p136 <= 0)) OR ((1 <= p89))) U X ((((p136 <= 0)) OR ((1 <= p89))))) OR (((p195 <= 0)) OR ((1 <= p97))))))
lola: processed formula length: 118
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((((1 <= p220)) AND ((p30 <= 0)))) AND ((((p195 <= 0)) OR ((1 <= p22))) AND (((p97 <= 0)) OR ((1 <= p65)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((((1 <= p220)) AND ((p30 <= 0)))) AND ((((p195 <= 0)) OR ((1 <= p22))) AND (((p97 <= 0)) OR ((1 <= p65)))))))
lola: processed formula length: 121
lola: 55 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: 194 markings, 194 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p222 <= 0)) OR ((1 <= p108)))) AND (X (((((p222 <= 0)) OR ((1 <= p108))) AND (((p222 <= 0)) OR ((1 <= p108)) OR ((1 <= p70))))) OR (((p222 <= 0)) OR ((1 <= p108)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p222 <= 0)) OR ((1 <= p108)))) AND (X (((((p222 <= 0)) OR ((1 <= p108))) AND (((p222 <= 0)) OR ((1 <= p108)) OR ((1 <= p70))))) OR (((p222 <= 0)) OR ((1 <= p108)))))))
lola: processed formula length: 185
lola: 55 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: 2236621 markings, 2458687 edges, 447324 markings/sec, 0 secs
lola: 4618203 markings, 5076740 edges, 476316 markings/sec, 5 secs
lola: 6973690 markings, 7666104 edges, 471097 markings/sec, 10 secs
lola: 9444198 markings, 10381912 edges, 494102 markings/sec, 15 secs
lola: 11884104 markings, 13064072 edges, 487981 markings/sec, 20 secs
lola: 14034882 markings, 15428409 edges, 430156 markings/sec, 25 secs
lola: 16105371 markings, 17704475 edges, 414098 markings/sec, 30 secs
lola: 18525062 markings, 20364421 edges, 483938 markings/sec, 35 secs
lola: 20927558 markings, 23005465 edges, 480499 markings/sec, 40 secs
lola: 23327633 markings, 25643845 edges, 480015 markings/sec, 45 secs
lola: 25604423 markings, 28146696 edges, 455358 markings/sec, 50 secs
lola: 27776108 markings, 30534011 edges, 434337 markings/sec, 55 secs
lola: 30091377 markings, 33079165 edges, 463054 markings/sec, 60 secs
lola: 32454331 markings, 35676736 edges, 472591 markings/sec, 65 secs
lola: 33538328 markings, 36872778 edges, 216799 markings/sec, 70 secs
lola: 34610232 markings, 38046702 edges, 214381 markings/sec, 75 secs
lola: 35628605 markings, 39166420 edges, 203675 markings/sec, 80 secs
lola: 36535441 markings, 40163067 edges, 181367 markings/sec, 85 secs
lola: 37258692 markings, 40958127 edges, 144650 markings/sec, 90 secs
lola: 38296228 markings, 42098680 edges, 207507 markings/sec, 95 secs
lola: 39217266 markings, 43111171 edges, 184208 markings/sec, 100 secs
lola: 40305876 markings, 44307870 edges, 217722 markings/sec, 105 secs
lola: 41042486 markings, 45117621 edges, 147322 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((((1 <= p0)) AND ((p23 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((((1 <= p0)) AND ((p23 <= 0)))))))
lola: processed formula length: 46
lola: 55 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: 194 markings, 194 edges
lola: ========================================
lola: subprocess 4 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p2 <= 0)) OR ((1 <= p152))) U G ((((p110 <= 0)) OR ((1 <= p44))))) U X (X ((((p2 <= 0)) OR ((1 <= p152))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p2 <= 0)) OR ((1 <= p152))) U G ((((p110 <= 0)) OR ((1 <= p44))))) U X (X ((((p2 <= 0)) OR ((1 <= p152))))))
lola: processed formula length: 116
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p178)) AND ((p73 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p178 <= 0)) OR ((1 <= p73)))
lola: processed formula length: 32
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p74 <= 0)) OR ((1 <= p223)))))
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 ((((p74 <= 0)) OR ((1 <= p223)))))
lola: processed formula length: 40
lola: 55 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 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p116)) AND ((p190 <= 0)))))
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 <= p116)) AND ((p190 <= 0)))))
lola: processed formula length: 41
lola: 55 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 1722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p52)))) AND (((p166 <= 0)) OR ((1 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p52)))) AND (((p166 <= 0)) OR ((1 <= p191)))))
lola: processed formula length: 64
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 149 edges
lola: ========================================
lola: subprocess 9 will run for 3444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p7 <= 0)) OR ((1 <= p85)))) OR (F (G ((((p7 <= 0)) OR ((1 <= p85))))) AND F (G (((((1 <= p7)) AND ((p85 <= 0))) OR (((1 <= p188)) AND ((p29 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p7 <= 0)) OR ((1 <= p85))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p7 <= 0)) OR ((1 <= p85))))
lola: processed formula length: 34
lola: 55 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: 96 markings, 132 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((1 <= p7)) AND ((p85 <= 0))) OR (((1 <= p188)) AND ((p29 <= 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 <= p7)) AND ((p85 <= 0))) OR (((1 <= p188)) AND ((p29 <= 0))))))
lola: processed formula length: 77
lola: 55 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: 96 markings, 129 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p222 <= 0)) OR ((1 <= p108)))) AND (X (((((p222 <= 0)) OR ((1 <= p108))) AND (((p222 <= 0)) OR ((1 <= p108)) OR ((1 <= p70))))) OR (((p222 <= 0)) OR ((1 <= p108)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p222 <= 0)) OR ((1 <= p108)))) AND (X (((((p222 <= 0)) OR ((1 <= p108))) AND (((p222 <= 0)) OR ((1 <= p108)) OR ((1 <= p70))))) OR (((p222 <= 0)) OR ((1 <= p108)))))))
lola: processed formula length: 185
lola: 55 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: 2017693 markings, 2218017 edges, 403539 markings/sec, 0 secs
lola: 4225698 markings, 4645262 edges, 441601 markings/sec, 5 secs
lola: 6345899 markings, 6975983 edges, 424040 markings/sec, 10 secs
lola: 8706861 markings, 9571364 edges, 472192 markings/sec, 15 secs
lola: 10880954 markings, 11961321 edges, 434819 markings/sec, 20 secs
lola: 13255490 markings, 14571629 edges, 474907 markings/sec, 25 secs
lola: 15620789 markings, 17171781 edges, 473060 markings/sec, 30 secs
lola: 17982548 markings, 19768042 edges, 472352 markings/sec, 35 secs
lola: 20239633 markings, 22249232 edges, 451417 markings/sec, 40 secs
lola: 22369292 markings, 24590346 edges, 425932 markings/sec, 45 secs
lola: 24483887 markings, 26914901 edges, 422919 markings/sec, 50 secs
lola: 26652830 markings, 29299199 edges, 433789 markings/sec, 55 secs
lola: 28759904 markings, 31615487 edges, 421415 markings/sec, 60 secs
lola: 30841619 markings, 33903896 edges, 416343 markings/sec, 65 secs
lola: 32935556 markings, 36209820 edges, 418787 markings/sec, 70 secs
lola: 34264990 markings, 37667519 edges, 265887 markings/sec, 75 secs
lola: 35417917 markings, 38934586 edges, 230585 markings/sec, 80 secs
lola: 36298554 markings, 39902879 edges, 176127 markings/sec, 85 secs
lola: 37275730 markings, 40977503 edges, 195435 markings/sec, 90 secs
lola: 37888049 markings, 41649972 edges, 122464 markings/sec, 95 secs
lola: 38985559 markings, 42856454 edges, 219502 markings/sec, 100 secs
lola: 39767902 markings, 43716476 edges, 156469 markings/sec, 105 secs
lola: 40793708 markings, 44844138 edges, 205161 markings/sec, 110 secs
lola: 41143094 markings, 45228213 edges, 69877 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown no no no no no yes yes
lola:
preliminary result: yes no unknown no no no no no yes yes
lola: memory consumption: 3640 KB
lola: time consumption: 248 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-030A"
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-030A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478301033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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