About the Execution of ITS-LoLa for SimpleLoadBal-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15729.460 | 3600000.00 | 3651590.00 | 915.30 | TFFFFFTFTFFTFTFT | 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.r186-oct2-158987939200604.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 SimpleLoadBal-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939200604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 4.0K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 20:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 153K Mar 24 05:38 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 SimpleLoadBal-PT-05-CTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591252862716
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:41:05] [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-04 06:41:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:41:05] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2020-06-04 06:41:05] [INFO ] Transformed 59 places.
[2020-06-04 06:41:05] [INFO ] Transformed 180 transitions.
[2020-06-04 06:41:05] [INFO ] Parsed PT model containing 59 places and 180 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 283 ms. (steps per millisecond=353 ) properties seen :[1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1]
[2020-06-04 06:41:05] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2020-06-04 06:41:05] [INFO ] Computed 19 place invariants in 7 ms
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 43 ms returned sat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 8 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned unsat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:41:05] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive place invariants in 74 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 16 ms returned unsat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned unsat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive place invariants in 49 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:41:06] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2020-06-04 06:41:06] [INFO ] State equation strengthened by 61 read => feed constraints.
[2020-06-04 06:41:06] [INFO ] [Real]Added 61 Read/Feed constraints in 14 ms returned sat
[2020-06-04 06:41:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:41:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 29 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:41:06] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-06-04 06:41:06] [INFO ] [Nat]Added 61 Read/Feed constraints in 9 ms returned sat
[2020-06-04 06:41:06] [INFO ] Deduced a trap composed of 29 places in 112 ms
[2020-06-04 06:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2020-06-04 06:41:06] [INFO ] Computed and/alt/rep : 175/5137/135 causal constraints in 32 ms.
[2020-06-04 06:41:08] [INFO ] Added : 135 causal constraints over 27 iterations in 2346 ms. Result :sat
[2020-06-04 06:41:08] [INFO ] [Real]Absence check using 16 positive place invariants in 30 ms returned sat
[2020-06-04 06:41:08] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-04 06:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:41:09] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-04 06:41:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:41:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-04 06:41:09] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 27 ms returned sat
[2020-06-04 06:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:41:09] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-06-04 06:41:09] [INFO ] [Nat]Added 61 Read/Feed constraints in 14 ms returned sat
[2020-06-04 06:41:09] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2020-06-04 06:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-06-04 06:41:09] [INFO ] Computed and/alt/rep : 175/5137/135 causal constraints in 83 ms.
[2020-06-04 06:41:12] [INFO ] Added : 134 causal constraints over 27 iterations in 2777 ms. Result :sat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-06-04 06:41:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 06:41:12] [INFO ] Flatten gal took : 120 ms
[2020-06-04 06:41:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 06:41:12] [INFO ] Flatten gal took : 37 ms
FORMULA SimpleLoadBal-PT-05-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:41:12] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2020-06-04 06:41:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SimpleLoadBal-PT-05 @ 3570 seconds
FORMULA SimpleLoadBal-PT-05-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SimpleLoadBal-PT-05-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for CTLFireability @ SimpleLoadBal-PT-05
{
"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": "Thu Jun 4 06:41:13 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(AG(EF(((1 <= p41) AND (1 <= p49) AND (1 <= p55)))))",
"processed_size": 54,
"rewrites": 22
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 805509,
"markings": 116176,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "EF(AG(EX(((1 <= p21) AND (1 <= p35)))))",
"processed_size": 39,
"rewrites": 22
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 695234,
"markings": 116176,
"produced_by": "CTL model checker",
"value": false
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "((1 <= p42) AND (1 <= p49) AND (1 <= p56) AND ((p45 <= 0) OR (p50 <= 0) OR (p55 <= 0) OR (p49 <= 0) OR (p56 <= 0)))",
"processed_size": 119,
"rewrites": 22
},
"result":
{
"edges": 1532,
"markings": 1346,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p35) AND (1 <= p46) AND (1 <= p48) AND (1 <= p56))",
"processed_size": 57,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "EF(AX((((1 <= p41) AND (1 <= p48) AND (1 <= p55)) OR ((1 <= p46) AND (1 <= p48) AND (1 <= p55)))))",
"processed_size": 99,
"rewrites": 21
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 566332,
"markings": 116176,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E(((p32 <= 0) OR (p46 <= 0) OR (p50 <= 0) OR (p54 <= 0)) U AX((1 <= p4)))",
"processed_size": 76,
"rewrites": 21
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 558892,
"markings": 115384,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p46) AND (1 <= p48) AND (1 <= p55))))",
"processed_size": 50,
"rewrites": 20
},
"result":
{
"edges": 2256,
"markings": 1357,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p3) AND ((p27 <= 0) OR (p46 <= 0) OR (p54 <= 0)))",
"processed_size": 58,
"rewrites": 23
},
"result":
{
"edges": 327055,
"markings": 98593,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF((EF(((1 <= p44) AND (1 <= p49) AND (1 <= p54))) OR (p1 <= 0)))",
"processed_size": 65,
"rewrites": 21
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 13861,
"markings": 7342,
"produced_by": "CTL model checker",
"value": true
},
"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": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "E(EF(((p41 <= 0) OR (p49 <= 0) OR (p55 <= 0))) U AG(((p44 <= 0) OR (p50 <= 0) OR (p55 <= 0))))",
"processed_size": 98,
"rewrites": 22
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 986011,
"markings": 116176,
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EF((EF(((1 <= p42) AND (1 <= p48) AND (1 <= p55))) AND AG(((1 <= p45) AND (1 <= p50) AND (1 <= p56)))))",
"processed_size": 103,
"rewrites": 22
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 938203,
"markings": 116176,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EG((EG((((1 <= p42) AND (1 <= p51) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p49) AND (1 <= p55)))) OR EF(((1 <= p42) AND (1 <= p47) AND (1 <= p54)))))",
"processed_size": 151,
"rewrites": 22
},
"net":
{
"conflict_clusters": 15,
"singleton_clusters": 0
},
"result":
{
"edges": 4759,
"markings": 2750,
"produced_by": "CTL model checker",
"value": true
},
"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": 1187
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p43) AND (1 <= p49) AND (1 <= p55))",
"processed_size": 42,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 12949,
"markings": 8755,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p26 <= 0) OR (p46 <= 0) OR (p52 <= 0)) AND (((1 <= p45) AND (1 <= p52) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p48) AND (1 <= p55))))",
"processed_size": 140,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p42) AND (1 <= p49) AND (1 <= p56))))",
"processed_size": 50,
"rewrites": 20
},
"result":
{
"edges": 1473,
"markings": 1297,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 12949,
"markings": 8755,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"result":
{
"edges": 12949,
"markings": 8755,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 8,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "((1 <= p42) AND (1 <= p48) AND (1 <= p55) AND ((p26 <= 0) OR (p46 <= 0)) AND ((p46 <= 0) OR (p49 <= 0)) AND ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p32 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p10 <= 0) OR (p40 <= 0) OR (p45 <= 0) OR (p54 <= 0) OR ((1 <= p31) AND (1 <= p46) AND (1 <= p56)) OR (((p26 <= 0) OR (p46 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p50 <= 0) OR (p56 <= 0)))) AND ((p27 <= 0) OR (p40 <= 0) OR (p56 <= 0) OR (p46 <= 0) OR (p52 <= 0) OR (p57 <= 0)))",
"processed_size": 497,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41060,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(A(G(E(F(**)))))) : (E(F(DEADLOCK)) OR **) : E(F((E(F(**)) AND A(G(**))))) : (E(F(DEADLOCK)) OR **) : E(F(A(G(E(X(**)))))) : E((E(F(*)) U A(G(**)))) : (E(F(**)) OR **) : A(X(A(G(**)))) : E(F(**)) : (E(F(A(X(**)))) OR **) : A(F((E(F(**)) OR **))) : E(F(A(G(**)))) : E(G((E(G(**)) OR E(F(**))))) : E((** U A(X(**))))"
},
"net":
{
"arcs": 1158,
"conflict_clusters": 15,
"places": 59,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"preliminary_value": "yes no no no no no yes no yes no yes no yes no ",
"value": "yes no no no no no yes no yes no yes no 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: 239/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 59
lola: finding significant places
lola: 59 places, 180 transitions, 40 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 (G (A (X (E (F (((1 <= p41) AND (1 <= p49) AND (1 <= p55)))))))) : (E (F (A (X ((1 <= 0))))) OR ((1 <= p42) AND (1 <= p48) AND (1 <= p55) AND ((p26 <= 0) OR (p46 <= 0)) AND ((p46 <= 0) OR (p49 <= 0)) AND ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p32 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p10 <= 0) OR (p40 <= 0) OR (p45 <= 0) OR (p54 <= 0) OR ((1 <= p31) AND (1 <= p46) AND (1 <= p56)) OR (((p26 <= 0) OR (p46 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p50 <= 0) OR (p56 <= 0)))) AND ((p27 <= 0) OR (p40 <= 0) OR (p56 <= 0) OR (p46 <= 0) OR (p52 <= 0) OR (p57 <= 0)))) : E (F ((E (F (((1 <= p42) AND (1 <= p48) AND (1 <= p55)))) AND A (G (((1 <= p45) AND (1 <= p50) AND (1 <= p56))))))) : (E (F (A (X ((1 <= 0))))) OR ((1 <= p43) AND (1 <= p49) AND (1 <= p55))) : E (F (A (G (E (X (((1 <= p21) AND (1 <= p35)))))))) : E ((NOT(A (G (((1 <= p41) AND (1 <= p49) AND (1 <= p55))))) U A (G (((p44 <= 0) OR (p50 <= 0) OR (p55 <= 0)))))) : ((E (F (((1 <= p42) AND (1 <= p49) AND (1 <= p56)))) OR A ((((p44 <= 0) OR (p50 <= 0) OR (p56 <= 0)) U (1 <= 0)))) OR (((p26 <= 0) OR (p46 <= 0) OR (p52 <= 0)) AND (((1 <= p45) AND (1 <= p52) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p48) AND (1 <= p55))))) : A (G (A (X (((p42 <= 0) OR (p49 <= 0) OR (p56 <= 0) OR ((1 <= p45) AND (1 <= p50) AND (1 <= p55) AND (1 <= p49) AND (1 <= p56))))))) : (E (F (((1 <= p46) AND (1 <= p48) AND (1 <= p55)))) OR E ((((((1 <= p34) AND (1 <= p46) AND (1 <= p49) AND (1 <= p53)) OR ((1 <= p44) AND (1 <= p52) AND (1 <= p57))) AND ((p14 <= 0) OR (p40 <= 0))) U E (G ((1 <= 0)))))) : (E (F (A (X ((((1 <= p41) AND (1 <= p48) AND (1 <= p55)) OR ((1 <= p46) AND (1 <= p48) AND (1 <= p55))))))) OR ((1 <= p35) AND (1 <= p46) AND (1 <= p48) AND (1 <= p56))) : A (F ((E (F (((1 <= p44) AND (1 <= p49) AND (1 <= p54)))) OR (p1 <= 0)))) : E (F (A (G (((p3 <= 0) OR ((1 <= p27) AND (1 <= p46) AND (1 <= p54))))))) : E (G ((E (G ((((1 <= p42) AND (1 <= p51) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p49) AND (1 <= p55))))) OR E (F (((1 <= p42) AND (1 <= p47) AND (1 <= p54))))))) : E ((((p32 <= 0) OR (p46 <= 0) OR (p50 <= 0) OR (p54 <= 0)) U A (X ((1 <= p4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (E (F (((1 <= p41) AND (1 <= p49) AND (1 <= p55))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AG(EF(((1 <= p41) AND (1 <= p49) AND (1 <= p55)))))
lola: processed formula length: 54
lola: 22 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: 116176 markings, 805509 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (X (((1 <= p21) AND (1 <= p35))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(EX(((1 <= p21) AND (1 <= p35)))))
lola: processed formula length: 39
lola: 22 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: 116176 markings, 695234 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p42 <= 0) OR (p49 <= 0) OR (p56 <= 0) OR ((1 <= p45) AND (1 <= p50) AND (1 <= p55) AND (1 <= p49) AND (1 <= p56)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p42) AND (1 <= p49) AND (1 <= p56) AND ((p45 <= 0) OR (p50 <= 0) OR (p55 <= 0) OR (p49 <= 0) OR (p56 <= 0)))
lola: processed formula length: 119
lola: 22 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: 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 <= p42) AND (1 <= p49) AND (1 <= p56) AND ((p45 <= 0) OR (p50 <= 0) OR (p55 <= 0) OR (p49 <= 0) OR (p56 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: The predicate is not invariant from successors.
lola: 1346 markings, 1532 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((((1 <= p41) AND (1 <= p48) AND (1 <= p55)) OR ((1 <= p46) AND (1 <= p48) AND (1 <= p55))))))) OR ((1 <= p35) AND (1 <= p46) AND (1 <= p48) AND (1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p35) AND (1 <= p46) AND (1 <= p48) AND (1 <= p56))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p35) AND (1 <= p46) AND (1 <= p48) AND (1 <= p56))
lola: processed formula length: 57
lola: 19 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 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p41) AND (1 <= p48) AND (1 <= p55)) OR ((1 <= p46) AND (1 <= p48) AND (1 <= p55)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p41) AND (1 <= p48) AND (1 <= p55)) OR ((1 <= p46) AND (1 <= p48) AND (1 <= p55)))))
lola: processed formula length: 99
lola: 21 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).
sara: try reading problem file CTLFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3)
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 116176 markings, 566332 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p32 <= 0) OR (p46 <= 0) OR (p50 <= 0) OR (p54 <= 0)) U A (X ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p32 <= 0) OR (p46 <= 0) OR (p50 <= 0) OR (p54 <= 0)) U AX((1 <= p4)))
lola: processed formula length: 76
lola: 21 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: 115384 markings, 558892 edges
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p46) AND (1 <= p48) AND (1 <= p55))))
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 <= p46) AND (1 <= p48) AND (1 <= p55))))
lola: processed formula length: 50
lola: 20 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1357 markings, 2256 edges
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p3 <= 0) OR ((1 <= p27) AND (1 <= p46) AND (1 <= p54)))))))
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:787
lola: processed formula: ((1 <= p3) AND ((p27 <= 0) OR (p46 <= 0) OR (p54 <= 0)))
lola: processed formula length: 58
lola: 23 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: ((p3 <= 0) OR ((1 <= p27) AND (1 <= p46) AND (1 <= p54)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 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:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p3) AND ((p27 <= 0) OR (p46 <= 0) OR (p54 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
sara: warning, failure of lp_solve (at job 16)
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 98593 markings, 327055 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F (((1 <= p44) AND (1 <= p49) AND (1 <= p54)))) OR (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF(((1 <= p44) AND (1 <= p49) AND (1 <= p54))) OR (p1 <= 0)))
lola: processed formula length: 65
lola: 21 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: 7342 markings, 13861 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (((p41 <= 0) OR (p49 <= 0) OR (p55 <= 0)))) U A (G (((p44 <= 0) OR (p50 <= 0) OR (p55 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((p41 <= 0) OR (p49 <= 0) OR (p55 <= 0))) U AG(((p44 <= 0) OR (p50 <= 0) OR (p55 <= 0))))
lola: processed formula length: 98
lola: 22 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: 116176 markings, 986011 edges
lola: ========================================
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F (((1 <= p42) AND (1 <= p48) AND (1 <= p55)))) AND A (G (((1 <= p45) AND (1 <= p50) AND (1 <= p56)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EF(((1 <= p42) AND (1 <= p48) AND (1 <= p55))) AND AG(((1 <= p45) AND (1 <= p50) AND (1 <= p56)))))
lola: processed formula length: 103
lola: 22 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: 116176 markings, 938203 edges
lola: ========================================
lola: subprocess 10 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((((1 <= p42) AND (1 <= p51) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p49) AND (1 <= p55))))) OR E (F (((1 <= p42) AND (1 <= p47) AND (1 <= p54)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG((((1 <= p42) AND (1 <= p51) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p49) AND (1 <= p55)))) OR EF(((1 <= p42) AND (1 <= p47) AND (1 <= p54)))))
lola: processed formula length: 151
lola: 22 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: 2750 markings, 4759 edges
lola: ========================================
lola: subprocess 11 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (DEADLOCK)) OR ((1 <= p43) AND (1 <= p49) AND (1 <= p55)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p43) AND (1 <= p49) AND (1 <= p55))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p43) AND (1 <= p49) AND (1 <= p55))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 12 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 8755 markings, 12949 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p42) AND (1 <= p49) AND (1 <= p56)))) OR (((p26 <= 0) OR (p46 <= 0) OR (p52 <= 0)) AND (((1 <= p45) AND (1 <= p52) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p48) AND (1 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p26 <= 0) OR (p46 <= 0) OR (p52 <= 0)) AND (((1 <= p45) AND (1 <= p52) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p48) AND (1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p26 <= 0) OR (p46 <= 0) OR (p52 <= 0)) AND (((1 <= p45) AND (1 <= p52) AND (1 <= p57)) OR ((1 <= p41) AND (1 <= p48) AND (1 <= p55))))
lola: processed formula length: 140
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 9 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 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p42) AND (1 <= p49) AND (1 <= p56))))
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 <= p42) AND (1 <= p49) AND (1 <= p56))))
lola: processed formula length: 50
lola: 20 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p42) AND (1 <= p49) AND (1 <= p56))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1297 markings, 1473 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (DEADLOCK)) OR ((1 <= p42) AND (1 <= p48) AND (1 <= p55) AND ((p26 <= 0) OR (p46 <= 0)) AND ((p46 <= 0) OR (p49 <= 0)) AND ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p32 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p10 <= 0) OR (p40 <= 0) OR (p45 <= 0) OR (p54 <= 0) OR ((1 <= p31) AND (1 <= p46) AND (1 <= p56)) OR (((p26 <= 0) OR (p46 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 8755 markings, 12949 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ...considering subproblem: (E (F (DEADLOCK)) OR ((1 <= p42) AND (1 <= p48) AND (1 <= p55) AND ((p26 <= 0) OR (p46 <= 0)) AND ((p46 <= 0) OR (p49 <= 0)) AND ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p32 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p10 <= 0) OR (p40 <= 0) OR (p45 <= 0) OR (p54 <= 0) OR ((1 <= p31) AND (1 <= p46) AND (1 <= p56)) OR (((p26 <= 0) OR (p46 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 8755 markings, 12949 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p42) AND (1 <= p48) AND (1 <= p55) AND ((p26 <= 0) OR (p46 <= 0)) AND ((p46 <= 0) OR (p49 <= 0)) AND ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p32 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p10 <= 0) OR (p40 <= 0) OR (p45 <= 0) OR (p54 <= 0) OR ((1 <= p31) AND (1 <= p46) AND (1 <= p56)) OR (((p26 <= 0) OR (p46 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p50 <= 0) OR (p56 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p42) AND (1 <= p48) AND (1 <= p55) AND ((p26 <= 0) OR (p46 <= 0)) AND ((p46 <= 0) OR (p49 <= 0)) AND ((p38 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p32 <= 0) OR (p46 <= 0) OR (p51 <= 0)) AND ((p10 <= 0) OR (p40 <= 0) OR (p45 <= 0) OR (p54 <= 0) OR ((1 <= p31) AND (1 <= p46) AND (1 <= p56)) OR (((p26 <= 0) OR (p46 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p50 <= 0) OR (p56 <= 0... (shortened)
lola: processed formula length: 497
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 32 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no yes no yes no yes no yes no
lola:
preliminary result: yes no no no no no yes no yes no yes no yes no
lola: memory consumption: 41060 KB
lola: time consumption: 9 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: 5999428 kB
After kill :
MemTotal: 16427332 kB
MemFree: 5997152 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="SimpleLoadBal-PT-05"
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 SimpleLoadBal-PT-05, 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 r186-oct2-158987939200604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 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 '
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 ;