About the Execution of ITS-LoLa for SmartHome-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15717.810 | 3600000.00 | 677289.00 | 602.30 | T?FFTFFF?TFFFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r228-oct2-159033547100059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SmartHome-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547100059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.1K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.0K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 64K May 12 20:42 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 SmartHome-PT-08-CTLCardinality-00
FORMULA_NAME SmartHome-PT-08-CTLCardinality-01
FORMULA_NAME SmartHome-PT-08-CTLCardinality-02
FORMULA_NAME SmartHome-PT-08-CTLCardinality-03
FORMULA_NAME SmartHome-PT-08-CTLCardinality-04
FORMULA_NAME SmartHome-PT-08-CTLCardinality-05
FORMULA_NAME SmartHome-PT-08-CTLCardinality-06
FORMULA_NAME SmartHome-PT-08-CTLCardinality-07
FORMULA_NAME SmartHome-PT-08-CTLCardinality-08
FORMULA_NAME SmartHome-PT-08-CTLCardinality-09
FORMULA_NAME SmartHome-PT-08-CTLCardinality-10
FORMULA_NAME SmartHome-PT-08-CTLCardinality-11
FORMULA_NAME SmartHome-PT-08-CTLCardinality-12
FORMULA_NAME SmartHome-PT-08-CTLCardinality-13
FORMULA_NAME SmartHome-PT-08-CTLCardinality-14
FORMULA_NAME SmartHome-PT-08-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591288233683
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:30:36] [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-04 16:30:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:30:36] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2020-06-04 16:30:36] [INFO ] Transformed 252 places.
[2020-06-04 16:30:36] [INFO ] Transformed 291 transitions.
[2020-06-04 16:30:36] [INFO ] Found NUPN structural information;
[2020-06-04 16:30:36] [INFO ] Parsed PT model containing 252 places and 291 transitions in 220 ms.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 21 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 69 ms.
Incomplete random walk after 100000 steps, including 575 resets, run finished after 323 ms. (steps per millisecond=309 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 270 rows 232 cols
[2020-06-04 16:30:37] [INFO ] Computed 11 place invariants in 22 ms
[2020-06-04 16:30:37] [INFO ] [Real]Absence check using 11 positive place invariants in 57 ms returned sat
[2020-06-04 16:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:38] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-06-04 16:30:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-06-04 16:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:38] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-04 16:30:39] [INFO ] Deduced a trap composed of 35 places in 1010 ms
[2020-06-04 16:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1040 ms
[2020-06-04 16:30:39] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 37 ms.
[2020-06-04 16:30:40] [INFO ] Added : 266 causal constraints over 54 iterations in 1316 ms. Result :sat
[2020-06-04 16:30:41] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-04 16:30:41] [INFO ] Flatten gal took : 55 ms
[2020-06-04 16:30:41] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-04 16:30:41] [INFO ] Flatten gal took : 28 ms
FORMULA SmartHome-PT-08-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 16:30:41] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-04 16:30:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmartHome-PT-08 @ 3570 seconds
FORMULA SmartHome-PT-08-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ SmartHome-PT-08
{
"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": "Thu Jun 4 16:30:41 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX((((1 <= p169)) AND ((p138 <= 0)))))",
"processed_size": 41,
"rewrites": 14
},
"net":
{
"conflict_clusters": 205,
"singleton_clusters": 0
},
"result":
{
"edges": 720,
"markings": 555,
"produced_by": "CTL model checker",
"value": true
},
"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": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((((p174 <= 0)) OR ((1 <= p153))))",
"processed_size": 37,
"rewrites": 13
},
"net":
{
"conflict_clusters": 205,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p202)) AND ((p131 <= 0)))",
"processed_size": 33,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p33 <= 0)) OR ((1 <= p173)))))",
"processed_size": 40,
"rewrites": 14
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p158))))",
"processed_size": 21,
"rewrites": 13
},
"result":
{
"edges": 14,
"markings": 15,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p143 <= 0)) OR ((1 <= p33)))))",
"processed_size": 40,
"rewrites": 14
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p160))",
"processed_size": 13,
"rewrites": 15
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p134))",
"processed_size": 13,
"rewrites": 16
},
"result":
{
"edges": 1586,
"markings": 908,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 743
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 743
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p190 <= 0)) OR ((1 <= p221)))))",
"processed_size": 41,
"rewrites": 14
},
"result":
{
"edges": 13,
"markings": 14,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((p27 <= 0))))",
"processed_size": 20,
"rewrites": 14
},
"result":
{
"edges": 14,
"markings": 15,
"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": 1486
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p27))))",
"processed_size": 20,
"rewrites": 13
},
"result":
{
"edges": 14,
"markings": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 29536,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(X(**)))) : E(F(A(G(*)))) : E(F(E(G(**)))) : A(G(**)) : (A(F(**)) AND (E(G(**)) OR A(G(*)))) : (A(G(**)) AND A(G(**))) : (A(G(**)) AND (A(F(**)) AND (E(X(**)) OR (** OR E(X(**)))))) : (A(G(**)) AND A(G(E(F(**))))) : (E(F(**)) OR E(F(A(G(**))))) : A(F(A(G(**)))) : E(F(**))"
},
"net":
{
"arcs": 622,
"conflict_clusters": 205,
"places": 232,
"places_significant": 221,
"singleton_clusters": 0,
"transitions": 270
},
"result":
{
"interim_value": "yes unknown yes no unknown no no no yes no yes ",
"preliminary_value": "yes unknown yes no unknown no no no yes no yes "
},
"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: 502/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7424
lola: finding significant places
lola: 232 places, 270 transitions, 221 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: E (F (A (X ((((1 <= p169)) AND ((p138 <= 0))))))) : E (F (NOT(E (F ((((p23 <= 0)) OR ((1 <= p109)))))))) : E (F (E (G (((1 <= p160)))))) : A (G ((((p143 <= 0)) OR ((1 <= p33))))) : (A (F ((((1 <= p164)) OR ((p17 <= 0)) OR ((1 <= p62))))) AND (E (G ((((1 <= p229)) AND ((p155 <= 0))))) OR NOT(E (F (((1 <= p103))))))) : A (G ((A (G ((((p190 <= 0)) OR ((1 <= p221))))) AND (((p201 <= 0)) OR ((1 <= p64)) OR (p102 <= 0))))) : ((A (G ((((p33 <= 0)) OR ((1 <= p173))))) AND A (F ((((p202 <= 0)) OR ((1 <= p131)))))) AND ((E (X ((((p174 <= 0)) OR ((1 <= p153))))) OR ((p124 <= 0))) OR E (X ((((p90 <= 0)) OR ((1 <= p27))))))) : A (G ((((p27 <= 0)) AND E (F ((((p55 <= 0)) OR ((1 <= p104)))))))) : E (F ((((1 <= p27)) OR A (G ((((p202 <= 0)) OR ((1 <= p190)))))))) : A (F (A (G (((p134 <= 0)))))) : E (F (((1 <= p158))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((1 <= p169)) AND ((p138 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((1 <= p169)) AND ((p138 <= 0)))))
lola: processed formula length: 41
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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 555 markings, 720 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p33 <= 0)) OR ((1 <= p173))))) AND (A (F ((((p202 <= 0)) OR ((1 <= p131))))) AND (E (X ((((p174 <= 0)) OR ((1 <= p153))))) OR (((p124 <= 0)) OR E (X ((((p90 <= 0)) OR ((1 <= p27)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p174 <= 0)) OR ((1 <= p153)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p174 <= 0)) OR ((1 <= p153))))
lola: processed formula length: 37
lola: 13 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p202 <= 0)) OR ((1 <= p131)))))
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: (((1 <= p202)) AND ((p131 <= 0)))
lola: processed formula length: 33
lola: 15 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate eventually occurs.
lola: formula 0: (((p202 <= 0)) OR ((1 <= p131)))
lola: state equation task get result unparse finished id 0
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p33 <= 0)) OR ((1 <= p173)))))
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 ((((p33 <= 0)) OR ((1 <= p173)))))
lola: processed formula length: 40
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p33)) AND ((p173 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p158))))
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 <= p158))))
lola: processed formula length: 21
lola: 13 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 <= p158))
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
sara: try reading problem file CTLCardinality-3-0.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p143 <= 0)) OR ((1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p143 <= 0)) OR ((1 <= p33)))))
lola: processed formula length: 40
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p143)) AND ((p33 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p160))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p160))
lola: processed formula length: 13
lola: 15 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
sara: try reading problem file CTLCardinality-3-0.sara.
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: ((p160 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p160))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 45 markings, 45 edges
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: write sara problem file to CTLCardinality-4-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-1.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p23)) AND ((p109 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p23 <= 0)) OR ((1 <= p109)))
lola: processed formula length: 32
lola: 16 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p23)) AND ((p109 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: lola: rewrite Frontend/Parser/formula_rewrite.k:788state equation: calling and running sara
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p23 <= 0)) OR ((1 <= p109)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
sara: try reading problem file CTLCardinality-5-0.sara.
lola: state equation: write sara problem file to CTLCardinality-5-1.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-5-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 772523 markings, 3292302 edges, 154505 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1353982 markings, 6424682 edges, 116292 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1921232 markings, 9325153 edges, 113450 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2403398 markings, 12085002 edges, 96433 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2851882 markings, 14863670 edges, 89697 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3288392 markings, 17730977 edges, 87302 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3765524 markings, 20451922 edges, 95426 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4222324 markings, 23226225 edges, 91360 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4749886 markings, 26059708 edges, 105512 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5275019 markings, 28753337 edges, 105027 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5784859 markings, 31636979 edges, 101968 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6275555 markings, 34738422 edges, 98139 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6782798 markings, 37912031 edges, 101449 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7307372 markings, 41036760 edges, 104915 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7855982 markings, 43924526 edges, 109722 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8383727 markings, 46749981 edges, 105549 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8873953 markings, 49778335 edges, 98045 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 9429542 markings, 52641950 edges, 111118 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 9850375 markings, 55234436 edges, 84167 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 10280104 markings, 57769968 edges, 85946 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 10740294 markings, 60573509 edges, 92038 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 11348150 markings, 63412105 edges, 121571 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 11921901 markings, 66431112 edges, 114750 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 12466972 markings, 69434094 edges, 109014 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 12954239 markings, 72423675 edges, 97453 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 13513902 markings, 75385901 edges, 111933 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 14054119 markings, 78340931 edges, 108043 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 14462735 markings, 81325299 edges, 81723 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 14959834 markings, 84384638 edges, 99420 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 15474099 markings, 87453178 edges, 102853 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 16035792 markings, 90535799 edges, 112339 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 16624256 markings, 93633591 edges, 117693 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 17201811 markings, 96782800 edges, 115511 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 17761357 markings, 99878743 edges, 111909 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 18265958 markings, 102837301 edges, 100920 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 18766287 markings, 105918732 edges, 100066 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 19276359 markings, 108901140 edges, 102014 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 19789644 markings, 111834559 edges, 102657 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 20388511 markings, 114494759 edges, 119773 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 20843026 markings, 116867892 edges, 90903 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 21274020 markings, 119254298 edges, 86199 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 21679915 markings, 121576056 edges, 81179 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 22128066 markings, 123950468 edges, 89630 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 22495776 markings, 126219188 edges, 73542 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 22798632 markings, 128557800 edges, 60571 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 23268063 markings, 130761706 edges, 93886 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 23655097 markings, 132917292 edges, 77407 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 23924713 markings, 135136946 edges, 53923 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 24391857 markings, 137351353 edges, 93429 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 24821333 markings, 139495196 edges, 85895 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 25214645 markings, 141686591 edges, 78662 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 25555807 markings, 144132336 edges, 68232 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 25983336 markings, 146604883 edges, 85506 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 26363319 markings, 148948854 edges, 75997 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 26758939 markings, 151260075 edges, 79124 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 27341876 markings, 154069133 edges, 116587 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 27916056 markings, 157147244 edges, 114836 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 28505326 markings, 160204739 edges, 117854 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 29018340 markings, 163160096 edges, 102603 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 29527663 markings, 166104917 edges, 101865 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 30012619 markings, 169120611 edges, 96991 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 30666757 markings, 172280388 edges, 130828 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 31477641 markings, 175018612 edges, 162177 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 32071536 markings, 177961555 edges, 118779 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 32843121 markings, 180418703 edges, 154317 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 33640175 markings, 182610868 edges, 159411 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 34332316 markings, 184673535 edges, 138428 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 34893167 markings, 186635561 edges, 112170 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 35423383 markings, 188557453 edges, 106043 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 35976622 markings, 190606518 edges, 110648 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 36471182 markings, 192691811 edges, 98912 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 36873838 markings, 194703955 edges, 80531 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 37248529 markings, 196707136 edges, 74938 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 37667024 markings, 198847798 edges, 83699 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 38105711 markings, 201112332 edges, 87737 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 38541421 markings, 203365046 edges, 87142 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 38942301 markings, 205743491 edges, 80176 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 39351791 markings, 208122128 edges, 81898 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 39789757 markings, 210683704 edges, 87593 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 40224907 markings, 213381223 edges, 87030 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 40662923 markings, 216232755 edges, 87603 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 41101366 markings, 218596147 edges, 87689 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 41372470 markings, 221041042 edges, 54221 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 41791190 markings, 223808181 edges, 83744 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 42176792 markings, 226126639 edges, 77120 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 42586265 markings, 228782585 edges, 81895 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 42944260 markings, 230835143 edges, 71599 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 43258488 markings, 233087195 edges, 62846 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 43645166 markings, 235506770 edges, 77336 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 43898468 markings, 237574990 edges, 50660 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 44243958 markings, 239639136 edges, 69098 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 44495697 markings, 241557637 edges, 50348 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 44820284 markings, 243402364 edges, 64917 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 45068300 markings, 245222757 edges, 49603 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 45375197 markings, 247270638 edges, 61379 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 45811386 markings, 249704144 edges, 87238 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 46143552 markings, 252478687 edges, 66433 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 46511555 markings, 255118662 edges, 73601 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 46787712 markings, 257823513 edges, 55231 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 46967545 markings, 260282022 edges, 35967 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 47081322 markings, 262480935 edges, 22755 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 47296926 markings, 264431063 edges, 43121 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 47586999 markings, 266482508 edges, 58015 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 47828133 markings, 268383341 edges, 48227 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 47859237 markings, 270444833 edges, 6221 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 47952967 markings, 272567406 edges, 18746 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 48090013 markings, 274587295 edges, 27409 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 48262158 markings, 276751761 edges, 34429 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 48433089 markings, 278964256 edges, 34186 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 48655075 markings, 281358397 edges, 44397 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 48761257 markings, 283562084 edges, 21236 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 48963717 markings, 286004656 edges, 40492 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 49172774 markings, 288497397 edges, 41811 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 49347243 markings, 290930143 edges, 34894 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 49565780 markings, 293473548 edges, 43707 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 49742162 markings, 295999982 edges, 35276 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 49938282 markings, 298657179 edges, 39224 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 50440672 markings, 301632945 edges, 100478 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown unknown no unknown unknown unknown yes
lola: memory consumption: 2870116 KB
lola: time consumption: 598 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p134 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p134))
lola: processed formula length: 13
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p134))
lola: state equation task get result unparse finished id 1
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p134 <= 0))
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 /EGEF
lola: The predicate is not eventually invariant.
lola: 908 markings, 1586 edges
lola: subprocess 7 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p190 <= 0)) OR ((1 <= p221))))) AND A (G ((((p201 <= 0)) OR ((1 <= p64)) OR (p102 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p190 <= 0)) OR ((1 <= p221)))))
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 ((((p190 <= 0)) OR ((1 <= p221)))))
lola: processed formula length: 41
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: subprocess 8 will run for 990 seconds at most (--localtimelimit=0)
lola: lola: ========================================
lola: ...considering subproblem: (A (G (((p27 <= 0)))) AND A (G (E (F ((((p55 <= 0)) OR ((1 <= p104))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 990 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p27 <= 0))))
lola: processed formula length: 20
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p27))
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: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p27)))) OR E (F (A (G ((((p202 <= 0)) OR ((1 <= p190))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p27))))
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 <= p27))))
lola: processed formula length: 20
lola: 13 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: ((1 <= p27))
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 2972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p164)) OR ((p17 <= 0)) OR ((1 <= p62))))) AND (E (G ((((1 <= p229)) AND ((p155 <= 0))))) OR A (G (((p103 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown no no no yes no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 29536 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown no no no yes no yes
lola:
preliminary result: yes unknown yes no unknown no no no yes no yes
lola: memory consumption: 29536 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16114980 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16114964 kB
--------------------
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="SmartHome-PT-08"
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 SmartHome-PT-08, 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 r228-oct2-159033547100059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-08.tgz
mv SmartHome-PT-08 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 ;