About the Execution of ITS-LoLa for RefineWMG-PT-025026
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15800.410 | 3600000.00 | 761184.00 | 172557.30 | FTFTT?F?FT?FFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500091.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 RefineWMG-PT-025026, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.5K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 56K Mar 24 05:38 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME n0-CTLCardinality-00
FORMULA_NAME n0-CTLCardinality-01
FORMULA_NAME n0-CTLCardinality-02
FORMULA_NAME n0-CTLCardinality-03
FORMULA_NAME n0-CTLCardinality-04
FORMULA_NAME n0-CTLCardinality-05
FORMULA_NAME n0-CTLCardinality-06
FORMULA_NAME n0-CTLCardinality-07
FORMULA_NAME n0-CTLCardinality-08
FORMULA_NAME n0-CTLCardinality-09
FORMULA_NAME n0-CTLCardinality-10
FORMULA_NAME n0-CTLCardinality-11
FORMULA_NAME n0-CTLCardinality-12
FORMULA_NAME n0-CTLCardinality-13
FORMULA_NAME n0-CTLCardinality-14
FORMULA_NAME n0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591226617677
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:23:39] [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 23:23:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:23:39] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-06-03 23:23:39] [INFO ] Transformed 129 places.
[2020-06-03 23:23:39] [INFO ] Transformed 103 transitions.
[2020-06-03 23:23:39] [INFO ] Parsed PT model containing 129 places and 103 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Incomplete random walk after 100012 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=584 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 103 rows 129 cols
[2020-06-03 23:23:39] [INFO ] Computed 52 place invariants in 5 ms
[2020-06-03 23:23:39] [INFO ] [Real]Absence check using 52 positive place invariants in 29 ms returned sat
[2020-06-03 23:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:39] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2020-06-03 23:23:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:40] [INFO ] [Nat]Absence check using 52 positive place invariants in 104 ms returned sat
[2020-06-03 23:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:40] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 23:23:40] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 10 ms.
[2020-06-03 23:23:40] [INFO ] Added : 57 causal constraints over 12 iterations in 265 ms. Result :sat
[2020-06-03 23:23:40] [INFO ] [Real]Absence check using 52 positive place invariants in 165 ms returned sat
[2020-06-03 23:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:40] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-06-03 23:23:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:40] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2020-06-03 23:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:40] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-06-03 23:23:40] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 37 ms.
[2020-06-03 23:23:41] [INFO ] Added : 52 causal constraints over 11 iterations in 145 ms. Result :sat
[2020-06-03 23:23:41] [INFO ] [Real]Absence check using 52 positive place invariants in 28 ms returned sat
[2020-06-03 23:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:41] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 23:23:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:41] [INFO ] [Nat]Absence check using 52 positive place invariants in 24 ms returned sat
[2020-06-03 23:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:41] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-03 23:23:41] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 4 ms.
[2020-06-03 23:23:41] [INFO ] Added : 52 causal constraints over 11 iterations in 101 ms. Result :sat
[2020-06-03 23:23:41] [INFO ] [Real]Absence check using 52 positive place invariants in 32 ms returned sat
[2020-06-03 23:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:41] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-03 23:23:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:41] [INFO ] [Nat]Absence check using 52 positive place invariants in 39 ms returned sat
[2020-06-03 23:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:41] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:23:41] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 7 ms.
[2020-06-03 23:23:41] [INFO ] Added : 54 causal constraints over 11 iterations in 146 ms. Result :sat
[2020-06-03 23:23:41] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2020-06-03 23:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:42] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-03 23:23:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2020-06-03 23:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-06-03 23:23:42] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 9 ms.
[2020-06-03 23:23:42] [INFO ] Added : 54 causal constraints over 11 iterations in 93 ms. Result :sat
[2020-06-03 23:23:42] [INFO ] [Real]Absence check using 52 positive place invariants in 13 ms returned sat
[2020-06-03 23:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:42] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-03 23:23:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2020-06-03 23:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:46] [INFO ] [Nat]Absence check using state equation in 3939 ms returned sat
[2020-06-03 23:23:46] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 3 ms.
[2020-06-03 23:23:46] [INFO ] Added : 40 causal constraints over 13 iterations in 81 ms. Result :sat
[2020-06-03 23:23:46] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2020-06-03 23:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:46] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-03 23:23:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2020-06-03 23:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:46] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-06-03 23:23:46] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 5 ms.
[2020-06-03 23:23:46] [INFO ] Added : 57 causal constraints over 12 iterations in 92 ms. Result :sat
[2020-06-03 23:23:46] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2020-06-03 23:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 23:23:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2020-06-03 23:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:46] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-03 23:23:46] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 7 ms.
[2020-06-03 23:23:46] [INFO ] Added : 50 causal constraints over 10 iterations in 75 ms. Result :sat
[2020-06-03 23:23:46] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2020-06-03 23:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:46] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-06-03 23:23:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:47] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2020-06-03 23:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:47] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-03 23:23:47] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 6 ms.
[2020-06-03 23:23:47] [INFO ] Added : 57 causal constraints over 12 iterations in 88 ms. Result :sat
[2020-06-03 23:23:47] [INFO ] [Real]Absence check using 52 positive place invariants in 10 ms returned sat
[2020-06-03 23:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:47] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 23:23:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:23:47] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2020-06-03 23:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:23:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-03 23:23:47] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 6 ms.
[2020-06-03 23:23:47] [INFO ] Added : 48 causal constraints over 10 iterations in 73 ms. Result :sat
[2020-06-03 23:23:47] [INFO ] Flatten gal took : 39 ms
[2020-06-03 23:23:47] [INFO ] Flatten gal took : 11 ms
[2020-06-03 23:23:47] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 23:23:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-025026 @ 3570 seconds
FORMULA n0-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA n0-CTLCardinality-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2370
rslt: Output for CTLCardinality @ RefineWMG-PT-025026
{
"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",
"--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 23:24:00 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p91 + 1 <= p113) OR (p11 <= p16))))",
"processed_size": 44,
"rewrites": 19
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p106 <= p22) AND (2 <= p35))",
"processed_size": 30,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p5 + 1 <= p56)",
"processed_size": 15,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((3 <= p76)))",
"processed_size": 18,
"rewrites": 19
},
"result":
{
"edges": 567,
"markings": 568,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p65)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p80 <= 0)))",
"processed_size": 18,
"rewrites": 19
},
"result":
{
"edges": 11,
"markings": 12,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 ((p68 + 1 <= p52)))",
"processed_size": 24,
"rewrites": 19
},
"result":
{
"edges": 26,
"markings": 27,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 330
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p104 <= p33)))",
"processed_size": 21,
"rewrites": 19
},
"result":
{
"edges": 17,
"markings": 13,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 367
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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 (G (((p49 + 1 <= p58) OR ((2 <= p106) AND (p59 <= p65) AND (2 <= p66)))))",
"processed_size": 76,
"rewrites": 19
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((p23 <= p29) AND (1 <= p30) AND (2 <= p95) AND ((p61 <= p65) OR (1 <= p111)))))",
"processed_size": 87,
"rewrites": 18
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 514
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 514
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p53) OR (p118 + 1 <= p125))",
"processed_size": 34,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 617
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p38 <= 1) AND (p92 <= 0))))",
"processed_size": 35,
"rewrites": 18
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 617
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 617
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p105 <= p77) OR ((p55 <= p67) AND (2 <= p91)))",
"processed_size": 49,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 771
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p20)))",
"processed_size": 18,
"rewrites": 18
},
"result":
{
"edges": 68,
"markings": 69,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 771
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 771
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((2 <= p87) OR (p35 <= p69))",
"processed_size": 29,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1028
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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 (((p37 <= 0) AND ((p7 <= p72) OR (1 <= p96)))))",
"processed_size": 53,
"rewrites": 18
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1028
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1028
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))",
"processed_size": 61,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1455
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((2 <= p4) OR (p51 <= p21) OR (p128 <= p43))",
"processed_size": 46,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2911
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G (((p1 <= 0) OR (p105 <= 0))))",
"processed_size": 35,
"rewrites": 19
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2911
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((p104 <= 1)) OR ((p10 + 1 <= p66) AND (p45 + 1 <= p18) AND (p66 <= 2))))",
"processed_size": 79,
"rewrites": 27
},
"result":
{
"edges": 153,
"markings": 119,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))",
"processed_size": 61,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3536,
"runtime": 1200.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(**)) AND E(X(**))) : (E(F(**)) OR (** OR **)) : (** AND ((E(G(**)) AND (** AND **)) OR (E(X(**)) AND A(G(**))))) : (E(F(**)) AND **) : E(F((E(G(**)) AND **))) : A((** U A(G(**)))) : A(G(**)) : (E((** U **)) OR **) : A(G(**)) : (E(F(**)) AND **) : E(F(A(X(*)))) : A(G(*)) : A(G(*)) : E(F(**)) : A(X(A(G(*)))) : (A(G(**)) AND **)"
},
"net":
{
"arcs": 308,
"conflict_clusters": 78,
"places": 129,
"places_significant": 77,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"preliminary_value": "no yes no yes yes unknown no unknown no yes unknown no no yes no no ",
"value": "no yes no yes yes unknown no unknown no yes unknown no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 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: (A (G (((p91 + 1 <= p113) OR (p11 <= p16)))) AND E (X (((p9 <= p105) OR ((p98 <= p109) AND (2 <= p54)))))) : ((E (F (((p38 <= 1) AND (p92 <= 0)))) OR (1 <= p53)) OR (p118 + 1 <= p125)) : ((p5 + 1 <= p56) AND (((E (G ((2 <= p61))) AND (p106 <= p22)) AND (2 <= p35)) OR (E (X ((p39 <= p38))) AND A (G ((3 <= p76)))))) : (E (F ((3 <= p20))) AND ((p105 <= p77) OR ((p55 <= p67) AND (2 <= p91)))) : E (F ((E (G ((2 <= p104))) AND ((p66 <= p10) OR (p18 <= p45) OR (3 <= p66))))) : A ((((3 <= p64) AND (p91 <= p78) AND (2 <= p25) AND (p109 <= p85)) U A (G ((p0 <= p91))))) : A (G ((p104 <= p33))) : (E (((p100 <= p73) U (2 <= p70))) OR ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))) : A (G (((p49 + 1 <= p58) OR ((2 <= p106) AND (p59 <= p65) AND (2 <= p66))))) : (E (F (((p37 <= 0) AND ((p7 <= p72) OR (1 <= p96))))) AND ((2 <= p87) OR (p35 <= p69))) : E (F (NOT(E (X ((p25 <= p63)))))) : NOT(E (F ((1 <= p80)))) : NOT(E (F ((p52 <= p68)))) : E (F (((p23 <= p29) AND (1 <= p30) AND (2 <= p95) AND ((p61 <= p65) OR (1 <= p111))))) : NOT(E (F (E (X ((2 <= p65)))))) : (A (G (((p1 <= 0) OR (p105 <= 0)))) AND ((2 <= p4) OR (p51 <= p21) OR (p128 <= p43)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p91 + 1 <= p113) OR (p11 <= p16)))) AND E (X (((p9 <= p105) OR ((p98 <= p109) AND (2 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p91 + 1 <= p113) OR (p11 <= p16))))
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 (((p91 + 1 <= p113) OR (p11 <= p16))))
lola: processed formula length: 44
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: ((p113 <= p91) AND (p16 + 1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 + 1 <= p56) AND ((E (G ((2 <= p61))) AND ((p106 <= p22) AND (2 <= p35))) OR (E (X ((p39 <= p38))) AND A (G ((3 <= p76))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p106 <= p22) AND (2 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p106 <= p22) AND (2 <= p35))
lola: processed formula length: 30
lola: 18 rewrites
lola: closed formula file CTLCardinality.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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 + 1 <= p56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 + 1 <= p56)
lola: processed formula length: 15
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p76)))
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 ((3 <= p76)))
lola: processed formula length: 18
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: (p76 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 568 markings, 567 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p63 + 1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p63 + 1 <= p25)))
lola: processed formula length: 24
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3419433 markings, 5194880 edges, 683887 markings/sec, 0 secs
lola: 6829337 markings, 10375301 edges, 681981 markings/sec, 5 secs
lola: 11888026 markings, 18060617 edges, 1011738 markings/sec, 10 secs
lola: 15216822 markings, 23117823 edges, 665759 markings/sec, 15 secs
lola: 18427419 markings, 27995462 edges, 642119 markings/sec, 20 secs
lola: 21572968 markings, 32774282 edges, 629110 markings/sec, 25 secs
lola: 24714687 markings, 37547283 edges, 628344 markings/sec, 30 secs
lola: 27802743 markings, 42238756 edges, 617611 markings/sec, 35 secs
lola: 30957931 markings, 47032218 edges, 631038 markings/sec, 40 secs
lola: 34107126 markings, 51816560 edges, 629839 markings/sec, 45 secs
lola: 37215404 markings, 56538762 edges, 621656 markings/sec, 50 secs
lola: 40285180 markings, 61202444 edges, 613955 markings/sec, 55 secs
lola: 40689025 markings, 61815962 edges, 80769 markings/sec, 60 secs
lola: 41420726 markings, 62927658 edges, 146340 markings/sec, 65 secs
lola: 42622978 markings, 64754734 edges, 240450 markings/sec, 70 secs
lola: 43737827 markings, 66448422 edges, 222970 markings/sec, 75 secs
lola: 45277621 markings, 68787745 edges, 307959 markings/sec, 80 secs
lola: 45749152 markings, 69503487 edges, 94306 markings/sec, 85 secs
lola: 46223588 markings, 70224243 edges, 94887 markings/sec, 90 secs
lola: 46223588 markings, 70224243 edges, 0 markings/sec, 95 secs
lola: 46985422 markings, 71381656 edges, 152367 markings/sec, 100 secs
lola: 47055811 markings, 71488597 edges, 14078 markings/sec, 105 secs
lola: 47055811 markings, 71488597 edges, 0 markings/sec, 110 secs
lola: 47061965 markings, 71497935 edges, 1231 markings/sec, 115 secs
lola: 47793714 markings, 72609650 edges, 146350 markings/sec, 120 secs
lola: 48301505 markings, 73381088 edges, 101558 markings/sec, 125 secs
lola: 48301505 markings, 73381088 edges, 0 markings/sec, 130 secs
lola: 48301505 markings, 73381088 edges, 0 markings/sec, 135 secs
lola: 48348106 markings, 73451880 edges, 9320 markings/sec, 140 secs
lola: 49992124 markings, 75949554 edges, 328804 markings/sec, 145 secs
lola: 50376725 markings, 76533830 edges, 76920 markings/sec, 150 secs
lola: 50466451 markings, 76670144 edges, 17945 markings/sec, 155 secs
lola: 50466451 markings, 76670144 edges, 0 markings/sec, 160 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p65 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p65)
lola: processed formula length: 10
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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p65)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 28 markings, 27 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p80 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p80 <= 0)))
lola: processed formula length: 18
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: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 <= p80)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p68 + 1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p68 + 1 <= p52)))
lola: processed formula length: 24
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p52 <= p68)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p104 <= p33)))
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 ((p104 <= p33)))
lola: processed formula length: 21
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: (p33 + 1 <= p104)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p49 + 1 <= p58) OR ((2 <= p106) AND (p59 <= p65) AND (2 <= p66)))))
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 (((p49 + 1 <= p58) OR ((2 <= p106) AND (p59 <= p65) AND (2 <= p66)))))
lola: processed formula length: 76
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: ((p58 <= p49) AND ((p106 <= 1) OR (p65 + 1 <= p59) OR (p66 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p23 <= p29) AND (1 <= p30) AND (2 <= p95) AND ((p61 <= p65) OR (1 <= p111)))))
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 (((p23 <= p29) AND (1 <= p30) AND (2 <= p95) AND ((p61 <= p65) OR (1 <= p111)))))
lola: processed formula length: 87
lola: 18 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p23 <= p29) AND (1 <= p30) AND (2 <= p95) AND ((p61 <= p65) OR (1 <= p111)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p64) AND (p91 <= p78) AND (2 <= p25) AND (p109 <= p85)) U A (G ((p0 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((3 <= p64) AND (p91 <= p78) AND (2 <= p25) AND (p109 <= p85)) U AG((p0 <= p91)))
lola: processed formula length: 83
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: 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: 3944826 markings, 5993065 edges, 788965 markings/sec, 0 secs
lola: 7885065 markings, 11979196 edges, 788048 markings/sec, 5 secs
lola: 11772279 markings, 17884783 edges, 777443 markings/sec, 10 secs
lola: 15685605 markings, 23830008 edges, 782665 markings/sec, 15 secs
lola: 19558124 markings, 29713256 edges, 774504 markings/sec, 20 secs
lola: 23331166 markings, 35445394 edges, 754608 markings/sec, 25 secs
lola: 27019360 markings, 41048601 edges, 737639 markings/sec, 30 secs
lola: 30803778 markings, 46798010 edges, 756884 markings/sec, 35 secs
lola: 34621031 markings, 52597287 edges, 763451 markings/sec, 40 secs
lola: 38368811 markings, 58291041 edges, 749556 markings/sec, 45 secs
lola: 42127778 markings, 64001782 edges, 751793 markings/sec, 50 secs
lola: 45950793 markings, 69809813 edges, 764603 markings/sec, 55 secs
lola: 49672637 markings, 75464167 edges, 744369 markings/sec, 60 secs
lola: 53388978 markings, 81110153 edges, 743268 markings/sec, 65 secs
lola: 57054519 markings, 86678955 edges, 733108 markings/sec, 70 secs
lola: 60847350 markings, 92441127 edges, 758566 markings/sec, 75 secs
lola: 64250598 markings, 97611677 edges, 680650 markings/sec, 80 secs
lola: 64292865 markings, 97675649 edges, 8453 markings/sec, 85 secs
lola: 64292865 markings, 97675649 edges, 0 markings/sec, 90 secs
lola: 64292865 markings, 97675649 edges, 0 markings/sec, 95 secs
lola: 64292865 markings, 97675649 edges, 0 markings/sec, 100 secs
lola: 65697029 markings, 99809182 edges, 280833 markings/sec, 105 secs
lola: 67645118 markings, 102768497 edges, 389618 markings/sec, 110 secs
lola: 70283266 markings, 106776824 edges, 527630 markings/sec, 115 secs
lola: 73674459 markings, 111929002 edges, 678239 markings/sec, 120 secs
lola: 74922127 markings, 113823958 edges, 249534 markings/sec, 125 secs
lola: 74922127 markings, 113823958 edges, 0 markings/sec, 130 secs
lola: 74922127 markings, 113823958 edges, 0 markings/sec, 135 secs
lola: 76567809 markings, 116324137 edges, 329136 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p38 <= 1) AND (p92 <= 0)))) OR ((1 <= p53) OR (p118 + 1 <= p125)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p53) OR (p118 + 1 <= p125))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p53) OR (p118 + 1 <= p125))
lola: processed formula length: 34
lola: 18 rewrites
lola: closed formula file CTLCardinality.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: subprocess 11 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p38 <= 1) AND (p92 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p38 <= 1) AND (p92 <= 0))))
lola: processed formula length: 35
lola: 18 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p38 <= 1) AND (p92 <= 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
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p20))) AND ((p105 <= p77) OR ((p55 <= p67) AND (2 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p105 <= p77) OR ((p55 <= p67) AND (2 <= p91)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p105 <= p77) OR ((p55 <= p67) AND (2 <= p91)))
lola: processed formula length: 49
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 12 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p20)))
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 ((3 <= p20)))
lola: processed formula length: 18
lola: 18 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 69 markings, 68 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p37 <= 0) AND ((p7 <= p72) OR (1 <= p96))))) AND ((2 <= p87) OR (p35 <= p69)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p87) OR (p35 <= p69))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p87) OR (p35 <= p69))
lola: processed formula length: 29
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 13 will run for 1028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p37 <= 0) AND ((p7 <= p72) OR (1 <= p96)))))
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 (((p37 <= 0) AND ((p7 <= p72) OR (1 <= p96)))))
lola: processed formula length: 53
lola: 18 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p37 <= 0) AND ((p7 <= p72) OR (1 <= p96)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p100 <= p73) U (2 <= p70))) OR ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))
lola: processed formula length: 61
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p100 <= p73) U (2 <= p70)))
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 (((p100 <= p73) U (2 <= p70)))
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 /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: (2 <= p70)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || 3728679 markings, 5664676 edges, 745736 markings/sec, 0 secs
lola: sara is running 5 secs || 7450146 markings, 11318462 edges, 744293 markings/sec, 5 secs
lola: sara is running 10 secs || 11114199 markings, 16884986 edges, 732811 markings/sec, 10 secs
lola: sara is running 15 secs || 14690337 markings, 22317972 edges, 715228 markings/sec, 15 secs
lola: sara is running 20 secs || 18156920 markings, 27584517 edges, 693317 markings/sec, 20 secs
lola: sara is running 25 secs || 21582543 markings, 32788827 edges, 685125 markings/sec, 25 secs
lola: sara is running 30 secs || 24981588 markings, 37952765 edges, 679809 markings/sec, 30 secs
lola: sara is running 35 secs || 28359486 markings, 43084569 edges, 675580 markings/sec, 35 secs
lola: sara is running 40 secs || 31767768 markings, 48262551 edges, 681656 markings/sec, 40 secs
lola: sara is running 45 secs || 35180114 markings, 53446679 edges, 682469 markings/sec, 45 secs
lola: sara is running 50 secs || 38570962 markings, 58598158 edges, 678170 markings/sec, 50 secs
lola: sara is running 55 secs || 41958255 markings, 63744229 edges, 677459 markings/sec, 55 secs
lola: sara is running 60 secs || 45426387 markings, 69013121 edges, 693626 markings/sec, 60 secs
lola: sara is running 65 secs || 48786002 markings, 74117157 edges, 671923 markings/sec, 65 secs
lola: sara is running 70 secs || 52096473 markings, 79146521 edges, 662094 markings/sec, 70 secs
lola: sara is running 75 secs || 55426188 markings, 84205152 edges, 665943 markings/sec, 75 secs
lola: sara is running 80 secs || 58798433 markings, 89328359 edges, 674449 markings/sec, 80 secs
lola: sara is running 85 secs || 62203295 markings, 94501120 edges, 680972 markings/sec, 85 secs
lola: sara is running 90 secs || 65540810 markings, 99571572 edges, 667503 markings/sec, 90 secs
lola: sara is running 95 secs || 68903484 markings, 104680249 edges, 672535 markings/sec, 95 secs
lola: sara is running 100 secs || 72333035 markings, 109890528 edges, 685910 markings/sec, 100 secs
lola: sara is running 105 secs || 75744898 markings, 115073942 edges, 682373 markings/sec, 105 secs
lola: sara is running 110 secs || 79007461 markings, 120030540 edges, 652513 markings/sec, 110 secs
lola: sara is running 115 secs || 82062314 markings, 124671550 edges, 610971 markings/sec, 115 secs
lola: sara is running 120 secs || 84446026 markings, 128292969 edges, 476742 markings/sec, 120 secs
lola: sara is running 125 secs || 87636423 markings, 133139911 edges, 638079 markings/sec, 125 secs
lola: sara is running 130 secs || 90621623 markings, 137675130 edges, 597040 markings/sec, 130 secs
lola: sara is running 135 secs || 90772346 markings, 137904105 edges, 30145 markings/sec, 135 secs
lola: sara is running 140 secs || 91736343 markings, 139368635 edges, 192799 markings/sec, 140 secs
lola: sara is running 145 secs || 94793432 markings, 144013078 edges, 611418 markings/sec, 145 secs
lola: sara is running 150 secs || 97036263 markings, 147420437 edges, 448566 markings/sec, 150 secs
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: subprocess 14 will run for 1455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p1 <= 0) OR (p105 <= 0)))) AND ((2 <= p4) OR (p51 <= p21) OR (p128 <= p43)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p4) OR (p51 <= p21) OR (p128 <= p43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p4) OR (p51 <= p21) OR (p128 <= p43))
lola: processed formula length: 46
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 15 will run for 2911 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1 <= 0) OR (p105 <= 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 (((p1 <= 0) OR (p105 <= 0))))
lola: processed formula length: 35
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 <= p1) AND (1 <= p105))
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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2911 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((2 <= p104))) AND ((p66 <= p10) OR (p18 <= p45) OR (3 <= p66)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p104 <= 1)) OR ((p10 + 1 <= p66) AND (p45 + 1 <= p18) AND (p66 <= 2))))
lola: processed formula length: 79
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 119 markings, 153 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p63 + 1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p63 + 1 <= p25)))
lola: processed formula length: 24
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3323788 markings, 5049563 edges, 664758 markings/sec, 0 secs
lola: 6584577 markings, 10003456 edges, 652158 markings/sec, 5 secs
lola: 9847258 markings, 14960224 edges, 652536 markings/sec, 10 secs
lola: 13108852 markings, 19915335 edges, 652319 markings/sec, 15 secs
lola: 16424181 markings, 24952074 edges, 663066 markings/sec, 20 secs
lola: 19557542 markings, 29712381 edges, 626672 markings/sec, 25 secs
lola: 22675724 markings, 34449625 edges, 623636 markings/sec, 30 secs
lola: 25781144 markings, 39167469 edges, 621084 markings/sec, 35 secs
lola: 28865419 markings, 43853213 edges, 616855 markings/sec, 40 secs
lola: 32008564 markings, 48628373 edges, 628629 markings/sec, 45 secs
lola: 35161296 markings, 53418102 edges, 630546 markings/sec, 50 secs
lola: 38308011 markings, 58198674 edges, 629343 markings/sec, 55 secs
lola: 41320019 markings, 62775136 edges, 602402 markings/sec, 60 secs
lola: 41563374 markings, 63144328 edges, 48671 markings/sec, 65 secs
lola: 42742300 markings, 64935478 edges, 235785 markings/sec, 70 secs
lola: 44186558 markings, 67131294 edges, 288852 markings/sec, 75 secs
lola: 45859415 markings, 69675262 edges, 334571 markings/sec, 80 secs
lola: 48383356 markings, 73505497 edges, 504788 markings/sec, 85 secs
lola: 48479120 markings, 73650910 edges, 19153 markings/sec, 90 secs
lola: 48676713 markings, 73951118 edges, 39519 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p64) AND (p91 <= p78) AND (2 <= p25) AND (p109 <= p85)) U A (G ((p0 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((3 <= p64) AND (p91 <= p78) AND (2 <= p25) AND (p109 <= p85)) U AG((p0 <= p91)))
lola: processed formula length: 83
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: 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: 3761340 markings, 5714297 edges, 752268 markings/sec, 0 secs
lola: 7615904 markings, 11570272 edges, 770913 markings/sec, 5 secs
lola: 11444350 markings, 17386562 edges, 765689 markings/sec, 10 secs
lola: 15297129 markings, 23239825 edges, 770556 markings/sec, 15 secs
lola: 19011059 markings, 28882157 edges, 742786 markings/sec, 20 secs
lola: 22678235 markings, 34453437 edges, 733435 markings/sec, 25 secs
lola: 26310589 markings, 39971824 edges, 726471 markings/sec, 30 secs
lola: 29962238 markings, 45519530 edges, 730330 markings/sec, 35 secs
lola: 33605242 markings, 51054080 edges, 728601 markings/sec, 40 secs
lola: 37226808 markings, 56556078 edges, 724313 markings/sec, 45 secs
lola: 40877237 markings, 62101904 edges, 730086 markings/sec, 50 secs
lola: 44618285 markings, 67785421 edges, 748210 markings/sec, 55 secs
lola: 48289040 markings, 73362150 edges, 734151 markings/sec, 60 secs
lola: 51911415 markings, 78865372 edges, 724475 markings/sec, 65 secs
lola: 55488603 markings, 84299963 edges, 715438 markings/sec, 70 secs
lola: 59125385 markings, 89825064 edges, 727356 markings/sec, 75 secs
lola: 62736265 markings, 95311605 edges, 722176 markings/sec, 80 secs
lola: 65996118 markings, 100264158 edges, 651971 markings/sec, 85 secs
lola: 67285942 markings, 102222834 edges, 257965 markings/sec, 90 secs
lola: 67285942 markings, 102222834 edges, 0 markings/sec, 95 secs
lola: 67285942 markings, 102222834 edges, 0 markings/sec, 100 secs
lola: 69028236 markings, 104869770 edges, 348459 markings/sec, 105 secs
lola: 70603552 markings, 107263042 edges, 315063 markings/sec, 110 secs
lola: 70603552 markings, 107263042 edges, 0 markings/sec, 115 secs
lola: 72778016 markings, 110566556 edges, 434893 markings/sec, 120 secs
lola: 73748581 markings, 112041064 edges, 194113 markings/sec, 125 secs
lola: 73748581 markings, 112041064 edges, 0 markings/sec, 130 secs
lola: 73748581 markings, 112041064 edges, 0 markings/sec, 135 secs
lola: 74807050 markings, 113649132 edges, 211694 markings/sec, 140 secs
lola: 75830657 markings, 115204224 edges, 204721 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (((p100 <= p73) U (2 <= p70))) OR ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p27) AND ((p26 <= 0) OR ((2 <= p22) AND (p86 <= 0))))
lola: processed formula length: 61
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (((p100 <= p73) U (2 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: ========================================
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 (((p100 <= p73) U (2 <= p70)))
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 /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: (2 <= p70)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || 3566291 markings, 5417983 edges, 713258 markings/sec, 0 secs
lola: sara is running 5 secs || 7093094 markings, 10776012 edges, 705361 markings/sec, 5 secs
lola: sara is running 10 secs || 10595807 markings, 16097441 edges, 700543 markings/sec, 10 secs
lola: sara is running 15 secs || 14123559 markings, 21456904 edges, 705550 markings/sec, 15 secs
lola: sara is running 20 secs || 17663666 markings, 26835149 edges, 708021 markings/sec, 20 secs
lola: sara is running 25 secs || 21128417 markings, 32098909 edges, 692950 markings/sec, 25 secs
lola: sara is running 30 secs || 24562881 markings, 37316668 edges, 686893 markings/sec, 30 secs
lola: sara is running 35 secs || 27900489 markings, 42387254 edges, 667522 markings/sec, 35 secs
lola: sara is running 40 secs || 31373525 markings, 47663595 edges, 694607 markings/sec, 40 secs
lola: sara is running 45 secs || 34921834 markings, 53054296 edges, 709662 markings/sec, 45 secs
lola: sara is running 50 secs || 38395668 markings, 58331841 edges, 694767 markings/sec, 50 secs
lola: sara is running 55 secs || 41845511 markings, 63572947 edges, 689969 markings/sec, 55 secs
lola: sara is running 60 secs || 45318463 markings, 68849157 edges, 694590 markings/sec, 60 secs
lola: sara is running 65 secs || 48740498 markings, 74048032 edges, 684407 markings/sec, 65 secs
lola: sara is running 70 secs || 52116599 markings, 79177117 edges, 675220 markings/sec, 70 secs
lola: sara is running 75 secs || 55416058 markings, 84189748 edges, 659892 markings/sec, 75 secs
lola: sara is running 80 secs || 58733955 markings, 89230413 edges, 663579 markings/sec, 80 secs
lola: sara is running 85 secs || 62113142 markings, 94364152 edges, 675837 markings/sec, 85 secs
lola: sara is running 90 secs || 65480235 markings, 99479553 edges, 673419 markings/sec, 90 secs
lola: sara is running 95 secs || 68803980 markings, 104529079 edges, 664749 markings/sec, 95 secs
lola: sara is running 100 secs || 72170480 markings, 109643566 edges, 673300 markings/sec, 100 secs
lola: sara is running 105 secs || 75654952 markings, 114937285 edges, 696894 markings/sec, 105 secs
lola: sara is running 110 secs || 79045342 markings, 120088079 edges, 678078 markings/sec, 110 secs
lola: sara is running 115 secs || 79431201 markings, 120674283 edges, 77172 markings/sec, 115 secs
lola: sara is running 120 secs || 82544671 markings, 125404382 edges, 622694 markings/sec, 120 secs
lola: sara is running 125 secs || 84750297 markings, 128755234 edges, 441125 markings/sec, 125 secs
lola: sara is running 130 secs || 87750573 markings, 133313327 edges, 600055 markings/sec, 130 secs
lola: sara is running 135 secs || 89049040 markings, 135286014 edges, 259693 markings/sec, 135 secs
lola: sara is running 140 secs || 91135088 markings, 138455203 edges, 417210 markings/sec, 140 secs
lola: sara is running 145 secs || 94182739 markings, 143085267 edges, 609530 markings/sec, 145 secs
lola: sara is running 150 secs || 94313825 markings, 143284428 edges, 26217 markings/sec, 150 secs
lola: sara is running 155 secs || 94313825 markings, 143284428 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 96343479 markings, 146367924 edges, 405931 markings/sec, 160 secs
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: RESULT
lola:
SUMMARY: no yes no yes yes unknown no unknown no yes unknown no no yes no no
lola:
preliminary result: no yes no yes yes unknown no unknown no yes unknown no no yes no no
lola: memory consumption: 3536 KB
lola: time consumption: 1200 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="RefineWMG-PT-025026"
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 RefineWMG-PT-025026, 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 r186-oct2-158987938500091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025026.tgz
mv RefineWMG-PT-025026 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 ;