Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334600121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ClientsAndServers-PT-N1000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:42 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.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N1000P0-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-15

=== Now, execution of the tool begins

BK_START 1620898675672

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

FORMULA ClientsAndServers-PT-N1000P0-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N1000P0-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2916
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N1000P0

{
"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": "Thu May 13 09:38:01 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((F ((p17 + 1 <= p16)) AND (p3 <= p0)) U X ((p16 <= p10)))",
"processed_size": 58,
"rewrites": 44
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (X (G (((p15 <= p23) AND (p4 <= 1))))) AND ((p19 <= p8) AND (p15 <= p23))))",
"processed_size": 81,
"rewrites": 44
},
"result":
{
"edges": 50002,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p2 + 1 <= p23) OR (p16 <= p20))",
"processed_size": 34,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p20 + 1 <= p16)",
"processed_size": 16,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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 ((p6 + 1 <= p22))",
"processed_size": 19,
"rewrites": 44
},
"result":
{
"edges": 8020,
"markings": 8020,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 ((p5 + 1 <= p22))",
"processed_size": 19,
"rewrites": 44
},
"result":
{
"edges": 50001,
"markings": 50001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p14 <= p0)",
"processed_size": 11,
"rewrites": 46
},
"result":
{
"edges": 34017,
"markings": 34017,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1617
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F ((F (G ((1 <= p8))) OR (1 <= p8))) OR G ((p12 <= p11))))",
"processed_size": 62,
"rewrites": 44
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 3235
},
"child":
[

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((3 <= p12))",
"processed_size": 14,
"rewrites": 44
},
"result":
{
"edges": 8020,
"markings": 8020,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p24) AND F ((p4 <= p15)))))",
"processed_size": 40,
"rewrites": 44
},
"result":
{
"edges": 50003,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3424,
"runtime": 654.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F((F(G(**)) OR **)) OR G(**))) : (X(G((X(**) OR (G(**) AND X(F(**)))))) OR F(((** U **) AND **))) : ((F(**) AND **) U X(**)) : F(*) : (G(**) OR F(G((** AND F(**))))) : X((X(X(G((** AND *)))) AND (** AND **))) : (((X(*) AND *) OR G(*)) AND (F(*) OR G(((X(*) AND *) OR G(*))))) : X((** U X(X((G(F(*)) AND X(*))))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "yes yes yes no no no no unknown ",
"value": "yes yes yes no no no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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 ((F ((F (G ((1 <= p8))) OR (1 <= p8))) OR G ((p12 <= p11)))) : (X (G ((G ((p16 <= p0)) U X ((p16 <= p0))))) OR F ((((2 <= p7) U (p7 + 1 <= p8)) AND (p16 <= p0)))) : ((F ((p17 + 1 <= p16)) AND (p3 <= p0)) U X ((p16 <= p10))) : NOT(G ((p14 <= p0))) : (G ((3 <= p12)) OR F ((G ((2 <= p24)) AND G (F ((p4 <= p15)))))) : X ((((G (X (X ((p15 <= p23)))) AND NOT(X (F (X ((2 <= p4)))))) AND (p19 <= p8)) AND (p15 <= p23))) : NOT((G ((p20 + 1 <= p16)) U ((X ((p22 <= p5)) OR ((p23 <= p2) AND (p20 + 1 <= p16))) AND F ((p22 <= p6))))) : X (((p24 <= p18) U NOT(X (X ((F (G ((p22 <= p21))) OR X ((p9 <= 0))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:335
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((X ((p16 <= p0)) OR (G ((p16 <= p0)) AND X (F ((p16 <= p0))))))) OR F ((((2 <= p7) U (p7 + 1 <= p8)) AND (p16 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((2 <= p7) U (p7 + 1 <= p8)) AND (p16 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((2 <= p7) U (p7 + 1 <= p8)) AND (p16 <= p0)))
lola: processed formula length: 50
lola: 44 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p17 + 1 <= p16)) AND (p3 <= p0)) U X ((p16 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p17 + 1 <= p16)) AND (p3 <= p0)) U X ((p16 <= p10)))
lola: processed formula length: 58
lola: 44 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G (((p15 <= p23) AND (p4 <= 1))))) AND ((p19 <= p8) AND (p15 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G (((p15 <= p23) AND (p4 <= 1))))) AND ((p19 <= p8) AND (p15 <= p23))))
lola: processed formula length: 81
lola: 44 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: 50002 markings, 50002 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X ((p5 + 1 <= p22)) AND ((p2 + 1 <= p23) OR (p16 <= p20))) OR G ((p6 + 1 <= p22))) AND (F ((p16 <= p20)) OR G (((X ((p5 + 1 <= p22)) AND ((p2 + 1 <= p23) OR (p16 <= p20))) OR G ((p6 + 1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 + 1 <= p23) OR (p16 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 + 1 <= p23) OR (p16 <= p20))
lola: processed formula length: 34
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p16 <= p20))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p20 + 1 <= p16)
lola: processed formula length: 16
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p6 + 1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p6 + 1 <= p22))
lola: processed formula length: 19
lola: 44 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: 8020 markings, 8020 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p5 + 1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p5 + 1 <= p22))
lola: processed formula length: 19
lola: 44 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: 50001 markings, 50001 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p24 <= p18) U X (X ((G (F ((p21 + 1 <= p22))) AND X ((1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p24 <= p18) U X (X ((G (F ((p21 + 1 <= p22))) AND X ((1 <= p9)))))))
lola: processed formula length: 73
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 30 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: 2980480 markings, 8742116 edges, 596096 markings/sec, 0 secs
lola: 5558031 markings, 16696059 edges, 515510 markings/sec, 5 secs
lola: 7991051 markings, 24238775 edges, 486604 markings/sec, 10 secs
lola: 10533736 markings, 32228638 edges, 508537 markings/sec, 15 secs
lola: 13009993 markings, 40003233 edges, 495251 markings/sec, 20 secs
lola: 15430788 markings, 47671811 edges, 484159 markings/sec, 25 secs
lola: 17897465 markings, 55487389 edges, 493335 markings/sec, 30 secs
lola: 20290359 markings, 63066121 edges, 478579 markings/sec, 35 secs
lola: 22664997 markings, 70577164 edges, 474928 markings/sec, 40 secs
lola: 24836983 markings, 77459765 edges, 434397 markings/sec, 45 secs
lola: 27270495 markings, 85354184 edges, 486702 markings/sec, 50 secs
lola: 29772380 markings, 93243314 edges, 500377 markings/sec, 55 secs
lola: 32211131 markings, 100983976 edges, 487750 markings/sec, 60 secs
lola: 34641661 markings, 108876604 edges, 486106 markings/sec, 65 secs
lola: 37150031 markings, 116798807 edges, 501674 markings/sec, 70 secs
lola: 39419215 markings, 124221975 edges, 453837 markings/sec, 75 secs
lola: 41836073 markings, 131819490 edges, 483372 markings/sec, 80 secs
lola: 44225944 markings, 139629663 edges, 477974 markings/sec, 85 secs
lola: 46700171 markings, 147438661 edges, 494845 markings/sec, 90 secs
lola: 49021695 markings, 155015666 edges, 464305 markings/sec, 95 secs
lola: 51192701 markings, 162151266 edges, 434201 markings/sec, 100 secs
lola: 53677903 markings, 169916237 edges, 497040 markings/sec, 105 secs
lola: 55648393 markings, 176384326 edges, 394098 markings/sec, 110 secs
lola: 57463076 markings, 182377957 edges, 362937 markings/sec, 115 secs
lola: 59655801 markings, 189169357 edges, 438545 markings/sec, 120 secs
lola: 61423613 markings, 194968397 edges, 353562 markings/sec, 125 secs
lola: 63151667 markings, 200668594 edges, 345611 markings/sec, 130 secs
lola: 64972533 markings, 206397852 edges, 364173 markings/sec, 135 secs
lola: 67367509 markings, 214089879 edges, 478995 markings/sec, 140 secs
lola: 69649033 markings, 221604011 edges, 456305 markings/sec, 145 secs
lola: 71892723 markings, 229033436 edges, 448738 markings/sec, 150 secs
lola: 74427271 markings, 236881427 edges, 506910 markings/sec, 155 secs
lola: 76709305 markings, 244375092 edges, 456407 markings/sec, 160 secs
lola: 78963071 markings, 251823727 edges, 450753 markings/sec, 165 secs
lola: 81343216 markings, 259279436 edges, 476029 markings/sec, 170 secs
lola: 83651617 markings, 266772691 edges, 461680 markings/sec, 175 secs
lola: 85877495 markings, 274095439 edges, 445176 markings/sec, 180 secs
lola: 88069271 markings, 281347450 edges, 438355 markings/sec, 185 secs
lola: 90409453 markings, 288674011 edges, 468036 markings/sec, 190 secs
lola: 92661693 markings, 295964756 edges, 450448 markings/sec, 195 secs
lola: 94724451 markings, 302760646 edges, 412552 markings/sec, 200 secs
lola: 96752021 markings, 309461610 edges, 405514 markings/sec, 205 secs
lola: 98769524 markings, 316154417 edges, 403501 markings/sec, 210 secs
lola: 101114543 markings, 323386015 edges, 469004 markings/sec, 215 secs
lola: 103402209 markings, 330854915 edges, 457533 markings/sec, 220 secs
lola: 105628835 markings, 338200141 edges, 445325 markings/sec, 225 secs
lola: 107840533 markings, 345526698 edges, 442340 markings/sec, 230 secs
lola: 110014603 markings, 352773045 edges, 434814 markings/sec, 235 secs
lola: 112542053 markings, 360523275 edges, 505490 markings/sec, 240 secs
lola: 114740611 markings, 367724039 edges, 439712 markings/sec, 245 secs
lola: 116541538 markings, 373665850 edges, 360185 markings/sec, 250 secs
lola: 118422887 markings, 379903240 edges, 376270 markings/sec, 255 secs
lola: 120265397 markings, 386027233 edges, 368502 markings/sec, 260 secs
lola: 121901061 markings, 391486504 edges, 327133 markings/sec, 265 secs
lola: 124249273 markings, 398620090 edges, 469642 markings/sec, 270 secs
lola: 126223443 markings, 405072669 edges, 394834 markings/sec, 275 secs
lola: 128137211 markings, 411396687 edges, 382754 markings/sec, 280 secs
lola: 130118311 markings, 417938923 edges, 396220 markings/sec, 285 secs
lola: 132003614 markings, 424221541 edges, 377061 markings/sec, 290 secs
lola: 133971490 markings, 430751098 edges, 393575 markings/sec, 295 secs
lola: 136080867 markings, 437228962 edges, 421875 markings/sec, 300 secs
lola: 138099453 markings, 443752357 edges, 403717 markings/sec, 305 secs
lola: 139909425 markings, 449685730 edges, 361994 markings/sec, 310 secs
lola: 140966119 markings, 453180606 edges, 211339 markings/sec, 315 secs
lola: 142475835 markings, 458169398 edges, 301943 markings/sec, 320 secs
lola: 142542537 markings, 458392385 edges, 13340 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p0 + 1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p14 <= p0)
lola: processed formula length: 11
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 34017 markings, 34017 edges
lola: ========================================
lola: subprocess 6 will run for 1617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((F (G ((1 <= p8))) OR (1 <= p8))) OR G ((p12 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((F (G ((1 <= p8))) OR (1 <= p8))) OR G ((p12 <= p11))))
lola: processed formula length: 62
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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 7 will run for 3235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((3 <= p12)) OR F (G (((2 <= p24) AND F ((p4 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p12))
lola: processed formula length: 14
lola: 44 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: 8020 markings, 8020 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((p24 <= p18) U X (X ((G (F ((p21 + 1 <= p22))) AND X ((1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p24 <= p18) U X (X ((G (F ((p21 + 1 <= p22))) AND X ((1 <= p9)))))))
lola: processed formula length: 73
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 30 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: 3094021 markings, 9101199 edges, 618804 markings/sec, 0 secs
lola: 5919027 markings, 17800773 edges, 565001 markings/sec, 5 secs
lola: 8622861 markings, 26258694 edges, 540767 markings/sec, 10 secs
lola: 11358217 markings, 34813949 edges, 547071 markings/sec, 15 secs
lola: 13954705 markings, 43067021 edges, 519298 markings/sec, 20 secs
lola: 16658501 markings, 51494979 edges, 540759 markings/sec, 25 secs
lola: 19223320 markings, 59617893 edges, 512964 markings/sec, 30 secs
lola: 21713051 markings, 67523484 edges, 497946 markings/sec, 35 secs
lola: 23757891 markings, 74129689 edges, 408968 markings/sec, 40 secs
lola: 25980632 markings, 81134126 edges, 444548 markings/sec, 45 secs
lola: 28382857 markings, 88756646 edges, 480445 markings/sec, 50 secs
lola: 30778947 markings, 96536986 edges, 479218 markings/sec, 55 secs
lola: 33276377 markings, 104420676 edges, 499486 markings/sec, 60 secs
lola: 35595663 markings, 112027422 edges, 463857 markings/sec, 65 secs
lola: 38031653 markings, 119662763 edges, 487198 markings/sec, 70 secs
lola: 40064841 markings, 126338698 edges, 406638 markings/sec, 75 secs
lola: 42510808 markings, 134010250 edges, 489193 markings/sec, 80 secs
lola: 44767867 markings, 141416689 edges, 451412 markings/sec, 85 secs
lola: 47236187 markings, 149171629 edges, 493664 markings/sec, 90 secs
lola: 49418057 markings, 156304275 edges, 436374 markings/sec, 95 secs
lola: 51589673 markings, 163280032 edges, 434323 markings/sec, 100 secs
lola: 53975487 markings, 170890436 edges, 477163 markings/sec, 105 secs
lola: 56056325 markings, 177728021 edges, 416168 markings/sec, 110 secs
lola: 58301510 markings, 184802756 edges, 449037 markings/sec, 115 secs
lola: 60501045 markings, 191926488 edges, 439907 markings/sec, 120 secs
lola: 62424865 markings, 198253828 edges, 384764 markings/sec, 125 secs
lola: 64303939 markings, 204485927 edges, 375815 markings/sec, 130 secs
lola: 66835809 markings, 212349647 edges, 506374 markings/sec, 135 secs
lola: 69266519 markings, 220324056 edges, 486142 markings/sec, 140 secs
lola: 71662739 markings, 228256185 edges, 479244 markings/sec, 145 secs
lola: 74267617 markings, 236364544 edges, 520976 markings/sec, 150 secs
lola: 76649716 markings, 244175367 edges, 476420 markings/sec, 155 secs
lola: 79004473 markings, 251953004 edges, 470951 markings/sec, 160 secs
lola: 81500515 markings, 259777055 edges, 499208 markings/sec, 165 secs
lola: 83906073 markings, 267604511 edges, 481112 markings/sec, 170 secs
lola: 86240887 markings, 275294193 edges, 466963 markings/sec, 175 secs
lola: 88506372 markings, 282818321 edges, 453097 markings/sec, 180 secs
lola: 90998365 markings, 290555032 edges, 498399 markings/sec, 185 secs
lola: 93269675 markings, 297959571 edges, 454262 markings/sec, 190 secs
lola: 95410645 markings, 305016630 edges, 428194 markings/sec, 195 secs
lola: 97505579 markings, 311964812 edges, 418987 markings/sec, 200 secs
lola: 99650006 markings, 318932851 edges, 428885 markings/sec, 205 secs
lola: 102129337 markings, 326681958 edges, 495866 markings/sec, 210 secs
lola: 104439901 markings, 334269841 edges, 462113 markings/sec, 215 secs
lola: 106727814 markings, 341835639 edges, 457583 markings/sec, 220 secs
lola: 108963709 markings, 349263672 edges, 447179 markings/sec, 225 secs
lola: 111394280 markings, 356828304 edges, 486114 markings/sec, 230 secs
lola: 113719240 markings, 364368207 edges, 464992 markings/sec, 235 secs
lola: 115834444 markings, 371327030 edges, 423041 markings/sec, 240 secs
lola: 117768101 markings, 377732305 edges, 386731 markings/sec, 245 secs
lola: 119652815 markings, 383977851 edges, 376943 markings/sec, 250 secs
lola: 121504655 markings, 390144447 edges, 370368 markings/sec, 255 secs
lola: 123723139 markings, 396919927 edges, 443697 markings/sec, 260 secs
lola: 125758243 markings, 403544851 edges, 407021 markings/sec, 265 secs
lola: 127616017 markings, 409671360 edges, 371555 markings/sec, 270 secs
lola: 129536465 markings, 416011598 edges, 384090 markings/sec, 275 secs
lola: 131390748 markings, 422167596 edges, 370857 markings/sec, 280 secs
lola: 133198269 markings, 428174321 edges, 361504 markings/sec, 285 secs
lola: 134702507 markings, 433211906 edges, 300848 markings/sec, 290 secs
lola: 136792333 markings, 439497200 edges, 417965 markings/sec, 295 secs
lola: 138657569 markings, 445580679 edges, 373047 markings/sec, 300 secs
lola: 140002681 markings, 449997956 edges, 269022 markings/sec, 305 secs
lola: 141529939 markings, 455047915 edges, 305452 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((3 <= p12)) OR F (G (((2 <= p24) AND F ((p4 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((3 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p12))
lola: processed formula length: 14
lola: 44 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: 8020 markings, 8020 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p24) AND F ((p4 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((2 <= p24) AND F ((p4 <= p15)))))
lola: processed formula length: 40
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 50002 markings, 50003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no unknown
lola:
preliminary result: yes yes yes no no no no unknown
lola: memory consumption: 3424 KB
lola: time consumption: 654 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="ClientsAndServers-PT-N1000P0"
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 ClientsAndServers-PT-N1000P0, 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 r056-oct2-162038334600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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