About the Execution of ITS-LoLa for PolyORBLF-PT-S06J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15747.550 | 3600000.00 | 255868.00 | 110.80 | TTFFTTTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872000515.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-PT-S06J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000515
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 15K Apr 12 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 12 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 11 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 10 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 10 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 339K Apr 9 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 9 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 15M Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591160207886
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:56:49] [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 04:56:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:56:49] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2020-06-03 04:56:49] [INFO ] Transformed 632 places.
[2020-06-03 04:56:49] [INFO ] Transformed 10500 transitions.
[2020-06-03 04:56:49] [INFO ] Parsed PT model containing 632 places and 10500 transitions in 494 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 89 ms.
Incomplete random walk after 100000 steps, including 613 resets, run finished after 1064 ms. (steps per millisecond=93 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0]
[2020-06-03 04:56:51] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2020-06-03 04:56:51] [INFO ] Computed 54 place invariants in 213 ms
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 22 ms returned unsat
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 17 ms returned unsat
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 27 ms returned unsat
[2020-06-03 04:56:51] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 55 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 35 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 29 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 14 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 35 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 40 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 21 ms returned unsat
[2020-06-03 04:56:52] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-06-03 04:56:53] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 67 ms returned unsat
[2020-06-03 04:56:53] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2020-06-03 04:56:53] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 37 ms returned unsat
[2020-06-03 04:56:53] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2020-06-03 04:56:53] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 22 ms returned unsat
[2020-06-03 04:56:53] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 17 simplifications.
[2020-06-03 04:56:53] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 04:56:53] [INFO ] Flatten gal took : 341 ms
[2020-06-03 04:56:54] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 04:56:54] [INFO ] Flatten gal took : 177 ms
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:56:54] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 04:56:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 38 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-PT-S06J04T06 @ 3570 seconds
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3344
rslt: Output for CTLCardinality @ PolyORBLF-PT-S06J04T06
{
"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 04:56:54 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 419
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AF(EX((p336 <= p468)))",
"processed_size": 22,
"rewrites": 6
},
"net":
{
"conflict_clusters": 233,
"singleton_clusters": 0
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 479
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 479
},
"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": "(p108 <= p110)",
"processed_size": 14,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 559
},
"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 ((p274 <= p552)))",
"processed_size": 22,
"rewrites": 6
},
"result":
{
"edges": 322309,
"markings": 170362,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 557
},
"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": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "E (F (((p585 <= p149 + p252 + p72 + p310 + p587 + p73) AND (1 <= p128 + p209 + p263 + p323 + p505) AND (p284 <= p115 + p134 + p162 + p178 + p179 + p201 + p215 + p224 + p244 + p254 + p76 + p320 + p322 + p332 + p333 + p360 + p373 + p401 + p411 + p413 + p428 + p446 + p452 + p463 + p493 + p508 + p543 + p547 + p559 + p595 + p55 + p608 + p612 + p42 + p62 + p86))))",
"processed_size": 360,
"rewrites": 5
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"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": 669
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p339 + 1 <= p336)",
"processed_size": 18,
"rewrites": 7
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 77
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 836
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"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": "((p395 <= 0) OR ((p230 + 1 <= p97) AND (p528 <= 2) AND (p108 <= 0) AND (p578 <= 1)))",
"processed_size": 85,
"rewrites": 7
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 25
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1115
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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 (((p86 <= p612) U (p296 + 1 <= p457)))",
"processed_size": 40,
"rewrites": 9
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1672
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1672
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(p199 + p287 + p417 + p31 + p497 + p74 <= 1)",
"processed_size": 44,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3345
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EG(AF((p151 + p220 + p294 + p69 + p567 + p583 <= p233 + p290 + p394 + p451 + p75 + p97)))",
"processed_size": 89,
"rewrites": 6
},
"net":
{
"conflict_clusters": 233,
"singleton_clusters": 0
},
"result":
{
"edges": 525,
"markings": 263,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3345
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3345
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p140 + p168 + p273 + p407 + p432)))",
"processed_size": 47,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p140 + p168 + p273 + p407 + p432)))",
"processed_size": 47,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12)))",
"processed_size": 83,
"rewrites": 5
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 96004,
"runtime": 225.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : (E(G(A(F(**)))) AND **) : (E(G(**)) OR (A(G(**)) AND A(F(E(G(**)))))) : A((** U **)) : A(F(**)) : A(F(E(X(**)))) : A(F(**)) : (A(X(**)) AND (A(G(**)) AND (A(F(**)) OR **)))"
},
"net":
{
"arcs": 14880,
"conflict_clusters": 233,
"places": 632,
"places_significant": 578,
"singleton_clusters": 0,
"transitions": 2430
},
"result":
{
"preliminary_value": "yes yes yes no no no no no ",
"value": "yes yes yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3062/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 20224
lola: finding significant places
lola: 632 places, 2430 transitions, 578 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: E (F (((p585 <= p149 + p252 + p72 + p310 + p587 + p73) AND (1 <= p128 + p209 + p263 + p323 + p505) AND (p284 <= p115 + p134 + p162 + p178 + p179 + p201 + p215 + p224 + p244 + p254 + p76 + p320 + p322 + p332 + p333 + p360 + p373 + p401 + p411 + p413 + p428 + p446 + p452 + p463 + p493 + p508 + p543 + p547 + p559 + p595 + p55 + p608 + p612 + p42 + p62 + p86)))) : (E (G (A (F ((p151 + p220 + p294 + p69 + p567 + p583 <= p233 + p290 + p394 + p451 + p75 + p97))))) AND E (((1 <= 0) U (p199 + p287 + p417 + p31 + p497 + p74 <= 1)))) : A ((A (G ((2 <= p140 + p168 + p273 + p407 + p432))) U E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12))))) : A (((p86 <= p612) U (p296 + 1 <= p457))) : A (F (((1 <= p395) AND ((p97 <= p230) OR (3 <= p528) OR (1 <= p108) OR (2 <= p578))))) : A (F (E (X ((p336 <= p468))))) : A (F ((p336 <= p339))) : ((A (X (((p246 <= p575) AND (p187 <= p532)))) AND A (G ((p274 <= p552)))) AND (A (F ((p354 <= p153))) OR (p108 <= p110)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p336 <= p468)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX((p336 <= p468)))
lola: processed formula length: 22
lola: 6 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p246 <= p575) AND (p187 <= p532)))) AND (A (G ((p274 <= p552))) AND (A (F ((p354 <= p153))) OR (p108 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p108 <= p110)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p108 <= p110)
lola: processed formula length: 14
lola: 4 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 2 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p274 <= p552)))
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 ((p274 <= p552)))
lola: processed formula length: 22
lola: 6 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: (p552 + 1 <= p274)
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 71177 markings, 141271 edges, 14235 markings/sec, 0 secs
lola: sara is running 5 secs || 143846 markings, 286350 edges, 14534 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 170362 markings, 322309 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p585 <= p149 + p252 + p72 + p310 + p587 + p73) AND (1 <= p128 + p209 + p263 + p323 + p505) AND (p284 <= p115 + p134 + p162 + p178 + p179 + p201 + p215 + p224 + p244 + p254 + p76 + p320 + p322 + p332 + p333 + p360 + p373 + p401 + p411 + p413 + p428 + p446 + p452 + p463 + p493 + p508 + p543 + p547 + p559 + p595 + p55 + p608 + p612 + p42 + p62 + p86))))
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 (((p585 <= p149 + p252 + p72 + p310 + p587 + p73) AND (1 <= p128 + p209 + p263 + p323 + p505) AND (p284 <= p115 + p134 + p162 + p178 + p179 + p201 + p215 + p224 + p244 + p254 + p76 + p320 + p322 + p332 + p333 + p360 + p373 + p401 + p411 + p413 + p428 + p446 + p452 + p463 + p493 + p508 + p543 + p547 + p559 + p595 + p55 + p608 + p612 + p42 + p62 + p86))))
lola: processed formula length: 360
lola: 5 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: ((p585 <= p149 + p252 + p72 + p310 + p587 + p73) AND (1 <= p128 + p209 + p263 + p323 + p505) AND (p284 <= p115 + p134 + p162 + p178 + p179 + p201 + p215 + p224 + p244 + p254 + p76 + p320 + p322 + p332 + p333 + p360 + p373 + p401 + p411 + p413 + p428 + p446 + p452 + p463 + p493 + p508 + p543 + p547 + p559 + p595 + p55 + p608 + p612 + p42 + p62 + p86))
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: 18 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p336 <= p339)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p339 + 1 <= p336)
lola: processed formula length: 18
lola: 7 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: (p336 <= p339)
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 / EG
lola: The predicate does not eventually occur.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 4 will run for 836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p395) AND ((p97 <= p230) OR (3 <= p528) OR (1 <= p108) OR (2 <= p578)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p395 <= 0) OR ((p230 + 1 <= p97) AND (p528 <= 2) AND (p108 <= 0) AND (p578 <= 1)))
lola: processed formula length: 85
lola: 7 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: ((1 <= p395) AND ((p97 <= p230) OR (3 <= p528) OR (1 <= p108) OR (2 <= p578)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 5 will run for 1115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p86 <= p612) U (p296 + 1 <= p457)))
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 (((p86 <= p612) U (p296 + 1 <= p457)))
lola: processed formula length: 40
lola: 9 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: (p86 <= p612)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: 36 markings, 35 edges
lola: ========================================
lola: subprocess 6 will run for 1672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((p151 + p220 + p294 + p69 + p567 + p583 <= p233 + p290 + p394 + p451 + p75 + p97))))) AND (p199 + p287 + p417 + p31 + p497 + p74 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p199 + p287 + p417 + p31 + p497 + p74 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p199 + p287 + p417 + p31 + p497 + p74 <= 1)
lola: processed formula length: 44
lola: 4 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 7 will run for 3345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p151 + p220 + p294 + p69 + p567 + p583 <= p233 + p290 + p394 + p451 + p75 + p97)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((p151 + p220 + p294 + p69 + p567 + p583 <= p233 + p290 + p394 + p451 + p75 + p97)))
lola: processed formula length: 89
lola: 6 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 263 markings, 525 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 3345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12))) OR (A (G ((2 <= p140 + p168 + p273 + p407 + p432))) AND A (F (E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p140 + p168 + p273 + p407 + p432)))
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 <= p140 + p168 + p273 + p407 + p432)))
lola: processed formula length: 47
lola: 6 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: (p140 + p168 + p273 + p407 + p432 <= 1)
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: 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 (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12))) OR (A (G ((2 <= p140 + p168 + p273 + p407 + p432))) AND A (F (E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p140 + p168 + p273 + p407 + p432)))
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 <= p140 + p168 + p273 + p407 + p432)))
lola: processed formula length: 47
lola: 6 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
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: (p140 + p168 + p273 + p407 + p432 <= 1)
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p140 + p168 + p273 + p407 + p432 <= p166 + p527 + p58 + p610 + p615 + p12)))
lola: processed formula length: 83
lola: 5 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p166 + p527 + p58 + p610 + p615 + p12 + 1 <= p140 + p168 + p273 + p407 + p432)
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 / EG
lola: The predicate is possibly preserved.
lola: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no
lola:
preliminary result: yes yes yes no no no no no
lola: memory consumption: 96004 KB
lola: time consumption: 225 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="PolyORBLF-PT-S06J04T06"
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 PolyORBLF-PT-S06J04T06, 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 r176-tajo-158987872000515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 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 ;