About the Execution of ITS-LoLa for BusinessProcesses-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15729.120 | 3600000.00 | 1115332.00 | 174.40 | FFFTFTFFTFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900467.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900467
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 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 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591156734257
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:58:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:58:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:58:55] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-06-03 03:58:55] [INFO ] Transformed 274 places.
[2020-06-03 03:58:55] [INFO ] Transformed 237 transitions.
[2020-06-03 03:58:55] [INFO ] Found NUPN structural information;
[2020-06-03 03:58:55] [INFO ] Parsed PT model containing 274 places and 237 transitions in 92 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Incomplete random walk after 100000 steps, including 1200 resets, run finished after 223 ms. (steps per millisecond=448 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 236 rows 273 cols
[2020-06-03 03:58:56] [INFO ] Computed 43 place invariants in 9 ms
[2020-06-03 03:58:56] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2020-06-03 03:58:56] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2020-06-03 03:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:56] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 8 places in 153 ms
[2020-06-03 03:58:56] [INFO ] Deduced a trap composed of 22 places in 192 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 12 places in 78 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 33 places in 112 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 68 places in 57 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 32 places in 54 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 14 places in 87 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 38 places in 97 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 73 places in 55 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 16 places in 36 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 26 places in 42 ms
[2020-06-03 03:58:57] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2020-06-03 03:58:57] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1380 ms
[2020-06-03 03:58:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:58:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 58 ms returned sat
[2020-06-03 03:58:58] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-06-03 03:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:58:58] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 14 places in 70 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 14 places in 56 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 26 places in 113 ms
[2020-06-03 03:58:58] [INFO ] Deduced a trap composed of 74 places in 60 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 71 places in 93 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 72 places in 63 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 24 places in 61 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 48 places in 55 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 21 places in 46 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 41 places in 44 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 29 places in 50 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 77 places in 47 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 74 places in 46 ms
[2020-06-03 03:58:59] [INFO ] Deduced a trap composed of 31 places in 32 ms
[2020-06-03 03:58:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1402 ms
[2020-06-03 03:58:59] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 19 ms.
[2020-06-03 03:59:00] [INFO ] Added : 193 causal constraints over 39 iterations in 844 ms. Result :sat
[2020-06-03 03:59:00] [INFO ] Deduced a trap composed of 68 places in 86 ms
[2020-06-03 03:59:00] [INFO ] Deduced a trap composed of 69 places in 47 ms
[2020-06-03 03:59:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2020-06-03 03:59:01] [INFO ] [Real]Absence check using 31 positive place invariants in 216 ms returned sat
[2020-06-03 03:59:01] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 49 ms returned sat
[2020-06-03 03:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:01] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2020-06-03 03:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:59:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-06-03 03:59:01] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-06-03 03:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:59:01] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-06-03 03:59:01] [INFO ] Deduced a trap composed of 11 places in 46 ms
[2020-06-03 03:59:01] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-06-03 03:59:01] [INFO ] Deduced a trap composed of 15 places in 120 ms
[2020-06-03 03:59:01] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 28 places in 28 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 29 places in 30 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 40 places in 28 ms
[2020-06-03 03:59:02] [INFO ] Deduced a trap composed of 33 places in 26 ms
[2020-06-03 03:59:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 724 ms
[2020-06-03 03:59:02] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 9 ms.
[2020-06-03 03:59:02] [INFO ] Added : 132 causal constraints over 27 iterations in 447 ms. Result :sat
[2020-06-03 03:59:03] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:59:03] [INFO ] Flatten gal took : 80 ms
[2020-06-03 03:59:03] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:59:03] [INFO ] Flatten gal took : 24 ms
FORMULA BusinessProcesses-PT-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:59:03] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 03:59:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-03 @ 3570 seconds
FORMULA BusinessProcesses-PT-03-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for CTLCardinality @ BusinessProcesses-PT-03
{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:59:03 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": "A (G ((((p183 <= 0)) OR ((1 <= p67)))))",
"processed_size": 40,
"rewrites": 19
},
"result":
{
"edges": 56,
"markings": 57,
"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"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": "A (G ((((p149 <= 0)) OR ((1 <= p257)))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 53,
"markings": 54,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": "A (G ((((p226 <= 0)) OR ((1 <= p168)))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 152,
"markings": 153,
"produced_by": "state space",
"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",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": "A (G ((((p244 <= 0)) OR ((1 <= p11)))))",
"processed_size": 40,
"rewrites": 19
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((DEADLOCK OR ((((p226 <= 0)) OR ((1 <= p109))) AND (((p17 <= 0)) OR ((1 <= p244)))))))",
"processed_size": 94,
"rewrites": 22
},
"result":
{
"edges": 106,
"markings": 107,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((((1 <= p14)) AND ((p55 <= 0)) AND ((1 <= p157)) AND ((p62 <= 0))) R (((p21 <= 0)) OR ((1 <= p135)))))",
"processed_size": 107,
"rewrites": 22
},
"result":
{
"edges": 118,
"markings": 119,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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 <= p221)) AND ((p39 <= 0)))",
"processed_size": 32,
"rewrites": 20
},
"result":
{
"edges": 3532928,
"markings": 470057,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 3,
"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": "E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))",
"processed_size": 73,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 3,
"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": "E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))",
"processed_size": 73,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((((p87 <= 0)) OR ((1 <= p152))) AND (((p194 <= 0)) OR ((1 <= p189)) OR ((1 <= p128))))))",
"processed_size": 98,
"rewrites": 19
},
"result":
{
"edges": 33,
"markings": 34,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28228,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((* R *)) : A(G(**)) : E(G(E(F(*)))) : TRUE : A(G(**)) : NODEADLOCK : A(G((DEADLOCK OR **))) : (A(G(**)) AND E((** U **))) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 630,
"conflict_clusters": 215,
"places": 273,
"places_significant": 230,
"singleton_clusters": 0,
"transitions": 236
},
"result":
{
"preliminary_value": "no no yes yes no yes no no no no ",
"value": "no no yes yes no yes no no 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: 509/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 273
lola: finding significant places
lola: 273 places, 236 transitions, 230 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: NOT(E (((((p14 <= 0)) OR ((1 <= p55)) OR ((p157 <= 0)) OR ((1 <= p62))) U (((1 <= p21)) AND ((p135 <= 0)))))) : A (G ((((p149 <= 0)) OR ((1 <= p257))))) : E (G (NOT(A (G ((((p221 <= 0)) OR ((1 <= p39)))))))) : E (G ((0 <= 0))) : A ((E (X ((1 <= 0))) U A (G ((((p183 <= 0)) OR ((1 <= p67))))))) : E (X ((0 <= 0))) : A (G ((A (X ((1 <= 0))) OR ((((p226 <= 0)) OR ((1 <= p109))) AND (((p17 <= 0)) OR ((1 <= p244))))))) : (A (G (((((p87 <= 0)) OR ((1 <= p152))) AND (((p194 <= 0)) OR ((1 <= p189)) OR ((1 <= p128)))))) AND E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))) : A (G ((((p226 <= 0)) OR ((1 <= p168))))) : A (G ((((p244 <= 0)) OR ((1 <= p11)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p183 <= 0)) OR ((1 <= p67)))))
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 ((((p183 <= 0)) OR ((1 <= p67)))))
lola: processed formula length: 40
lola: 19 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: formula 0: (((1 <= p183)) AND ((p67 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p149 <= 0)) OR ((1 <= p257)))))
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 ((((p149 <= 0)) OR ((1 <= p257)))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.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 <= p149)) AND ((p257 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 54 markings, 53 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p226 <= 0)) OR ((1 <= p168)))))
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 ((((p226 <= 0)) OR ((1 <= p168)))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.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 <= p226)) AND ((p168 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 153 markings, 152 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p244 <= 0)) OR ((1 <= p11)))))
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 ((((p244 <= 0)) OR ((1 <= p11)))))
lola: processed formula length: 40
lola: 19 rewrites
lola: closed formula file CTLCardinality.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 <= p244)) AND ((p11 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((DEADLOCK OR ((((p226 <= 0)) OR ((1 <= p109))) AND (((p17 <= 0)) OR ((1 <= p244)))))))
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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:776
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G ((DEADLOCK OR ((((p226 <= 0)) OR ((1 <= p109))) AND (((p17 <= 0)) OR ((1 <= p244)))))))
lola: processed formula length: 94
lola: 22 rewrites
lola: closed formula file CTLCardinality.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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:776
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: (NODEADLOCK AND ((((1 <= p226)) AND ((p109 <= 0))) OR (((1 <= p17)) AND ((p244 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 107 markings, 106 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((1 <= p14)) AND ((p55 <= 0)) AND ((1 <= p157)) AND ((p62 <= 0))) R (((p21 <= 0)) OR ((1 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((((1 <= p14)) AND ((p55 <= 0)) AND ((1 <= p157)) AND ((p62 <= 0))) R (((p21 <= 0)) OR ((1 <= p135)))))
lola: processed formula length: 107
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: 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 <= p21)) AND ((p135 <= 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: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 119 markings, 118 edges
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((1 <= p221)) AND ((p39 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((1 <= p221)) AND ((p39 <= 0)))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file CTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p221 <= 0)) OR ((1 <= p39)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p221)) AND ((p39 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
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 || 395618 markings, 2968045 edges, 79124 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 470057 markings, 3532928 edges
lola: ========================================
lola: subprocess 9 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((((p87 <= 0)) OR ((1 <= p152))) AND (((p194 <= 0)) OR ((1 <= p189)) OR ((1 <= p128)))))) AND E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))
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 (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))
lola: processed formula length: 73
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: 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: (A (G (((((p87 <= 0)) OR ((1 <= p152))) AND (((p194 <= 0)) OR ((1 <= p189)) OR ((1 <= p128)))))) AND E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))
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 (((((1 <= p245)) AND ((p267 <= 0))) U (((p95 <= 0)) OR ((1 <= p67)))))
lola: processed formula length: 73
lola: 20 rewrites
lola: closed formula file CTLCardinality.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: (((p95 <= 0)) OR ((1 <= p67)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((((p87 <= 0)) OR ((1 <= p152))) AND (((p194 <= 0)) OR ((1 <= p189)) OR ((1 <= p128))))))
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 (((((p87 <= 0)) OR ((1 <= p152))) AND (((p194 <= 0)) OR ((1 <= p189)) OR ((1 <= p128))))))
lola: processed formula length: 98
lola: 19 rewrites
lola: closed formula file CTLCardinality.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: 34 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no yes no no no no
lola:
preliminary result: no no yes yes no yes no no no no
lola: memory consumption: 28228 KB
lola: time consumption: 9 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;