About the Execution of ITS-LoLa for SmallOperatingSystem-PT-MT0128DC0032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.480 | 3600000.00 | 1411699.00 | 2525.60 | TFTTFTTTTFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389400043.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 SmallOperatingSystem-PT-MT0128DC0032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389400043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.3K Apr 12 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 20:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 11 20:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591199087728
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:44:51] [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 15:44:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:44:51] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-06-03 15:44:51] [INFO ] Transformed 9 places.
[2020-06-03 15:44:51] [INFO ] Transformed 8 transitions.
[2020-06-03 15:44:51] [INFO ] Parsed PT model containing 9 places and 8 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Incomplete random walk after 100004 steps, including 0 resets, run finished after 117 ms. (steps per millisecond=854 ) properties seen :[0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 8 rows 9 cols
[2020-06-03 15:44:51] [INFO ] Computed 4 place invariants in 4 ms
[2020-06-03 15:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned unsat
[2020-06-03 15:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 37 ms returned unsat
[2020-06-03 15:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 40 ms returned unsat
[2020-06-03 15:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned unsat
[2020-06-03 15:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-06-03 15:44:51] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 15:44:52] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 15:44:52] [INFO ] Flatten gal took : 24 ms
[2020-06-03 15:44:52] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 15:44:52] [INFO ] Flatten gal took : 6 ms
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:44:52] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 15:44:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT0128DC0032 @ 3570 seconds
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0128DC0032-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2229
rslt: Output for CTLCardinality @ SmallOperatingSystem-PT-MT0128DC0032
{
"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 15:44:52 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p2 <= p5)))",
"processed_size": 18,
"rewrites": 10
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EX(AG((1 <= p6)))",
"processed_size": 17,
"rewrites": 11
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 234722,
"markings": 95617,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 ((2 <= p2)))",
"processed_size": 17,
"rewrites": 11
},
"result":
{
"edges": 31,
"markings": 32,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p2) AND (p6 <= p8) AND (1 <= p3))))",
"processed_size": 48,
"rewrites": 10
},
"result":
{
"edges": 263,
"markings": 264,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG(E((1 <= p2) U (p3 <= p4)))",
"processed_size": 29,
"rewrites": 11
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 1718428,
"markings": 411321,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "E ((((1 <= p5) OR (p7 <= 0)) U ((2 <= p3) AND ((p5 <= p4) OR (p5 <= p7)))))",
"processed_size": 77,
"rewrites": 12
},
"result":
{
"edges": 10896,
"markings": 3729,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 611
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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 ((((p8 + 1 <= p4)) R (p7 + 1 <= p2)))",
"processed_size": 39,
"rewrites": 14
},
"result":
{
"edges": 314309,
"markings": 120165,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"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 ((2 <= p1)))",
"processed_size": 17,
"rewrites": 11
},
"result":
{
"edges": 222,
"markings": 223,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1018
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1018
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p1 <= p8)))",
"processed_size": 18,
"rewrites": 10
},
"result":
{
"edges": 160,
"markings": 161,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1527
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p5 <= p7)))",
"processed_size": 18,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1527
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "E ((((p7 <= p2) AND (p3 <= p7) AND (3 <= p6) AND (1 <= p1)) U (p2 <= 2)))",
"processed_size": 73,
"rewrites": 12
},
"result":
{
"edges": 1206805,
"markings": 435982,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3054
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3054
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))",
"processed_size": 43,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF((AG((p8 <= p7)) AND ((p6 + 1 <= p4) OR ((1 <= p7) AND (1 <= p8)))))",
"processed_size": 71,
"rewrites": 11
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 1061464678,
"markings": 113321065,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))",
"processed_size": 43,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": "((p4 <= p3) AND ((p7 <= 1) OR (p2 + 1 <= p8)))",
"processed_size": 47,
"rewrites": 12
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21496,
"runtime": 1341.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((* R *)) : (E(F(**)) OR E(X(E(F(**))))) : (E(F(**)) AND E(F(**))) : (A(F(**)) OR A((** U **))) : E((** U **)) : E(F((A(G(**)) AND **))) : (A(G(**)) AND A(G(A(F(**))))) : E(X(A(G(**)))) : A(G(**)) : E(F(**)) : E((** U **)) : A(G(E((** U **))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no yes yes yes yes no no no no yes no no ",
"value": "no yes yes yes yes no no 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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: NOT(E ((((p4 <= p8)) U (p2 <= p7)))) : E (F ((E (F ((p2 <= p5))) OR E (X ((p2 <= p4)))))) : (E (F ((p5 <= p7))) AND E (F ((p1 <= p8)))) : (A (F (((p3 + 1 <= p4) OR ((2 <= p7) AND (p8 <= p2))))) OR A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))) : E ((((p7 <= p2) AND (p3 <= p7) AND (3 <= p6) AND (1 <= p1)) U (p2 <= 2))) : E (F ((A (G ((p8 <= p7))) AND ((p6 + 1 <= p4) OR ((1 <= p7) AND (1 <= p8)))))) : A (G ((E (G ((2 <= p1))) AND A (F ((p8 <= p6)))))) : E (X (A (G ((1 <= p6))))) : A (G ((2 <= p2))) : E (F (((1 <= p2) AND (p6 <= p8) AND (1 <= p3)))) : E ((((1 <= p5) OR (p7 <= 0)) U ((2 <= p3) AND ((p5 <= p4) OR (p5 <= p7))))) : A (G (E (((1 <= p2) U (p3 <= p4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p2 <= p5))) OR E (X (E (F ((p2 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p2 <= p5)))
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 ((p2 <= p5)))
lola: processed formula length: 18
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
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: (p2 <= p5)
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-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((1 <= p6)))
lola: processed formula length: 17
lola: 11 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).
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 95617 markings, 234722 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p2)))
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 ((2 <= p2)))
lola: processed formula length: 17
lola: 11 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: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2) AND (p6 <= p8) AND (1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p2) AND (p6 <= p8) AND (1 <= p3))))
lola: processed formula length: 48
lola: 10 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: ((1 <= p2) AND (p6 <= p8) AND (1 <= p3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 264 markings, 263 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((1 <= p2) U (p3 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((1 <= p2) U (p3 <= p4)))
lola: processed formula length: 29
lola: 11 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 411321 markings, 1718428 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p8 <= p7))) AND ((p6 + 1 <= p4) OR ((1 <= p7) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p8 <= p7)) AND ((p6 + 1 <= p4) OR ((1 <= p7) AND (1 <= p8)))))
lola: processed formula length: 71
lola: 11 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: 1764081 markings, 7742439 edges, 352816 markings/sec, 0 secs
lola: 3323944 markings, 14734906 edges, 311973 markings/sec, 5 secs
lola: 4779240 markings, 21348382 edges, 291059 markings/sec, 10 secs
lola: 6181000 markings, 27754802 edges, 280352 markings/sec, 15 secs
lola: 7622342 markings, 34340435 edges, 288268 markings/sec, 20 secs
lola: 9130171 markings, 41345835 edges, 301566 markings/sec, 25 secs
lola: 10606590 markings, 48141915 edges, 295284 markings/sec, 30 secs
lola: 12000405 markings, 54638812 edges, 278763 markings/sec, 35 secs
lola: 13389614 markings, 61142788 edges, 277842 markings/sec, 40 secs
lola: 14908319 markings, 68217899 edges, 303741 markings/sec, 45 secs
lola: 16424332 markings, 75315585 edges, 303203 markings/sec, 50 secs
lola: 17859706 markings, 82093223 edges, 287075 markings/sec, 55 secs
lola: 19394667 markings, 89302488 edges, 306992 markings/sec, 60 secs
lola: 20828553 markings, 96038789 edges, 286777 markings/sec, 65 secs
lola: 22249254 markings, 102718417 edges, 284140 markings/sec, 70 secs
lola: 23562185 markings, 108957932 edges, 262586 markings/sec, 75 secs
lola: 24940507 markings, 115459869 edges, 275664 markings/sec, 80 secs
lola: 26351713 markings, 122143699 edges, 282241 markings/sec, 85 secs
lola: 27725163 markings, 128703772 edges, 274690 markings/sec, 90 secs
lola: 29024807 markings, 134852915 edges, 259929 markings/sec, 95 secs
lola: 30347309 markings, 141102791 edges, 264500 markings/sec, 100 secs
lola: 31683551 markings, 147453306 edges, 267248 markings/sec, 105 secs
lola: 33038583 markings, 153894322 edges, 271006 markings/sec, 110 secs
lola: 34391392 markings, 160332863 edges, 270562 markings/sec, 115 secs
lola: 35657727 markings, 166379134 edges, 253267 markings/sec, 120 secs
lola: 37024030 markings, 172836385 edges, 273261 markings/sec, 125 secs
lola: 38474258 markings, 179718291 edges, 290046 markings/sec, 130 secs
lola: 39953385 markings, 186764512 edges, 295825 markings/sec, 135 secs
lola: 41409715 markings, 193732727 edges, 291266 markings/sec, 140 secs
lola: 42843718 markings, 200542709 edges, 286801 markings/sec, 145 secs
lola: 44171099 markings, 206907416 edges, 265476 markings/sec, 150 secs
lola: 45542161 markings, 213465806 edges, 274212 markings/sec, 155 secs
lola: 46934901 markings, 220059663 edges, 278548 markings/sec, 160 secs
lola: 48245638 markings, 226345805 edges, 262147 markings/sec, 165 secs
lola: 49521486 markings, 232499374 edges, 255170 markings/sec, 170 secs
lola: 50845057 markings, 238788077 edges, 264714 markings/sec, 175 secs
lola: 52179251 markings, 245172995 edges, 266839 markings/sec, 180 secs
lola: 53497304 markings, 251431407 edges, 263611 markings/sec, 185 secs
lola: 54808589 markings, 257733824 edges, 262257 markings/sec, 190 secs
lola: 56147848 markings, 264136531 edges, 267852 markings/sec, 195 secs
lola: 57485917 markings, 270504577 edges, 267614 markings/sec, 200 secs
lola: 58804974 markings, 276827027 edges, 263811 markings/sec, 205 secs
lola: 60101195 markings, 283081632 edges, 259244 markings/sec, 210 secs
lola: 61442230 markings, 289447224 edges, 268207 markings/sec, 215 secs
lola: 62818788 markings, 296027055 edges, 275312 markings/sec, 220 secs
lola: 63976315 markings, 301594204 edges, 231505 markings/sec, 225 secs
lola: 65403480 markings, 308400953 edges, 285433 markings/sec, 230 secs
lola: 66741406 markings, 314799010 edges, 267585 markings/sec, 235 secs
lola: 67918082 markings, 320446537 edges, 235335 markings/sec, 240 secs
lola: 69216571 markings, 326663732 edges, 259698 markings/sec, 245 secs
lola: 70562084 markings, 333126450 edges, 269103 markings/sec, 250 secs
lola: 71931087 markings, 339700182 edges, 273801 markings/sec, 255 secs
lola: 73227924 markings, 345880002 edges, 259367 markings/sec, 260 secs
lola: 74504716 markings, 352010844 edges, 255358 markings/sec, 265 secs
lola: 75780538 markings, 358102754 edges, 255164 markings/sec, 270 secs
lola: 77139097 markings, 364625041 edges, 271712 markings/sec, 275 secs
lola: 78537757 markings, 371365677 edges, 279732 markings/sec, 280 secs
lola: 79787414 markings, 377365899 edges, 249931 markings/sec, 285 secs
lola: 81029313 markings, 383303157 edges, 248380 markings/sec, 290 secs
lola: 82242552 markings, 389125694 edges, 242648 markings/sec, 295 secs
lola: 83317545 markings, 394275687 edges, 214999 markings/sec, 300 secs
lola: 84632068 markings, 400561683 edges, 262905 markings/sec, 305 secs
lola: 86054238 markings, 407439065 edges, 284434 markings/sec, 310 secs
lola: 87453794 markings, 414223069 edges, 279911 markings/sec, 315 secs
lola: 88920336 markings, 421318477 edges, 293308 markings/sec, 320 secs
lola: 90372097 markings, 428286346 edges, 290352 markings/sec, 325 secs
lola: 91836537 markings, 435370149 edges, 292888 markings/sec, 330 secs
lola: 93266461 markings, 442347695 edges, 285985 markings/sec, 335 secs
lola: 94667158 markings, 449099720 edges, 280139 markings/sec, 340 secs
lola: 95956949 markings, 455396938 edges, 257958 markings/sec, 345 secs
lola: 97290576 markings, 461903846 edges, 266725 markings/sec, 350 secs
lola: 98549684 markings, 468063872 edges, 251822 markings/sec, 355 secs
lola: 99851316 markings, 474402717 edges, 260326 markings/sec, 360 secs
lola: 101286028 markings, 481389034 edges, 286942 markings/sec, 365 secs
lola: 102759737 markings, 488546797 edges, 294742 markings/sec, 370 secs
lola: 104177815 markings, 495426189 edges, 283616 markings/sec, 375 secs
lola: 105589347 markings, 502327213 edges, 282306 markings/sec, 380 secs
lola: 107047464 markings, 509432691 edges, 291623 markings/sec, 385 secs
lola: 108464347 markings, 516241790 edges, 283377 markings/sec, 390 secs
lola: 109926761 markings, 523254748 edges, 292483 markings/sec, 395 secs
lola: 111428332 markings, 530400726 edges, 300314 markings/sec, 400 secs
lola: 112863279 markings, 537285787 edges, 286989 markings/sec, 405 secs
lola: 112899548 markings, 544082239 edges, 7254 markings/sec, 410 secs
lola: 112919369 markings, 549747604 edges, 3964 markings/sec, 415 secs
lola: 112938308 markings, 555155558 edges, 3788 markings/sec, 420 secs
lola: 112957346 markings, 561335455 edges, 3808 markings/sec, 425 secs
lola: 112980585 markings, 567466150 edges, 4648 markings/sec, 430 secs
lola: 113014253 markings, 573647779 edges, 6734 markings/sec, 435 secs
lola: 113059605 markings, 579805249 edges, 9070 markings/sec, 440 secs
lola: 113088729 markings, 585865797 edges, 5825 markings/sec, 445 secs
lola: 113117216 markings, 591790221 edges, 5697 markings/sec, 450 secs
lola: 113147015 markings, 597786729 edges, 5960 markings/sec, 455 secs
lola: 113191509 markings, 603558368 edges, 8899 markings/sec, 460 secs
lola: 113217591 markings, 609446122 edges, 5216 markings/sec, 465 secs
lola: 113251838 markings, 615456613 edges, 6849 markings/sec, 470 secs
lola: 113274741 markings, 621359223 edges, 4581 markings/sec, 475 secs
lola: 113286415 markings, 627035448 edges, 2335 markings/sec, 480 secs
lola: 113303942 markings, 633041136 edges, 3505 markings/sec, 485 secs
lola: 113312361 markings, 638990783 edges, 1684 markings/sec, 490 secs
lola: 113317944 markings, 644956761 edges, 1117 markings/sec, 495 secs
lola: 113320072 markings, 650900677 edges, 426 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown no no yes unknown no
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p5) OR (p7 <= 0)) U ((2 <= p3) AND ((p5 <= p4) OR (p5 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p5) OR (p7 <= 0)) U ((2 <= p3) AND ((p5 <= p4) OR (p5 <= p7)))))
lola: processed formula length: 77
lola: 12 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 <= p3) AND ((p5 <= p4) OR (p5 <= p7)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 3729 markings, 10896 edges
lola: ========================================
lola: subprocess 7 will run for 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p8 + 1 <= p4)) R (p7 + 1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p8 + 1 <= p4)) R (p7 + 1 <= p2)))
lola: processed formula length: 39
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= p7)
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 120165 markings, 314309 edges
lola: ========================================
lola: subprocess 8 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= p1))) AND A (G (A (F ((p8 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p1)))
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 ((2 <= p1)))
lola: processed formula length: 17
lola: 11 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: (p1 <= 1)
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-8-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: 223 markings, 222 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p5 <= p7))) AND E (F ((p1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 <= p8)))
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 ((p1 <= p8)))
lola: processed formula length: 18
lola: 10 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: (p1 <= p8)
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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 161 markings, 160 edges
lola: state equation 0: solution produced
lola: ========================================
lola: subprocess 10 will run for 1527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p5 <= p7)))
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 ((p5 <= p7)))
lola: processed formula length: 18
lola: 10 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: (p5 <= p7)
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-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 1527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p7 <= p2) AND (p3 <= p7) AND (3 <= p6) AND (1 <= p1)) U (p2 <= 2)))
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 ((((p7 <= p2) AND (p3 <= p7) AND (3 <= p6) AND (1 <= p1)) U (p2 <= 2)))
lola: processed formula length: 73
lola: 12 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: (p2 <= 2)
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-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 435982 markings, 1206805 edges
lola: ========================================
lola: subprocess 11 will run for 3054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p3 + 1 <= p4) OR ((2 <= p7) AND (p8 <= p2))))) OR A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))
lola: processed formula length: 43
lola: 14 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1 <= 1)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p8 <= p7))) AND ((p6 + 1 <= p4) OR ((1 <= p7) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p8 <= p7)) AND ((p6 + 1 <= p4) OR ((1 <= p7) AND (1 <= p8)))))
lola: processed formula length: 71
lola: 11 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: 1787840 markings, 7854010 edges, 357568 markings/sec, 0 secs
lola: 3562059 markings, 15812491 edges, 354844 markings/sec, 5 secs
lola: 5306958 markings, 23752345 edges, 348980 markings/sec, 10 secs
lola: 6922503 markings, 31146276 edges, 323109 markings/sec, 15 secs
lola: 8509100 markings, 38486275 edges, 317319 markings/sec, 20 secs
lola: 10161100 markings, 46079797 edges, 330400 markings/sec, 25 secs
lola: 11857700 markings, 53956567 edges, 339320 markings/sec, 30 secs
lola: 13544689 markings, 61847254 edges, 337398 markings/sec, 35 secs
lola: 15214158 markings, 69653925 edges, 333894 markings/sec, 40 secs
lola: 16811990 markings, 77172156 edges, 319566 markings/sec, 45 secs
lola: 18366431 markings, 84464378 edges, 310888 markings/sec, 50 secs
lola: 20011660 markings, 92198494 edges, 329046 markings/sec, 55 secs
lola: 21587065 markings, 99601658 edges, 315081 markings/sec, 60 secs
lola: 23194693 markings, 107238047 edges, 321526 markings/sec, 65 secs
lola: 24774141 markings, 114665646 edges, 315890 markings/sec, 70 secs
lola: 26354515 markings, 122157015 edges, 316075 markings/sec, 75 secs
lola: 27974544 markings, 129890323 edges, 324006 markings/sec, 80 secs
lola: 29533089 markings, 137230359 edges, 311709 markings/sec, 85 secs
lola: 31111583 markings, 144757446 edges, 315699 markings/sec, 90 secs
lola: 32645438 markings, 152020886 edges, 306771 markings/sec, 95 secs
lola: 34170377 markings, 159313647 edges, 304988 markings/sec, 100 secs
lola: 35743849 markings, 166788456 edges, 314694 markings/sec, 105 secs
lola: 37304281 markings, 174171391 edges, 312086 markings/sec, 110 secs
lola: 38832275 markings, 181420130 edges, 305599 markings/sec, 115 secs
lola: 40367405 markings, 188770496 edges, 307026 markings/sec, 120 secs
lola: 41892104 markings, 196033577 edges, 304940 markings/sec, 125 secs
lola: 43380020 markings, 203156135 edges, 297583 markings/sec, 130 secs
lola: 44936763 markings, 210557734 edges, 311349 markings/sec, 135 secs
lola: 46372629 markings, 217398077 edges, 287173 markings/sec, 140 secs
lola: 47830130 markings, 224336743 edges, 291500 markings/sec, 145 secs
lola: 49337857 markings, 231621422 edges, 301545 markings/sec, 150 secs
lola: 50856329 markings, 238843500 edges, 303694 markings/sec, 155 secs
lola: 52292640 markings, 245706164 edges, 287262 markings/sec, 160 secs
lola: 53782010 markings, 252787720 edges, 297874 markings/sec, 165 secs
lola: 55203353 markings, 259634796 edges, 284269 markings/sec, 170 secs
lola: 56675574 markings, 266643351 edges, 294444 markings/sec, 175 secs
lola: 58075127 markings, 273312926 edges, 279911 markings/sec, 180 secs
lola: 59520217 markings, 280262421 edges, 289018 markings/sec, 185 secs
lola: 61049704 markings, 287567614 edges, 305897 markings/sec, 190 secs
lola: 62571072 markings, 294825955 edges, 304274 markings/sec, 195 secs
lola: 64053449 markings, 301956379 edges, 296475 markings/sec, 200 secs
lola: 65521926 markings, 308966294 edges, 293695 markings/sec, 205 secs
lola: 66868671 markings, 315411482 edges, 269349 markings/sec, 210 secs
lola: 68186472 markings, 321725238 edges, 263560 markings/sec, 215 secs
lola: 69550774 markings, 328270203 edges, 272860 markings/sec, 220 secs
lola: 71049353 markings, 335481907 edges, 299716 markings/sec, 225 secs
lola: 72546485 markings, 342646687 edges, 299426 markings/sec, 230 secs
lola: 74063660 markings, 349881876 edges, 303435 markings/sec, 235 secs
lola: 75507362 markings, 356812744 edges, 288740 markings/sec, 240 secs
lola: 76954243 markings, 363731196 edges, 289376 markings/sec, 245 secs
lola: 78436925 markings, 370875873 edges, 296536 markings/sec, 250 secs
lola: 79944500 markings, 378141229 edges, 301515 markings/sec, 255 secs
lola: 81469405 markings, 385409966 edges, 304981 markings/sec, 260 secs
lola: 82949512 markings, 392508305 edges, 296021 markings/sec, 265 secs
lola: 84443886 markings, 399689095 edges, 298875 markings/sec, 270 secs
lola: 85984288 markings, 407091748 edges, 308080 markings/sec, 275 secs
lola: 87461481 markings, 414262306 edges, 295439 markings/sec, 280 secs
lola: 88985746 markings, 421634781 edges, 304853 markings/sec, 285 secs
lola: 90474889 markings, 428779264 edges, 297829 markings/sec, 290 secs
lola: 92002628 markings, 436173032 edges, 305548 markings/sec, 295 secs
lola: 93522897 markings, 443584692 edges, 304054 markings/sec, 300 secs
lola: 94952757 markings, 450500105 edges, 285972 markings/sec, 305 secs
lola: 96454867 markings, 457819016 edges, 300422 markings/sec, 310 secs
lola: 97902856 markings, 464938551 edges, 289598 markings/sec, 315 secs
lola: 99381285 markings, 472140735 edges, 295686 markings/sec, 320 secs
lola: 100814002 markings, 479084838 edges, 286543 markings/sec, 325 secs
lola: 102264225 markings, 486190897 edges, 290045 markings/sec, 330 secs
lola: 103744981 markings, 493294219 edges, 296151 markings/sec, 335 secs
lola: 105201222 markings, 500409767 edges, 291248 markings/sec, 340 secs
lola: 106646522 markings, 507494279 edges, 289060 markings/sec, 345 secs
lola: 108131248 markings, 514654515 edges, 296945 markings/sec, 350 secs
lola: 109614896 markings, 521762174 edges, 296730 markings/sec, 355 secs
lola: 111087569 markings, 528802980 edges, 294535 markings/sec, 360 secs
lola: 112650106 markings, 536211219 edges, 312507 markings/sec, 365 secs
lola: 112898066 markings, 543572693 edges, 49592 markings/sec, 370 secs
lola: 112919903 markings, 549938815 edges, 4367 markings/sec, 375 secs
lola: 112940020 markings, 556360805 edges, 4023 markings/sec, 380 secs
lola: 112965301 markings, 562274136 edges, 5056 markings/sec, 385 secs
lola: 112980943 markings, 568372507 edges, 3128 markings/sec, 390 secs
lola: 113015632 markings, 574171287 edges, 6938 markings/sec, 395 secs
lola: 113059605 markings, 580254216 edges, 8795 markings/sec, 400 secs
lola: 113088729 markings, 585985671 edges, 5825 markings/sec, 405 secs
lola: 113116610 markings, 591491393 edges, 5576 markings/sec, 410 secs
lola: 113146832 markings, 597455774 edges, 6044 markings/sec, 415 secs
lola: 113191508 markings, 603513178 edges, 8935 markings/sec, 420 secs
lola: 113214240 markings, 609236157 edges, 4546 markings/sec, 425 secs
lola: 113251838 markings, 615060709 edges, 7520 markings/sec, 430 secs
lola: 113274741 markings, 620821336 edges, 4581 markings/sec, 435 secs
lola: 113286415 markings, 626688731 edges, 2335 markings/sec, 440 secs
lola: 113299663 markings, 632417895 edges, 2650 markings/sec, 445 secs
lola: 113311877 markings, 638140481 edges, 2443 markings/sec, 450 secs
lola: 113317944 markings, 643969479 edges, 1213 markings/sec, 455 secs
lola: 113319830 markings, 650052715 edges, 377 markings/sec, 460 secs
lola: 113321002 markings, 656054033 edges, 234 markings/sec, 465 secs
lola: 113321065 markings, 661883892 edges, 13 markings/sec, 470 secs
lola: 113321065 markings, 667910116 edges, 0 markings/sec, 475 secs
lola: 113321065 markings, 673620649 edges, 0 markings/sec, 480 secs
lola: 113321065 markings, 679218471 edges, 0 markings/sec, 485 secs
lola: 113321065 markings, 684926926 edges, 0 markings/sec, 490 secs
lola: 113321065 markings, 690824516 edges, 0 markings/sec, 495 secs
lola: 113321065 markings, 696448840 edges, 0 markings/sec, 500 secs
lola: 113321065 markings, 701833008 edges, 0 markings/sec, 505 secs
lola: 113321065 markings, 707413542 edges, 0 markings/sec, 510 secs
lola: 113321065 markings, 713019442 edges, 0 markings/sec, 515 secs
lola: 113321065 markings, 718298926 edges, 0 markings/sec, 520 secs
lola: 113321065 markings, 723898983 edges, 0 markings/sec, 525 secs
lola: 113321065 markings, 729528092 edges, 0 markings/sec, 530 secs
lola: 113321065 markings, 735258507 edges, 0 markings/sec, 535 secs
lola: 113321065 markings, 740609701 edges, 0 markings/sec, 540 secs
lola: 113321065 markings, 746374763 edges, 0 markings/sec, 545 secs
lola: 113321065 markings, 751949338 edges, 0 markings/sec, 550 secs
lola: 113321065 markings, 757627246 edges, 0 markings/sec, 555 secs
lola: 113321065 markings, 763306539 edges, 0 markings/sec, 560 secs
lola: 113321065 markings, 768855281 edges, 0 markings/sec, 565 secs
lola: 113321065 markings, 773412686 edges, 0 markings/sec, 570 secs
lola: 113321065 markings, 778825309 edges, 0 markings/sec, 575 secs
lola: 113321065 markings, 784186814 edges, 0 markings/sec, 580 secs
lola: 113321065 markings, 789759688 edges, 0 markings/sec, 585 secs
lola: 113321065 markings, 794828672 edges, 0 markings/sec, 590 secs
lola: 113321065 markings, 800271469 edges, 0 markings/sec, 595 secs
lola: 113321065 markings, 805766725 edges, 0 markings/sec, 600 secs
lola: 113321065 markings, 811348744 edges, 0 markings/sec, 605 secs
lola: 113321065 markings, 817100198 edges, 0 markings/sec, 610 secs
lola: 113321065 markings, 822524911 edges, 0 markings/sec, 615 secs
lola: 113321065 markings, 827774314 edges, 0 markings/sec, 620 secs
lola: 113321065 markings, 833514435 edges, 0 markings/sec, 625 secs
lola: 113321065 markings, 839116112 edges, 0 markings/sec, 630 secs
lola: 113321065 markings, 844989073 edges, 0 markings/sec, 635 secs
lola: 113321065 markings, 850974233 edges, 0 markings/sec, 640 secs
lola: 113321065 markings, 853855669 edges, 0 markings/sec, 645 secs
lola: 113321065 markings, 859721167 edges, 0 markings/sec, 650 secs
lola: 113321065 markings, 866013901 edges, 0 markings/sec, 655 secs
lola: 113321065 markings, 872111416 edges, 0 markings/sec, 660 secs
lola: 113321065 markings, 878237986 edges, 0 markings/sec, 665 secs
lola: 113321065 markings, 884098854 edges, 0 markings/sec, 670 secs
lola: 113321065 markings, 890134117 edges, 0 markings/sec, 675 secs
lola: 113321065 markings, 894606467 edges, 0 markings/sec, 680 secs
lola: 113321065 markings, 900534083 edges, 0 markings/sec, 685 secs
lola: 113321065 markings, 906591287 edges, 0 markings/sec, 690 secs
lola: 113321065 markings, 912630997 edges, 0 markings/sec, 695 secs
lola: 113321065 markings, 918608559 edges, 0 markings/sec, 700 secs
lola: 113321065 markings, 924685545 edges, 0 markings/sec, 705 secs
lola: 113321065 markings, 930175254 edges, 0 markings/sec, 710 secs
lola: 113321065 markings, 933240687 edges, 0 markings/sec, 715 secs
lola: 113321065 markings, 937356471 edges, 0 markings/sec, 720 secs
lola: 113321065 markings, 943850593 edges, 0 markings/sec, 725 secs
lola: 113321065 markings, 949277095 edges, 0 markings/sec, 730 secs
lola: 113321065 markings, 954040200 edges, 0 markings/sec, 735 secs
lola: 113321065 markings, 960394665 edges, 0 markings/sec, 740 secs
lola: 113321065 markings, 965289517 edges, 0 markings/sec, 745 secs
lola: 113321065 markings, 971659038 edges, 0 markings/sec, 750 secs
lola: 113321065 markings, 978048509 edges, 0 markings/sec, 755 secs
lola: 113321065 markings, 982735535 edges, 0 markings/sec, 760 secs
lola: 113321065 markings, 989346357 edges, 0 markings/sec, 765 secs
lola: 113321065 markings, 994518759 edges, 0 markings/sec, 770 secs
lola: 113321065 markings, 1001031479 edges, 0 markings/sec, 775 secs
lola: 113321065 markings, 1007652954 edges, 0 markings/sec, 780 secs
lola: 113321065 markings, 1012433963 edges, 0 markings/sec, 785 secs
lola: 113321065 markings, 1019259875 edges, 0 markings/sec, 790 secs
lola: 113321065 markings, 1026095035 edges, 0 markings/sec, 795 secs
lola: 113321065 markings, 1033052780 edges, 0 markings/sec, 800 secs
lola: 113321065 markings, 1040375384 edges, 0 markings/sec, 805 secs
lola: 113321065 markings, 1047920950 edges, 0 markings/sec, 810 secs
lola: 113321065 markings, 1055804902 edges, 0 markings/sec, 815 secs
lola: 113321065 markings, 1061464678 edges, 0 markings/sec, 820 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 113321065 markings, 1061464678 edges
lola: ========================================
lola: ...considering subproblem: (A (F (((p3 + 1 <= p4) OR ((2 <= p7) AND (p8 <= p2))))) OR A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p1 <= 1) U ((2 <= p8) OR (2 <= p5))))
lola: processed formula length: 43
lola: 14 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1 <= 1)
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-13-0.sara
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p3 + 1 <= p4) OR ((2 <= p7) AND (p8 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= p3) AND ((p7 <= 1) OR (p2 + 1 <= p8)))
lola: processed formula length: 47
lola: 12 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 + 1 <= p4) OR ((2 <= p7) AND (p8 <= p2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 33 markings, 32 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no no no yes no no
lola:
preliminary result: no yes yes yes yes no no no no yes no no
lola: ========================================
lola: memory consumption: 21496 KB
lola: time consumption: 1341 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="SmallOperatingSystem-PT-MT0128DC0032"
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 SmallOperatingSystem-PT-MT0128DC0032, 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 r194-csrt-159033389400043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0128DC0032.tgz
mv SmallOperatingSystem-PT-MT0128DC0032 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 ;