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-158987928800588.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-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 2.8K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 38K 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-2-CTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591215290779

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:14:52] [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:14:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2020-06-03 20:14:53] [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:14:53] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 33 ms.
[2020-06-03 20:14:53] [INFO ] Computed order based on color domains.
[2020-06-03 20:14:53] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions in 7 ms.
[2020-06-03 20:14:53] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=574 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2020-06-03 20:14:53] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2020-06-03 20:14:53] [INFO ] Computed 10 place invariants in 4 ms
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-03 20:14:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 20:14:53] [INFO ] [Real]Added 20 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 1 ms returned sat
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 11 places in 30 ms
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 17 places in 24 ms
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2020-06-03 20:14:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2020-06-03 20:14:53] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 13 ms.
[2020-06-03 20:14:53] [INFO ] Added : 53 causal constraints over 11 iterations in 65 ms. Result :sat
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Real]Added 20 Read/Feed constraints in 6 ms returned sat
[2020-06-03 20:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 15 places in 19 ms
[2020-06-03 20:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2020-06-03 20:14:53] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 3 ms.
[2020-06-03 20:14:53] [INFO ] Added : 52 causal constraints over 11 iterations in 43 ms. Result :sat
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 20:14:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 8 places in 15 ms
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2020-06-03 20:14:53] [INFO ] Deduced a trap composed of 8 places in 14 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 14 places in 11 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 9 places in 11 ms
[2020-06-03 20:14:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 100 ms
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:14:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 1 ms returned sat
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 9 places in 16 ms
[2020-06-03 20:14:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Added 20 Read/Feed constraints in 1 ms returned sat
[2020-06-03 20:14:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 9 places in 15 ms
[2020-06-03 20:14:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:14:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 1 ms returned sat
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 8 places in 11 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 8 places in 11 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2020-06-03 20:14:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 42 ms
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:14:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:14:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 20:14:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 1 ms returned sat
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 14 places in 12 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 8 places in 11 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 13 places in 10 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 11 places in 13 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 9 places in 13 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 9 places in 13 ms
[2020-06-03 20:14:54] [INFO ] Deduced a trap composed of 11 places in 12 ms
[2020-06-03 20:14:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 112 ms
[2020-06-03 20:14:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 20:14:54] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 20:14:54] [INFO ] Flatten gal took : 28 ms
[2020-06-03 20:14:54] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 20:14:54] [INFO ] Flatten gal took : 9 ms
FORMULA LamportFastMutEx-COL-2-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:14:54] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-03 20:14:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ LamportFastMutEx-COL-2 @ 3570 seconds

FORMULA LamportFastMutEx-COL-2-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-2-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ LamportFastMutEx-COL-2

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 9,
"aneg": 2,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "AX(((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40))) OR EF(((p24 <= 0) AND (p25 <= 0)))))",
"processed_size": 286,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "EX(NOT DEADLOCK)",
"processed_size": 16,
"rewrites": 36
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 4,
"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": "AX((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21))))",
"processed_size": 63,
"rewrites": 36
},
"net":
{
"conflict_clusters": 5,
"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"
}
},

{
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p24) OR (1 <= p25))",
"processed_size": 26,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"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": "E (F ((((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)))))",
"processed_size": 67,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G ((((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)))))",
"processed_size": 129,
"rewrites": 36
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 3,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) AND (((1 <= p9) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p42)))))))",
"processed_size": 325,
"rewrites": 36
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 68,
"problems": 18
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A(EX((((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)))) U ((1 <= p24) OR (1 <= p25)))",
"processed_size": 220,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 2,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EF((EF((((p30 <= 0) OR (p32 <= 0) OR (p33 <= 0)) AND ((p31 <= 0) OR (p34 <= 0) OR (p35 <= 0)))) AND EG((((p7 <= 0) OR (p36 <= 0)) AND ((p5 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p5 <= 0) OR (p37 <= 0))))))",
"processed_size": 231,
"rewrites": 38
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0)))",
"processed_size": 123,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 6,
"aneg": 0,
"comp": 12,
"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": 5,
"visible_transitions": 0
},
"processed": "E (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))))",
"processed_size": 191,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 20,
"adisj": 2,
"aneg": 0,
"comp": 42,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "A (((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))) U (((1 <= p1) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22)))))",
"processed_size": 655,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 60
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 8
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0)))",
"processed_size": 123,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))",
"processed_size": 90,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 6,
"aneg": 0,
"comp": 12,
"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": 5,
"visible_transitions": 0
},
"processed": "E (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))))",
"processed_size": 191,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47644,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F((E(F(*)) AND E(G(*))))) : A(X((* OR E(F(*))))) : E(X(NODEADLOCK)) : (A((** U **)) AND ((E(F(*)) OR **) AND (E(G(**)) OR (** OR **)))) : A(X(*)) : (E(F(*)) AND (E(G(*)) OR (E(X(**)) OR (** OR **)))) : (E(X(**)) OR E(F(**))) : A((E(X(**)) U **))"
},
"net":
{
"arcs": 256,
"conflict_clusters": 5,
"places": 44,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "yes yes yes no no yes yes no ",
"value": "yes yes yes no no yes yes 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: 106/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44
lola: finding significant places
lola: 44 places, 62 transitions, 34 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 CTLFireability.xml
lola: NOT(A (G ((A (G ((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35))))) OR A (F ((((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))))))) : NOT(E (X (((((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p6 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p6 <= 0) OR (p40 <= 0))) AND A (G (((1 <= p24) OR (1 <= p25)))))))) : E (X (E (X ((0 <= 0))))) : ((A (((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))) U (((1 <= p1) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))) AND (NOT(A (G ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22)))))) OR (((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0))))) AND ((E (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0))))) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p33))) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))) : NOT(E (X ((((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)))))) : (NOT(A (G ((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)))))) AND (((NOT(A (F ((((1 <= p2) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p21)))))) OR E (X ((((p7 <= 0) OR (p36 <= 0)) AND ((p5 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p5 <= 0) OR (p37 <= 0)))))) OR (1 <= p24)) OR (1 <= p25))) : (E (X ((((1 <= p7) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p6) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p19))))) OR E (F ((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) AND (((1 <= p9) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p42)))))))) : A ((E (X ((((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40))))) U ((1 <= p24) OR (1 <= p25))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:251
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40))) OR E (F (((p24 <= 0) AND (p25 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40))) OR EF(((p24 <= 0) AND (p25 <= 0)))))
lola: processed formula length: 286
lola: 37 rewrites
lola: closed formula file CTLFireability.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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(NOT DEADLOCK)
lola: processed formula length: 16
lola: 36 rewrites
lola: closed formula file CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21))))
lola: processed formula length: 63
lola: 36 rewrites
lola: closed formula file CTLFireability.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 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0))))) AND (E (G ((((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0))))) OR (E (X ((((p7 <= 0) OR (p36 <= 0)) AND ((p5 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p5 <= 0) OR (p37 <= 0))))) OR ((1 <= p24) OR (1 <= p25)))))
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: ((1 <= p24) OR (1 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p24) OR (1 <= p25))
lola: processed formula length: 26
lola: 36 rewrites
lola: closed formula file CTLFireability.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: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)))))
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 ((((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)))))
lola: processed formula length: 67
lola: 36 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: formula 0: (((p3 <= 0) OR (p20 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)))
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)))))
lola: processed formula length: 129
lola: 36 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 16 markings, 16 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p20)) OR ((1 <= p2) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p21)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= p7) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p6) AND (1 <= p18)) OR ((1 <= p6) AND (1 <= p19)) OR ((1 <= p5) AND (1 <= p19))))) OR E (F ((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) AND (((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) AND (((1 <= p9) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p42)))))))
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 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) AND (((1 <= p9) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p42)))))))
lola: processed formula length: 325
lola: 36 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3) AND (1 <= p20)) OR ((1 <= p4) AND (1 <= p21)) OR ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) AND (((1 <= p9) AND (1 <= p42)) OR ((1 <= p11) AND (1 <= p43)) OR ((1 <= p10) AND (1 <= p43)) OR ((1 <= p8) AND (1 <= p42)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 68 literals and 18 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40))))) U ((1 <= p24) OR (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((((1 <= p6) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)))) U ((1 <= p24) OR (1 <= p25)))
lola: processed formula length: 220
lola: 37 rewrites
lola: closed formula file CTLFireability.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((((p30 <= 0) OR (p32 <= 0) OR (p33 <= 0)) AND ((p31 <= 0) OR (p34 <= 0) OR (p35 <= 0))))) AND E (G ((((p7 <= 0) OR (p36 <= 0)) AND ((p5 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p5 <= 0) OR (p37 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EF((((p30 <= 0) OR (p32 <= 0) OR (p33 <= 0)) AND ((p31 <= 0) OR (p34 <= 0) OR (p35 <= 0)))) AND EG((((p7 <= 0) OR (p36 <= 0)) AND ((p5 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p5 <= 0) OR (p37 <= 0))))))
lola: processed formula length: 231
lola: 38 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))) U (((1 <= p1) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0)))
lola: processed formula length: 123
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 191
lola: 36 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
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: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))) U (((1 <= p1) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))) U (((1 <= p1) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8... (shortened)
lola: processed formula length: 655
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: formula 0: (((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39)))
lola: produced by: state space /ER
lola: state equation task get result unparse finished id 0
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 18 literals and 8 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))) U (((1 <= p1) AND (1 <= p11)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p9 <= 0) OR (p42 <= 0)) AND ((p11 <= 0) OR (p43 <= 0)) AND ((p10 <= 0) OR (p43 <= 0)) AND ((p8 <= 0) OR (p42 <= 0)))
lola: processed formula length: 123
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))
lola: processed formula length: 90
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 6 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 (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p3 <= 0) OR (p13 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p13 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 191
lola: 36 rewrites
lola: closed formula file CTLFireability.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:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: formula 0: (((1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes no
lola:
preliminary result: yes yes yes no no yes yes no
lola: memory consumption: 47644 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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-2"
export BK_EXAMINATION="CTLFireability"
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-2, examination is CTLFireability"
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-158987928800588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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