fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987882500514
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Diffusion2D-PT-D30N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15738.610 3600000.00 541024.00 404.50 FFFFFFFFFTFTFFTT normal

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-158987882500514.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-D30N150, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882500514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.6K Mar 31 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 22:55 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.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.6K Mar 27 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-D30N150-00
FORMULA_NAME Diffusion2D-PT-D30N150-01
FORMULA_NAME Diffusion2D-PT-D30N150-02
FORMULA_NAME Diffusion2D-PT-D30N150-03
FORMULA_NAME Diffusion2D-PT-D30N150-04
FORMULA_NAME Diffusion2D-PT-D30N150-05
FORMULA_NAME Diffusion2D-PT-D30N150-06
FORMULA_NAME Diffusion2D-PT-D30N150-07
FORMULA_NAME Diffusion2D-PT-D30N150-08
FORMULA_NAME Diffusion2D-PT-D30N150-09
FORMULA_NAME Diffusion2D-PT-D30N150-10
FORMULA_NAME Diffusion2D-PT-D30N150-11
FORMULA_NAME Diffusion2D-PT-D30N150-12
FORMULA_NAME Diffusion2D-PT-D30N150-13
FORMULA_NAME Diffusion2D-PT-D30N150-14
FORMULA_NAME Diffusion2D-PT-D30N150-15

=== Now, execution of the tool begins

BK_START 1591225121026

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:58:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 22:58:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:58:43] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2020-06-03 22:58:43] [INFO ] Transformed 900 places.
[2020-06-03 22:58:43] [INFO ] Transformed 6844 transitions.
[2020-06-03 22:58:43] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100026 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=1538 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 6844 rows 900 cols
[2020-06-03 22:58:44] [INFO ] Computed 1 place invariants in 66 ms
[2020-06-03 22:58:44] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 22:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:58:52] [INFO ] [Real]Absence check using state equation in 7936 ms returned sat
[2020-06-03 22:58:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 456 ms.
[2020-06-03 22:58:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:58:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2020-06-03 22:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:03] [INFO ] [Nat]Absence check using state equation in 8751 ms returned sat
[2020-06-03 22:59:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 494 ms.
[2020-06-03 22:59:14] [INFO ] Added : 145 causal constraints over 29 iterations in 11050 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:59:14] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 22:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:21] [INFO ] [Real]Absence check using state equation in 6648 ms returned sat
[2020-06-03 22:59:21] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 423 ms.
[2020-06-03 22:59:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 44 ms returned sat
[2020-06-03 22:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:29] [INFO ] [Nat]Absence check using state equation in 6658 ms returned sat
[2020-06-03 22:59:29] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 479 ms.
[2020-06-03 22:59:42] [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 (=> (> t331 0) (or (and (> t89 0) (< o89 o331)) (and (> t96 0) (< o96 o331)) (and (> t103 0) (< o103 o331)) (and (> t323 0) (< o323 o331)) (and (> t338 0) (< o338 o331)) (and (> t555 0) (< o555 o331)) (and (> t562 0) (< o562 o331)) (and (> t569 0) (< o569 o331))))") while checking expression at index 1
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:53] [INFO ] [Real]Absence check using state equation in 11086 ms returned sat
[2020-06-03 22:59:54] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 457 ms.
[2020-06-03 22:59:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 45 ms returned sat
[2020-06-03 22:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:02] [INFO ] [Nat]Absence check using state equation in 6885 ms returned sat
[2020-06-03 23:00:02] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 384 ms.
[2020-06-03 23:00:15] [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 (=> (> t314 0) (or (and (> t81 0) (< o81 o314)) (and (> t167 0) (< o167 o314)) (and (> t402 0) (< o402 o314)) (and (> t548 0) (< o548 o314)) (and (> t633 0) (< o633 o314))))") while checking expression at index 2
[2020-06-03 23:00:15] [INFO ] [Real]Absence check using 1 positive place invariants in 29 ms returned sat
[2020-06-03 23:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:23] [INFO ] [Real]Absence check using state equation in 7528 ms returned sat
[2020-06-03 23:00:23] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 507 ms.
[2020-06-03 23:00:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:00:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 79 ms returned sat
[2020-06-03 23:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:34] [INFO ] [Nat]Absence check using state equation in 9582 ms returned sat
[2020-06-03 23:00:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 608 ms.
[2020-06-03 23:00:44] [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 (=> (> t240 0) (or (and (> t2 0) (< o2 o240)) (and (> t10 0) (< o10 o240)) (and (> t228 0) (< o228 o240)) (and (> t245 0) (< o245 o240)) (and (> t463 0) (< o463 o240)) (and (> t468 0) (< o468 o240)) (and (> t476 0) (< o476 o240)) (and (> t694 0) (< o694 o240))))") while checking expression at index 3
[2020-06-03 23:00:44] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-06-03 23:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:52] [INFO ] [Real]Absence check using state equation in 7877 ms returned sat
[2020-06-03 23:00:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 599 ms.
[2020-06-03 23:00:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:00:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 41 ms returned sat
[2020-06-03 23:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:01] [INFO ] [Nat]Absence check using state equation in 6845 ms returned sat
[2020-06-03 23:01:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 454 ms.
[2020-06-03 23:01:14] [INFO ] Added : 190 causal constraints over 38 iterations in 12874 ms. Result :(error "Failed to check-sat")
[2020-06-03 23:01:14] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-06-03 23:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:21] [INFO ] [Real]Absence check using state equation in 6977 ms returned sat
[2020-06-03 23:01:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 476 ms.
[2020-06-03 23:01:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:01:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 45 ms returned sat
[2020-06-03 23:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:30] [INFO ] [Nat]Absence check using state equation in 7289 ms returned sat
[2020-06-03 23:01:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 445 ms.
[2020-06-03 23:01:43] [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 (=> (> t97 0) (or (and (> t86 0) (< o86 o97)) (and (> t101 0) (< o101 o97)) (and (> t321 0) (< o321 o97)) (and (> t328 0) (< o328 o97)) (and (> t335 0) (< o335 o97)) (and (> t6697 0) (< o6697 o97)) (and (> t6704 0) (< o6704 o97)) (and (> t6711 0) (< o6711 o97))))") while checking expression at index 5
[2020-06-03 23:01:43] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-06-03 23:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:51] [INFO ] [Real]Absence check using state equation in 8202 ms returned sat
[2020-06-03 23:01:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 393 ms.
[2020-06-03 23:01:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:01:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 80 ms returned sat
[2020-06-03 23:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:02] [INFO ] [Nat]Absence check using state equation in 10074 ms returned sat
[2020-06-03 23:02:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 368 ms.
[2020-06-03 23:02:12] [INFO ] Added : 175 causal constraints over 35 iterations in 9618 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 23:02:12] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 23:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:18] [INFO ] [Real]Absence check using state equation in 6209 ms returned sat
[2020-06-03 23:02:19] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 361 ms.
[2020-06-03 23:02:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:02:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 42 ms returned sat
[2020-06-03 23:02:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:28] [INFO ] [Nat]Absence check using state equation in 7853 ms returned sat
[2020-06-03 23:02:28] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 391 ms.
[2020-06-03 23:02:40] [INFO ] Added : 180 causal constraints over 36 iterations in 11904 ms. Result :(error "Failed to check-sat")
[2020-06-03 23:02:40] [INFO ] [Real]Absence check using 1 positive place invariants in 29 ms returned sat
[2020-06-03 23:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:49] [INFO ] [Real]Absence check using state equation in 8648 ms returned sat
[2020-06-03 23:02:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 439 ms.
[2020-06-03 23:02:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:02:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 67 ms returned sat
[2020-06-03 23:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:03] [INFO ] [Nat]Absence check using state equation in 12341 ms returned sat
[2020-06-03 23:03:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 379 ms.
[2020-06-03 23:03:10] [INFO ] Added : 100 causal constraints over 20 iterations in 7374 ms. Result :unknown
[2020-06-03 23:03:11] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 23:03:11] [INFO ] Flatten gal took : 440 ms
FORMULA Diffusion2D-PT-D30N150-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:03:11] [INFO ] Flatten gal took : 215 ms
[2020-06-03 23:03:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2020-06-03 23:03:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 54 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Diffusion2D-PT-D30N150 @ 3570 seconds

FORMULA Diffusion2D-PT-D30N150-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Diffusion2D-PT-D30N150-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Diffusion2D-PT-D30N150-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA Diffusion2D-PT-D30N150-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2799
rslt: Output for LTLFireability @ Diffusion2D-PT-D30N150

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:03:12 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p853) OR (p181 <= 0)) R (F ((p333 <= 0)) AND (p333 <= 0))))",
"processed_size": 71,
"rewrites": 65
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (F (((1 <= p756) AND (p97 <= 0)))) AND (1 <= p756)) U X ((1 <= p576)))",
"processed_size": 74,
"rewrites": 65
},
"result":
{
"edges": 2251,
"markings": 2251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((X ((F ((p727 <= 0)) OR (p727 <= 0))) AND (1 <= p205)) OR ((p727 <= 0) OR (p354 <= 0))))",
"processed_size": 92,
"rewrites": 65
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 6,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((G ((F ((p511 <= 0)) OR (p511 <= 0))) AND (p511 <= 0))) AND ((1 <= p679) OR X ((G ((F ((p511 <= 0)) OR (p511 <= 0))) AND (p511 <= 0))))))))",
"processed_size": 152,
"rewrites": 65
},
"result":
{
"edges": 15797589,
"markings": 3804996,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 484
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X ((X (X (G ((p497 <= 0)))) OR F (((p497 <= 0) AND (p603 <= 0)))))))",
"processed_size": 74,
"rewrites": 65
},
"result":
{
"edges": 1328,
"markings": 403,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 565
},
"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 ((1 <= p615)))",
"processed_size": 19,
"rewrites": 65
},
"result":
{
"edges": 620,
"markings": 619,
"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": 707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (((1 <= p300) AND (1 <= p490))))",
"processed_size": 37,
"rewrites": 65
},
"result":
{
"edges": 620,
"markings": 619,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 943
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F (G ((1 <= p612))) OR ((p694 <= 0) OR (1 <= p612))))",
"processed_size": 57,
"rewrites": 65
},
"result":
{
"edges": 1124318,
"markings": 374401,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1409
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G (F ((p582 <= 0))) OR F ((1 <= p263))))",
"processed_size": 44,
"rewrites": 65
},
"result":
{
"edges": 1193325,
"markings": 413176,
"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": 2806
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((p651 <= 0)) AND (1 <= p574))))",
"processed_size": 41,
"rewrites": 65
},
"result":
{
"edges": 787191,
"markings": 230429,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(1 <= p897)",
"processed_size": 11,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((X ((p818 <= 0)) AND (p142 <= 0)))))",
"processed_size": 45,
"rewrites": 65
},
"result":
{
"edges": 1328,
"markings": 403,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 70344,
"runtime": 771.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((G(F(**)) OR F(**))) : G(F((G(*) AND **))) : G((F(G(**)) OR (** OR **))) : F(G(**)) : X((* R (F(*) AND *))) : ((X(F(**)) AND **) U X(**)) : X(((X((F(*) OR **)) AND *) OR (* OR *))) : F(G(**)) : X(X(G((F((G((F(*) OR *)) AND *)) AND (** OR X((G((F(*) OR *)) AND *))))))) : X(X(X((X(X(G(**))) OR F(**))))) : (X(X(F((X(*) AND *)))) OR (X(**) AND **))"
},
"net":
{
"arcs": 13688,
"conflict_clusters": 900,
"places": 900,
"places_significant": 899,
"singleton_clusters": 0,
"transitions": 6844
},
"result":
{
"preliminary_value": "no no no no yes no yes no no yes yes ",
"value": "no no no no yes no yes 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: 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 LTLFireability.xml
lola: F ((G (X (F ((p582 <= 0)))) OR F ((1 <= p263)))) : G (F (X ((NOT(F ((1 <= p651))) AND (1 <= p574))))) : G (((X (X (F (G ((1 <= p612))))) OR (p694 <= 0)) OR (1 <= p612))) : F (G (X (((1 <= p300) AND (1 <= p490))))) : X (NOT((((p853 <= 0) AND (1 <= p181)) U (G ((1 <= p333)) OR (1 <= p333))))) : ((F (X (((1 <= p756) AND (p97 <= 0)))) AND (1 <= p756)) U X ((1 <= p576))) : NOT(X ((((NOT(X ((NOT(G ((1 <= p727))) OR (p727 <= 0)))) OR (p205 <= 0)) AND (1 <= p727)) AND (1 <= p354)))) : F (G (F (G ((1 <= p615))))) : X (X (G (((1 <= p679) U NOT(X ((F ((G ((1 <= p511)) AND (1 <= p511))) OR (1 <= p511)))))))) : X (X ((X (X (G (X ((p497 <= 0))))) OR F (X (((p497 <= 0) AND (p603 <= 0))))))) : (X (NOT(G (X ((X ((1 <= p818)) OR (1 <= p142)))))) OR (X ((1 <= p897)) AND (1 <= p897)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p853) OR (p181 <= 0)) R (F ((p333 <= 0)) AND (p333 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p853) OR (p181 <= 0)) R (F ((p333 <= 0)) AND (p333 <= 0))))
lola: processed formula length: 71
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F (((1 <= p756) AND (p97 <= 0)))) AND (1 <= p756)) U X ((1 <= p576)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (F (((1 <= p756) AND (p97 <= 0)))) AND (1 <= p756)) U X ((1 <= p576)))
lola: processed formula length: 74
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 2251 markings, 2251 edges
lola: ========================================
lola: subprocess 2 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X ((F ((p727 <= 0)) OR (p727 <= 0))) AND (1 <= p205)) OR ((p727 <= 0) OR (p354 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X ((F ((p727 <= 0)) OR (p727 <= 0))) AND (1 <= p205)) OR ((p727 <= 0) OR (p354 <= 0))))
lola: processed formula length: 92
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((G ((F ((p511 <= 0)) OR (p511 <= 0))) AND (p511 <= 0))) AND ((1 <= p679) OR X ((G ((F ((p511 <= 0)) OR (p511 <= 0))) AND (p511 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((G ((F ((p511 <= 0)) OR (p511 <= 0))) AND (p511 <= 0))) AND ((1 <= p679) OR X ((G ((F ((p511 <= 0)) OR (p511 <= 0))) AND (p511 <= 0))))))))
lola: processed formula length: 152
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 171059 markings, 620729 edges, 34212 markings/sec, 0 secs
lola: 327292 markings, 1266571 edges, 31247 markings/sec, 5 secs
lola: 486550 markings, 1925255 edges, 31852 markings/sec, 10 secs
lola: 639041 markings, 2538843 edges, 30498 markings/sec, 15 secs
lola: 764869 markings, 3055707 edges, 25166 markings/sec, 20 secs
lola: 886977 markings, 3544438 edges, 24422 markings/sec, 25 secs
lola: 1002042 markings, 4011198 edges, 23013 markings/sec, 30 secs
lola: 1115067 markings, 4478218 edges, 22605 markings/sec, 35 secs
lola: 1234556 markings, 4969195 edges, 23898 markings/sec, 40 secs
lola: 1354085 markings, 5459510 edges, 23906 markings/sec, 45 secs
lola: 1455464 markings, 5876442 edges, 20276 markings/sec, 50 secs
lola: 1563052 markings, 6324711 edges, 21518 markings/sec, 55 secs
lola: 1668608 markings, 6766718 edges, 21111 markings/sec, 60 secs
lola: 1784781 markings, 7252921 edges, 23235 markings/sec, 65 secs
lola: 1880122 markings, 7654135 edges, 19068 markings/sec, 70 secs
lola: 1987062 markings, 8102251 edges, 21388 markings/sec, 75 secs
lola: 2092692 markings, 8547284 edges, 21126 markings/sec, 80 secs
lola: 2205990 markings, 9026302 edges, 22660 markings/sec, 85 secs
lola: 2316800 markings, 9502000 edges, 22162 markings/sec, 90 secs
lola: 2420399 markings, 9942093 edges, 20720 markings/sec, 95 secs
lola: 2535916 markings, 10427924 edges, 23103 markings/sec, 100 secs
lola: 2655599 markings, 10934735 edges, 23937 markings/sec, 105 secs
lola: 2770696 markings, 11416465 edges, 23019 markings/sec, 110 secs
lola: 2869303 markings, 11828863 edges, 19721 markings/sec, 115 secs
lola: 2978138 markings, 12291250 edges, 21767 markings/sec, 120 secs
lola: 3095003 markings, 12788270 edges, 23373 markings/sec, 125 secs
lola: 3216924 markings, 13306051 edges, 24384 markings/sec, 130 secs
lola: 3324121 markings, 13759709 edges, 21439 markings/sec, 135 secs
lola: 3436667 markings, 14234094 edges, 22509 markings/sec, 140 secs
lola: 3548154 markings, 14705375 edges, 22297 markings/sec, 145 secs
lola: 3664335 markings, 15196333 edges, 23236 markings/sec, 150 secs
lola: 3778660 markings, 15685680 edges, 22865 markings/sec, 155 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: 3804996 markings, 15797589 edges
lola: ========================================
lola: subprocess 4 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((X (X (G ((p497 <= 0)))) OR F (((p497 <= 0) AND (p603 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((X (X (G ((p497 <= 0)))) OR F (((p497 <= 0) AND (p603 <= 0)))))))
lola: processed formula length: 74
lola: 65 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 403 markings, 1328 edges
lola: ========================================
lola: subprocess 5 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((X ((p818 <= 0)) AND (p142 <= 0))))) OR (X ((1 <= p897)) AND (1 <= p897)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes no yes unknown no yes unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 69884 KB
lola: time consumption: 741 seconds
lola: print data as JSON (--json)
lola: caught signal User defined signal 2 - aborting LoLA
lola: writing JSON to LTLFireability.json
lola:
preliminary result: unknown unknown unknown unknown yes no yes unknown no yes unknown
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p615)))
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 <= p615)))
lola: processed formula length: 19
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 619 markings, 620 edges
lola: ========================================
lola: subprocess 7 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p300) AND (1 <= p490))))
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 <= p300) AND (1 <= p490))))
lola: processed formula length: 37
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 619 markings, 620 edges
lola: ========================================
lola: subprocess 8 will run for 943 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((1 <= p612))) OR ((p694 <= 0) OR (1 <= p612))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((1 <= p612))) OR ((p694 <= 0) OR (1 <= p612))))
lola: processed formula length: 57
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 194765 markings, 515024 edges, 38953 markings/sec, 0 secs
lola: 346350 markings, 1027560 edges, 30317 markings/sec, 5 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: 374401 markings, 1124318 edges
lola: ========================================
lola: subprocess 9 will run for 1409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((p582 <= 0))) OR F ((1 <= p263))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p582 <= 0))) OR F ((1 <= p263))))
lola: processed formula length: 44
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 202103 markings, 519590 edges, 40421 markings/sec, 0 secs
lola: 362903 markings, 1030862 edges, 32160 markings/sec, 5 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: 413176 markings, 1193325 edges
lola: ========================================
lola: subprocess 10 will run for 2806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p651 <= 0)) AND (1 <= p574))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p651 <= 0)) AND (1 <= p574))))
lola: processed formula length: 41
lola: 65 rewrites
lola: closed formula file LTLFireability.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: 190352 markings, 560963 edges, 38070 markings/sec, 0 secs
lola: add low 432
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: 230429 markings, 787191 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (X (F ((X ((p818 <= 0)) AND (p142 <= 0))))) OR (X ((1 <= p897)) AND (1 <= p897)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p897)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p897)
lola: processed formula length: 11
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (F ((X ((p818 <= 0)) AND (p142 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X ((p818 <= 0)) AND (p142 <= 0)))))
lola: processed formula length: 45
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 403 markings, 1328 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: no no no no yes no yes no no yes yes
lola:
preliminary result: no no no no yes no yes no no yes yes
lola: ========================================
lola: memory consumption: 70344 KB
lola: time consumption: 771 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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-D30N150"
export BK_EXAMINATION="LTLFireability"
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-D30N150, examination is LTLFireability"
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-158987882500514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;