Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902800413.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is FMS-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902800413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 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 FMS-PT-20000-00
FORMULA_NAME FMS-PT-20000-01
FORMULA_NAME FMS-PT-20000-02
FORMULA_NAME FMS-PT-20000-03
FORMULA_NAME FMS-PT-20000-04
FORMULA_NAME FMS-PT-20000-05
FORMULA_NAME FMS-PT-20000-06
FORMULA_NAME FMS-PT-20000-07
FORMULA_NAME FMS-PT-20000-08
FORMULA_NAME FMS-PT-20000-09
FORMULA_NAME FMS-PT-20000-10
FORMULA_NAME FMS-PT-20000-11
FORMULA_NAME FMS-PT-20000-12
FORMULA_NAME FMS-PT-20000-13
FORMULA_NAME FMS-PT-20000-14
FORMULA_NAME FMS-PT-20000-15

=== Now, execution of the tool begins

BK_START 1620783338094

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-12 01:35:39] [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]
[2021-05-12 01:35:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 01:35:39] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-12 01:35:39] [INFO ] Transformed 22 places.
[2021-05-12 01:35:39] [INFO ] Transformed 20 transitions.
[2021-05-12 01:35:39] [INFO ] Parsed PT model containing 22 places and 20 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100009 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=1785 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 20 rows 22 cols
[2021-05-12 01:35:40] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 12 ms.
[2021-05-12 01:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 29 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 2 ms.
[2021-05-12 01:35:40] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 11 ms.
[2021-05-12 01:35:40] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 1 ms.
[2021-05-12 01:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2021-05-12 01:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2021-05-12 01:35:40] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 1 ms.
[2021-05-12 01:35:40] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2021-05-12 01:35:40] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 2 ms.
[2021-05-12 01:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 2 ms.
[2021-05-12 01:35:40] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 1 ms.
[2021-05-12 01:35:40] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 1 ms.
[2021-05-12 01:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-12 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 01:35:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 01:35:40] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 2 ms.
[2021-05-12 01:35:40] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2021-05-12 01:35:41] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-12 01:35:41] [INFO ] Flatten gal took : 22 ms
FORMULA FMS-PT-20000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 01:35:41] [INFO ] Flatten gal took : 4 ms
[2021-05-12 01:35:41] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-12 01:35:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FMS-PT-20000 @ 3570 seconds

FORMULA FMS-PT-20000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2146
rslt: Output for LTLCardinality @ FMS-PT-20000

{
"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 May 12 01:35:45 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 403
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((X ((X ((p18 + 1 <= p8)) R (p4 + 1 <= p9))) AND F ((G ((p4 + 1 <= p9)) OR ((p5 <= 0) AND (p4 + 1 <= p9)))))))",
"processed_size": 115,
"rewrites": 39
},
"result":
{
"edges": 80003,
"markings": 80003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 461
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p5 <= p20)))",
"processed_size": 19,
"rewrites": 39
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"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": "X ((F ((p17 <= 2)) AND F ((p5 <= p20))))",
"processed_size": 40,
"rewrites": 39
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 645
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 645
},
"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": "(1 <= p13)",
"processed_size": 10,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 806
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p13 <= p18)))",
"processed_size": 20,
"rewrites": 39
},
"result":
{
"edges": 540008,
"markings": 440006,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 806
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p14 + 1 <= p8))",
"processed_size": 19,
"rewrites": 39
},
"result":
{
"edges": 100002,
"markings": 100002,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1405
},
"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": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 41
},
"result":
{
"edges": 100002,
"markings": 100002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2811
},
"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": "(1 <= p4)",
"processed_size": 9,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p14 + 1 <= p8))",
"processed_size": 19,
"rewrites": 39
},
"result":
{
"edges": 100002,
"markings": 100002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p4)",
"processed_size": 9,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p4))",
"processed_size": 13,
"rewrites": 39
},
"result":
{
"edges": 679979,
"markings": 579983,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3700,
"runtime": 1424.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : X(G(**)) : G((X(**) OR ((G(*) R *) OR **))) : (G(**) AND **) : X(F((X((X(*) R *)) AND F((G(*) OR (* AND *)))))) : X(F(**)) : X((F(**) AND F(**))) : (F(G(**)) AND (X(**) OR **)) : (X(G((F(**) AND F(G(**))))) OR (G(*) AND F(G((F(**) AND F(G(**))))))) : F((X(X(G((F(**) AND **)))) OR (G(**) AND F(G((F(**) AND **))))))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no unknown unknown no no yes yes no unknown unknown ",
"value": "no unknown unknown no no yes yes no unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: F ((((2 <= p2) U (1 <= 0)) OR (2 <= p2))) : G (X ((p5 <= p7))) : G (((X (((p4 <= p14) AND (p6 <= p17))) OR NOT((F ((p6 <= p17)) U (p2 + 1 <= p15)))) OR (p14 + 1 <= p4))) : (G ((1 <= p4)) AND (1 <= p4)) : X (NOT(G ((X ((X ((p8 <= p18)) U (p9 <= p4))) OR G (((1 <= p5) U (p9 <= p4))))))) : X (((0 <= 0) U F ((p5 <= p20)))) : X (((F ((p5 <= p20)) U F ((p17 <= 2))) AND F ((p5 <= p20)))) : (F (G ((p13 <= p18))) AND (X ((p13 <= p18)) OR (1 <= p13))) : (NOT(F ((p8 <= p14))) U X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))) : F ((G (((1 <= p7))) U X (X (G ((F ((3 <= p7)) AND (p0 <= p11)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p5 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p5 <= p7)))
lola: processed formula length: 18
lola: 39 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: 4743566 markings, 6303646 edges, 948713 markings/sec, 0 secs
lola: 9282104 markings, 12352928 edges, 907708 markings/sec, 5 secs
lola: 13764238 markings, 18326017 edges, 896427 markings/sec, 10 secs
lola: 18268195 markings, 24331837 edges, 900791 markings/sec, 15 secs
lola: 22833611 markings, 30419848 edges, 913083 markings/sec, 20 secs
lola: 27328229 markings, 36411662 edges, 898924 markings/sec, 25 secs
lola: 31785070 markings, 42356814 edges, 891368 markings/sec, 30 secs
lola: 36242776 markings, 48303262 edges, 891541 markings/sec, 35 secs
lola: 40676856 markings, 54214269 edges, 886816 markings/sec, 40 secs
lola: 45073536 markings, 60074287 edges, 879336 markings/sec, 45 secs
lola: 49481016 markings, 65950289 edges, 881496 markings/sec, 50 secs
lola: 53852408 markings, 71777268 edges, 874278 markings/sec, 55 secs
lola: 58225327 markings, 77606537 edges, 874584 markings/sec, 60 secs
lola: 62588597 markings, 83429640 edges, 872654 markings/sec, 65 secs
lola: 66953145 markings, 89248046 edges, 872910 markings/sec, 70 secs
lola: 71310645 markings, 95054187 edges, 871500 markings/sec, 75 secs
lola: 75644486 markings, 100834840 edges, 866768 markings/sec, 80 secs
lola: 80642115 markings, 107501158 edges, 999526 markings/sec, 85 secs
lola: 84927183 markings, 113208653 edges, 857014 markings/sec, 90 secs
lola: 89200768 markings, 118908924 edges, 854717 markings/sec, 95 secs
lola: 92155905 markings, 122851798 edges, 591027 markings/sec, 100 secs
lola: 94076443 markings, 125425220 edges, 384108 markings/sec, 105 secs
lola: 95543834 markings, 127365426 edges, 293478 markings/sec, 110 secs
lola: 97620222 markings, 130137894 edges, 415278 markings/sec, 115 secs
lola: 99568934 markings, 132730914 edges, 389742 markings/sec, 120 secs
lola: 101576559 markings, 135412302 edges, 401525 markings/sec, 125 secs
lola: 103729779 markings, 138282076 edges, 430644 markings/sec, 130 secs
lola: 105405911 markings, 140516234 edges, 335226 markings/sec, 135 secs
lola: 107804694 markings, 143714347 edges, 479757 markings/sec, 140 secs
lola: 109680280 markings, 146217680 edges, 375117 markings/sec, 145 secs
lola: 111517219 markings, 148663043 edges, 367388 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p4 <= p14) AND (p6 <= p17))) OR ((G ((p17 + 1 <= p6)) R (p15 <= p2)) OR (p14 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p4 <= p14) AND (p6 <= p17))) OR ((G ((p17 + 1 <= p6)) R (p15 <= p2)) OR (p14 + 1 <= p4))))
lola: processed formula length: 99
lola: 39 rewrites
lola: closed formula file LTLCardinality.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: 4644467 markings, 6166586 edges, 928893 markings/sec, 0 secs
lola: 9085472 markings, 12087983 edges, 888201 markings/sec, 5 secs
lola: 13470743 markings, 17935780 edges, 877054 markings/sec, 10 secs
lola: 17852274 markings, 23777967 edges, 876306 markings/sec, 15 secs
lola: 22198028 markings, 29576490 edges, 869151 markings/sec, 20 secs
lola: 26529213 markings, 35349655 edges, 866237 markings/sec, 25 secs
lola: 30825963 markings, 41078176 edges, 859350 markings/sec, 30 secs
lola: 35153963 markings, 46850068 edges, 865600 markings/sec, 35 secs
lola: 39429666 markings, 52550322 edges, 855141 markings/sec, 40 secs
lola: 43683450 markings, 58224085 edges, 850757 markings/sec, 45 secs
lola: 47937199 markings, 63894603 edges, 850750 markings/sec, 50 secs
lola: 52172335 markings, 69537200 edges, 847027 markings/sec, 55 secs
lola: 56391866 markings, 75166391 edges, 843906 markings/sec, 60 secs
lola: 60577430 markings, 80744632 edges, 837113 markings/sec, 65 secs
lola: 64820259 markings, 86401339 edges, 848566 markings/sec, 70 secs
lola: 69010091 markings, 91991241 edges, 837966 markings/sec, 75 secs
lola: 73227949 markings, 97610095 edges, 843572 markings/sec, 80 secs
lola: 77327958 markings, 103080005 edges, 820002 markings/sec, 85 secs
lola: 81400541 markings, 108508779 edges, 814517 markings/sec, 90 secs
lola: 85431602 markings, 113885269 edges, 806212 markings/sec, 95 secs
lola: 89465035 markings, 119265319 edges, 806687 markings/sec, 100 secs
lola: 92926055 markings, 123880906 edges, 692204 markings/sec, 105 secs
lola: 94926784 markings, 126547806 edges, 400146 markings/sec, 110 secs
lola: 96080050 markings, 128081650 edges, 230653 markings/sec, 115 secs
lola: 98360423 markings, 131122061 edges, 456075 markings/sec, 120 secs
lola: 99880961 markings, 133148945 edges, 304108 markings/sec, 125 secs
lola: 101579537 markings, 135416767 edges, 339715 markings/sec, 130 secs
lola: 104561172 markings, 139389146 edges, 596327 markings/sec, 135 secs
lola: 106394419 markings, 141836191 edges, 366649 markings/sec, 140 secs
lola: 109043271 markings, 145365089 edges, 529770 markings/sec, 145 secs
lola: 110704295 markings, 147583677 edges, 332205 markings/sec, 150 secs
lola: 113099794 markings, 150776866 edges, 479100 markings/sec, 155 secs
lola: 113379871 markings, 151146973 edges, 56015 markings/sec, 160 secs
lola: 113396098 markings, 151171315 edges, 3245 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((X ((p18 + 1 <= p8)) R (p4 + 1 <= p9))) AND F ((G ((p4 + 1 <= p9)) OR ((p5 <= 0) AND (p4 + 1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((X ((p18 + 1 <= p8)) R (p4 + 1 <= p9))) AND F ((G ((p4 + 1 <= p9)) OR ((p5 <= 0) AND (p4 + 1 <= p9)))))))
lola: processed formula length: 115
lola: 39 rewrites
lola: closed formula file LTLCardinality.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: 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: 80003 markings, 80003 edges
lola: ========================================
lola: subprocess 3 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p5 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p5 <= p20)))
lola: processed formula length: 19
lola: 39 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p17 <= 2)) AND F ((p5 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p17 <= 2)) AND F ((p5 <= p20))))
lola: processed formula length: 40
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p13 <= p18))) AND (X ((p13 <= p18)) OR (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p13)
lola: processed formula length: 10
lola: 39 rewrites
lola: closed formula file LTLCardinality.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: subprocess 6 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p13 <= p18)))
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 ((p13 <= p18)))
lola: processed formula length: 20
lola: 39 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: 440006 markings, 540008 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5)))))) OR (G ((p14 + 1 <= p8)) AND F (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p14 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p14 + 1 <= p8))
lola: processed formula length: 19
lola: 39 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: 100002 markings, 100002 edges
lola: ========================================
lola: subprocess 7 will run for 1075 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))
lola: processed formula length: 47
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4750073 markings, 6310153 edges, 950015 markings/sec, 0 secs
lola: 9280161 markings, 12350011 edges, 906018 markings/sec, 5 secs
lola: 13749358 markings, 18309587 edges, 893839 markings/sec, 10 secs
lola: 18224612 markings, 24276465 edges, 895051 markings/sec, 15 secs
lola: 22663026 markings, 30193974 edges, 887683 markings/sec, 20 secs
lola: 27088670 markings, 36092330 edges, 885129 markings/sec, 25 secs
lola: 31484017 markings, 41955240 edges, 879069 markings/sec, 30 secs
lola: 35883284 markings, 47823881 edges, 879853 markings/sec, 35 secs
lola: 40242613 markings, 53632915 edges, 871866 markings/sec, 40 secs
lola: 44582927 markings, 59423279 edges, 868063 markings/sec, 45 secs
lola: 48928092 markings, 65210915 edges, 869033 markings/sec, 50 secs
lola: 53241589 markings, 70962475 edges, 862699 markings/sec, 55 secs
lola: 57643844 markings, 76834327 edges, 880451 markings/sec, 60 secs
lola: 62042587 markings, 82702331 edges, 879749 markings/sec, 65 secs
lola: 66453598 markings, 88578737 edges, 882202 markings/sec, 70 secs
lola: 70741950 markings, 94301159 edges, 857670 markings/sec, 75 secs
lola: 75012385 markings, 99993635 edges, 854087 markings/sec, 80 secs
lola: 79280484 markings, 105681805 edges, 853620 markings/sec, 85 secs
lola: 83499296 markings, 111306859 edges, 843762 markings/sec, 90 secs
lola: 87719629 markings, 116937253 edges, 844067 markings/sec, 95 secs
lola: 91860325 markings, 122460616 edges, 828139 markings/sec, 100 secs
lola: 92312655 markings, 123076349 edges, 90466 markings/sec, 105 secs
lola: 96197946 markings, 128269950 edges, 777058 markings/sec, 110 secs
lola: 100000492 markings, 133308241 edges, 760509 markings/sec, 115 secs
lola: 100152521 markings, 133514190 edges, 30406 markings/sec, 120 secs
lola: 100764984 markings, 134326662 edges, 122493 markings/sec, 125 secs
lola: 104172262 markings, 138873997 edges, 681456 markings/sec, 130 secs
lola: 107798604 markings, 143705213 edges, 725268 markings/sec, 135 secs
lola: 111661300 markings, 148859160 edges, 772539 markings/sec, 140 secs
lola: 111820801 markings, 149068407 edges, 31900 markings/sec, 145 secs
lola: 113250364 markings, 150972717 edges, 285913 markings/sec, 150 secs
lola: 113250478 markings, 150972888 edges, 23 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 1012 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (G ((F ((3 <= p7)) AND (p0 <= p11))))) OR (G (((1 <= p7))) AND F (G ((F ((3 <= p7)) AND (p0 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (G ((F ((3 <= p7)) AND (p0 <= p11))))) OR (G (((1 <= p7))) AND F (G ((F ((3 <= p7)) AND (p0 <= p11)))))))
lola: processed formula length: 114
lola: 39 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: 4036403 markings, 5356469 edges, 807281 markings/sec, 0 secs
lola: 7892073 markings, 10497912 edges, 771134 markings/sec, 5 secs
lola: 11729244 markings, 15613573 edges, 767434 markings/sec, 10 secs
lola: 15507545 markings, 20650931 edges, 755660 markings/sec, 15 secs
lola: 19329647 markings, 25749968 edges, 764420 markings/sec, 20 secs
lola: 23157458 markings, 30855610 edges, 765562 markings/sec, 25 secs
lola: 27032827 markings, 36018565 edges, 775074 markings/sec, 30 secs
lola: 30866767 markings, 41129378 edges, 766788 markings/sec, 35 secs
lola: 34734563 markings, 46290978 edges, 773559 markings/sec, 40 secs
lola: 38549135 markings, 51372739 edges, 762914 markings/sec, 45 secs
lola: 42361728 markings, 56461535 edges, 762519 markings/sec, 50 secs
lola: 46105470 markings, 61447052 edges, 748748 markings/sec, 55 secs
lola: 49828707 markings, 66411814 edges, 744647 markings/sec, 60 secs
lola: 53510606 markings, 71324573 edges, 736380 markings/sec, 65 secs
lola: 57202944 markings, 76243895 edges, 738468 markings/sec, 70 secs
lola: 60888941 markings, 81161891 edges, 737199 markings/sec, 75 secs
lola: 64686531 markings, 86227607 edges, 759518 markings/sec, 80 secs
lola: 68436520 markings, 91223070 edges, 749998 markings/sec, 85 secs
lola: 72194506 markings, 96235707 edges, 751597 markings/sec, 90 secs
lola: 77301255 markings, 103042542 edges, 1021350 markings/sec, 95 secs
lola: 81040751 markings, 108029102 edges, 747899 markings/sec, 100 secs
lola: 84639977 markings, 112828471 edges, 719845 markings/sec, 105 secs
lola: 85718631 markings, 114265803 edges, 215731 markings/sec, 110 secs
lola: 88935541 markings, 118557811 edges, 643382 markings/sec, 115 secs
lola: 89085850 markings, 118756548 edges, 30062 markings/sec, 120 secs
lola: 90030624 markings, 120013687 edges, 188955 markings/sec, 125 secs
lola: 92717363 markings, 123598906 edges, 537348 markings/sec, 130 secs
lola: 92717363 markings, 123598906 edges, 0 markings/sec, 135 secs
lola: 94249758 markings, 125642281 edges, 306479 markings/sec, 140 secs
lola: 96150145 markings, 128172813 edges, 380077 markings/sec, 145 secs
lola: 97180408 markings, 129548184 edges, 206053 markings/sec, 150 secs
lola: 99891234 markings, 133164354 edges, 542165 markings/sec, 155 secs
lola: 100711360 markings, 134254523 edges, 164025 markings/sec, 160 secs
lola: 103922675 markings, 138541418 edges, 642263 markings/sec, 165 secs
lola: 104267777 markings, 138999060 edges, 69020 markings/sec, 170 secs
lola: 104267832 markings, 138999143 edges, 11 markings/sec, 175 secs
lola: 104267915 markings, 138999267 edges, 17 markings/sec, 180 secs
lola: 104268017 markings, 138999420 edges, 20 markings/sec, 185 secs
lola: 104268117 markings, 138999569 edges, 20 markings/sec, 190 secs
lola: 104268224 markings, 138999731 edges, 21 markings/sec, 195 secs
lola: 104268305 markings, 138999852 edges, 16 markings/sec, 200 secs
lola: 104270082 markings, 139002518 edges, 355 markings/sec, 205 secs
lola: 104270169 markings, 139002647 edges, 17 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p2))
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: (p2 <= 1)
lola: processed formula length: 9
lola: 41 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: 100002 markings, 100002 edges
lola: ========================================
lola: subprocess 9 will run for 2811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p4)) AND (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 2811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p5 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p5 <= p7)))
lola: processed formula length: 18
lola: 39 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: 4763980 markings, 6325854 edges, 952796 markings/sec, 0 secs
lola: 9286504 markings, 12359528 edges, 904505 markings/sec, 5 secs
lola: 13768243 markings, 18332024 edges, 896348 markings/sec, 10 secs
lola: 18227405 markings, 24280653 edges, 891832 markings/sec, 15 secs
lola: 22672702 markings, 30208491 edges, 889059 markings/sec, 20 secs
lola: 27101444 markings, 36111492 edges, 885748 markings/sec, 25 secs
lola: 31513754 markings, 41994282 edges, 882462 markings/sec, 30 secs
lola: 35914657 markings, 47861092 edges, 880181 markings/sec, 35 secs
lola: 40282117 markings, 53682790 edges, 873492 markings/sec, 40 secs
lola: 44613216 markings, 59458713 edges, 866220 markings/sec, 45 secs
lola: 48960781 markings, 65259951 edges, 869513 markings/sec, 50 secs
lola: 53274977 markings, 71011136 edges, 862839 markings/sec, 55 secs
lola: 57591194 markings, 76765354 edges, 863243 markings/sec, 60 secs
lola: 61873773 markings, 82474804 edges, 856516 markings/sec, 65 secs
lola: 66209707 markings, 88252909 edges, 867187 markings/sec, 70 secs
lola: 70571956 markings, 94073131 edges, 872450 markings/sec, 75 secs
lola: 74850633 markings, 99774082 edges, 855735 markings/sec, 80 secs
lola: 79119776 markings, 105467687 edges, 853829 markings/sec, 85 secs
lola: 83349945 markings, 111111336 edges, 846034 markings/sec, 90 secs
lola: 87564313 markings, 116725774 edges, 842874 markings/sec, 95 secs
lola: 91730736 markings, 122285465 edges, 833285 markings/sec, 100 secs
lola: 94988300 markings, 126642636 edges, 651513 markings/sec, 105 secs
lola: 97928872 markings, 130551746 edges, 588114 markings/sec, 110 secs
lola: 99628482 markings, 132810233 edges, 339922 markings/sec, 115 secs
lola: 101627068 markings, 135478067 edges, 399717 markings/sec, 120 secs
lola: 104014533 markings, 138659200 edges, 477493 markings/sec, 125 secs
lola: 105719292 markings, 140936297 edges, 340952 markings/sec, 130 secs
lola: 108314112 markings, 144395916 edges, 518964 markings/sec, 135 secs
lola: 109702907 markings, 146244734 edges, 277759 markings/sec, 140 secs
lola: 112758528 markings, 150320407 edges, 611124 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((X (((p4 <= p14) AND (p6 <= p17))) OR ((G ((p17 + 1 <= p6)) R (p15 <= p2)) OR (p14 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p4 <= p14) AND (p6 <= p17))) OR ((G ((p17 + 1 <= p6)) R (p15 <= p2)) OR (p14 + 1 <= p4))))
lola: processed formula length: 99
lola: 39 rewrites
lola: closed formula file LTLCardinality.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: 4570577 markings, 6070654 edges, 914115 markings/sec, 0 secs
lola: 8955659 markings, 11915808 edges, 877016 markings/sec, 5 secs
lola: 13318673 markings, 17737679 edges, 872603 markings/sec, 10 secs
lola: 17675638 markings, 23543016 edges, 871393 markings/sec, 15 secs
lola: 22005310 markings, 29317416 edges, 865934 markings/sec, 20 secs
lola: 26315199 markings, 35062143 edges, 861978 markings/sec, 25 secs
lola: 30583948 markings, 40755159 edges, 853750 markings/sec, 30 secs
lola: 34895807 markings, 46502840 edges, 862372 markings/sec, 35 secs
lola: 39222783 markings, 52273195 edges, 865395 markings/sec, 40 secs
lola: 43468914 markings, 57932286 edges, 849226 markings/sec, 45 secs
lola: 47693531 markings, 63569106 edges, 844923 markings/sec, 50 secs
lola: 51908305 markings, 69189170 edges, 842955 markings/sec, 55 secs
lola: 56111545 markings, 74792480 edges, 840648 markings/sec, 60 secs
lola: 60290651 markings, 80364472 edges, 835821 markings/sec, 65 secs
lola: 64504139 markings, 85984599 edges, 842698 markings/sec, 70 secs
lola: 68685871 markings, 91557092 edges, 836346 markings/sec, 75 secs
lola: 72863286 markings, 97124500 edges, 835483 markings/sec, 80 secs
lola: 77022944 markings, 102672493 edges, 831932 markings/sec, 85 secs
lola: 81169839 markings, 108202732 edges, 829379 markings/sec, 90 secs
lola: 85288984 markings, 113691346 edges, 823829 markings/sec, 95 secs
lola: 89391990 markings, 119165752 edges, 820601 markings/sec, 100 secs
lola: 92789642 markings, 123693954 edges, 679530 markings/sec, 105 secs
lola: 95005873 markings, 126660608 edges, 443246 markings/sec, 110 secs
lola: 97106125 markings, 129447742 edges, 420050 markings/sec, 115 secs
lola: 99367087 markings, 132468148 edges, 452192 markings/sec, 120 secs
lola: 101762642 markings, 135661422 edges, 479111 markings/sec, 125 secs
lola: 104041462 markings, 138699595 edges, 455764 markings/sec, 130 secs
lola: 106864901 markings, 142464683 edges, 564688 markings/sec, 135 secs
lola: 109832151 markings, 146415481 edges, 593450 markings/sec, 140 secs
lola: 113091679 markings, 150764692 edges, 651906 markings/sec, 145 secs
lola: 113350768 markings, 151112657 edges, 51818 markings/sec, 150 secs
lola: 113350967 markings, 151112856 edges, 40 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5)))))) OR (G ((p14 + 1 <= p8)) AND F (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p14 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p14 + 1 <= p8))
lola: processed formula length: 19
lola: 39 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: 100002 markings, 100002 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p16 <= 2)) AND F (G ((p1 <= p5))))))
lola: processed formula length: 47
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4864137 markings, 6464220 edges, 972827 markings/sec, 0 secs
lola: 9509421 markings, 12653899 edges, 929057 markings/sec, 5 secs
lola: 14092609 markings, 18768565 edges, 916638 markings/sec, 10 secs
lola: 18682018 markings, 24882563 edges, 917882 markings/sec, 15 secs
lola: 23239563 markings, 30959952 edges, 911509 markings/sec, 20 secs
lola: 27758824 markings, 36987546 edges, 903852 markings/sec, 25 secs
lola: 32274406 markings, 43010807 edges, 903116 markings/sec, 30 secs
lola: 36769424 markings, 49003221 edges, 899004 markings/sec, 35 secs
lola: 41244083 markings, 54965097 edges, 894932 markings/sec, 40 secs
lola: 45658195 markings, 60856155 edges, 882822 markings/sec, 45 secs
lola: 50122482 markings, 66803320 edges, 892857 markings/sec, 50 secs
lola: 54525522 markings, 72676924 edges, 880608 markings/sec, 55 secs
lola: 58934378 markings, 78555362 edges, 881771 markings/sec, 60 secs
lola: 63336646 markings, 84423390 edges, 880454 markings/sec, 65 secs
lola: 67742274 markings, 90301722 edges, 881126 markings/sec, 70 secs
lola: 72139513 markings, 96160717 edges, 879448 markings/sec, 75 secs
lola: 76505480 markings, 101986312 edges, 873193 markings/sec, 80 secs
lola: 80873664 markings, 107808475 edges, 873637 markings/sec, 85 secs
lola: 85194913 markings, 113570242 edges, 864250 markings/sec, 90 secs
lola: 89511508 markings, 119325027 edges, 863319 markings/sec, 95 secs
lola: 93048556 markings, 124040510 edges, 707410 markings/sec, 100 secs
lola: 96223233 markings, 128272604 edges, 634935 markings/sec, 105 secs
lola: 99115441 markings, 132131372 edges, 578442 markings/sec, 110 secs
lola: 100342935 markings, 133764609 edges, 245499 markings/sec, 115 secs
lola: 102692401 markings, 136896036 edges, 469893 markings/sec, 120 secs
lola: 104805309 markings, 139715345 edges, 422582 markings/sec, 125 secs
lola: 106802070 markings, 142380438 edges, 399352 markings/sec, 130 secs
lola: 109748102 markings, 146309411 edges, 589206 markings/sec, 135 secs
lola: 111119637 markings, 148136679 edges, 274307 markings/sec, 140 secs
lola: 113375442 markings, 151140329 edges, 451161 markings/sec, 145 secs
lola: 113379386 markings, 151146247 edges, 789 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((X (X (G ((F ((3 <= p7)) AND (p0 <= p11))))) OR (G (((1 <= p7))) AND F (G ((F ((3 <= p7)) AND (p0 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (G ((F ((3 <= p7)) AND (p0 <= p11))))) OR (G (((1 <= p7))) AND F (G ((F ((3 <= p7)) AND (p0 <= p11)))))))
lola: processed formula length: 114
lola: 39 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: 4144817 markings, 5504886 edges, 828963 markings/sec, 0 secs
lola: 8114800 markings, 10794934 edges, 793997 markings/sec, 5 secs
lola: 12048582 markings, 16042572 edges, 786756 markings/sec, 10 secs
lola: 15947918 markings, 21241480 edges, 779867 markings/sec, 15 secs
lola: 19868686 markings, 26469016 edges, 784154 markings/sec, 20 secs
lola: 23757475 markings, 31655619 edges, 777758 markings/sec, 25 secs
lola: 27626109 markings, 36808474 edges, 773727 markings/sec, 30 secs
lola: 31476743 markings, 41944328 edges, 770127 markings/sec, 35 secs
lola: 35337559 markings, 47095455 edges, 772163 markings/sec, 40 secs
lola: 39168302 markings, 52201475 edges, 766149 markings/sec, 45 secs
lola: 42989709 markings, 57293490 edges, 764281 markings/sec, 50 secs
lola: 46788139 markings, 62361039 edges, 759686 markings/sec, 55 secs
lola: 50605095 markings, 67446377 edges, 763391 markings/sec, 60 secs
lola: 54391952 markings, 72496568 edges, 757371 markings/sec, 65 secs
lola: 58141855 markings, 77501330 edges, 749981 markings/sec, 70 secs
lola: 61910683 markings, 82524477 edges, 753766 markings/sec, 75 secs
lola: 65707121 markings, 87588214 edges, 759288 markings/sec, 80 secs
lola: 69480103 markings, 92618419 edges, 754596 markings/sec, 85 secs
lola: 73247441 markings, 97639331 edges, 753468 markings/sec, 90 secs
lola: 77000602 markings, 102641883 edges, 750632 markings/sec, 95 secs
lola: 80745762 markings, 107636625 edges, 749032 markings/sec, 100 secs
lola: 84398103 markings, 112505981 edges, 730468 markings/sec, 105 secs
lola: 86845844 markings, 115777318 edges, 489548 markings/sec, 110 secs
lola: 88892360 markings, 118496319 edges, 409303 markings/sec, 115 secs
lola: 90369448 markings, 120470953 edges, 295418 markings/sec, 120 secs
lola: 92119388 markings, 122800922 edges, 349988 markings/sec, 125 secs
lola: 94086946 markings, 125428068 edges, 393512 markings/sec, 130 secs
lola: 96157781 markings, 128184268 edges, 414167 markings/sec, 135 secs
lola: 98648065 markings, 131509632 edges, 498057 markings/sec, 140 secs
lola: 100053590 markings, 133377885 edges, 281105 markings/sec, 145 secs
lola: 102893978 markings, 137168395 edges, 568078 markings/sec, 150 secs
lola: 104120259 markings, 138802156 edges, 245256 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p4)) AND (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p4))
lola: processed formula length: 13
lola: 39 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: 579983 markings, 679979 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown unknown no no yes yes no unknown unknown
lola:
preliminary result: no unknown unknown no no yes yes no unknown unknown
lola: memory consumption: 3700 KB
lola: time consumption: 1424 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="FMS-PT-20000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is FMS-PT-20000, 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 r094-tall-162048902800413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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