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.r227-tall-162098230900173.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 ShieldIIPt-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230900173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 161K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:52 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 ShieldIIPt-PT-001B-00
FORMULA_NAME ShieldIIPt-PT-001B-01
FORMULA_NAME ShieldIIPt-PT-001B-02
FORMULA_NAME ShieldIIPt-PT-001B-03
FORMULA_NAME ShieldIIPt-PT-001B-04
FORMULA_NAME ShieldIIPt-PT-001B-05
FORMULA_NAME ShieldIIPt-PT-001B-06
FORMULA_NAME ShieldIIPt-PT-001B-07
FORMULA_NAME ShieldIIPt-PT-001B-08
FORMULA_NAME ShieldIIPt-PT-001B-09
FORMULA_NAME ShieldIIPt-PT-001B-10
FORMULA_NAME ShieldIIPt-PT-001B-11
FORMULA_NAME ShieldIIPt-PT-001B-12
FORMULA_NAME ShieldIIPt-PT-001B-13
FORMULA_NAME ShieldIIPt-PT-001B-14
FORMULA_NAME ShieldIIPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1621140629037

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 04:50:30] [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-16 04:50:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 04:50:30] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-16 04:50:30] [INFO ] Transformed 73 places.
[2021-05-16 04:50:30] [INFO ] Transformed 68 transitions.
[2021-05-16 04:50:30] [INFO ] Found NUPN structural information;
[2021-05-16 04:50:30] [INFO ] Parsed PT model containing 73 places and 68 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=358 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 68 rows 73 cols
[2021-05-16 04:50:30] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-16 04:50:30] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-16 04:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned unsat
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-16 04:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 04:50:31] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-16 04:50:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 04:50:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2021-05-16 04:50:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-16 04:50:31] [INFO ] Flatten gal took : 29 ms
FORMULA ShieldIIPt-PT-001B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 04:50:31] [INFO ] Applying decomposition
[2021-05-16 04:50:31] [INFO ] Flatten gal took : 9 ms
[2021-05-16 04:50:31] [INFO ] Decomposing Gal with order
[2021-05-16 04:50:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 04:50:31] [INFO ] Flatten gal took : 27 ms
[2021-05-16 04:50:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 04:50:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 04:50:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-001B @ 3570 seconds

FORMULA ShieldIIPt-PT-001B-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3293
rslt: Output for LTLCardinality @ ShieldIIPt-PT-001B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 04:50:32 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((((p58 <= 0)) OR ((1 <= p16))) U (((p27 <= 0)) OR ((1 <= p54)))) AND X (G ((((p58 <= 0)) OR ((1 <= p16)))))))",
"processed_size": 117,
"rewrites": 62
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 5,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (X (X (F ((((1 <= p15)) AND ((p41 <= 0)))))))))",
"processed_size": 55,
"rewrites": 62
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (F (((p64 <= 0))))",
"processed_size": 20,
"rewrites": 62
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p38)) AND ((p36 <= 0)))))",
"processed_size": 39,
"rewrites": 62
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 585
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 3,
"aconj": 10,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((X (F ((((p26 <= 0)) OR ((1 <= p43))))) AND (((p7 <= 0)) OR ((1 <= p39)))) OR (G (F ((((p7 <= 0)) OR ((1 <= p39))))) AND F ((X (F ((((p26 <= 0)) OR ((1 <= p43))))) AND (((p7 <= 0)) OR ((1 <= p39)))))))))",
"processed_size": 215,
"rewrites": 62
},
"result":
{
"edges": 90124524,
"markings": 13041092,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p63 <= 0)) OR ((1 <= p47)))))",
"processed_size": 39,
"rewrites": 62
},
"result":
{
"edges": 1892798,
"markings": 672332,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1135
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p41)) AND ((p30 <= 0)))))",
"processed_size": 39,
"rewrites": 62
},
"result":
{
"edges": 99,
"markings": 98,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1703
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F (G (((1 <= p7)))) OR G (((p12 <= 0))))))",
"processed_size": 49,
"rewrites": 62
},
"result":
{
"edges": 202,
"markings": 198,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 3406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 11,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 7,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F (((G ((((1 <= p38)) AND ((p3 <= 0)))) AND (((1 <= p5)) AND (((p22 <= 0)) AND (((p16 <= 0)) OR ((1 <= p71)))))) OR (G ((((p38 <= 0)) OR ((1 <= p3)))) AND F ((G ((((1 <= p38)) AND ((p3 <= 0)))) AND (((1 <= p5)) AND (((p22 <= 0)) AND (((p16 <= 0)) OR ((1 <= p71)))))))))))",
"processed_size": 277,
"rewrites": 62
},
"result":
{
"edges": 104540681,
"markings": 6609678,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 27
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 34156,
"runtime": 277.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((X((F(G(*)) OR X(F(*)))) OR G(**))) : G(F(((G(**) AND (** AND (** AND **))) OR (G(**) AND F((G(**) AND (** AND (** AND **)))))))) : X(((** U **) AND X(G(**)))) : G(F((F(G(**)) OR G(*)))) : X(X(X(X(X(F(*)))))) : G(F(**)) : F(G(*)) : X((X(X(X(G(**)))) OR (** OR **))) : X(F(*)) : X(G(**)) : F(G(**)) : X(G(((X(F(**)) AND **) OR (G(F(**)) AND F((X(F(**)) AND **))))))"
},
"net":
{
"arcs": 168,
"conflict_clusters": 61,
"places": 73,
"places_significant": 63,
"singleton_clusters": 0,
"transitions": 68
},
"result":
{
"preliminary_value": "yes no no no no yes no no yes no yes yes ",
"value": "yes no no no no yes no no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 141/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 73
lola: finding significant places
lola: 73 places, 68 transitions, 63 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 true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: F ((X ((NOT(F (G (F (((1 <= p0)))))) OR NOT(X (G ((((p16 <= 0)) OR ((1 <= p63)))))))) OR G ((((1 <= p16)) AND ((p63 <= 0)))))) : F (G (F ((G ((((p38 <= 0)) OR ((1 <= p3)))) U (((G ((((1 <= p38)) AND ((p3 <= 0)))) AND ((1 <= p5))) AND ((p22 <= 0))) AND (((p16 <= 0)) OR ((1 <= p71)))))))) : X ((((((p58 <= 0)) OR ((1 <= p16))) U (((p27 <= 0)) OR ((1 <= p54)))) AND X (G ((((p58 <= 0)) OR ((1 <= p16))))))) : (((1 <= p7)) U G (NOT(X (G ((G (NOT(G (((1 <= p7))))) AND F (((1 <= p12))))))))) : X (X (X (NOT(G (X (X ((((p15 <= 0)) OR ((1 <= p41)))))))))) : F (G (F (X ((F ((((p63 <= 0)) OR ((1 <= p47)) OR ((p43 <= 0)) OR ((1 <= p9)))) U (((p63 <= 0)) OR ((1 <= p47)))))))) : X (F (G (X (NOT(X ((((p41 <= 0)) OR ((1 <= p30))))))))) : X (((NOT(X (X (NOT(G (X ((((p14 <= 0)) OR ((1 <= p37))))))))) OR (((1 <= p59)) AND ((p21 <= 0)))) OR (((1 <= p14)) AND ((p37 <= 0))))) : NOT(X (G (((1 <= p64))))) : G (X ((((1 <= p38)) AND ((p36 <= 0))))) : F (G ((((p72 <= 0)) OR ((1 <= p51))))) : X (G ((F (G (F ((((p7 <= 0)) OR ((1 <= p39)))))) U (X (F (((((p37 <= 0)) OR ((1 <= p47))) U (((p26 <= 0)) OR ((1 <= p43)))))) AND (((p7 <= 0)) OR ((1 <= p39)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((F (G (((p0 <= 0)))) OR X (F ((((1 <= p16)) AND ((p63 <= 0))))))) OR G ((((1 <= p16)) AND ((p63 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((F (G (((p0 <= 0)))) OR X (F ((((1 <= p16)) AND ((p63 <= 0))))))) OR G ((((1 <= p16)) AND ((p63 <= 0))))))
lola: processed formula length: 113
lola: 62 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: 1168902 markings, 4554846 edges, 233780 markings/sec, 0 secs
lola: 1978461 markings, 9097432 edges, 161912 markings/sec, 5 secs
lola: 2704835 markings, 13582008 edges, 145275 markings/sec, 10 secs
lola: 3430118 markings, 18065902 edges, 145057 markings/sec, 15 secs
lola: 4041630 markings, 22636894 edges, 122302 markings/sec, 20 secs
lola: 4516611 markings, 27237352 edges, 94996 markings/sec, 25 secs
lola: 4941605 markings, 31882006 edges, 84999 markings/sec, 30 secs
lola: 5332427 markings, 36615806 edges, 78164 markings/sec, 35 secs
lola: 5727184 markings, 41427729 edges, 78951 markings/sec, 40 secs
lola: 6045807 markings, 46002928 edges, 63725 markings/sec, 45 secs
lola: 6477072 markings, 51005828 edges, 86253 markings/sec, 50 secs
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: 6481281 markings, 51048820 edges
lola: ========================================
lola: subprocess 1 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((p58 <= 0)) OR ((1 <= p16))) U (((p27 <= 0)) OR ((1 <= p54)))) AND X (G ((((p58 <= 0)) OR ((1 <= p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((p58 <= 0)) OR ((1 <= p16))) U (((p27 <= 0)) OR ((1 <= p54)))) AND X (G ((((p58 <= 0)) OR ((1 <= p16)))))))
lola: processed formula length: 117
lola: 62 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: 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: 35 markings, 35 edges
lola: ========================================
lola: subprocess 2 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (F ((((1 <= p15)) AND ((p41 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (F ((((1 <= p15)) AND ((p41 <= 0)))))))))
lola: processed formula length: 55
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (G ((((p14 <= 0)) OR ((1 <= p37))))))) OR ((((1 <= p59)) AND ((p21 <= 0))) OR (((1 <= p14)) AND ((p37 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (G ((((p14 <= 0)) OR ((1 <= p37))))))) OR ((((1 <= p59)) AND ((p21 <= 0))) OR (((1 <= p14)) AND ((p37 <= 0))))))
lola: processed formula length: 125
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 399 edges
lola: ========================================
lola: subprocess 4 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p64 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p64 <= 0))))
lola: processed formula length: 20
lola: 62 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p38)) AND ((p36 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p38)) AND ((p36 <= 0)))))
lola: processed formula length: 39
lola: 62 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 6 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X (F ((((p26 <= 0)) OR ((1 <= p43))))) AND (((p7 <= 0)) OR ((1 <= p39)))) OR (G (F ((((p7 <= 0)) OR ((1 <= p39))))) AND F ((X (F ((((p26 <= 0)) OR ((1 <= p43))))) AND (((p7 <= 0)) OR ((1 <= p39)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X (F ((((p26 <= 0)) OR ((1 <= p43))))) AND (((p7 <= 0)) OR ((1 <= p39)))) OR (G (F ((((p7 <= 0)) OR ((1 <= p39))))) AND F ((X (F ((((p26 <= 0)) OR ((1 <= p43))))) AND (((p7 <= 0)) OR ((1 <= p39)))))))))
lola: processed formula length: 215
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1006272 markings, 4572379 edges, 201254 markings/sec, 0 secs
lola: 1768311 markings, 9133122 edges, 152408 markings/sec, 5 secs
lola: 2502222 markings, 13774345 edges, 146782 markings/sec, 10 secs
lola: 2964437 markings, 17862355 edges, 92443 markings/sec, 15 secs
lola: 4094558 markings, 22015605 edges, 226024 markings/sec, 20 secs
lola: 5316603 markings, 25703368 edges, 244409 markings/sec, 25 secs
lola: 6454724 markings, 29422684 edges, 227624 markings/sec, 30 secs
lola: 7350007 markings, 33514698 edges, 179057 markings/sec, 35 secs
lola: 8044929 markings, 37802431 edges, 138984 markings/sec, 40 secs
lola: 8665106 markings, 42169291 edges, 124035 markings/sec, 45 secs
lola: 9173953 markings, 46602539 edges, 101769 markings/sec, 50 secs
lola: 9730215 markings, 50978455 edges, 111252 markings/sec, 55 secs
lola: 10171694 markings, 55307439 edges, 88296 markings/sec, 60 secs
lola: 10505830 markings, 59844566 edges, 66827 markings/sec, 65 secs
lola: 10858830 markings, 64422199 edges, 70600 markings/sec, 70 secs
lola: 11148678 markings, 68998123 edges, 57970 markings/sec, 75 secs
lola: 11409183 markings, 73591997 edges, 52101 markings/sec, 80 secs
lola: 11731056 markings, 78061639 edges, 64375 markings/sec, 85 secs
lola: 11846696 markings, 82054443 edges, 23128 markings/sec, 90 secs
lola: 12548637 markings, 86729112 edges, 140388 markings/sec, 95 secs
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: 13041092 markings, 90124524 edges
lola: ========================================
lola: subprocess 7 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p63 <= 0)) OR ((1 <= p47)))))
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 ((((p63 <= 0)) OR ((1 <= p47)))))
lola: processed formula length: 39
lola: 62 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 672332 markings, 1892798 edges
lola: ========================================
lola: subprocess 8 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p72 <= 0)) OR ((1 <= p51)))))
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 ((((p72 <= 0)) OR ((1 <= p51)))))
lola: processed formula length: 39
lola: 62 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2318 markings, 2687 edges
lola: ========================================
lola: subprocess 9 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p41)) AND ((p30 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p41)) AND ((p30 <= 0)))))
lola: processed formula length: 39
lola: 62 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: 98 markings, 99 edges
lola: ========================================
lola: subprocess 10 will run for 1703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((1 <= p7)))) OR G (((p12 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((1 <= p7)))) OR G (((p12 <= 0))))))
lola: processed formula length: 49
lola: 62 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: 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: 198 markings, 202 edges
lola: ========================================
lola: subprocess 11 will run for 3406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G ((((1 <= p38)) AND ((p3 <= 0)))) AND (((1 <= p5)) AND (((p22 <= 0)) AND (((p16 <= 0)) OR ((1 <= p71)))))) OR (G ((((p38 <= 0)) OR ((1 <= p3)))) AND F ((G ((((1 <= p38)) AND ((p3 <= 0)))) AND (((1 <= p5)) AND (((p22 <= 0)) AND (((p16 <= 0)) OR ((1 <= p71)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((G ((((1 <= p38)) AND ((p3 <= 0)))) AND (((1 <= p5)) AND (((p22 <= 0)) AND (((p16 <= 0)) OR ((1 <= p71)))))) OR (G ((((p38 <= 0)) OR ((1 <= p3)))) AND F ((G ((((1 <= p38)) AND ((p3 <= 0)))) AND (((1 <= p5)) AND (((p22 <= 0)) AND (((p16 <= 0)) OR ((1 <= p71)))))))))))
lola: processed formula length: 277
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 27 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: 478369 markings, 4134801 edges, 95674 markings/sec, 0 secs
lola: 885417 markings, 8449285 edges, 81410 markings/sec, 5 secs
lola: 1264576 markings, 12877898 edges, 75832 markings/sec, 10 secs
lola: 1591565 markings, 17327838 edges, 65398 markings/sec, 15 secs
lola: 1922504 markings, 21839879 edges, 66188 markings/sec, 20 secs
lola: 2253441 markings, 26326437 edges, 66187 markings/sec, 25 secs
lola: 2571884 markings, 30861011 edges, 63689 markings/sec, 30 secs
lola: 2887890 markings, 35436529 edges, 63201 markings/sec, 35 secs
lola: 3205055 markings, 40071733 edges, 63433 markings/sec, 40 secs
lola: 3479471 markings, 44634777 edges, 54883 markings/sec, 45 secs
lola: 3738200 markings, 49368538 edges, 51746 markings/sec, 50 secs
lola: 3993544 markings, 54151606 edges, 51069 markings/sec, 55 secs
lola: 4247719 markings, 58889613 edges, 50835 markings/sec, 60 secs
lola: 4507569 markings, 63634900 edges, 51970 markings/sec, 65 secs
lola: 4765859 markings, 68346848 edges, 51658 markings/sec, 70 secs
lola: 5006478 markings, 73200457 edges, 48124 markings/sec, 75 secs
lola: 5260192 markings, 77943601 edges, 50743 markings/sec, 80 secs
lola: 5516716 markings, 82702431 edges, 51305 markings/sec, 85 secs
lola: 5757323 markings, 87533406 edges, 48121 markings/sec, 90 secs
lola: 5995624 markings, 92351141 edges, 47660 markings/sec, 95 secs
lola: 6237169 markings, 97093608 edges, 48309 markings/sec, 100 secs
lola: 6476091 markings, 101792763 edges, 47784 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6609678 markings, 104540681 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no yes no yes yes
lola:
preliminary result: yes no no no no yes no no yes no yes yes
lola: memory consumption: 34156 KB
lola: time consumption: 277 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="ShieldIIPt-PT-001B"
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 ShieldIIPt-PT-001B, 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 r227-tall-162098230900173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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