Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928800595.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is LamportFastMutEx-COL-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.5K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 39K Apr 30 13:04 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 LamportFastMutEx-COL-3-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591215361450

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:16:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:16:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:16:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 20:16:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 499 ms
[2020-06-03 20:16:03] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2020-06-03 20:16:03] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 22 ms.
[2020-06-03 20:16:03] [INFO ] Computed order based on color domains.
[2020-06-03 20:16:03] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions in 20 ms.
[2020-06-03 20:16:03] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 56 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 155 ms. (steps per millisecond=645 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 20:16:03] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2020-06-03 20:16:03] [INFO ] Computed 17 place invariants in 4 ms
[2020-06-03 20:16:03] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2020-06-03 20:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:03] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 20:16:03] [INFO ] State equation strengthened by 33 read => feed constraints.
[2020-06-03 20:16:03] [INFO ] [Real]Added 33 Read/Feed constraints in 13 ms returned sat
[2020-06-03 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:04] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 15 ms returned sat
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 17 places in 35 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 15 places in 29 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 17 places in 22 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 14 places in 19 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 12 places in 21 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 12 places in 18 ms
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2020-06-03 20:16:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 352 ms
[2020-06-03 20:16:04] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Real]Added 33 Read/Feed constraints in 13 ms returned sat
[2020-06-03 20:16:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2020-06-03 20:16:04] [INFO ] Deduced a trap composed of 9 places in 22 ms
[2020-06-03 20:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2020-06-03 20:16:04] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 11 ms.
[2020-06-03 20:16:04] [INFO ] Added : 76 causal constraints over 17 iterations in 137 ms. Result :sat
[2020-06-03 20:16:04] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:16:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 132 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:05] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 20:16:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 22 places in 26 ms
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2020-06-03 20:16:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2020-06-03 20:16:05] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 23 ms.
[2020-06-03 20:16:05] [INFO ] Added : 90 causal constraints over 19 iterations in 250 ms. Result :sat
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 23 places in 28 ms
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 19 places in 53 ms
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2020-06-03 20:16:05] [INFO ] Deduced a trap composed of 22 places in 255 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 20 places in 87 ms
[2020-06-03 20:16:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 643 ms
[2020-06-03 20:16:06] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
[2020-06-03 20:16:06] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2020-06-03 20:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:06] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 20:16:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2020-06-03 20:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:06] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-03 20:16:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 18 places in 24 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 10 places in 18 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 9 places in 19 ms
[2020-06-03 20:16:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 270 ms
[2020-06-03 20:16:06] [INFO ] Computed and/alt/rep : 111/423/93 causal constraints in 7 ms.
[2020-06-03 20:16:06] [INFO ] Added : 71 causal constraints over 15 iterations in 206 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 20:16:06] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 20:16:06] [INFO ] Flatten gal took : 53 ms
[2020-06-03 20:16:06] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 20:16:06] [INFO ] Flatten gal took : 13 ms
FORMULA LamportFastMutEx-COL-3-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:16:06] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 20:16:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ LamportFastMutEx-COL-3 @ 3570 seconds

FORMULA LamportFastMutEx-COL-3-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLCardinality @ LamportFastMutEx-COL-3

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:16:07 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EF(AX((p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p61 + p60 + p59)))",
"processed_size": 84,
"rewrites": 18
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 1066,
"markings": 557,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p67 + p66 + p65)))",
"processed_size": 30,
"rewrites": 17
},
"result":
{
"edges": 33479,
"markings": 14078,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX((1 <= p47 + p48 + p49))",
"processed_size": 26,
"rewrites": 17
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p26 + p27 + p28 <= p17 + p18 + p19) AND (2 <= p47 + p48 + p49))",
"processed_size": 65,
"rewrites": 18
},
"result":
{
"edges": 286,
"markings": 231,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EF((EF((3 <= p67 + p66 + p65)) AND EX((1 <= p23 + p24 + p25))))",
"processed_size": 63,
"rewrites": 19
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 136286,
"markings": 19742,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EX((p0 + p1 + p2 <= p61 + p60 + p59))",
"processed_size": 37,
"rewrites": 17
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p47 + p48 + p49)))",
"processed_size": 30,
"rewrites": 17
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(p67 + p66 + p65 <= p61 + p60 + p59)",
"processed_size": 36,
"rewrites": 19
},
"result":
{
"edges": 211,
"markings": 174,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "AG((EX((2 <= p64 + p63 + p62)) OR ((p67 + p66 + p65 + 1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) OR (p61 + p60 + p59 <= 0))))",
"processed_size": 140,
"rewrites": 18
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 570,
"markings": 313,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (1 <= p68 + p69 + p70))))",
"processed_size": 95,
"rewrites": 17
},
"result":
{
"edges": 68,
"markings": 68,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A (G (((p20 + p21 + p22 <= p32 + p33 + p34) OR (p68 + p69 + p70 <= 0) OR (p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2))))",
"processed_size": 136,
"rewrites": 18
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(p23 + p24 + p25 <= 0)",
"processed_size": 22,
"rewrites": 19
},
"result":
{
"edges": 56413,
"markings": 19693,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E(((p61 + p60 + p59 <= p23 + p24 + p25) OR (p20 + p21 + p22 <= 1)) U AG((p68 + p69 + p70 <= p0 + p1 + p2)))",
"processed_size": 108,
"rewrites": 18
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 93693,
"markings": 19742,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(1 <= p61 + p60 + p59)",
"processed_size": 22,
"rewrites": 19
},
"result":
{
"edges": 570,
"markings": 313,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19))",
"processed_size": 101,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19))",
"processed_size": 101,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (((p47 + p48 + p49 <= 0) U ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59))))",
"processed_size": 132,
"rewrites": 19
},
"result":
{
"edges": 11052,
"markings": 4268,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22004,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(X(*)))) : (A(X(**)) OR E(F(**))) : A(G(E(F(**)))) : E(G(E(F(**)))) : E(X(E(F(**)))) : E(F((E(F(**)) AND E(X(**))))) : A(G(**)) : (A(F(*)) AND (E(F(**)) OR (A(X(**)) OR E(X(**))))) : E(F(**)) : A(G((E(X(**)) OR (** OR **)))) : E((** U A(G(**)))) : (E((** U **)) OR **)"
},
"net":
{
"arcs": 480,
"conflict_clusters": 6,
"places": 71,
"places_significant": 54,
"singleton_clusters": 0,
"transitions": 114
},
"result":
{
"preliminary_value": "yes no yes yes yes no no no yes no no no ",
"value": "yes no yes yes yes no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 185/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 71
lola: finding significant places
lola: 71 places, 114 transitions, 54 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 CTLCardinality.xml
lola: NOT(A (G (E (X ((p61 + p60 + p59 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))))) : (A (X ((1 <= p47 + p48 + p49))) OR E (((0 <= 0) U (2 <= p67 + p66 + p65)))) : A (G (E (F ((p23 + p24 + p25 <= 0))))) : (A (X ((0 <= 0))) AND E (G (E (F ((1 <= p61 + p60 + p59)))))) : E (X (E (F (((p26 + p27 + p28 <= p17 + p18 + p19) AND (2 <= p47 + p48 + p49)))))) : E (F ((E (F ((3 <= p67 + p66 + p65))) AND E (X ((1 <= p23 + p24 + p25)))))) : A (G (((p20 + p21 + p22 <= p32 + p33 + p34) OR (p68 + p69 + p70 <= 0) OR (p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2)))) : (NOT(E (G ((p67 + p66 + p65 <= p61 + p60 + p59)))) AND ((E (F ((1 <= p47 + p48 + p49))) OR A (X ((p67 + p66 + p65 <= p29 + p30 + p31)))) OR E (X ((p0 + p1 + p2 <= p61 + p60 + p59))))) : E (F (A (F (((3 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (1 <= p68 + p69 + p70)))))) : A (G (((E (X ((2 <= p64 + p63 + p62))) OR (p67 + p66 + p65 + 1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)) OR (p61 + p60 + p59 <= 0)))) : E ((((p61 + p60 + p59 <= p23 + p24 + p25) OR (p20 + p21 + p22 <= 1)) U A (G ((p68 + p69 + p70 <= p0 + p1 + p2))))) : (E (((p47 + p48 + p49 <= 0) U ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59)))) OR ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p61 + p60 + p59)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p61 + p60 + p59)))
lola: processed formula length: 84
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 557 markings, 1066 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= p47 + p48 + p49))) OR E (F ((2 <= p67 + p66 + p65))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p67 + p66 + p65)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p67 + p66 + p65)))
lola: processed formula length: 30
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p67 + p66 + p65)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 14078 markings, 33479 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p47 + p48 + p49)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p47 + p48 + p49))
lola: processed formula length: 26
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((p26 + p27 + p28 <= p17 + p18 + p19) AND (2 <= p47 + p48 + p49))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((p26 + p27 + p28 <= p17 + p18 + p19) AND (2 <= p47 + p48 + p49))
lola: processed formula length: 65
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p26 + p27 + p28 <= p17 + p18 + p19) AND (2 <= p47 + p48 + p49))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 231 markings, 286 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-2-0.sara.
lola: ...considering subproblem: E (F ((E (F ((3 <= p67 + p66 + p65))) AND E (X ((1 <= p23 + p24 + p25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EF((3 <= p67 + p66 + p65)) AND EX((1 <= p23 + p24 + p25))))
lola: processed formula length: 63
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19742 markings, 136286 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p61 + p60 + p59 + 1 <= p67 + p66 + p65))) AND (E (F ((1 <= p47 + p48 + p49))) OR (A (X ((p67 + p66 + p65 <= p29 + p30 + p31))) OR E (X ((p0 + p1 + p2 <= p61 + p60 + p59))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p0 + p1 + p2 <= p61 + p60 + p59)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p0 + p1 + p2 <= p61 + p60 + p59))
lola: processed formula length: 37
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p47 + p48 + p49)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p47 + p48 + p49)))
lola: processed formula length: 30
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p61 + p60 + p59 + 1 <= p67 + p66 + p65)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p67 + p66 + p65 <= p61 + p60 + p59)
lola: processed formula length: 36
lola: 19 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p61 + p60 + p59 + 1 <= p67 + p66 + p65)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 174 markings, 211 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((2 <= p64 + p63 + p62))) OR ((p67 + p66 + p65 + 1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) OR (p61 + p60 + p59 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX((2 <= p64 + p63 + p62)) OR ((p67 + p66 + p65 + 1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) OR (p61 + p60 + p59 <= 0))))
lola: processed formula length: 140
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 313 markings, 570 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (1 <= p68 + p69 + p70))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (1 <= p68 + p69 + p70))))
lola: processed formula length: 95
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 68 markings, 68 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p20 + p21 + p22 <= p32 + p33 + p34) OR (p68 + p69 + p70 <= 0) OR (p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p20 + p21 + p22 <= p32 + p33 + p34) OR (p68 + p69 + p70 <= 0) OR (p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2))))
lola: processed formula length: 136
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p32 + p33 + p34 + 1 <= p20 + p21 + p22) AND (1 <= p68 + p69 + p70) AND (3 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 102 edges
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p23 + p24 + p25 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p23 + p24 + p25 <= 0)
lola: processed formula length: 22
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p23 + p24 + p25 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p23 + p24 + p25)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 19693 markings, 56413 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p61 + p60 + p59 <= p23 + p24 + p25) OR (p20 + p21 + p22 <= 1)) U A (G ((p68 + p69 + p70 <= p0 + p1 + p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p61 + p60 + p59 <= p23 + p24 + p25) OR (p20 + p21 + p22 <= 1)) U AG((p68 + p69 + p70 <= p0 + p1 + p2)))
lola: processed formula length: 108
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19742 markings, 93693 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= p61 + p60 + p59)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (1 <= p61 + p60 + p59)
lola: processed formula length: 22
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 313 markings, 570 edges
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p47 + p48 + p49 <= 0) U ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59)))) OR ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19))
lola: processed formula length: 101
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: (E (((p47 + p48 + p49 <= 0) U ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59)))) OR ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p67 + p66 + p65 <= p17 + p18 + p19))
lola: processed formula length: 101
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((p47 + p48 + p49 <= 0) U ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p47 + p48 + p49 <= 0) U ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59))))
lola: processed formula length: 132
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p47 + p48 + p49) AND (1 <= p61 + p60 + p59))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 4268 markings, 11052 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no no no yes no no no
lola:
preliminary result: yes no yes yes yes no no no yes no no no
lola: memory consumption: 22004 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="LamportFastMutEx-COL-3"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is LamportFastMutEx-COL-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928800595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;