About the Execution of ITS-LoLa for DatabaseWithMutex-COL-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.150 | 3600000.00 | 20262.00 | 140.90 | TFTTFTTFFFFFTTFF | 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.r178-tajo-158987882100228.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 DatabaseWithMutex-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882100228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.0K Mar 31 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 19K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591210777145
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:59:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 18:59:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:59:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 18:59:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 912 ms
[2020-06-03 18:59:43] [INFO ] sort/places :
site->all_active,all_passive,
file->Mutex,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,
[2020-06-03 18:59:43] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 12 ms.
[2020-06-03 18:59:43] [INFO ] Computed order based on color domains.
[2020-06-03 18:59:43] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions in 59 ms.
[2020-06-03 18:59:43] [INFO ] Unfolded HLPN properties in 0 ms.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
[2020-06-03 18:59:43] [INFO ] Reduced 2 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 107 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 261 ms. (steps per millisecond=383 ) properties seen :[1, 1, 0, 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, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 32 rows 38 cols
[2020-06-03 18:59:43] [INFO ] Computed 10 place invariants in 3 ms
[2020-06-03 18:59:44] [INFO ] [Real]Absence check using 7 positive place invariants in 32 ms returned unsat
[2020-06-03 18:59:44] [INFO ] [Real]Absence check using 7 positive place invariants in 54 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 18:59:44] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-03 18:59:44] [INFO ] Flatten gal took : 52 ms
[2020-06-03 18:59:44] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-03 18:59:44] [INFO ] Flatten gal took : 5 ms
FORMULA DatabaseWithMutex-COL-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 18:59:44] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-03 18:59:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DatabaseWithMutex-COL-02 @ 3570 seconds
FORMULA DatabaseWithMutex-COL-02-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-COL-02-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ DatabaseWithMutex-COL-02
{
"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": "Wed Jun 3 18:59:45 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "E (F (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))))",
"processed_size": 65,
"rewrites": 147
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "E (G (((1 <= p4) OR (1 <= p5))))",
"processed_size": 33,
"rewrites": 147
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"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 ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))))",
"processed_size": 187,
"rewrites": 149
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "existential_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))))",
"processed_size": 125,
"rewrites": 147
},
"net":
{
"conflict_clusters": 26,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "EG(AF(((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))) AND (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))))",
"processed_size": 261,
"rewrites": 148
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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 <= p11) AND (1 <= p37))",
"processed_size": 27,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)))",
"processed_size": 61,
"rewrites": 147
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) AND (p5 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))",
"processed_size": 212,
"rewrites": 147
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 <= p11) AND (1 <= p35))",
"processed_size": 27,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 <= p10) AND (1 <= p34))",
"processed_size": 27,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 <= p10) AND (1 <= p36))",
"processed_size": 27,
"rewrites": 146
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p1) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)))))",
"processed_size": 129,
"rewrites": 147
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 64,
"problems": 16
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"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": 10,
"visible_transitions": 0
},
"processed": "A (G (((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))))",
"processed_size": 197,
"rewrites": 148
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"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": 3567
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EG(AF((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))",
"processed_size": 133,
"rewrites": 148
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 30,
"markings": 12,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 39588,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : (A(X(*)) AND (E(G(**)) AND (E((* R *)) OR (E(F(*)) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))))))))) : E(G(A(F(**)))) : (E(G(A(F(**)))) OR ((E(X(**)) OR (** OR (** OR (** OR (** OR (E(G(**)) AND **)))))) AND (A(F(*)) OR (** OR **))))"
},
"net":
{
"arcs": 88,
"conflict_clusters": 26,
"places": 38,
"places_significant": 28,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no yes yes no ",
"value": "no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (G (A (G (((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))))) : ((NOT(E (X ((((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))))) AND E (G (((1 <= p4) OR (1 <= p5))))) AND (NOT(A ((((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)) U (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))) OR ((((((((((((((((NOT(A (G (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))))) AND (p16 <= 0)) AND (p17 <= 0)) AND (p18 <= 0)) AND (p19 <= 0)) AND (p32 <= 0)) AND (p33 <= 0)) AND (p30 <= 0)) AND (p31 <= 0)) AND ((p8 <= 0) OR (p24 <= 0))) AND ((p9 <= 0) OR (p25 <= 0))) AND ((p6 <= 0) OR (p26 <= 0))) AND ((p7 <= 0) OR (p27 <= 0))) AND ((p3 <= 0) OR (p29 <= 0))) AND ((p0 <= 0) OR (p28 <= 0))) AND ((p1 <= 0) OR (p28 <= 0))) AND ((p2 <= 0) OR (p29 <= 0))))) : E (G (A (F ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))))) : (E (G (A (F (((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))) AND (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))))) OR ((((((E (X (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)))) OR ((1 <= p11) AND (1 <= p37))) OR ((1 <= p10) AND (1 <= p36))) OR ((1 <= p10) AND (1 <= p34))) OR ((1 <= p11) AND (1 <= p35))) OR (E (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p1) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29))))) AND ((1 <= p4) OR (1 <= p5) OR ((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)) OR ((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p1) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29))))) AND ((NOT(E (G (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23))))) OR ((p4 <= 0) AND (p5 <= 0))) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))))) AND (E (G (((1 <= p4) OR (1 <= p5)))) AND (E ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))) OR (E (F (((p32 <= 0) AND (p33 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))))
lola: processed formula length: 65
lola: 147 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: ((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p4) OR (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
sara: try reading problem file CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p4) OR (1 <= p5))))
lola: processed formula length: 33
lola: 147 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4 <= 0) AND (p5 <= 0))
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 / EG
lola: The predicate is possibly preserved.
lola: 8 markings, 8 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0)) R (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))))
lola: processed formula length: 187
lola: 149 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))))
lola: processed formula length: 125
lola: 147 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F (((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))) AND (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))))) OR ((E (X (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)))) OR (((1 <= p11) AND (1 <= p37)) OR (((1 <= p10) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))) AND (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))) AND (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))))
lola: processed formula length: 261
lola: 148 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p11) AND (1 <= p37))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p11) AND (1 <= p37))
lola: processed formula length: 27
lola: 146 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 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p32) OR (1 <= p33) OR (1 <= p30) OR (1 <= p31)))
lola: processed formula length: 61
lola: 147 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p4 <= 0) AND (p5 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((p4 <= 0) AND (p5 <= 0)) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))
lola: processed formula length: 212
lola: 147 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p11) AND (1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p11) AND (1 <= p35))
lola: processed formula length: 27
lola: 146 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 7 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p34))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND (1 <= p34))
lola: processed formula length: 27
lola: 146 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 8 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND (1 <= p36))
lola: processed formula length: 27
lola: 146 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 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p1) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p1) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)))))
lola: processed formula length: 129
lola: 147 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not possibly preserved.
lola: formula 0: (((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)))
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 64 literals and 16 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 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 (((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0))) OR ((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))))
lola: processed formula length: 197
lola: 148 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: 5 markings, 4 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))) AND ((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))
lola: processed formula length: 133
lola: 148 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12 markings, 30 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no
lola:
preliminary result: no yes yes no
lola: memory consumption: 39588 KB
lola: time consumption: 3 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="DatabaseWithMutex-COL-02"
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 DatabaseWithMutex-COL-02, 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 r178-tajo-158987882100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 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 ;