About the Execution of ITS-LoLa for HouseConstruction-PT-32000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15746.480 | 3600000.00 | 585640.00 | 1860.60 | T?FT???????????? | 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.r184-oct2-158987928200243.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 HouseConstruction-PT-32000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928200243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.5K Apr 4 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 4 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 3 21:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 3 21:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 3 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 3 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-32000-CTLCardinality-00
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-01
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-02
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-03
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-04
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-05
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-06
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-07
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-08
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-09
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-32000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591199392263
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:49:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:49:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:49:53] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-06-03 15:49:53] [INFO ] Transformed 26 places.
[2020-06-03 15:49:53] [INFO ] Transformed 18 transitions.
[2020-06-03 15:49:53] [INFO ] Parsed PT model containing 26 places and 18 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Incomplete random walk after 128004 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=3368 ) properties seen :[0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 18 rows 26 cols
[2020-06-03 15:49:53] [INFO ] Computed 8 place invariants in 2 ms
[2020-06-03 15:49:53] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 11 ms returned sat
[2020-06-03 15:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 15:49:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 17 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:49:54] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:49:54] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned unsat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 14 ms.
[2020-06-03 15:49:54] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:49:54] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:49:54] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 12 causal constraints over 3 iterations in 8 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 14 causal constraints over 3 iterations in 9 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 10 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 14 causal constraints over 3 iterations in 8 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 4 ms.
[2020-06-03 15:49:54] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:49:54] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2020-06-03 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:49:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:49:54] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:49:54] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 15:49:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 15:49:54] [INFO ] Flatten gal took : 21 ms
[2020-06-03 15:49:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 15:49:54] [INFO ] Flatten gal took : 5 ms
FORMULA HouseConstruction-PT-32000-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:49:54] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 15:49:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ HouseConstruction-PT-32000 @ 3570 seconds
FORMULA HouseConstruction-PT-32000-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HouseConstruction-PT-32000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ HouseConstruction-PT-32000
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 15:49:55 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"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": "AX(E((p20 <= p8) U (p0 <= p14)))",
"processed_size": 32,
"rewrites": 17
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 671964,
"markings": 671965,
"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": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p16)))",
"processed_size": 18,
"rewrites": 16
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 5,
"visible_transitions": 0
},
"processed": "EX((((p6 <= p23) AND (p17 <= p25)) OR (p10 + 1 <= p6)))",
"processed_size": 56,
"rewrites": 16
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 8008832,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(E((** U **)))) : E(G(A((** U **)))) : (E(F(**)) AND E(X(**))) : (A((** U **)) OR **) : A((E(X(**)) U E(G(**)))) : A(F(A(G(**)))) : (A((* R *)) OR **) : (E(G(A(F(**)))) OR **) : A(F(**)) : (E(G(**)) AND (** OR A(X(*)))) : E(F(A(G(**)))) : A(F(*)) : A(G(**)) : E((E(F(**)) U A(G(**)))) : (** OR (A(F(*)) OR **))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 18,
"places": 26,
"places_significant": 18,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"interim_value": "yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 44/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (X (E (((p20 <= p8) U (p0 <= p14))))) : E (G (A (((p7 <= p21) U (1 <= p9))))) : (E (F (A (F ((3 <= p16))))) AND E (X ((((p6 <= p23) AND (p17 <= p25)) OR (p10 + 1 <= p6))))) : (A (((p16 <= 2) U (p16 + 1 <= p13))) OR ((p16 + 1 <= p15) AND ((2 <= p1) OR (p25 <= p12)))) : A ((E (X ((p6 <= p1))) U E (G ((p15 <= p12))))) : A (F (A (G (((1 <= p8) OR (p14 <= p6)))))) : (NOT(E (((p4 <= p14) U (3 <= p16)))) OR (p1 + 1 <= p23)) : (E (G (A (F ((2 <= p2))))) OR (1 <= p20)) : A (F (((p2 <= p9) AND (p9 <= 2) AND (p22 + 1 <= p17)))) : (E (G ((((p24 <= p14) OR (1 <= p7)) AND (p19 <= p1) AND (p16 <= p2)))) AND ((p3 <= 0) OR NOT(E (X ((p2 <= p6)))))) : E (F (A (G (((1 <= p16) AND (p16 <= p14)))))) : NOT(E (G ((p13 <= 0)))) : A (G ((1 <= p0))) : E ((E (F ((p23 <= p25))) U A (G ((2 <= p15))))) : (((2 <= p8) OR NOT(E (G (((p2 <= p14) OR (2 <= p12)))))) OR ((p17 + 1 <= p11) AND (p9 + 1 <= p20) AND ((3 <= p16) OR (p5 <= p22) OR (3 <= p6) OR (1 <= p10))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (((p20 <= p8) U (p0 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E((p20 <= p8) U (p0 <= p14)))
lola: processed formula length: 32
lola: 17 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: 671965 markings, 671964 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p16))) AND E (X ((((p6 <= p23) AND (p17 <= p25)) OR (p10 + 1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p16)))
lola: processed formula length: 18
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p16)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-0.sara.
sara: error: :113: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p6 <= p23) AND (p17 <= p25)) OR (p10 + 1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p6 <= p23) AND (p17 <= p25)) OR (p10 + 1 <= p6)))
lola: processed formula length: 56
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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p6 <= p1))) U E (G ((p15 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p6 <= p1)) U EG((p15 <= p12)))
lola: processed formula length: 36
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3038943 markings, 9352230 edges, 607789 markings/sec, 0 secs
lola: 5137480 markings, 18012247 edges, 419707 markings/sec, 5 secs
lola: 6612355 markings, 24856706 edges, 294975 markings/sec, 10 secs
lola: 8141392 markings, 31745562 edges, 305807 markings/sec, 15 secs
lola: 9528180 markings, 38231939 edges, 277358 markings/sec, 20 secs
lola: 11001718 markings, 44648973 edges, 294708 markings/sec, 25 secs
lola: 12325653 markings, 50501739 edges, 264787 markings/sec, 30 secs
lola: 13807999 markings, 57033234 edges, 296469 markings/sec, 35 secs
lola: 15174358 markings, 63438627 edges, 273272 markings/sec, 40 secs
lola: 16303560 markings, 68849574 edges, 225840 markings/sec, 45 secs
lola: 17572934 markings, 74700653 edges, 253875 markings/sec, 50 secs
lola: 19244384 markings, 82002929 edges, 334290 markings/sec, 55 secs
lola: 20718059 markings, 88584143 edges, 294735 markings/sec, 60 secs
lola: 21955574 markings, 94443501 edges, 247503 markings/sec, 65 secs
lola: 23139575 markings, 100153305 edges, 236800 markings/sec, 70 secs
lola: 24004695 markings, 104747466 edges, 173024 markings/sec, 75 secs
lola: 25430406 markings, 111894912 edges, 285142 markings/sec, 80 secs
lola: 26838969 markings, 118789679 edges, 281713 markings/sec, 85 secs
lola: 28227281 markings, 125859349 edges, 277662 markings/sec, 90 secs
lola: 29594918 markings, 132838237 edges, 273527 markings/sec, 95 secs
lola: 30795232 markings, 139407471 edges, 240063 markings/sec, 100 secs
lola: 32059831 markings, 146056125 edges, 252920 markings/sec, 105 secs
lola: 33510439 markings, 153353565 edges, 290122 markings/sec, 110 secs
lola: 35296674 markings, 161376473 edges, 357247 markings/sec, 115 secs
lola: 36849451 markings, 168954647 edges, 310555 markings/sec, 120 secs
lola: 38285964 markings, 175987297 edges, 287303 markings/sec, 125 secs
lola: 39648162 markings, 182958147 edges, 272440 markings/sec, 130 secs
lola: 41046983 markings, 190139291 edges, 279764 markings/sec, 135 secs
lola: 42320703 markings, 196906458 edges, 254744 markings/sec, 140 secs
lola: 43953282 markings, 204634184 edges, 326516 markings/sec, 145 secs
lola: 45531795 markings, 212087915 edges, 315703 markings/sec, 150 secs
lola: 46966350 markings, 219243645 edges, 286911 markings/sec, 155 secs
lola: 48482304 markings, 226626429 edges, 303191 markings/sec, 160 secs
lola: 49916211 markings, 233420427 edges, 286781 markings/sec, 165 secs
lola: 51589448 markings, 240983901 edges, 334647 markings/sec, 170 secs
lola: 53026997 markings, 248035794 edges, 287510 markings/sec, 175 secs
lola: 54458998 markings, 255127105 edges, 286400 markings/sec, 180 secs
lola: 55744266 markings, 261885570 edges, 257054 markings/sec, 185 secs
lola: 57160859 markings, 268845967 edges, 283319 markings/sec, 190 secs
lola: 59044582 markings, 277151796 edges, 376745 markings/sec, 195 secs
lola: 60376874 markings, 283662267 edges, 266458 markings/sec, 200 secs
lola: 61813269 markings, 290571599 edges, 287279 markings/sec, 205 secs
lola: 63268899 markings, 297892361 edges, 291126 markings/sec, 210 secs
lola: 64790806 markings, 305443224 edges, 304381 markings/sec, 215 secs
lola: 65966375 markings, 311879364 edges, 235114 markings/sec, 220 secs
lola: 67224698 markings, 318762033 edges, 251665 markings/sec, 225 secs
lola: 68560581 markings, 325596330 edges, 267177 markings/sec, 230 secs
lola: 69796433 markings, 332025067 edges, 247170 markings/sec, 235 secs
lola: 71067791 markings, 338441896 edges, 254272 markings/sec, 240 secs
lola: 72279399 markings, 344924621 edges, 242322 markings/sec, 245 secs
lola: 73409294 markings, 351068464 edges, 225979 markings/sec, 250 secs
lola: 75339224 markings, 359667531 edges, 385986 markings/sec, 255 secs
lola: 76895568 markings, 367417888 edges, 311269 markings/sec, 260 secs
lola: 78414392 markings, 374767336 edges, 303765 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5847276 KB
lola: time consumption: 277 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p24 <= p14) OR (1 <= p7)) AND (p19 <= p1) AND (p16 <= p2)))) AND ((p3 <= 0) OR A (X ((p6 + 1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p24 <= p14) OR (1 <= p7)) AND (p19 <= p1) AND (p16 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p24 <= p14) OR (1 <= p7)) AND (p19 <= p1) AND (p16 <= p2))))
lola: processed formula length: 70
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 / 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: (((p14 + 1 <= p24) AND (p7 <= 0)) OR (p1 + 1 <= p19) OR (p2 + 1 <= p16))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: error: :113: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: 5585851 markings, 8715602 edges, 1117170 markings/sec, 0 secs || sara is running 0 secs
lola: 9945067 markings, 17097373 edges, 871843 markings/sec, 5 secs || sara is running 5 secs
lola: 14340833 markings, 25400761 edges, 879153 markings/sec, 10 secs || sara is running 10 secs
lola: 18571717 markings, 33582214 edges, 846177 markings/sec, 15 secs || sara is running 15 secs
lola: 22719206 markings, 41602569 edges, 829498 markings/sec, 20 secs || sara is running 20 secs
lola: 26845464 markings, 49581425 edges, 825252 markings/sec, 25 secs || sara is running 25 secs
lola: 30935046 markings, 57489370 edges, 817916 markings/sec, 30 secs || sara is running 30 secs
lola: 34893939 markings, 65145564 edges, 791779 markings/sec, 35 secs || sara is running 35 secs
lola: 38903738 markings, 72899503 edges, 801960 markings/sec, 40 secs || sara is running 40 secs
lola: 42901937 markings, 80630305 edges, 799640 markings/sec, 45 secs || sara is running 45 secs
lola: 46884051 markings, 88330281 edges, 796423 markings/sec, 50 secs || sara is running 50 secs
lola: 50862355 markings, 96024367 edges, 795661 markings/sec, 55 secs || sara is running 55 secs
lola: 54855981 markings, 103746698 edges, 798725 markings/sec, 60 secs || sara is running 60 secs
lola: 58787343 markings, 111348267 edges, 786272 markings/sec, 65 secs || sara is running 65 secs
lola: 62716191 markings, 118946315 edges, 785770 markings/sec, 70 secs || sara is running 70 secs
lola: 66607027 markings, 126469668 edges, 778167 markings/sec, 75 secs || sara is running 75 secs
lola: 70464232 markings, 133929605 edges, 771441 markings/sec, 80 secs || sara is running 80 secs
lola: 74452427 markings, 141640400 edges, 797639 markings/sec, 85 secs || sara is running 85 secs
lola: 78394641 markings, 149264173 edges, 788443 markings/sec, 90 secs || sara is running 90 secs
lola: 82278355 markings, 156774241 edges, 776743 markings/sec, 95 secs || sara is running 95 secs
lola: 86026267 markings, 164022692 edges, 749582 markings/sec, 100 secs || sara is running 100 secs
lola: 89927555 markings, 171566001 edges, 780258 markings/sec, 105 secs || sara is running 105 secs
lola: 93746403 markings, 178949418 edges, 763770 markings/sec, 110 secs || sara is running 110 secs
lola: 97600162 markings, 186402198 edges, 770752 markings/sec, 115 secs || sara is running 115 secs
lola: 101438334 markings, 193825977 edges, 767634 markings/sec, 120 secs || sara is running 120 secs
lola: 105302344 markings, 201295663 edges, 772802 markings/sec, 125 secs || sara is running 125 secs
lola: 109164974 markings, 208767338 edges, 772526 markings/sec, 130 secs || sara is running 130 secs
lola: 113068099 markings, 216313530 edges, 780625 markings/sec, 135 secs || sara is running 135 secs
lola: 116932303 markings, 223785538 edges, 772841 markings/sec, 140 secs || sara is running 140 secs
lola: 120802708 markings, 231271644 edges, 774081 markings/sec, 145 secs || sara is running 145 secs
lola: 124659593 markings, 238730149 edges, 771377 markings/sec, 150 secs || sara is running 150 secs
lola: 128526900 markings, 246207770 edges, 773461 markings/sec, 155 secs || sara is running 155 secs
lola: 132384041 markings, 253667876 edges, 771428 markings/sec, 160 secs || sara is running 160 secs
lola: 136210921 markings, 261067712 edges, 765376 markings/sec, 165 secs || sara is running 165 secs
lola: 140003606 markings, 268399751 edges, 758537 markings/sec, 170 secs || sara is running 170 secs
lola: 143844607 markings, 275828638 edges, 768200 markings/sec, 175 secs || sara is running 175 secs
lola: 147682765 markings, 283250987 edges, 767632 markings/sec, 180 secs || sara is running 180 secs
lola: 151530482 markings, 290691007 edges, 769543 markings/sec, 185 secs || sara is running 185 secs
lola: 155355984 markings, 298090465 edges, 765100 markings/sec, 190 secs || sara is running 190 secs
lola: 159175153 markings, 305472810 edges, 763834 markings/sec, 195 secs || sara is running 195 secs
lola: 163002926 markings, 312874872 edges, 765555 markings/sec, 200 secs || sara is running 200 secs
lola: 166853657 markings, 320320846 edges, 770146 markings/sec, 205 secs || sara is running 205 secs
lola: 170677078 markings, 327716636 edges, 764684 markings/sec, 210 secs || sara is running 210 secs
lola: 174489202 markings, 335089570 edges, 762425 markings/sec, 215 secs || sara is running 215 secs
lola: 178336890 markings, 342527028 edges, 769538 markings/sec, 220 secs || sara is running 220 secs
lola: 182217098 markings, 350031218 edges, 776042 markings/sec, 225 secs || sara is running 225 secs
lola: 186101511 markings, 357542826 edges, 776883 markings/sec, 230 secs || sara is running 230 secs
lola: 189938802 markings, 364961642 edges, 767458 markings/sec, 235 secs || sara is running 235 secs
lola: 193794936 markings, 372420748 edges, 771227 markings/sec, 240 secs || sara is running 240 secs
lola: 197615837 markings, 379810347 edges, 764180 markings/sec, 245 secs || sara is running 245 secs
lola: 201484282 markings, 387287913 edges, 773689 markings/sec, 250 secs || sara is running 250 secs
lola: 205354935 markings, 394772978 edges, 774131 markings/sec, 255 secs || sara is running 255 secs
lola: 209165853 markings, 402145405 edges, 762184 markings/sec, 260 secs || sara is running 260 secs
lola: 212966235 markings, 409492140 edges, 760076 markings/sec, 265 secs || sara is running 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8008832 KB
lola: time consumption: 551 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 unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8008832 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: 8120616 kB
After kill :
MemTotal: 16427332 kB
MemFree: 8120616 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="HouseConstruction-PT-32000"
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 HouseConstruction-PT-32000, 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 r184-oct2-158987928200243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-32000.tgz
mv HouseConstruction-PT-32000 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 ;