fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913700292
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V04P05N02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.600 3600000.00 62052.00 363.00 FTTFFFTFFFFFFTTF normal

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.r182-oct2-158987913700292.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 BridgeAndVehicles-PT-V04P05N02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.4K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 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 BridgeAndVehicles-PT-V04P05N02-CTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591141976625

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:52:58] [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-02 23:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:52:59] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-06-02 23:52:59] [INFO ] Transformed 28 places.
[2020-06-02 23:52:59] [INFO ] Transformed 52 transitions.
[2020-06-02 23:52:59] [INFO ] Parsed PT model containing 28 places and 52 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Incomplete random walk after 100000 steps, including 2293 resets, run finished after 210 ms. (steps per millisecond=476 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0]
[2020-06-02 23:52:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-06-02 23:52:59] [INFO ] Computed 7 place invariants in 3 ms
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 23:52:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-02 23:52:59] [INFO ] [Real]Added 6 Read/Feed constraints in 6 ms returned sat
[2020-06-02 23:52:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 5 ms.
[2020-06-02 23:52:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:52:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 23:52:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 18 ms.
[2020-06-02 23:52:59] [INFO ] Added : 27 causal constraints over 6 iterations in 75 ms. Result :sat
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-02 23:52:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:52:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 23:52:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2020-06-02 23:52:59] [INFO ] Added : 25 causal constraints over 5 iterations in 37 ms. Result :sat
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using 7 positive place invariants in 40 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-02 23:52:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:52:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 23:52:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2020-06-02 23:52:59] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 5 ms.
[2020-06-02 23:52:59] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
[2020-06-02 23:53:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 23:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-02 23:53:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:53:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 23:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 23:53:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 23:53:00] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2020-06-02 23:53:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2020-06-02 23:53:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-06-02 23:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:00] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-02 23:53:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:53:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 23:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:53:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 23:53:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 23:53:00] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-06-02 23:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2020-06-02 23:53:00] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2020-06-02 23:53:00] [INFO ] Added : 27 causal constraints over 6 iterations in 26 ms. Result :sat
[2020-06-02 23:53:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-02 23:53:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 23:53:00] [INFO ] Flatten gal took : 31 ms
[2020-06-02 23:53:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 23:53:00] [INFO ] Flatten gal took : 10 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:53:00] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-02 23:53:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BridgeAndVehicles-PT-V04P05N02 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLFireability @ BridgeAndVehicles-PT-V04P05N02

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:53:00 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))",
"processed_size": 147,
"rewrites": 37
},
"result":
{
"edges": 1875,
"markings": 1118,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 33
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p20) AND (1 <= p7))",
"processed_size": 26,
"rewrites": 37
},
"result":
{
"edges": 4545,
"markings": 2326,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EX(A((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U (1 <= p7)))",
"processed_size": 166,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 51,
"markings": 51,
"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": 297
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"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": "AX(EG(((p19 <= 0) OR (p27 <= 0) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))",
"processed_size": 94,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 1559,
"markings": 792,
"produced_by": "CTL model checker",
"value": true
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "(((p18 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))",
"processed_size": 61,
"rewrites": 38
},
"result":
{
"edges": 430,
"markings": 253,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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": 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": "((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))",
"processed_size": 54,
"rewrites": 38
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 34
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(EG((p7 <= 0)))",
"processed_size": 17,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 14809,
"markings": 2793,
"produced_by": "CTL model checker",
"value": true
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EF((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0)))) AND (p20 <= 0)))",
"processed_size": 84,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 1991,
"markings": 576,
"produced_by": "CTL model checker",
"value": false
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E((EF(((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25))) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27) AND (1 <= p20) AND (p4 <= 0))) U ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)))",
"processed_size": 213,
"rewrites": 37
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 7161,
"markings": 2874,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF((A(((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) U ((1 <= p18) AND (1 <= p27))) AND AG(((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)))))",
"processed_size": 160,
"rewrites": 38
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 103,
"markings": 51,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 6,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AG((EF((((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0)))) OR (EF((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))))))",
"processed_size": 484,
"rewrites": 38
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 11806,
"markings": 2874,
"produced_by": "CTL model checker",
"value": true
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 13,
"adisj": 3,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "AF((EG((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) AND ((((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))) AND (AF((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) OR (1 <= p7)))))",
"processed_size": 546,
"rewrites": 38
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 5178,
"markings": 2615,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))",
"processed_size": 54,
"rewrites": 38
},
"result":
{
"edges": 7160,
"markings": 2874,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))",
"processed_size": 60,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p7 <= 0)",
"processed_size": 9,
"rewrites": 38
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p10)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p10)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26))",
"processed_size": 56,
"rewrites": 39
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 53484,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((E(G(**)) AND (** AND (A(F(**)) OR **))))) : A(F(E(G(*)))) : A(G((E(F(**)) OR (E(F(**)) OR (** OR (** OR (** OR **))))))) : (E(X(E(G(**)))) AND A(X((A(X(**)) OR **)))) : A(F(**)) : (E(X(E(F(**)))) OR E(X(A((** U **))))) : (E(G(E(F(**)))) OR (** OR **)) : E(G((E(F(*)) AND **))) : E(((E(F(**)) OR **) U **)) : A(F(**)) : A(F((A((** U **)) AND A(G(**))))) : E(G(E(F(**)))) : ((A(G(A(F(**)))) AND (A(G(**)) AND (A(G(**)) AND (A(G(**)) AND A(G(**)))))) OR E(F(A(G(*))))) : A(X(E(G(**))))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no yes yes no no no yes no no no no no yes yes ",
"value": "no yes yes no no no yes no no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 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: A (F (((E (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))) AND (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))) AND (A (F ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))) OR (1 <= p7))))) : A (F (NOT(A (F ((1 <= p7)))))) : A (G ((((((E (F ((((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0))))) OR E (F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) : (E (X (E (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))))) AND A (X ((A (X ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) OR (((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p14 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p14 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p14 <= 0) OR (p27 <= 0))))))) : A (F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) : E (X ((E (F (((1 <= p20) AND (1 <= p7)))) OR A (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U (1 <= p7)))))) : ((E (G (E (F ((p7 <= 0))))) OR ((1 <= p18) AND (1 <= p27))) OR ((1 <= p19) AND (1 <= p27))) : E (G ((NOT(A (G ((((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)))))) AND (p20 <= 0)))) : E (((E (F (((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)))) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27) AND (1 <= p20) AND (p4 <= 0))) U ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)))) : A (F (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))) : A (F ((A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) U ((1 <= p18) AND (1 <= p27)))) AND A (G (((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26))))))) : E (G (E (F (A (F (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))))) : (A (G (((((A (F (((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)))) AND (1 <= p4)) AND (1 <= p6)) AND (1 <= p9)) AND (1 <= p10)))) OR NOT(A (G (E (F (((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)))))))) : A (X (E (G (((p19 <= 0) OR (p27 <= 0) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: rewrite Frontend/Parser/formula_rewrite.k:254
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: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:455
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))))) AND A (X ((A (X ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) OR (((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))
lola: processed formula length: 147
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: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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 /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 1118 markings, 1875 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (((1 <= p20) AND (1 <= p7)))))) OR E (X (A (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p20) AND (1 <= p7))))))
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: ((1 <= p20) AND (1 <= p7))
lola: processed formula length: 26
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: 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: ((1 <= p20) AND (1 <= p7))
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 CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is unreachable from any successor.
lola: 2326 markings, 4545 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) U (1 <= p7)))
lola: processed formula length: 166
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: 51 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p19 <= 0) OR (p27 <= 0) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p19 <= 0) OR (p27 <= 0) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))
lola: processed formula length: 94
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: 792 markings, 1559 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))))
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:787
lola: processed formula: (((p18 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))
lola: processed formula length: 61
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: 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: (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 253 markings, 430 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))))
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:787
lola: processed formula: ((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))
lola: processed formula length: 54
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: 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 51 markings, 50 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p7 <= 0)))
lola: processed formula length: 17
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 2 significant temporal operators and needs 9 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: 2793 markings, 14809 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-3-0.sara.
lola: ...considering subproblem: E (G ((E (F ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0))))) AND (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0)))) AND (p20 <= 0)))
lola: processed formula length: 84
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 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: 576 markings, 1991 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (F (((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)))) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27) AND (1 <= p20) AND (p4 <= 0))) U ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EF(((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25))) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27) AND (1 <= p20) AND (p4 <= 0))) U ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)))
lola: processed formula length: 213
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 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: 2874 markings, 7161 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A ((((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) U ((1 <= p18) AND (1 <= p27)))) AND A (G (((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((A(((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) U ((1 <= p18) AND (1 <= p27))) AND AG(((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)))))
lola: processed formula length: 160
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).
sara: warning, failure of lp_solve (at job 25)
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 51 markings, 103 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0))))) OR (E (F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p11) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0)))) OR (EF((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR (((1 <= p9) AND (1 <= p11) AND (1 <= p1... (shortened)
lola: processed formula length: 484
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: 2874 markings, 11806 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))) AND ((((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) AND ((((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))) AND (... (shortened)
lola: processed formula length: 546
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2615 markings, 5178 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))))))
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 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))
lola: processed formula length: 54
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: 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: 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: ((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
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: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))
lola: state equation task get result unparse finished id 1
lola: Reachability of the predicate is not possibly preserved.
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: 2874 markings, 7160 edges
lola: ========================================
lola: subprocess 12 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((p7 <= 0))))) OR (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))
lola: processed formula length: 60
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p7 <= 0)))))
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: (p7 <= 0)
lola: processed formula length: 9
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: 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: 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 <= p7)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
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: (p7 <= 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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Reachability of the predicate is possibly preserved.
lola: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (A (F (((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)))))) AND (A (G ((1 <= p4))) AND (A (G ((1 <= p6))) AND (A (G ((1 <= p9))) AND A (G ((1 <= p10))))))) OR E (F (A (G (((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p10)))
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 ((1 <= p10)))
lola: processed formula length: 18
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: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p10 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: ((A (G (A (F (((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)))))) AND (A (G ((1 <= p4))) AND (A (G ((1 <= p6))) AND (A (G ((1 <= p9))) AND A (G ((1 <= p10))))))) OR E (F (A (G (((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p10)))
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 ((1 <= p10)))
lola: processed formula length: 18
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: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p10 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26))
lola: processed formula length: 56
lola: 39 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
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 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: ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes no no no no no yes yes
lola:
preliminary result: no yes yes no no no yes no no no no no yes yes
lola: memory consumption: 53484 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16098984 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16098716 kB

--------------------
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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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 r182-oct2-158987913700292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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