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.r178-tajo-158987882500497.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 Diffusion2D-PT-D30N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882500497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.1K Mar 31 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 29 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 22:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 24 05:37 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 Diffusion2D-PT-D30N050-00
FORMULA_NAME Diffusion2D-PT-D30N050-01
FORMULA_NAME Diffusion2D-PT-D30N050-02
FORMULA_NAME Diffusion2D-PT-D30N050-03
FORMULA_NAME Diffusion2D-PT-D30N050-04
FORMULA_NAME Diffusion2D-PT-D30N050-05
FORMULA_NAME Diffusion2D-PT-D30N050-06
FORMULA_NAME Diffusion2D-PT-D30N050-07
FORMULA_NAME Diffusion2D-PT-D30N050-08
FORMULA_NAME Diffusion2D-PT-D30N050-09
FORMULA_NAME Diffusion2D-PT-D30N050-10
FORMULA_NAME Diffusion2D-PT-D30N050-11
FORMULA_NAME Diffusion2D-PT-D30N050-12
FORMULA_NAME Diffusion2D-PT-D30N050-13
FORMULA_NAME Diffusion2D-PT-D30N050-14
FORMULA_NAME Diffusion2D-PT-D30N050-15

=== Now, execution of the tool begins

BK_START 1591224503858

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:48:25] [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-03 22:48:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:48:25] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2020-06-03 22:48:25] [INFO ] Transformed 900 places.
[2020-06-03 22:48:25] [INFO ] Transformed 6844 transitions.
[2020-06-03 22:48:25] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 168 ms. (steps per millisecond=595 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 6844 rows 900 cols
[2020-06-03 22:48:25] [INFO ] Computed 1 place invariants in 54 ms
[2020-06-03 22:48:26] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2020-06-03 22:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:32] [INFO ] [Real]Absence check using state equation in 6627 ms returned sat
[2020-06-03 22:48:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 555 ms.
[2020-06-03 22:48:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:48:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 37 ms returned sat
[2020-06-03 22:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:48:41] [INFO ] [Nat]Absence check using state equation in 6434 ms returned sat
[2020-06-03 22:48:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 572 ms.
[2020-06-03 22:48:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t343 0) (or (and (> t105 0) (< o105 o343)) (and (> t112 0) (< o112 o343)) (and (> t119 0) (< o119 o343)) (and (> t339 0) (< o339 o343)) (and (> t354 0) (< o354 o343)) (and (> t571 0) (< o571 o343)) (and (> t578 0) (< o578 o343)) (and (> t585 0) (< o585 o343))))") while checking expression at index 0
[2020-06-03 22:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 22:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:49:01] [INFO ] [Real]Absence check using state equation in 6090 ms returned sat
[2020-06-03 22:49:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 423 ms.
[2020-06-03 22:49:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:49:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 45 ms returned sat
[2020-06-03 22:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:49:08] [INFO ] [Nat]Absence check using state equation in 6102 ms returned sat
[2020-06-03 22:49:09] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 376 ms.
[2020-06-03 22:49:22] [INFO ] Added : 200 causal constraints over 40 iterations in 13627 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:49:22] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 22:49:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:49:28] [INFO ] [Real]Absence check using state equation in 6100 ms returned sat
[2020-06-03 22:49:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:49:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 54 ms returned sat
[2020-06-03 22:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:49:34] [INFO ] [Nat]Absence check using state equation in 5733 ms returned sat
[2020-06-03 22:49:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 433 ms.
[2020-06-03 22:49:49] [INFO ] Added : 195 causal constraints over 39 iterations in 14021 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:49:49] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 22:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:49:55] [INFO ] [Real]Absence check using state equation in 6410 ms returned sat
[2020-06-03 22:49:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 426 ms.
[2020-06-03 22:49:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:49:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 45 ms returned sat
[2020-06-03 22:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:50:03] [INFO ] [Nat]Absence check using state equation in 6649 ms returned sat
[2020-06-03 22:50:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 324 ms.
[2020-06-03 22:50:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t336 0) (or (and (> t97 0) (< o97 o336)) (and (> t104 0) (< o104 o336)) (and (> t111 0) (< o111 o336)) (and (> t331 0) (< o331 o336)) (and (> t346 0) (< o346 o336)) (and (> t563 0) (< o563 o336)) (and (> t570 0) (< o570 o336)) (and (> t577 0) (< o577 o336))))") while checking expression at index 3
[2020-06-03 22:50:17] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 22:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:50:23] [INFO ] [Real]Absence check using state equation in 5954 ms returned sat
[2020-06-03 22:50:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:50:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 52 ms returned sat
[2020-06-03 22:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:50:29] [INFO ] [Nat]Absence check using state equation in 5651 ms returned sat
[2020-06-03 22:50:29] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 427 ms.
[2020-06-03 22:50:43] [INFO ] Added : 200 causal constraints over 40 iterations in 14085 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 22:50:43] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 22:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:50:49] [INFO ] [Real]Absence check using state equation in 6256 ms returned sat
[2020-06-03 22:50:50] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 442 ms.
[2020-06-03 22:50:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:50:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 43 ms returned sat
[2020-06-03 22:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:50:57] [INFO ] [Nat]Absence check using state equation in 6444 ms returned sat
[2020-06-03 22:50:58] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 452 ms.
[2020-06-03 22:51:11] [INFO ] Added : 210 causal constraints over 42 iterations in 13300 ms. Result :unknown
[2020-06-03 22:51:11] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned unsat
[2020-06-03 22:51:11] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 22:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:51:17] [INFO ] [Real]Absence check using state equation in 6181 ms returned sat
[2020-06-03 22:51:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 366 ms.
[2020-06-03 22:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:51:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 41 ms returned sat
[2020-06-03 22:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:51:25] [INFO ] [Nat]Absence check using state equation in 6090 ms returned sat
[2020-06-03 22:51:25] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 325 ms.
[2020-06-03 22:51:39] [INFO ] Added : 215 causal constraints over 43 iterations in 13745 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:51:39] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned unsat
[2020-06-03 22:51:39] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 22:51:39] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 22:51:39] [INFO ] Flatten gal took : 368 ms
FORMULA Diffusion2D-PT-D30N050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N050-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:51:40] [INFO ] Flatten gal took : 212 ms
[2020-06-03 22:51:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-03 22:51:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D30N050 @ 3570 seconds

FORMULA Diffusion2D-PT-D30N050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3538
rslt: Output for LTLCardinality @ Diffusion2D-PT-D30N050

{
"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": "Wed Jun 3 22:51:40 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((p240 <= p126)) U G ((((2 <= p721) R (p259 + 1 <= p590)) OR F ((p126 + 1 <= p240)))))",
"processed_size": 89,
"rewrites": 73
},
"result":
{
"edges": 1514,
"markings": 1509,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F ((X (F ((G ((p858 <= 0)) OR ((p235 + 1 <= p667) AND (p858 <= 0))))) AND G ((p793 <= p556)))) AND G ((p368 <= 2))))",
"processed_size": 120,
"rewrites": 73
},
"result":
{
"edges": 974586,
"markings": 241173,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (X (F ((p33 + 1 <= p320)))) U (F ((p655 + 1 <= p114)) AND F ((2 <= p879))))",
"processed_size": 78,
"rewrites": 73
},
"result":
{
"edges": 751,
"markings": 751,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((F (G ((2 <= p543))) AND F ((2 <= p543))))))",
"processed_size": 53,
"rewrites": 73
},
"result":
{
"edges": 751,
"markings": 751,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((3 <= p656)))",
"processed_size": 19,
"rewrites": 73
},
"result":
{
"edges": 220,
"markings": 219,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p380 <= 1)))",
"processed_size": 19,
"rewrites": 73
},
"result":
{
"edges": 132038,
"markings": 50050,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((G ((p435 <= p493)) AND (2 <= p407))) AND (2 <= p407)))",
"processed_size": 62,
"rewrites": 73
},
"result":
{
"edges": 165975,
"markings": 66889,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p468 + 1 <= p476)) AND F ((p708 + 1 <= p187))))",
"processed_size": 55,
"rewrites": 73
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 1770
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p468 <= 1)",
"processed_size": 11,
"rewrites": 75
},
"result":
{
"edges": 218,
"markings": 218,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p679 <= p318)",
"processed_size": 14,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p679 <= p318) U ((2 <= p710) U (p790 <= p884)))",
"processed_size": 49,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p679 <= p318)",
"processed_size": 14,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p636 <= p607))",
"processed_size": 18,
"rewrites": 73
},
"result":
{
"edges": 150142,
"markings": 58345,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 70440,
"runtime": 32.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** U (** U **)) AND (G(**) AND **)) : (X(**) U G(((* R *) OR F(*)))) : G((F(*) AND F(*))) : G((F((X(F((G(*) OR (* AND *)))) AND G(**))) AND G(*))) : F(G(**)) : F((G((G(**) AND **)) AND **)) : (F(**) AND G(*)) : (X(X(F(*))) U (F(*) AND F(**))) : X(X(G((F(G(**)) AND F(**))))) : G(F(*))"
},
"net":
{
"arcs": 13688,
"conflict_clusters": 900,
"places": 900,
"places_significant": 899,
"singleton_clusters": 0,
"transitions": 6844
},
"result":
{
"preliminary_value": "no no no no no no no no no no ",
"value": "no no no no no no no no no no "
},
"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: 7744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 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: ((((p679 <= p318) U ((2 <= p710) U (p790 <= p884))) AND G ((p636 <= p607))) AND (p679 <= p318)) : (X ((p240 <= p126)) U NOT(F ((((p721 <= 1) U (p590 <= p259)) AND G ((p240 <= p126)))))) : (NOT(F (X (((p708 + 1 <= p187) U G (X ((p476 <= p468))))))) AND NOT(F (G ((p187 <= p708))))) : G ((F ((X (NOT(G (((p667 <= p235) U (1 <= p858))))) AND G ((p793 <= p556)))) AND NOT(F ((3 <= p368))))) : F (G ((((p827 <= p265) OR (p50 + 1 <= p541)) U F (G ((3 <= p656)))))) : F ((F ((G ((G ((p435 <= p493)) AND (2 <= p407))) AND (2 <= p407))) AND G (((p832 <= p551) U (0 <= 0))))) : (F ((F ((p81 <= p730)) U F ((2 <= p468)))) AND NOT(F ((p866 + 1 <= p326)))) : (X (NOT(G (NOT(F (NOT(X ((p320 <= p33)))))))) U (NOT(G ((p114 <= p655))) AND F ((2 <= p879)))) : G (X (X ((G (X (F (NOT(X (F (NOT(G ((2 <= p543))))))))) AND F ((2 <= p543)))))) : G (X (NOT(G ((2 <= p380)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:329
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: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p240 <= p126)) U G ((((2 <= p721) R (p259 + 1 <= p590)) OR F ((p126 + 1 <= p240)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p240 <= p126)) U G ((((2 <= p721) R (p259 + 1 <= p590)) OR F ((p126 + 1 <= p240)))))
lola: processed formula length: 89
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 1509 markings, 1514 edges
lola: ========================================
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((X (F ((G ((p858 <= 0)) OR ((p235 + 1 <= p667) AND (p858 <= 0))))) AND G ((p793 <= p556)))) AND G ((p368 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((X (F ((G ((p858 <= 0)) OR ((p235 + 1 <= p667) AND (p858 <= 0))))) AND G ((p793 <= p556)))) AND G ((p368 <= 2))))
lola: processed formula length: 120
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 175083 markings, 700829 edges, 35017 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 241173 markings, 974586 edges
lola: ========================================
lola: subprocess 2 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p33 + 1 <= p320)))) U (F ((p655 + 1 <= p114)) AND F ((2 <= p879))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F ((p33 + 1 <= p320)))) U (F ((p655 + 1 <= p114)) AND F ((2 <= p879))))
lola: processed formula length: 78
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 751 markings, 751 edges
lola: ========================================
lola: subprocess 3 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (G ((2 <= p543))) AND F ((2 <= p543))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (G ((2 <= p543))) AND F ((2 <= p543))))))
lola: processed formula length: 53
lola: 73 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 751 markings, 751 edges
lola: ========================================
lola: subprocess 4 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p656)))
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 ((3 <= p656)))
lola: processed formula length: 19
lola: 73 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: 219 markings, 220 edges
lola: ========================================
lola: subprocess 5 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p380 <= 1)))
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 ((p380 <= 1)))
lola: processed formula length: 19
lola: 73 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: 50050 markings, 132038 edges
lola: ========================================
lola: subprocess 6 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((G ((p435 <= p493)) AND (2 <= p407))) AND (2 <= p407)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G ((p435 <= p493)) AND (2 <= p407))) AND (2 <= p407)))
lola: processed formula length: 62
lola: 73 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: 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: add low 4445
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: 66889 markings, 165975 edges
lola: ========================================
lola: subprocess 7 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p468 + 1 <= p476)) AND F ((p708 + 1 <= p187))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p468 + 1 <= p476)) AND F ((p708 + 1 <= p187))))
lola: processed formula length: 55
lola: 73 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((2 <= p468)) AND G ((p326 <= p866)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p468))
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: (p468 <= 1)
lola: processed formula length: 11
lola: 75 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 218 markings, 218 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p679 <= p318) U ((2 <= p710) U (p790 <= p884))) AND (G ((p636 <= p607)) AND (p679 <= p318)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p679 <= p318)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p679 <= p318)
lola: processed formula length: 14
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: 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: ((p679 <= p318) U ((2 <= p710) U (p790 <= p884)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p679 <= p318) U ((2 <= p710) U (p790 <= p884)))
lola: processed formula length: 49
lola: 73 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p679 <= p318) U ((2 <= p710) U (p790 <= p884))) AND (G ((p636 <= p607)) AND (p679 <= p318)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p679 <= p318)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p679 <= p318)
lola: processed formula length: 14
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: G ((p636 <= p607))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p636 <= p607))
lola: processed formula length: 18
lola: 73 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: 58345 markings, 150142 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no
lola: memory consumption: 70440 KB
lola: time consumption: 32 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="Diffusion2D-PT-D30N050"
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 Diffusion2D-PT-D30N050, 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 r178-tajo-158987882500497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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