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.r011-tall-162038006000173.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 Angiogenesis-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006000173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 26 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 26 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 33K 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 Angiogenesis-PT-20-00
FORMULA_NAME Angiogenesis-PT-20-01
FORMULA_NAME Angiogenesis-PT-20-02
FORMULA_NAME Angiogenesis-PT-20-03
FORMULA_NAME Angiogenesis-PT-20-04
FORMULA_NAME Angiogenesis-PT-20-05
FORMULA_NAME Angiogenesis-PT-20-06
FORMULA_NAME Angiogenesis-PT-20-07
FORMULA_NAME Angiogenesis-PT-20-08
FORMULA_NAME Angiogenesis-PT-20-09
FORMULA_NAME Angiogenesis-PT-20-10
FORMULA_NAME Angiogenesis-PT-20-11
FORMULA_NAME Angiogenesis-PT-20-12
FORMULA_NAME Angiogenesis-PT-20-13
FORMULA_NAME Angiogenesis-PT-20-14
FORMULA_NAME Angiogenesis-PT-20-15

=== Now, execution of the tool begins

BK_START 1620430962053

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

FORMULA Angiogenesis-PT-20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3106
rslt: Output for LTLCardinality @ Angiogenesis-PT-20

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 7 23:42:45 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((F ((p36 <= p15)) OR (p8 <= p38)) U X ((p31 <= p3)))",
"processed_size": 53,
"rewrites": 71
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((p1 <= p20)))",
"processed_size": 19,
"rewrites": 71
},
"result":
{
"edges": 2925964,
"markings": 1426042,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F ((X (F ((1 <= p4))) OR F ((p13 <= 1)))) AND X ((2 <= p13)))))",
"processed_size": 70,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "G ((X ((((1 <= p21) U (1 <= p3)) OR (G (F ((p26 + 1 <= p3))) AND F ((1 <= p3))))) OR G ((p18 + 1 <= p14))))",
"processed_size": 107,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 667
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"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 ((p22 <= p29))",
"processed_size": 16,
"rewrites": 71
},
"result":
{
"edges": 52,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (((p22 <= p29) OR (G ((p11 <= p9)) AND F ((p22 <= p29))))))",
"processed_size": 64,
"rewrites": 71
},
"result":
{
"edges": 31,
"markings": 22,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (F ((p17 + 1 <= p11))) R ((p18 <= p20) U (p31 <= p18))))",
"processed_size": 62,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"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": 1112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((F (G ((p2 + 1 <= p5))) AND F ((p15 <= 1))))",
"processed_size": 47,
"rewrites": 71
},
"result":
{
"edges": 1747,
"markings": 1113,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1669
},
"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": "G (F ((p16 <= p11)))",
"processed_size": 20,
"rewrites": 71
},
"result":
{
"edges": 94762,
"markings": 60446,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "F (G (((p27 + 1 <= p24))))",
"processed_size": 26,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3344,
"runtime": 464.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(G(*)) AND F(**))) : F(G((F(**) OR X(**)))) : ((F(**) OR **) U X(**)) : X(G(*)) : (F(G(*)) AND (F(G(*)) OR G(F(**)))) : X(F((F((X(F(**)) OR F(**))) AND X(**)))) : G((X(((** U **) OR (G(F(*)) AND F(**)))) OR G(*))) : (X(X((** OR (G(**) AND F(**))))) OR G(*)) : X((X(F(*)) R (** U **))) : ((** U G(**)) AND G(F(**)))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no unknown no no no no no yes no no ",
"value": "no unknown no no no no no yes 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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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: F ((G (X (NOT(G (F ((p5 <= p2)))))) AND F ((p15 <= 1)))) : F (G (X ((((0 <= 0) U (p33 + 1 <= p5)) OR X (((p5 <= p33))))))) : ((((0 <= 0) U (p36 <= p15)) OR (p8 <= p38)) U X ((p31 <= p3))) : NOT(F (X ((p20 + 1 <= p1)))) : NOT((NOT(G (((0 <= 0) U F ((1 <= p3))))) U G (F (((p24 <= p27)))))) : F (X ((F ((F (X ((1 <= p4))) OR ((p10 <= p20) U F ((p13 <= 1))))) AND X ((2 <= p13))))) : G ((X ((NOT(G (F (G ((p3 <= p26))))) U ((1 <= p21) U (1 <= p3)))) OR NOT(F ((p14 <= p18))))) : (X (X ((G ((p11 <= p9)) U (p22 <= p29)))) OR NOT(F ((p29 + 1 <= p22)))) : X (NOT((G (X ((p11 <= p17))) U NOT(((p18 <= p20) U (p31 <= p18)))))) : (((p16 <= p11) U G ((2 <= p4))) AND NOT(X (F (X (NOT(G (F (G (F ((p16 <= p11)))))))))))
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p33 + 1 <= p5)) OR X (((p5 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p33 + 1 <= p5)) OR X (((p5 <= p33))))))
lola: processed formula length: 50
lola: 71 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: 3035613 markings, 6185699 edges, 607123 markings/sec, 0 secs
lola: 6059395 markings, 12474820 edges, 604756 markings/sec, 5 secs
lola: 8848669 markings, 18304830 edges, 557855 markings/sec, 10 secs
lola: 11509763 markings, 23831310 edges, 532219 markings/sec, 15 secs
lola: 14065375 markings, 29170790 edges, 511122 markings/sec, 20 secs
lola: 16584627 markings, 34423795 edges, 503850 markings/sec, 25 secs
lola: 19084724 markings, 39594916 edges, 500019 markings/sec, 30 secs
lola: 21623605 markings, 44799889 edges, 507776 markings/sec, 35 secs
lola: 24142087 markings, 49969839 edges, 503696 markings/sec, 40 secs
lola: 26660643 markings, 55162882 edges, 503711 markings/sec, 45 secs
lola: 29147881 markings, 60341014 edges, 497448 markings/sec, 50 secs
lola: 31548535 markings, 65309834 edges, 480131 markings/sec, 55 secs
lola: 33959050 markings, 70300390 edges, 482103 markings/sec, 60 secs
lola: 36387210 markings, 75300465 edges, 485632 markings/sec, 65 secs
lola: 38780348 markings, 80300251 edges, 478628 markings/sec, 70 secs
lola: 41082674 markings, 85188066 edges, 460465 markings/sec, 75 secs
lola: 43433182 markings, 90135018 edges, 470102 markings/sec, 80 secs
lola: 45777197 markings, 95025570 edges, 468803 markings/sec, 85 secs
lola: 48066243 markings, 99845531 edges, 457809 markings/sec, 90 secs
lola: 50490408 markings, 104787946 edges, 484833 markings/sec, 95 secs
lola: 52802948 markings, 109640934 edges, 462508 markings/sec, 100 secs
lola: 55075540 markings, 114446126 edges, 454518 markings/sec, 105 secs
lola: 57576327 markings, 119488153 edges, 500157 markings/sec, 110 secs
lola: 59869197 markings, 124317997 edges, 458574 markings/sec, 115 secs
lola: 62193838 markings, 129161861 edges, 464928 markings/sec, 120 secs
lola: 64418882 markings, 133891339 edges, 445009 markings/sec, 125 secs
lola: 66633135 markings, 138646327 edges, 442851 markings/sec, 130 secs
lola: 68943868 markings, 143538948 edges, 462147 markings/sec, 135 secs
lola: 71199844 markings, 148285388 edges, 451195 markings/sec, 140 secs
lola: 73457747 markings, 153021150 edges, 451581 markings/sec, 145 secs
lola: 75780549 markings, 157783253 edges, 464560 markings/sec, 150 secs
lola: 77496423 markings, 161359848 edges, 343175 markings/sec, 155 secs
lola: 79006243 markings, 164560482 edges, 301964 markings/sec, 160 secs
lola: 80452719 markings, 167572961 edges, 289295 markings/sec, 165 secs
lola: 82058867 markings, 170881919 edges, 321230 markings/sec, 170 secs
lola: 83695966 markings, 174375071 edges, 327420 markings/sec, 175 secs
lola: 85301997 markings, 177493050 edges, 321206 markings/sec, 180 secs
lola: 86871676 markings, 180763302 edges, 313936 markings/sec, 185 secs
lola: 88201209 markings, 183482905 edges, 265907 markings/sec, 190 secs
lola: 89488505 markings, 186240199 edges, 257459 markings/sec, 195 secs
lola: 90950016 markings, 189339894 edges, 292302 markings/sec, 200 secs
lola: 92187716 markings, 191995004 edges, 247540 markings/sec, 205 secs
lola: 93967377 markings, 195620849 edges, 355932 markings/sec, 210 secs
lola: 95285873 markings, 198343591 edges, 263699 markings/sec, 215 secs
lola: 95809398 markings, 199449564 edges, 104705 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p36 <= p15)) OR (p8 <= p38)) U X ((p31 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p36 <= p15)) OR (p8 <= p38)) U X ((p31 <= p3)))
lola: processed formula length: 53
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p1 <= p20)))
lola: processed formula length: 19
lola: 71 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1426042 markings, 2925964 edges
lola: ========================================
lola: subprocess 3 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((X (F ((1 <= p4))) OR F ((p13 <= 1)))) AND X ((2 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((X (F ((1 <= p4))) OR F ((p13 <= 1)))) AND X ((2 <= p13)))))
lola: processed formula length: 70
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((1 <= p21) U (1 <= p3)) OR (G (F ((p26 + 1 <= p3))) AND F ((1 <= p3))))) OR G ((p18 + 1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((1 <= p21) U (1 <= p3)) OR (G (F ((p26 + 1 <= p3))) AND F ((1 <= p3))))) OR G ((p18 + 1 <= p14))))
lola: processed formula length: 107
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((p22 <= p29) OR (G ((p11 <= p9)) AND F ((p22 <= p29)))))) OR G ((p22 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p22 <= p29))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 <= p29))
lola: processed formula length: 16
lola: 71 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: 31 markings, 52 edges
lola: ========================================
lola: subprocess 6 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p22 <= p29) OR (G ((p11 <= p9)) AND F ((p22 <= p29))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p22 <= p29) OR (G ((p11 <= p9)) AND F ((p22 <= p29))))))
lola: processed formula length: 64
lola: 71 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 22 markings, 31 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((p17 + 1 <= p11))) R ((p18 <= p20) U (p31 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((p17 + 1 <= p11))) R ((p18 <= p20) U (p31 <= p18))))
lola: processed formula length: 62
lola: 71 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p2 + 1 <= p5))) AND F ((p15 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p2 + 1 <= p5))) AND F ((p15 <= 1))))
lola: processed formula length: 47
lola: 71 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: 1113 markings, 1747 edges
lola: ========================================
lola: subprocess 8 will run for 1669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p16 <= p11) U G ((2 <= p4))) AND G (F ((p16 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p16 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p16 <= p11)))
lola: processed formula length: 20
lola: 71 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: 60446 markings, 94762 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p27 + 1 <= p24)))) AND (F (G (((p27 + 1 <= p24)))) OR G (F ((1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p27 + 1 <= p24))))
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 (((p27 + 1 <= p24))))
lola: processed formula length: 26
lola: 71 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: add low 1
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: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p33 + 1 <= p5)) OR X (((p5 <= p33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p33 + 1 <= p5)) OR X (((p5 <= p33))))))
lola: processed formula length: 50
lola: 71 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: 3036497 markings, 6187536 edges, 607299 markings/sec, 0 secs
lola: 6065126 markings, 12486439 edges, 605726 markings/sec, 5 secs
lola: 8835151 markings, 18277788 edges, 554005 markings/sec, 10 secs
lola: 11485354 markings, 23775541 edges, 530041 markings/sec, 15 secs
lola: 14036446 markings, 29109769 edges, 510218 markings/sec, 20 secs
lola: 16556893 markings, 34364126 edges, 504089 markings/sec, 25 secs
lola: 19089644 markings, 39604850 edges, 506550 markings/sec, 30 secs
lola: 21649058 markings, 44855875 edges, 511883 markings/sec, 35 secs
lola: 24194679 markings, 50077222 edges, 509124 markings/sec, 40 secs
lola: 26725977 markings, 55307987 edges, 506260 markings/sec, 45 secs
lola: 29243455 markings, 60534725 edges, 503496 markings/sec, 50 secs
lola: 31674023 markings, 65569150 edges, 486114 markings/sec, 55 secs
lola: 34126282 markings, 70639607 edges, 490452 markings/sec, 60 secs
lola: 36575999 markings, 75698081 edges, 489943 markings/sec, 65 secs
lola: 39008663 markings, 80780564 edges, 486533 markings/sec, 70 secs
lola: 41336945 markings, 85726176 edges, 465656 markings/sec, 75 secs
lola: 43718194 markings, 90698522 edges, 476250 markings/sec, 80 secs
lola: 46038944 markings, 95560634 edges, 464150 markings/sec, 85 secs
lola: 48307344 markings, 100355072 edges, 453680 markings/sec, 90 secs
lola: 50761131 markings, 105350205 edges, 490757 markings/sec, 95 secs
lola: 53089316 markings, 110233465 edges, 465637 markings/sec, 100 secs
lola: 55405076 markings, 115101098 edges, 463152 markings/sec, 105 secs
lola: 57889919 markings, 120143600 edges, 496969 markings/sec, 110 secs
lola: 60205538 markings, 125000781 edges, 463124 markings/sec, 115 secs
lola: 62515513 markings, 129832781 edges, 461995 markings/sec, 120 secs
lola: 64781282 markings, 134639621 edges, 453154 markings/sec, 125 secs
lola: 67008474 markings, 139432605 edges, 445438 markings/sec, 130 secs
lola: 69308326 markings, 144271758 edges, 459970 markings/sec, 135 secs
lola: 71621960 markings, 149115604 edges, 462727 markings/sec, 140 secs
lola: 73794115 markings, 153785340 edges, 434431 markings/sec, 145 secs
lola: 76199216 markings, 158639018 edges, 481020 markings/sec, 150 secs
lola: 77765951 markings, 161953355 edges, 313347 markings/sec, 155 secs
lola: 79046804 markings, 164649943 edges, 256171 markings/sec, 160 secs
lola: 80167247 markings, 167005075 edges, 224089 markings/sec, 165 secs
lola: 82172423 markings, 171103147 edges, 401035 markings/sec, 170 secs
lola: 83629957 markings, 174228789 edges, 291507 markings/sec, 175 secs
lola: 85500844 markings, 177907500 edges, 374177 markings/sec, 180 secs
lola: 86828225 markings, 180675087 edges, 265476 markings/sec, 185 secs
lola: 88014501 markings, 183095703 edges, 237255 markings/sec, 190 secs
lola: 89561284 markings, 186405497 edges, 309357 markings/sec, 195 secs
lola: 91027131 markings, 189497702 edges, 293169 markings/sec, 200 secs
lola: 92438676 markings, 192487251 edges, 282309 markings/sec, 205 secs
lola: 93807151 markings, 195291495 edges, 273695 markings/sec, 210 secs
lola: 95098011 markings, 197963647 edges, 258172 markings/sec, 215 secs
lola: 95702823 markings, 199232189 edges, 120962 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no no no yes no no
lola:
preliminary result: no unknown no no no no no yes no no
lola: memory consumption: 3344 KB
lola: time consumption: 464 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="Angiogenesis-PT-20"
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 Angiogenesis-PT-20, 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 r011-tall-162038006000173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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