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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.9M
-rw-r--r-- 1 mcc users 4.2K Mar 31 06:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 29 22:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 29 22:56 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.3K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:32 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 4.7M 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-D40N150-00
FORMULA_NAME Diffusion2D-PT-D40N150-01
FORMULA_NAME Diffusion2D-PT-D40N150-02
FORMULA_NAME Diffusion2D-PT-D40N150-03
FORMULA_NAME Diffusion2D-PT-D40N150-04
FORMULA_NAME Diffusion2D-PT-D40N150-05
FORMULA_NAME Diffusion2D-PT-D40N150-06
FORMULA_NAME Diffusion2D-PT-D40N150-07
FORMULA_NAME Diffusion2D-PT-D40N150-08
FORMULA_NAME Diffusion2D-PT-D40N150-09
FORMULA_NAME Diffusion2D-PT-D40N150-10
FORMULA_NAME Diffusion2D-PT-D40N150-11
FORMULA_NAME Diffusion2D-PT-D40N150-12
FORMULA_NAME Diffusion2D-PT-D40N150-13
FORMULA_NAME Diffusion2D-PT-D40N150-14
FORMULA_NAME Diffusion2D-PT-D40N150-15

=== Now, execution of the tool begins

BK_START 1591226965687

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:29:28] [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 23:29:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:29:29] [INFO ] Load time of PNML (sax parser for PT used): 524 ms
[2020-06-03 23:29:29] [INFO ] Transformed 1600 places.
[2020-06-03 23:29:29] [INFO ] Transformed 12324 transitions.
[2020-06-03 23:29:29] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 672 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 170 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100123 steps, including 0 resets, run finished after 198 ms. (steps per millisecond=505 ) properties seen :[0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0]
// Phase 1: matrix 12324 rows 1600 cols
[2020-06-03 23:29:30] [INFO ] Computed 1 place invariants in 331 ms
[2020-06-03 23:29:30] [INFO ] [Real]Absence check using 1 positive place invariants in 33 ms returned sat
[2020-06-03 23:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:29:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:29:50] [INFO ] [Real]Absence check using state equation in 19408 ms returned (error "Failed to check-sat")
[2020-06-03 23:29:50] [INFO ] [Real]Absence check using 1 positive place invariants in 64 ms returned sat
[2020-06-03 23:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:30:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:30:10] [INFO ] [Real]Absence check using state equation in 19817 ms returned (error "Failed to check-sat")
[2020-06-03 23:30:10] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2020-06-03 23:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:30:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:30:30] [INFO ] [Real]Absence check using state equation in 19799 ms returned unknown
[2020-06-03 23:30:30] [INFO ] [Real]Absence check using 1 positive place invariants in 42 ms returned sat
[2020-06-03 23:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:30:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:30:50] [INFO ] [Real]Absence check using state equation in 19788 ms returned (error "Failed to check-sat")
[2020-06-03 23:30:50] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 23:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:31:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:31:10] [INFO ] [Real]Absence check using state equation in 19833 ms returned (error "Failed to check-sat")
[2020-06-03 23:31:10] [INFO ] [Real]Absence check using 1 positive place invariants in 61 ms returned sat
[2020-06-03 23:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:31:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:31:30] [INFO ] [Real]Absence check using state equation in 19762 ms returned (error "Failed to check-sat")
[2020-06-03 23:31:30] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2020-06-03 23:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:31:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:31:50] [INFO ] [Real]Absence check using state equation in 19795 ms returned (error "Failed to check-sat")
[2020-06-03 23:31:50] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-06-03 23:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:32:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:32:10] [INFO ] [Real]Absence check using state equation in 19826 ms returned (error "Failed to check-sat")
[2020-06-03 23:32:10] [INFO ] [Real]Absence check using 1 positive place invariants in 29 ms returned sat
[2020-06-03 23:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:32:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:32:30] [INFO ] [Real]Absence check using state equation in 19825 ms returned (error "Failed to check-sat")
[2020-06-03 23:32:30] [INFO ] [Real]Absence check using 1 positive place invariants in 41 ms returned sat
[2020-06-03 23:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:32:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:32:50] [INFO ] [Real]Absence check using state equation in 19614 ms returned (error "Failed to check-sat")
[2020-06-03 23:32:50] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned unsat
[2020-06-03 23:32:50] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2020-06-03 23:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:33:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:33:10] [INFO ] [Real]Absence check using state equation in 19826 ms returned (error "Failed to check-sat")
[2020-06-03 23:33:10] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned unsat
[2020-06-03 23:33:11] [INFO ] [Real]Absence check using 1 positive place invariants in 30 ms returned sat
[2020-06-03 23:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:33:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:33:31] [INFO ] [Real]Absence check using state equation in 19868 ms returned unknown
[2020-06-03 23:33:31] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-06-03 23:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:33:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:33:51] [INFO ] [Real]Absence check using state equation in 19822 ms returned (error "Failed to check-sat")
[2020-06-03 23:33:51] [INFO ] [Real]Absence check using 1 positive place invariants in 70 ms returned sat
[2020-06-03 23:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:34:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:34:11] [INFO ] [Real]Absence check using state equation in 19693 ms returned (error "Failed to check-sat")
[2020-06-03 23:34:11] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-06-03 23:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:34:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:34:31] [INFO ] [Real]Absence check using state equation in 19784 ms returned (error "Failed to check-sat")
[2020-06-03 23:34:31] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-06-03 23:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:34:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:34:51] [INFO ] [Real]Absence check using state equation in 19777 ms returned unknown
[2020-06-03 23:34:51] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-06-03 23:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:35:11] [INFO ] [Real]Absence check using state equation in 19815 ms returned (error "Failed to check-sat")
[2020-06-03 23:35:11] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2020-06-03 23:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:35:31] [INFO ] [Real]Absence check using state equation in 19828 ms returned (error "Failed to check-sat")
[2020-06-03 23:35:31] [INFO ] [Real]Absence check using 1 positive place invariants in 66 ms returned sat
[2020-06-03 23:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:35:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:35:51] [INFO ] [Real]Absence check using state equation in 19739 ms returned (error "Failed to check-sat")
[2020-06-03 23:35:51] [INFO ] [Real]Absence check using 1 positive place invariants in 42 ms returned sat
[2020-06-03 23:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:11] [INFO ] [Real]Absence check using state equation in 19843 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 23:36:11] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 23:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:36:31] [INFO ] [Real]Absence check using state equation in 19805 ms returned (error "Failed to check-sat")
[2020-06-03 23:36:31] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-06-03 23:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:36:51] [INFO ] [Real]Absence check using state equation in 19870 ms returned (error "Failed to check-sat")
[2020-06-03 23:36:51] [INFO ] [Real]Absence check using 1 positive place invariants in 29 ms returned sat
[2020-06-03 23:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:37:11] [INFO ] [Real]Absence check using state equation in 19783 ms returned (error "Failed to check-sat")
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 23:37:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 23:37:12] [INFO ] Flatten gal took : 595 ms
FORMULA Diffusion2D-PT-D40N150-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N150-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:37:12] [INFO ] Flatten gal took : 302 ms
[2020-06-03 23:37:12] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 23:37:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 99 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D40N150 @ 3570 seconds

FORMULA Diffusion2D-PT-D40N150-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Diffusion2D-PT-D40N150-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Diffusion2D-PT-D40N150-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3257
rslt: Output for LTLCardinality @ Diffusion2D-PT-D40N150

{
"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 23:37:13 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p1448 <= 2))",
"processed_size": 16,
"rewrites": 105
},
"result":
{
"edges": 9778745,
"markings": 1680979,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((G ((G ((p1507 + 1 <= p736)) OR (p1507 + 1 <= p736))) OR ((p736 <= p1507) AND X (X ((G ((p1507 + 1 <= p736)) OR (p1507 + 1 <= p736))))))))",
"processed_size": 144,
"rewrites": 105
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"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": 277
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"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": "G (((G ((p1208 + 1 <= p1487)) R F ((p1368 + 1 <= p876))) OR ((p1584 <= 2) R X ((p1368 + 1 <= p876)))))",
"processed_size": 102,
"rewrites": 105
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"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": 330
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (G ((p795 <= 0))) AND (p993 + 1 <= p1035))))",
"processed_size": 53,
"rewrites": 105
},
"result":
{
"edges": 2258,
"markings": 2257,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 367
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((p1363 <= p1297)))",
"processed_size": 24,
"rewrites": 105
},
"result":
{
"edges": 1935908,
"markings": 506835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p460 <= 1)",
"processed_size": 11,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 468
},
"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": "(p1148 + 1 <= p1250)",
"processed_size": 20,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 546
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(G ((p460 <= 1)) R ((p97 <= 2)))",
"processed_size": 32,
"rewrites": 105
},
"result":
{
"edges": 517673,
"markings": 207722,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p457 <= p1027)",
"processed_size": 15,
"rewrites": 107
},
"result":
{
"edges": 4651,
"markings": 4651,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 32
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((p457 <= p1027))",
"processed_size": 19,
"rewrites": 105
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 654
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((p279 <= 1)) AND (p1420 <= p633)))",
"processed_size": 41,
"rewrites": 105
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((p1527 <= p350) U (F ((3 <= p1104)) AND (3 <= p1104))) AND X (G ((p1406 <= p901)))))",
"processed_size": 89,
"rewrites": 105
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"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": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p738 <= p1366) U (G ((1 <= p1037)) OR (((F ((p1258 <= 0)) AND (p1037 <= 0)) U X ((1 <= p1037))) OR (1 <= p1037))))",
"processed_size": 116,
"rewrites": 105
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"compoundnumber": 9,
"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": 818
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p1165 + 1 <= p627) OR (p350 + 1 <= p1041))))",
"processed_size": 53,
"rewrites": 105
},
"result":
{
"edges": 4653,
"markings": 4652,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1091
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p1393 <= p856)) AND ((p1267 <= p735) OR (p1393 <= p856)))))",
"processed_size": 70,
"rewrites": 105
},
"result":
{
"edges": 482487,
"markings": 183808,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1632
},
"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": 107
},
"result":
{
"edges": 4651,
"markings": 4651,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p1266 + 1 <= p926)) AND ((F ((3 <= p196)) AND (2 <= p468)) OR (p1266 + 1 <= p926))))",
"processed_size": 92,
"rewrites": 105
},
"result":
{
"edges": 4651,
"markings": 4651,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280)))))",
"processed_size": 77,
"rewrites": 105
},
"result":
{
"edges": 4655,
"markings": 4654,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"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": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280)))))",
"processed_size": 77,
"rewrites": 105
},
"result":
{
"edges": 4655,
"markings": 4654,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p1595 <= p570)) OR (G ((p1467 <= p1001)) AND F ((p1595 <= p570)))))",
"processed_size": 75,
"rewrites": 105
},
"result":
{
"edges": 477238,
"markings": 185698,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"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": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 145108,
"runtime": 313.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(((* R *) AND X(G(*)))) AND G(*)) : X(F((G((G(*) OR **)) OR (* AND X(X((G(*) OR **))))))) : (G((F(**) AND (X(**) OR **))) AND X(G((F(G(*)) OR *)))) : G(((G(*) R F(*)) OR (* R X(*)))) : F(G((F(**) AND (** OR **)))) : F(G(*)) : F(G((X(G(*)) AND *))) : (G((F(**) AND ((F(**) AND **) OR **))) OR F(**)) : X(G(**)) : (** OR ((G(*) R *) AND (X(*) AND **))) : (F((X(**) AND **)) AND (F(**) OR X(**))) : ((** U G((F(**) AND (** OR **)))) OR G((F(**) OR (G(**) AND F(**))))) : X(((** U (F(**) AND **)) AND X(G(**)))) : (** U (G(**) OR (((F(*) AND **) U X(**)) OR **)))"
},
"net":
{
"arcs": 24648,
"conflict_clusters": 1600,
"places": 1600,
"places_significant": 1599,
"singleton_clusters": 0,
"transitions": 12324
},
"result":
{
"preliminary_value": "no no no no no no no no no no yes no no no ",
"value": "no no no no no no no no no no yes 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: 13924/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 51200
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 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: (NOT(X ((((3 <= p1448) U (p933 <= p48)) OR F (X ((3 <= p1448)))))) AND NOT(F ((3 <= p1448)))) : F (NOT(G (X (((p1507 + 1 <= p736) U NOT(X (X ((NOT(F ((p736 <= p1507))) OR (p1507 + 1 <= p736)))))))))) : (G ((X ((1 <= p1286)) U (p690 <= p59))) AND NOT(X (F ((X (G (F ((2 <= p1421)))) AND (1 <= p1286)))))) : G (NOT(F (((F (((p876 <= p1368) U (p1487 <= p1208))) U G ((p876 <= p1368))) AND ((3 <= p1584) U X ((p876 <= p1368))))))) : F (G (((p1267 <= p735) U (p1393 <= p856)))) : NOT((X ((G ((p627 <= p1165)) AND (p379 <= p688))) U G (F (((p627 <= p1165) AND (p1041 <= p350)))))) : G (NOT(G (F ((F (X ((1 <= p795))) OR (p1035 <= p993)))))) : (G (((F ((3 <= p196)) AND (2 <= p468)) U (p1266 + 1 <= p926))) OR F ((2 <= p468))) : G (X (G ((p1363 <= p1297)))) : ((p1148 + 1 <= p1250) OR ((NOT((((0 <= 0) U (2 <= p460)) U ((3 <= p97)))) AND NOT(X ((2 <= p460)))) AND (p460 <= 1))) : (F ((X ((p279 <= 1)) AND (p1420 <= p633))) AND (F ((p1027 + 1 <= p457)) OR X ((p457 <= p1027)))) : (((p1595 <= p570) U G (((p517 <= p892) U (2 <= p280)))) OR G ((G ((p1467 <= p1001)) U F ((p1595 <= p570))))) : X ((((p1527 <= p350) U (F ((3 <= p1104)) AND (3 <= p1104))) AND G (X ((p1406 <= p901))))) : ((p738 <= p1366) U ((G ((1 <= p1037)) OR ((NOT(G ((1 <= p1258))) AND (p1037 <= 0)) U X ((1 <= p1037)))) OR (1 <= p1037)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
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:338
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p1448 <= 2) R (p48 + 1 <= p933)) AND X (G ((p1448 <= 2))))) AND G ((p1448 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1448 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1448 <= 2))
lola: processed formula length: 16
lola: 105 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: 117688 markings, 281018 edges, 23538 markings/sec, 0 secs
lola: 216364 markings, 609354 edges, 19735 markings/sec, 5 secs
lola: 289728 markings, 968602 edges, 14673 markings/sec, 10 secs
lola: 355335 markings, 1325292 edges, 13121 markings/sec, 15 secs
lola: 418904 markings, 1674080 edges, 12714 markings/sec, 20 secs
lola: 492969 markings, 2011232 edges, 14813 markings/sec, 25 secs
lola: 544594 markings, 2355949 edges, 10325 markings/sec, 30 secs
lola: 596219 markings, 2699359 edges, 10325 markings/sec, 35 secs
lola: 647844 markings, 3042370 edges, 10325 markings/sec, 40 secs
lola: 699105 markings, 3385022 edges, 10252 markings/sec, 45 secs
lola: 749703 markings, 3710463 edges, 10120 markings/sec, 50 secs
lola: 794341 markings, 4002656 edges, 8928 markings/sec, 55 secs
lola: 838858 markings, 4292115 edges, 8903 markings/sec, 60 secs
lola: 883375 markings, 4580469 edges, 8903 markings/sec, 65 secs
lola: 932989 markings, 4902256 edges, 9923 markings/sec, 70 secs
lola: 985301 markings, 5239314 edges, 10462 markings/sec, 75 secs
lola: 1037054 markings, 5575143 edges, 10351 markings/sec, 80 secs
lola: 1088929 markings, 5913786 edges, 10375 markings/sec, 85 secs
lola: 1141171 markings, 6253473 edges, 10448 markings/sec, 90 secs
lola: 1194292 markings, 6596012 edges, 10624 markings/sec, 95 secs
lola: 1247118 markings, 6937722 edges, 10565 markings/sec, 100 secs
lola: 1299969 markings, 7279513 edges, 10570 markings/sec, 105 secs
lola: 1352507 markings, 7620237 edges, 10508 markings/sec, 110 secs
lola: 1405433 markings, 7963561 edges, 10585 markings/sec, 115 secs
lola: 1456232 markings, 8296944 edges, 10160 markings/sec, 120 secs
lola: 1506881 markings, 8628838 edges, 10130 markings/sec, 125 secs
lola: 1557299 markings, 8961248 edges, 10084 markings/sec, 130 secs
lola: 1604461 markings, 9269071 edges, 9432 markings/sec, 135 secs
lola: 1653251 markings, 9588221 edges, 9758 markings/sec, 140 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: 1680979 markings, 9778745 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((G ((p1507 + 1 <= p736)) OR (p1507 + 1 <= p736))) OR ((p736 <= p1507) AND X (X ((G ((p1507 + 1 <= p736)) OR (p1507 + 1 <= p736))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((G ((p1507 + 1 <= p736)) OR (p1507 + 1 <= p736))) OR ((p736 <= p1507) AND X (X ((G ((p1507 + 1 <= p736)) OR (p1507 + 1 <= p736))))))))
lola: processed formula length: 144
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 29 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 2 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((p690 <= p59)) AND (X ((1 <= p1286)) OR (p690 <= p59)))) AND X (G ((F (G ((p1421 <= 1))) OR (p1286 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p690 <= p59)) AND (X ((1 <= p1286)) OR (p690 <= p59))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p690 <= p59)) AND (X ((1 <= p1286)) OR (p690 <= p59))))
lola: processed formula length: 63
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 118400 markings, 430188 edges, 23680 markings/sec, 0 secs
lola: 234409 markings, 862337 edges, 23202 markings/sec, 5 secs
lola: 342478 markings, 1285783 edges, 21614 markings/sec, 10 secs
lola: 450655 markings, 1703932 edges, 21635 markings/sec, 15 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: 506074 markings, 1932696 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((p1208 + 1 <= p1487)) R F ((p1368 + 1 <= p876))) OR ((p1584 <= 2) R X ((p1368 + 1 <= p876)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p1208 + 1 <= p1487)) R F ((p1368 + 1 <= p876))) OR ((p1584 <= 2) R X ((p1368 + 1 <= p876)))))
lola: processed formula length: 102
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 20 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 4 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G ((p795 <= 0))) AND (p993 + 1 <= p1035))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G ((p795 <= 0))) AND (p993 + 1 <= p1035))))
lola: processed formula length: 53
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 11525
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: 2257 markings, 2258 edges
lola: ========================================
lola: subprocess 5 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p1363 <= p1297)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p1363 <= p1297)))
lola: processed formula length: 24
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 111763 markings, 405554 edges, 22353 markings/sec, 0 secs
lola: 219182 markings, 805349 edges, 21484 markings/sec, 5 secs
lola: 326425 markings, 1224514 edges, 21449 markings/sec, 10 secs
lola: 435546 markings, 1641589 edges, 21824 markings/sec, 15 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: 506835 markings, 1935908 edges
lola: ========================================
lola: subprocess 6 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1148 + 1 <= p1250) OR ((G ((p460 <= 1)) R ((p97 <= 2))) AND (X ((p460 <= 1)) AND (p460 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p460 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p460 <= 1)
lola: processed formula length: 11
lola: 105 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: subprocess 7 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1148 + 1 <= p1250)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1148 + 1 <= p1250)
lola: processed formula length: 20
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p460 <= 1)) R ((p97 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G ((p460 <= 1)) R ((p97 <= 2)))
lola: processed formula length: 32
lola: 105 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: 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: 145852 markings, 331323 edges, 29170 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: 207722 markings, 517673 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p279 <= 1)) AND (p1420 <= p633))) AND (F ((p1027 + 1 <= p457)) OR X ((p457 <= p1027))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p1027 + 1 <= p457))
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: (p457 <= p1027)
lola: processed formula length: 15
lola: 107 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: 4651 markings, 4651 edges
lola: subprocess 8 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p457 <= p1027))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p457 <= p1027))
lola: processed formula length: 19
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
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 9 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p279 <= 1)) AND (p1420 <= p633)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p279 <= 1)) AND (p1420 <= p633)))
lola: processed formula length: 41
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p1527 <= p350) U (F ((3 <= p1104)) AND (3 <= p1104))) AND X (G ((p1406 <= p901)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p1527 <= p350) U (F ((3 <= p1104)) AND (3 <= p1104))) AND X (G ((p1406 <= p901)))))
lola: processed formula length: 89
lola: 105 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 9 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p738 <= p1366) U (G ((1 <= p1037)) OR (((F ((p1258 <= 0)) AND (p1037 <= 0)) U X ((1 <= p1037))) OR (1 <= p1037))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p738 <= p1366) U (G ((1 <= p1037)) OR (((F ((p1258 <= 0)) AND (p1037 <= 0)) U X ((1 <= p1037))) OR (1 <= p1037))))
lola: processed formula length: 116
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 10 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1165 + 1 <= p627) OR (p350 + 1 <= p1041))))
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 (((p1165 + 1 <= p627) OR (p350 + 1 <= p1041))))
lola: processed formula length: 53
lola: 105 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: 4652 markings, 4653 edges
lola: ========================================
lola: subprocess 11 will run for 1091 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p1393 <= p856)) AND ((p1267 <= p735) OR (p1393 <= p856)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p1393 <= p856)) AND ((p1267 <= p735) OR (p1393 <= p856)))))
lola: processed formula length: 70
lola: 105 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: 130165 markings, 319031 edges, 26033 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: 183808 markings, 482487 edges
lola: ========================================
lola: subprocess 12 will run for 1632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((p1266 + 1 <= p926)) AND ((F ((3 <= p196)) AND (2 <= p468)) OR (p1266 + 1 <= p926)))) OR F ((2 <= p468)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1632 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: 107 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: 4651 markings, 4651 edges
lola: ========================================
lola: subprocess 13 will run for 3265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p1266 + 1 <= p926)) AND ((F ((3 <= p196)) AND (2 <= p468)) OR (p1266 + 1 <= p926))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p1266 + 1 <= p926)) AND ((F ((3 <= p196)) AND (2 <= p468)) OR (p1266 + 1 <= p926))))
lola: processed formula length: 92
lola: 105 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: 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: 4651 markings, 4651 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280))))) OR G ((F ((p1595 <= p570)) OR (G ((p1467 <= p1001)) AND F ((p1595 <= p570))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280)))))
lola: processed formula length: 77
lola: 105 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: 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: 4654 markings, 4655 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ...considering subproblem: (((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280))))) OR G ((F ((p1595 <= p570)) OR (G ((p1467 <= p1001)) AND F ((p1595 <= p570))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p1595 <= p570) U G ((F ((2 <= p280)) AND ((p517 <= p892) OR (2 <= p280)))))
lola: processed formula length: 77
lola: 105 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: 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: 4654 markings, 4655 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((p1595 <= p570)) OR (G ((p1467 <= p1001)) AND F ((p1595 <= p570)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p1595 <= p570)) OR (G ((p1467 <= p1001)) AND F ((p1595 <= p570)))))
lola: processed formula length: 75
lola: 105 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: 124954 markings, 317756 edges, 24991 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: 185698 markings, 477238 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no no no no yes no no no
lola: ========================================
lola: memory consumption: 145108 KB
lola: time consumption: 313 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-D40N150"
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-D40N150, 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-158987882500545"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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