About the Execution of ITS-LoLa for ShieldPPPt-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15793.800 | 3600000.00 | 1577312.00 | 8083.30 | TTTFTTF?TT?TTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477800652.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldPPPt-PT-010A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800652
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.5K May 14 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 67K May 12 20:42 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 ShieldPPPt-PT-010A-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-010A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591319337819
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:08:59] [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-05 01:08:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:08:59] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2020-06-05 01:08:59] [INFO ] Transformed 253 places.
[2020-06-05 01:08:59] [INFO ] Transformed 183 transitions.
[2020-06-05 01:08:59] [INFO ] Found NUPN structural information;
[2020-06-05 01:08:59] [INFO ] Parsed PT model containing 253 places and 183 transitions in 103 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 270 ms. (steps per millisecond=370 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 182 rows 253 cols
[2020-06-05 01:08:59] [INFO ] Computed 111 place invariants in 8 ms
[2020-06-05 01:09:00] [INFO ] [Real]Absence check using 111 positive place invariants in 61 ms returned sat
[2020-06-05 01:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:09:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-05 01:09:00] [INFO ] Computed and/alt/rep : 181/559/181 causal constraints in 23 ms.
[2020-06-05 01:09:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:09:00] [INFO ] [Nat]Absence check using 111 positive place invariants in 38 ms returned sat
[2020-06-05 01:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:09:00] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-05 01:09:00] [INFO ] Computed and/alt/rep : 181/559/181 causal constraints in 19 ms.
[2020-06-05 01:09:01] [INFO ] Added : 178 causal constraints over 37 iterations in 631 ms. Result :sat
[2020-06-05 01:09:01] [INFO ] Flatten gal took : 71 ms
[2020-06-05 01:09:01] [INFO ] Flatten gal took : 22 ms
[2020-06-05 01:09:01] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 01:09:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldPPPt-PT-010A @ 3570 seconds
FORMULA ShieldPPPt-PT-010A-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-010A-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2061
rslt: Output for CTLFireability @ ShieldPPPt-PT-010A
{
"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": "Fri Jun 5 01:09:01 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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 <= p12) AND (1 <= p14))",
"processed_size": 27,
"rewrites": 35
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"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": "AX(EF(((1 <= p28) AND (1 <= p51))))",
"processed_size": 35,
"rewrites": 35
},
"net":
{
"conflict_clusters": 113,
"singleton_clusters": 0
},
"result":
{
"edges": 81,
"markings": 82,
"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": 255
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 255
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "AX(((p232 <= 0) OR (p234 <= 0)))",
"processed_size": 33,
"rewrites": 34
},
"net":
{
"conflict_clusters": 113,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"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 <= p138) AND (1 <= p152))",
"processed_size": 29,
"rewrites": 36
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p43) AND (1 <= p50))))",
"processed_size": 35,
"rewrites": 34
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": 11,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p45) AND ((p20 <= 0)) AND (1 <= p206) AND (1 <= p221) AND (1 <= p47) AND (1 <= p192) AND (1 <= p194) AND (1 <= p113) AND (1 <= p127) AND (1 <= p133) AND (1 <= p150))))",
"processed_size": 180,
"rewrites": 34
},
"result":
{
"edges": 240,
"markings": 239,
"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"
},
"stateequation":
{
"literals": 11,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AF((EF((((1 <= p1) AND (1 <= p24)) OR ((1 <= p53) AND (1 <= p76)))) OR A(((1 <= p15) AND (1 <= p49)) U ((1 <= p178) AND (1 <= p201)))))",
"processed_size": 136,
"rewrites": 36
},
"net":
{
"conflict_clusters": 113,
"singleton_clusters": 0
},
"result":
{
"edges": 71,
"markings": 71,
"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": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 0,
"G": 1,
"U": 3,
"X": 0,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(E(((p107 <= 0) OR (p109 <= 0) OR (p63 <= 0) OR (p77 <= 0)) U EG(((1 <= p106) AND (1 <= p121)))) AND (E((((1 <= p162) AND (1 <= p164)) OR ((1 <= p5) AND (1 <= p22))) U ((p11 <= 0) OR (p21 <= 0))) OR (((1 <= p201)) AND (A(((1 <= p82) AND (1 <= p84)) U ((1 <= p120))) AND ((p90 <= 0) OR (p124 <= 0) OR (p157 <= 0) OR (p159 <= 0))))))",
"processed_size": 339,
"rewrites": 37
},
"net":
{
"conflict_clusters": 113,
"singleton_clusters": 0
},
"result":
{
"edges": 318,
"markings": 263,
"produced_by": "CTL model checker",
"value": true
},
"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": 427
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (((((p76 <= 0)) AND ((p68 <= 0) OR (p75 <= 0)) AND ((p56 <= 0) OR (p71 <= 0))) U ((1 <= p133) AND (1 <= p150))))",
"processed_size": 116,
"rewrites": 36
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E ((((((p113 <= 0) OR (p127 <= 0)) AND ((p178 <= 0) OR (p201 <= 0))) OR ((1 <= p67) AND (1 <= p69) AND (1 <= p93) AND (1 <= p100) AND (1 <= p145) AND (1 <= p95))) U ((1 <= p53) AND (1 <= p76))))",
"processed_size": 197,
"rewrites": 36
},
"result":
{
"edges": 61,
"markings": 62,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 598
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p92) AND (1 <= p94) AND (1 <= p12) AND (1 <= p14))",
"processed_size": 57,
"rewrites": 37
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 748
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((((p131 <= 0) OR (p146 <= 0)) OR (F (((p176 <= 0))) OR ((1 <= p57) AND (1 <= p59) AND (1 <= p245)))))",
"processed_size": 105,
"rewrites": 45
},
"result":
{
"edges": 2439,
"markings": 2325,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 998
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 998
},
"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 <= p222) AND (1 <= p170))",
"processed_size": 29,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1497
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((p132 <= 0) OR (p134 <= 0) OR (p230 <= 0) OR (p247 <= 0))))",
"processed_size": 69,
"rewrites": 35
},
"result":
{
"edges": 19,
"markings": 20,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2994
},
"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": "((p32 <= 0) OR (p34 <= 0) OR (p105 <= 0) OR (p122 <= 0))",
"processed_size": 59,
"rewrites": 36
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1497
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1497
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "A (G ((((p32 <= 0) OR (p34 <= 0)) AND ((p120 <= 0)))))",
"processed_size": 55,
"rewrites": 35
},
"result":
{
"edges": 17,
"markings": 18,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2994
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "A (G ((((p251 <= 0)) AND ((p87 <= 0) OR (p89 <= 0)))))",
"processed_size": 55,
"rewrites": 35
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2994
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2994
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p249))",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p249))",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p133) AND (1 <= p150))))",
"processed_size": 37,
"rewrites": 34
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3928,
"runtime": 1509.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U **)) : E(X(E(F(**)))) : E(F((** AND (E(G(**)) AND **)))) : (E(G(A(F(*)))) AND (A(G(*)) OR A(G(*)))) : A(F((E(F(**)) OR A((** U **))))) : E((** U **)) : (A(F(**)) OR (A(G(**)) OR (** AND (E(F(**)) AND (** AND **))))) : E(F(A(X(**)))) : (E(F(**)) OR (E(F(**)) AND (** AND (** AND (A(G(**)) AND A(G(**))))))) : E(F(**)) : A(G(E(F(**)))) : A(X(E(F(**)))) : (E((** U E(G(**)))) AND (E((** U **)) OR (** AND (A((** U **)) AND **)))) : E(F(**)) : (A(X(A(G(*)))) AND A(X(**))) : A(F(A(G(**))))"
},
"net":
{
"arcs": 724,
"conflict_clusters": 113,
"places": 253,
"places_significant": 142,
"singleton_clusters": 0,
"transitions": 182
},
"result":
{
"preliminary_value": "yes yes yes no yes yes no unknown yes yes unknown yes yes yes no no ",
"value": "yes yes yes no yes yes no unknown yes yes unknown yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 435/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8096
lola: finding significant places
lola: 253 places, 182 transitions, 142 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: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p245 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p202 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p232 <= 1)
lola: LP says that atomic proposition is always true: (p234 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: E (((((p76 <= 0)) AND ((p68 <= 0) OR (p75 <= 0)) AND ((p56 <= 0) OR (p71 <= 0))) U ((1 <= p133) AND (1 <= p150)))) : E (F (E (X (A (F (((1 <= p12) AND (1 <= p14)))))))) : E (F (((((1 <= p131) AND (1 <= p146)) AND E (G (((1 <= p176))))) AND ((p57 <= 0) OR (p59 <= 0) OR (p245 <= 0))))) : (NOT(A (F (E (G (((1 <= p80) AND (1 <= p97))))))) AND (NOT(E (F ((((1 <= p251)) OR ((1 <= p87) AND (1 <= p89)))))) OR NOT(E (F ((((1 <= p32) AND (1 <= p34)) OR ((1 <= p120)))))))) : A (F ((E (F ((((1 <= p1) AND (1 <= p24)) OR ((1 <= p53) AND (1 <= p76))))) OR A ((((1 <= p15) AND (1 <= p49)) U ((1 <= p178) AND (1 <= p201))))))) : E ((((((p113 <= 0) OR (p127 <= 0)) AND ((p178 <= 0) OR (p201 <= 0))) OR ((1 <= p67) AND (1 <= p69) AND (1 <= p93) AND (1 <= p100) AND (1 <= p145) AND (1 <= p95))) U ((1 <= p53) AND (1 <= p76)))) : ((A (F (A (F (((1 <= p32) AND (1 <= p34) AND (1 <= p105) AND (1 <= p122)))))) OR A (G (((p132 <= 0) OR (p134 <= 0) OR (p230 <= 0) OR (p247 <= 0))))) OR (((((1 <= p222) AND (1 <= p170)) AND E (F (((1 <= p106) AND (1 <= p121))))) AND ((p131 <= 0) OR (p146 <= 0))) AND ((p233 <= 0) OR (p250 <= 0)))) : E (F (A (X (((1 <= p191) AND (1 <= p202) AND (1 <= p157) AND (1 <= p159) AND (((1 <= p233) AND (1 <= p250)) OR ((1 <= p163) AND (1 <= p177)))))))) : (E (F (((1 <= p133) AND (1 <= p150)))) OR ((((A (F (E (F (((1 <= p86) AND (1 <= p96)))))) AND ((1 <= p215))) AND ((1 <= p249))) AND A (G (((1 <= p230) AND (1 <= p247))))) AND A (G (((1 <= p205) AND (1 <= p222)))))) : E (F (((1 <= p45) AND ((p20 <= 0)) AND (1 <= p206) AND (1 <= p221) AND (1 <= p47) AND (1 <= p192) AND (1 <= p194) AND (1 <= p113) AND (1 <= p127) AND (1 <= p133) AND (1 <= p150)))) : A (G (A (G (E (F (((1 <= p172)))))))) : A (X (E (F (((1 <= p28) AND (1 <= p51)))))) : (E ((((p107 <= 0) OR (p109 <= 0) OR (p63 <= 0) OR (p77 <= 0)) U E (G (((1 <= p106) AND (1 <= p121)))))) AND (E (((((1 <= p162) AND (1 <= p164)) OR ((1 <= p5) AND (1 <= p22))) U ((p11 <= 0) OR (p21 <= 0)))) OR ((((1 <= p201)) AND A ((((1 <= p82) AND (1 <= p84)) U ((1 <= p120))))) AND ((p90 <= 0) OR (p124 <= 0) OR (p157 <= 0) OR (p159 <= 0))))) : E (F (E (F (((1 <= p43) AND (1 <= p50)))))) : A (X ((NOT(E (F (((1 <= p138) AND (1 <= p152))))) AND ((p232 <= 0) OR (p234 <= 0))))) : A (F (A (G (((p92 <= 0) OR (p94 <= 0) OR (p12 <= 0) OR (p14 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p12) AND (1 <= p14))))))
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 <= p12) AND (1 <= p14))
lola: processed formula length: 27
lola: 35 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 <= p12) AND (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p191) AND (1 <= p202) AND (1 <= p157) AND (1 <= p159) AND (((1 <= p233) AND (1 <= p250)) OR ((1 <= p163) AND (1 <= p177))))))))
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 <= p191) AND (1 <= p202) AND (1 <= p157) AND (1 <= p159) AND (((1 <= p233) AND (1 <= p250)) OR ((1 <= p163) AND (1 <= p177))))))
lola: processed formula length: 139
lola: 35 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: 882449 markings, 2422988 edges, 176490 markings/sec, 0 secs
lola: 1588501 markings, 4528050 edges, 141210 markings/sec, 5 secs
lola: 2228895 markings, 6506351 edges, 128079 markings/sec, 10 secs
lola: 2836742 markings, 8421169 edges, 121569 markings/sec, 15 secs
lola: 3411719 markings, 10266982 edges, 114995 markings/sec, 20 secs
lola: 3949890 markings, 12011895 edges, 107634 markings/sec, 25 secs
lola: 4489496 markings, 13785148 edges, 107921 markings/sec, 30 secs
lola: 4995772 markings, 15446187 edges, 101255 markings/sec, 35 secs
lola: 5521590 markings, 17176017 edges, 105164 markings/sec, 40 secs
lola: 6002611 markings, 18785686 edges, 96204 markings/sec, 45 secs
lola: 6485083 markings, 20399574 edges, 96494 markings/sec, 50 secs
lola: 7056936 markings, 22314797 edges, 114371 markings/sec, 55 secs
lola: 7638478 markings, 24293858 edges, 116308 markings/sec, 60 secs
lola: 8199439 markings, 26208252 edges, 112192 markings/sec, 65 secs
lola: 8767783 markings, 28144690 edges, 113669 markings/sec, 70 secs
lola: 9319319 markings, 30054686 edges, 110307 markings/sec, 75 secs
lola: 9924409 markings, 32041668 edges, 121018 markings/sec, 80 secs
lola: 10758404 markings, 34435395 edges, 166799 markings/sec, 85 secs
lola: 11561610 markings, 36843866 edges, 160641 markings/sec, 90 secs
lola: 12352569 markings, 39308133 edges, 158192 markings/sec, 95 secs
lola: 13059277 markings, 41548931 edges, 141342 markings/sec, 100 secs
lola: 13719054 markings, 43693954 edges, 131955 markings/sec, 105 secs
lola: 14396238 markings, 45896716 edges, 135437 markings/sec, 110 secs
lola: 15095858 markings, 48204612 edges, 139924 markings/sec, 115 secs
lola: 15791316 markings, 50528028 edges, 139092 markings/sec, 120 secs
lola: 16478826 markings, 52832263 edges, 137502 markings/sec, 125 secs
lola: 17161605 markings, 55129628 edges, 136556 markings/sec, 130 secs
lola: 17826691 markings, 57388066 edges, 133017 markings/sec, 135 secs
lola: 18483848 markings, 59643421 edges, 131431 markings/sec, 140 secs
lola: 19133194 markings, 61888189 edges, 129869 markings/sec, 145 secs
lola: 19783099 markings, 64130255 edges, 129981 markings/sec, 150 secs
lola: 20428444 markings, 66365223 edges, 129069 markings/sec, 155 secs
lola: 21066675 markings, 68588829 edges, 127646 markings/sec, 160 secs
lola: 21696509 markings, 70798658 edges, 125967 markings/sec, 165 secs
lola: 22334813 markings, 73026152 edges, 127661 markings/sec, 170 secs
lola: 22963887 markings, 75246066 edges, 125815 markings/sec, 175 secs
lola: 23589784 markings, 77463325 edges, 125179 markings/sec, 180 secs
lola: 24206208 markings, 79659172 edges, 123285 markings/sec, 185 secs
lola: 24820488 markings, 81849954 edges, 122856 markings/sec, 190 secs
lola: 25437197 markings, 84045404 edges, 123342 markings/sec, 195 secs
lola: 26044878 markings, 86220130 edges, 121536 markings/sec, 200 secs
lola: 26647914 markings, 88390464 edges, 120607 markings/sec, 205 secs
lola: 27250078 markings, 90556602 edges, 120433 markings/sec, 210 secs
lola: 28087203 markings, 93064668 edges, 167425 markings/sec, 215 secs
lola: 29028219 markings, 95721956 edges, 188203 markings/sec, 220 secs
lola: 29888686 markings, 98290806 edges, 172093 markings/sec, 225 secs
lola: 30678688 markings, 100741166 edges, 158000 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p28) AND (1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p28) AND (1 <= p51))))
lola: processed formula length: 35
lola: 35 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: 82 markings, 81 edges
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (((p138 <= 0) OR (p152 <= 0)))))) AND A (X (((p232 <= 0) OR (p234 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p232 <= 0) OR (p234 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p232 <= 0) OR (p234 <= 0)))
lola: processed formula length: 33
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p138 <= 0) OR (p152 <= 0))))))
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:788
lola: processed formula: ((1 <= p138) AND (1 <= p152))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p138) AND (1 <= p152))
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-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p43) AND (1 <= p50))))
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 <= p43) AND (1 <= p50))))
lola: processed formula length: 35
lola: 34 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 <= p43) AND (1 <= p50))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p45) AND ((p20 <= 0)) AND (1 <= p206) AND (1 <= p221) AND (1 <= p47) AND (1 <= p192) AND (1 <= p194) AND (1 <= p113) AND (1 <= p127) AND (1 <= p133) AND (1 <= p150))))
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 <= p45) AND ((p20 <= 0)) AND (1 <= p206) AND (1 <= p221) AND (1 <= p47) AND (1 <= p192) AND (1 <= p194) AND (1 <= p113) AND (1 <= p127) AND (1 <= p133) AND (1 <= p150))))
lola: processed formula length: 180
lola: 34 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 <= p45) AND ((p20 <= 0)) AND (1 <= p206) AND (1 <= p221) AND (1 <= p47) AND (1 <= p192) AND (1 <= p194) AND (1 <= p113) AND (1 <= p127) AND (1 <= p133) AND (1 <= p150))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 239 markings, 240 edges
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p172))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p172))
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p172))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p172 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-6-1.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
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2111533 markings, 2611207 edges, 422307 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4174866 markings, 5251680 edges, 412667 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6190970 markings, 7843240 edges, 403221 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8141101 markings, 10381530 edges, 390026 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 10040406 markings, 12875786 edges, 379861 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11911040 markings, 15355708 edges, 374127 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 13819275 markings, 17858003 edges, 381647 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 15630702 markings, 20269864 edges, 362285 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 17424280 markings, 22659969 edges, 358716 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 19206160 markings, 25042219 edges, 356376 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 21010446 markings, 27443038 edges, 360857 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 22811878 markings, 29847877 edges, 360286 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 24579911 markings, 32222360 edges, 353607 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 26357644 markings, 34612984 edges, 355547 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 28101117 markings, 36968611 edges, 348695 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 29850260 markings, 39331618 edges, 349829 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 31552104 markings, 41644826 edges, 340369 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 33263175 markings, 43966650 edges, 342214 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 34961686 markings, 46285628 edges, 339702 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 36634568 markings, 48571289 edges, 334576 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 38159528 markings, 50660056 edges, 304992 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 39666889 markings, 52709801 edges, 301472 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 41187608 markings, 54783879 edges, 304144 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 42741309 markings, 56907229 edges, 310740 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 44407870 markings, 59182418 edges, 333312 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 46072685 markings, 61461010 edges, 332963 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 47750551 markings, 63755967 edges, 335573 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 49401483 markings, 66012933 edges, 330186 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 51074600 markings, 68307067 edges, 334623 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 52719146 markings, 70564691 edges, 328909 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 54366266 markings, 72821141 edges, 329424 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 56001375 markings, 75063946 edges, 327022 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 57608211 markings, 77280525 edges, 321367 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 59199438 markings, 79486924 edges, 318245 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 60806263 markings, 81711123 edges, 321365 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 62432438 markings, 83954061 edges, 325235 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 64066821 markings, 86200861 edges, 326877 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 65639410 markings, 88387835 edges, 314518 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 67233170 markings, 90597874 edges, 318752 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 68823228 markings, 92811964 edges, 318012 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 70394135 markings, 95004184 edges, 314181 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 71963762 markings, 97202477 edges, 313925 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 73559534 markings, 99417211 edges, 319154 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 75127549 markings, 101593829 edges, 313603 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 76730133 markings, 103816486 edges, 320517 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 78283930 markings, 105986603 edges, 310759 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 79902279 markings, 108221362 edges, 323670 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 81461033 markings, 110404862 edges, 311751 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 82994292 markings, 112556132 edges, 306652 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 84556113 markings, 114737727 edges, 312364 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 86122480 markings, 116922688 edges, 313273 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 87719330 markings, 119133563 edges, 319370 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 89252982 markings, 121275626 edges, 306730 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 90785220 markings, 123423685 edges, 306448 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 92312362 markings, 125565254 edges, 305428 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 93862952 markings, 127727600 edges, 310118 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 95420865 markings, 129895958 edges, 311583 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 96962618 markings, 132048743 edges, 308351 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 98469892 markings, 134174138 edges, 301455 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 99992066 markings, 136315971 edges, 304435 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 101503642 markings, 138436777 edges, 302315 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 103010315 markings, 140565344 edges, 301335 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 104569834 markings, 142738007 edges, 311904 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 106072734 markings, 144860880 edges, 300580 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 107568213 markings, 146961970 edges, 299096 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 109107540 markings, 149114224 edges, 307865 markings/sec, 325 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown yes unknown yes unknown yes no unknown
lola: memory consumption: 14356524 KB
lola: time consumption: 575 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((((1 <= p1) AND (1 <= p24)) OR ((1 <= p53) AND (1 <= p76))))) OR A ((((1 <= p15) AND (1 <= p49)) U ((1 <= p178) AND (1 <= p201)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF((((1 <= p1) AND (1 <= p24)) OR ((1 <= p53) AND (1 <= p76)))) OR A(((1 <= p15) AND (1 <= p49)) U ((1 <= p178) AND (1 <= p201)))))
lola: processed formula length: 136
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 71 markings, 71 edges
lola: ========================================
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p107 <= 0) OR (p109 <= 0) OR (p63 <= 0) OR (p77 <= 0)) U E (G (((1 <= p106) AND (1 <= p121)))))) AND (E (((((1 <= p162) AND (1 <= p164)) OR ((1 <= p5) AND (1 <= p22))) U ((p11 <= 0) OR (p21 <= 0)))) OR (((1 <= p201)) AND (A ((((1 <= p82) AND (1 <= p84)) U ((1 <= p120)))) AND ((p90 <= 0) OR (p124 <= 0) OR (p157 <= 0) OR (p159 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (E(((p107 <= 0) OR (p109 <= 0) OR (p63 <= 0) OR (p77 <= 0)) U EG(((1 <= p106) AND (1 <= p121)))) AND (E((((1 <= p162) AND (1 <= p164)) OR ((1 <= p5) AND (1 <= p22))) U ((p11 <= 0) OR (p21 <= 0))) OR (((1 <= p201)) AND (A(((1 <= p82) AND (1 <= p84)) U ((1 <= p120))) AND ((p90 <= 0) OR (p124 <= 0) OR (p157 <= 0) OR (p159 <= 0))))))
lola: processed formula length: 339
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 4 significant temporal operators and needs 17 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: 263 markings, 318 edges
lola: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p76 <= 0)) AND ((p68 <= 0) OR (p75 <= 0)) AND ((p56 <= 0) OR (p71 <= 0))) U ((1 <= p133) AND (1 <= p150))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p76 <= 0)) AND ((p68 <= 0) OR (p75 <= 0)) AND ((p56 <= 0) OR (p71 <= 0))) U ((1 <= p133) AND (1 <= p150))))
lola: processed formula length: 116
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 10 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((((p113 <= 0) OR (p127 <= 0)) AND ((p178 <= 0) OR (p201 <= 0))) OR ((1 <= p67) AND (1 <= p69) AND (1 <= p93) AND (1 <= p100) AND (1 <= p145) AND (1 <= p95))) U ((1 <= p53) AND (1 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((((p113 <= 0) OR (p127 <= 0)) AND ((p178 <= 0) OR (p201 <= 0))) OR ((1 <= p67) AND (1 <= p69) AND (1 <= p93) AND (1 <= p100) AND (1 <= p145) AND (1 <= p95))) U ((1 <= p53) AND (1 <= p76))))
lola: processed formula length: 197
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p53) AND (1 <= p76))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 62 markings, 61 edges
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
lola: ========================================
lola: subprocess 11 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p92 <= 0) OR (p94 <= 0) OR (p12 <= 0) OR (p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p92) AND (1 <= p94) AND (1 <= p12) AND (1 <= p14))
lola: processed formula length: 57
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 /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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p92 <= 0) OR (p94 <= 0) OR (p12 <= 0) OR (p14 <= 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: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 <= p92) AND (1 <= p94) AND (1 <= p12) AND (1 <= p14))
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-11-1.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 169 markings, 169 edges
lola: ========================================
lola: subprocess 12 will run for 748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p131) AND (1 <= p146)) AND (E (G (((1 <= p176)))) AND ((p57 <= 0) OR (p59 <= 0) OR (p245 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p131 <= 0) OR (p146 <= 0)) OR (F (((p176 <= 0))) OR ((1 <= p57) AND (1 <= p59) AND (1 <= p245)))))
lola: processed formula length: 105
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 2325 markings, 2439 edges
lola: ========================================
lola: subprocess 13 will run for 998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p32) AND (1 <= p34) AND (1 <= p105) AND (1 <= p122)))) OR (A (G (((p132 <= 0) OR (p134 <= 0) OR (p230 <= 0) OR (p247 <= 0)))) OR (((1 <= p222) AND (1 <= p170)) AND (E (F (((1 <= p106) AND (1 <= p121)))) AND (((p131 <= 0) OR (p146 <= 0)) AND ((p233 <= 0) OR (p250 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p222) AND (1 <= p170))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p222) AND (1 <= p170))
lola: processed formula length: 29
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p132 <= 0) OR (p134 <= 0) OR (p230 <= 0) OR (p247 <= 0))))
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 (((p132 <= 0) OR (p134 <= 0) OR (p230 <= 0) OR (p247 <= 0))))
lola: processed formula length: 69
lola: 35 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p132) AND (1 <= p134) AND (1 <= p230) AND (1 <= p247))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 15 will run for 2994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p32) AND (1 <= p34) AND (1 <= p105) AND (1 <= p122))))
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: ((p32 <= 0) OR (p34 <= 0) OR (p105 <= 0) OR (p122 <= 0))
lola: processed formula length: 59
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
sara: try reading problem file CTLFireability-14-0.sara.
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F (((p80 <= 0) OR (p97 <= 0)))))) AND (A (G ((((p251 <= 0)) AND ((p87 <= 0) OR (p89 <= 0))))) OR A (G ((((p32 <= 0) OR (p34 <= 0)) AND ((p120 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p32 <= 0) OR (p34 <= 0)) AND ((p120 <= 0)))))
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:788
lola: processed formula: A (G ((((p32 <= 0) OR (p34 <= 0)) AND ((p120 <= 0)))))
lola: processed formula length: 55
lola: 35 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 2994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p251 <= 0)) AND ((p87 <= 0) OR (p89 <= 0)))))
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:788
lola: processed formula: A (G ((((p251 <= 0)) AND ((p87 <= 0) OR (p89 <= 0)))))
lola: processed formula length: 55
lola: 35 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p251)) OR ((1 <= p87) AND (1 <= p89)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p133) AND (1 <= p150)))) OR (E (F (((1 <= p86) AND (1 <= p96)))) AND (((1 <= p215)) AND (((1 <= p249)) AND (A (G (((1 <= p230) AND (1 <= p247)))) AND A (G (((1 <= p205) AND (1 <= p222)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: place or transition ordering is non-deterministic
lola: subprocess 15 will run for 2994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p249))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p249))
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p191) AND (1 <= p202) AND (1 <= p157) AND (1 <= p159) AND (((1 <= p233) AND (1 <= p250)) OR ((1 <= p163) AND (1 <= p177))))))))
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 <= p191) AND (1 <= p202) AND (1 <= p157) AND (1 <= p159) AND (((1 <= p233) AND (1 <= p250)) OR ((1 <= p163) AND (1 <= p177))))))
lola: processed formula length: 139
lola: 35 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: 966503 markings, 2665093 edges, 193301 markings/sec, 0 secs
lola: 1787939 markings, 5151947 edges, 164287 markings/sec, 5 secs
lola: 2599880 markings, 7675461 edges, 162388 markings/sec, 10 secs
lola: 3376319 markings, 10153669 edges, 155288 markings/sec, 15 secs
lola: 4121723 markings, 12579267 edges, 149081 markings/sec, 20 secs
lola: 4855801 markings, 14987861 edges, 146816 markings/sec, 25 secs
lola: 5591378 markings, 17408952 edges, 147115 markings/sec, 30 secs
lola: 6297623 markings, 19775862 edges, 141249 markings/sec, 35 secs
lola: 7006875 markings, 22146186 edges, 141850 markings/sec, 40 secs
lola: 7690312 markings, 24472048 edges, 136687 markings/sec, 45 secs
lola: 8373793 markings, 26804606 edges, 136696 markings/sec, 50 secs
lola: 9044679 markings, 29103355 edges, 134177 markings/sec, 55 secs
lola: 9713290 markings, 31408024 edges, 133722 markings/sec, 60 secs
lola: 10669539 markings, 34166280 edges, 191250 markings/sec, 65 secs
lola: 11552018 markings, 36818825 edges, 176496 markings/sec, 70 secs
lola: 12379249 markings, 39392506 edges, 165446 markings/sec, 75 secs
lola: 13172446 markings, 41907434 edges, 158639 markings/sec, 80 secs
lola: 13848177 markings, 44114772 edges, 135146 markings/sec, 85 secs
lola: 14516795 markings, 46290152 edges, 133724 markings/sec, 90 secs
lola: 15145944 markings, 48376003 edges, 125830 markings/sec, 95 secs
lola: 15818315 markings, 50615973 edges, 134474 markings/sec, 100 secs
lola: 16490795 markings, 52873821 edges, 134496 markings/sec, 105 secs
lola: 17141495 markings, 55060117 edges, 130140 markings/sec, 110 secs
lola: 17819538 markings, 57363899 edges, 135609 markings/sec, 115 secs
lola: 18495743 markings, 59685393 edges, 135241 markings/sec, 120 secs
lola: 19126246 markings, 61863310 edges, 126101 markings/sec, 125 secs
lola: 19715626 markings, 63897177 edges, 117876 markings/sec, 130 secs
lola: 20316187 markings, 65974756 edges, 120112 markings/sec, 135 secs
lola: 20950006 markings, 68184462 edges, 126764 markings/sec, 140 secs
lola: 21600267 markings, 70460217 edges, 130052 markings/sec, 145 secs
lola: 22215583 markings, 72614011 edges, 123063 markings/sec, 150 secs
lola: 22857952 markings, 74870135 edges, 128474 markings/sec, 155 secs
lola: 23490860 markings, 77114042 edges, 126582 markings/sec, 160 secs
lola: 24117926 markings, 79344105 edges, 125413 markings/sec, 165 secs
lola: 24721783 markings, 81499009 edges, 120771 markings/sec, 170 secs
lola: 25286528 markings, 83506970 edges, 112949 markings/sec, 175 secs
lola: 25860628 markings, 85558808 edges, 114820 markings/sec, 180 secs
lola: 26437908 markings, 87637619 edges, 115456 markings/sec, 185 secs
lola: 26997074 markings, 89645968 edges, 111833 markings/sec, 190 secs
lola: 27599270 markings, 91702927 edges, 120439 markings/sec, 195 secs
lola: 28498986 markings, 94197466 edges, 179943 markings/sec, 200 secs
lola: 29411534 markings, 96863996 edges, 182510 markings/sec, 205 secs
lola: 30272258 markings, 99468971 edges, 172145 markings/sec, 210 secs
lola: 31069308 markings, 101982979 edges, 159410 markings/sec, 215 secs
lola: 31742241 markings, 104284741 edges, 134587 markings/sec, 220 secs
lola: 32348045 markings, 106468773 edges, 121161 markings/sec, 225 secs
lola: 33015023 markings, 108764941 edges, 133396 markings/sec, 230 secs
lola: 33720398 markings, 111101161 edges, 141075 markings/sec, 235 secs
lola: 34464830 markings, 113531358 edges, 148886 markings/sec, 240 secs
lola: 35185610 markings, 115913536 edges, 144156 markings/sec, 245 secs
lola: 35843719 markings, 118192497 edges, 131622 markings/sec, 250 secs
lola: 36446418 markings, 120381139 edges, 120540 markings/sec, 255 secs
lola: 37047115 markings, 122565300 edges, 120139 markings/sec, 260 secs
lola: 37720244 markings, 124867222 edges, 134626 markings/sec, 265 secs
lola: 38315545 markings, 127042477 edges, 119060 markings/sec, 270 secs
lola: 38910178 markings, 129213328 edges, 118927 markings/sec, 275 secs
lola: 39503765 markings, 131376756 edges, 118717 markings/sec, 280 secs
lola: 40094906 markings, 133538749 edges, 118228 markings/sec, 285 secs
lola: 40680588 markings, 135683253 edges, 117136 markings/sec, 290 secs
lola: 41263687 markings, 137829685 edges, 116620 markings/sec, 295 secs
lola: 41845317 markings, 139975602 edges, 116326 markings/sec, 300 secs
lola: 42545542 markings, 142249497 edges, 140045 markings/sec, 305 secs
lola: 43041905 markings, 144036996 edges, 99273 markings/sec, 310 secs
lola: 43595531 markings, 146077009 edges, 110725 markings/sec, 315 secs
lola: 44131514 markings, 148065211 edges, 107197 markings/sec, 320 secs
lola: 44683888 markings, 150115690 edges, 110475 markings/sec, 325 secs
lola: 45380267 markings, 152357639 edges, 139276 markings/sec, 330 secs
lola: 46141453 markings, 154582193 edges, 152237 markings/sec, 335 secs
lola: 46720609 markings, 156570512 edges, 115831 markings/sec, 340 secs
lola: 47221179 markings, 158426503 edges, 100114 markings/sec, 345 secs
lola: 47745539 markings, 160369191 edges, 104872 markings/sec, 350 secs
lola: 48288437 markings, 162394481 edges, 108580 markings/sec, 355 secs
lola: 48839901 markings, 164412363 edges, 110293 markings/sec, 360 secs
lola: 49399514 markings, 166451839 edges, 111923 markings/sec, 365 secs
lola: 50052476 markings, 168670483 edges, 130592 markings/sec, 370 secs
lola: 50509810 markings, 170227619 edges, 91467 markings/sec, 375 secs
lola: 50969021 markings, 171811260 edges, 91842 markings/sec, 380 secs
lola: 51349669 markings, 173239019 edges, 76130 markings/sec, 385 secs
lola: 51756286 markings, 174691446 edges, 81323 markings/sec, 390 secs
lola: 52201692 markings, 176246785 edges, 89081 markings/sec, 395 secs
lola: 52590994 markings, 177668187 edges, 77860 markings/sec, 400 secs
lola: 53288123 markings, 179710004 edges, 139426 markings/sec, 405 secs
lola: 53703075 markings, 181043253 edges, 82990 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p172))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p172))
lola: processed formula length: 13
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p172 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation 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: ((1 <= p172))
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: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2175126 markings, 2692862 edges, 435025 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4220285 markings, 5309088 edges, 409032 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6066981 markings, 7678754 edges, 369339 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7802200 markings, 9943425 edges, 347044 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9538937 markings, 12220153 edges, 347347 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11317054 markings, 14562165 edges, 355623 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 13202418 markings, 17047733 edges, 377073 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 15036897 markings, 19479827 edges, 366896 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 16840451 markings, 21881828 edges, 360711 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 18635291 markings, 24277294 edges, 358968 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 20370318 markings, 26599330 edges, 347005 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 21991293 markings, 28757725 edges, 324195 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 23614572 markings, 30923212 edges, 324656 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 25274006 markings, 33154251 edges, 331887 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 27044354 markings, 35535254 edges, 354070 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 28770346 markings, 37879048 edges, 345198 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 30467382 markings, 40170533 edges, 339407 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 32008690 markings, 42264893 edges, 308262 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 33565175 markings, 44373652 edges, 311297 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 35190626 markings, 46601820 edges, 325090 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 36872608 markings, 48897022 edges, 336396 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 38510112 markings, 51145926 edges, 327501 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 40203696 markings, 53441035 edges, 338717 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 41882973 markings, 55729168 edges, 335855 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 43556425 markings, 58014706 edges, 334690 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 45215086 markings, 60287313 edges, 331732 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 46808244 markings, 62469583 edges, 318632 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 48483285 markings, 64752509 edges, 335008 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 50157617 markings, 67038276 edges, 334866 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 51718674 markings, 69190146 edges, 312211 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 53216245 markings, 71252038 edges, 299514 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 54774160 markings, 73383818 edges, 311583 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 56255860 markings, 75415608 edges, 296340 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 57700301 markings, 77408285 edges, 288888 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 59217501 markings, 79511883 edges, 303440 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 60733820 markings, 81611178 edges, 303264 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 62184943 markings, 83612635 edges, 290225 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 63668244 markings, 85655135 edges, 296660 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 65164597 markings, 87726673 edges, 299271 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 66725473 markings, 89891149 edges, 312175 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 68200334 markings, 91940333 edges, 294972 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 69634756 markings, 93945853 edges, 286884 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 71067249 markings, 95944907 edges, 286499 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 72575509 markings, 98051295 edges, 301652 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 74161466 markings, 100247915 edges, 317191 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 75738397 markings, 102444501 edges, 315386 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 77307186 markings, 104630587 edges, 313758 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 78898578 markings, 106829885 edges, 318278 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 80468327 markings, 109020877 edges, 313950 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 82026316 markings, 111200174 edges, 311598 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 83568666 markings, 113357750 edges, 308470 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 85119845 markings, 115526473 edges, 310236 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 86677988 markings, 117698636 edges, 311629 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 88263509 markings, 119893078 edges, 317104 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 89802295 markings, 122043909 edges, 307757 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 91312554 markings, 124168110 edges, 302052 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 92850035 markings, 126315133 edges, 307496 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 94389929 markings, 128464632 edges, 307979 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 95938770 markings, 130621543 edges, 309768 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 97450186 markings, 132735954 edges, 302283 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 98952917 markings, 134854595 edges, 300546 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 100460928 markings, 136972355 edges, 301602 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 101952928 markings, 139070857 edges, 298400 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 103463207 markings, 141193933 edges, 302056 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 104971670 markings, 143311373 edges, 301693 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 106355250 markings, 145256006 edges, 276716 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 107688633 markings, 147130529 edges, 266677 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 109099207 markings, 149102591 edges, 282115 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 110572595 markings, 151177772 edges, 294678 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 112092056 markings, 153307454 edges, 303892 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 113543381 markings, 155370068 edges, 290265 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 115055309 markings, 157492481 edges, 302386 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 116536800 markings, 159585340 edges, 296298 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 118018156 markings, 161680623 edges, 296271 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 119504942 markings, 163782372 edges, 297357 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 120956187 markings, 165839102 edges, 290249 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 122461625 markings, 167946955 edges, 301088 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 123929674 markings, 170015595 edges, 293610 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 125161185 markings, 171749978 edges, 246302 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 126429305 markings, 173535300 edges, 253624 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 127766896 markings, 175423139 edges, 267518 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 129166129 markings, 177409971 edges, 279847 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 130501542 markings, 179293243 edges, 267083 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 131846057 markings, 181198013 edges, 268903 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 133265305 markings, 183203522 edges, 283850 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 134654409 markings, 185171275 edges, 277821 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 135980431 markings, 187042430 edges, 265204 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 137256327 markings, 188843037 edges, 255179 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 138532372 markings, 190659291 edges, 255209 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 139860499 markings, 192526665 edges, 265625 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 141292059 markings, 194539757 edges, 286312 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 142685935 markings, 196509639 edges, 278775 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 144056186 markings, 198433444 edges, 274050 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 145272612 markings, 200153173 edges, 243285 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 146392486 markings, 201736626 edges, 223975 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 147373314 markings, 203135298 edges, 196166 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 148478171 markings, 204704660 edges, 220971 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 149653895 markings, 206378783 edges, 235145 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 150878380 markings, 208120614 edges, 244897 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 152006479 markings, 209718529 edges, 225620 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 153231142 markings, 211461492 edges, 244933 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 154327809 markings, 213002535 edges, 219333 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 155265189 markings, 214335394 edges, 187476 markings/sec, 510 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p133) AND (1 <= p150)))) OR (E (F (((1 <= p86) AND (1 <= p96)))) AND (((1 <= p215)) AND (((1 <= p249)) AND (A (G (((1 <= p230) AND (1 <= p247)))) AND A (G (((1 <= p205) AND (1 <= p222)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p249))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p249))
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: ...considering subproblem: E (F (((1 <= p133) AND (1 <= p150))))
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 <= p133) AND (1 <= p150))))
lola: processed formula length: 37
lola: 34 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 <= p133) AND (1 <= p150))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes no unknown yes yes unknown yes yes yes no no
lola:
preliminary result: yes yes yes no yes yes no unknown yes yes unknown yes yes yes no no
lola: memory consumption: 3928 KB
lola: time consumption: 1509 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-010A"
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 ShieldPPPt-PT-010A, 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 r211-tajo-159033477800652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010A.tgz
mv ShieldPPPt-PT-010A 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 ;