About the Execution of ITS-LoLa for SmartHome-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15728.310 | 3600000.00 | 642345.00 | 714.20 | ?F?F?FF?FFF?T?FF | 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-159033547000043.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-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547000043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.1K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 56K 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-06-CTLCardinality-00
FORMULA_NAME SmartHome-PT-06-CTLCardinality-01
FORMULA_NAME SmartHome-PT-06-CTLCardinality-02
FORMULA_NAME SmartHome-PT-06-CTLCardinality-03
FORMULA_NAME SmartHome-PT-06-CTLCardinality-04
FORMULA_NAME SmartHome-PT-06-CTLCardinality-05
FORMULA_NAME SmartHome-PT-06-CTLCardinality-06
FORMULA_NAME SmartHome-PT-06-CTLCardinality-07
FORMULA_NAME SmartHome-PT-06-CTLCardinality-08
FORMULA_NAME SmartHome-PT-06-CTLCardinality-09
FORMULA_NAME SmartHome-PT-06-CTLCardinality-10
FORMULA_NAME SmartHome-PT-06-CTLCardinality-11
FORMULA_NAME SmartHome-PT-06-CTLCardinality-12
FORMULA_NAME SmartHome-PT-06-CTLCardinality-13
FORMULA_NAME SmartHome-PT-06-CTLCardinality-14
FORMULA_NAME SmartHome-PT-06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591288202232
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:30:03] [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:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:30:04] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-06-04 16:30:04] [INFO ] Transformed 219 places.
[2020-06-04 16:30:04] [INFO ] Transformed 254 transitions.
[2020-06-04 16:30:04] [INFO ] Found NUPN structural information;
[2020-06-04 16:30:04] [INFO ] Parsed PT model containing 219 places and 254 transitions in 99 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 18 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Incomplete random walk after 100000 steps, including 656 resets, run finished after 191 ms. (steps per millisecond=523 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 236 rows 202 cols
[2020-06-04 16:30:04] [INFO ] Computed 9 place invariants in 8 ms
[2020-06-04 16:30:04] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2020-06-04 16:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:04] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-06-04 16:30:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned unsat
[2020-06-04 16:30:04] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned unsat
[2020-06-04 16:30:04] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-06-04 16:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:04] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-06-04 16:30:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned unsat
[2020-06-04 16:30:04] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-06-04 16:30:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:05] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-04 16:30:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 84 ms returned sat
[2020-06-04 16:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:05] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-04 16:30:05] [INFO ] Deduced a trap composed of 47 places in 64 ms
[2020-06-04 16:30:05] [INFO ] Deduced a trap composed of 64 places in 123 ms
[2020-06-04 16:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2020-06-04 16:30:05] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 27 ms.
[2020-06-04 16:30:06] [INFO ] Added : 235 causal constraints over 47 iterations in 898 ms. Result :sat
[2020-06-04 16:30:06] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-06-04 16:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:06] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-04 16:30:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned unsat
[2020-06-04 16:30:06] [INFO ] [Real]Absence check using 9 positive place invariants in 62 ms returned sat
[2020-06-04 16:30:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:07] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2020-06-04 16:30:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 287 ms returned sat
[2020-06-04 16:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:07] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-04 16:30:07] [INFO ] Deduced a trap composed of 36 places in 70 ms
[2020-06-04 16:30:07] [INFO ] Deduced a trap composed of 27 places in 45 ms
[2020-06-04 16:30:07] [INFO ] Deduced a trap composed of 47 places in 48 ms
[2020-06-04 16:30:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2020-06-04 16:30:07] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 12 ms.
[2020-06-04 16:30:08] [INFO ] Added : 235 causal constraints over 47 iterations in 821 ms. Result :sat
[2020-06-04 16:30:08] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-06-04 16:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:08] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-04 16:30:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:30:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 85 ms returned sat
[2020-06-04 16:30:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:30:09] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 35 places in 30 ms
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 27 places in 28 ms
[2020-06-04 16:30:09] [INFO ] Deduced a trap composed of 47 places in 20 ms
[2020-06-04 16:30:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 112 ms
[2020-06-04 16:30:09] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 9 ms.
[2020-06-04 16:30:09] [INFO ] Added : 235 causal constraints over 47 iterations in 730 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-04 16:30:10] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 16:30:10] [INFO ] Flatten gal took : 75 ms
[2020-06-04 16:30:10] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 16:30:10] [INFO ] Flatten gal took : 13 ms
FORMULA SmartHome-PT-06-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 16:30:10] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 16:30:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmartHome-PT-06 @ 3570 seconds
FORMULA SmartHome-PT-06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-06-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-06-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-06-CTLCardinality-06 FALSE 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-06
{
"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:10 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 <= p157))",
"processed_size": 13,
"rewrites": 14
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((((p186 <= 0)) OR ((1 <= p194)))))",
"processed_size": 41,
"rewrites": 13
},
"result":
{
"edges": 44,
"markings": 45,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((((1 <= p47)) AND ((p140 <= 0)))))",
"processed_size": 40,
"rewrites": 12
},
"result":
{
"edges": 13,
"markings": 14,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 ((((p38 <= 0)) OR ((1 <= p43)))))",
"processed_size": 39,
"rewrites": 13
},
"result":
{
"edges": 6,
"markings": 7,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p23 <= 0)) OR ((1 <= p55)) OR ((p151 <= 0)) OR ((1 <= p191)))))",
"processed_size": 75,
"rewrites": 13
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((((p186 <= 0)) OR ((1 <= p128))) AND (((p156 <= 0)) OR ((1 <= p168))))))",
"processed_size": 81,
"rewrites": 13
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 27796,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(G(**)))) : A(G(**)) : A(G(A((** U **)))) : (A(G(**)) AND (NODEADLOCK AND E(F(**)))) : A(G(**)) : E(G(E(F(**)))) : A(G(**)) : (E(G(**)) AND E(F(A(G(**))))) : E(F(*)) : A(G(E(F(**)))) : A(G(**)) : A(X(A(G(**))))"
},
"net":
{
"arcs": 545,
"conflict_clusters": 177,
"places": 202,
"places_significant": 193,
"singleton_clusters": 0,
"transitions": 236
},
"result":
{
"interim_value": "unknown no unknown unknown no unknown no unknown yes unknown no no ",
"preliminary_value": "unknown no unknown unknown no unknown no unknown yes unknown no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 438/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6464
lola: finding significant places
lola: 202 places, 236 transitions, 193 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: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: E (F (A (G (((1 <= p169)))))) : A (G ((((p38 <= 0)) OR ((1 <= p43))))) : A (G (A (((((p160 <= 0)) OR ((1 <= p96))) U (((p173 <= 0)) OR ((1 <= p137))))))) : ((A (G ((((p21 <= 0)) OR ((p117 <= 0)) OR ((1 <= p84))))) AND NOT(A (X ((1 <= 0))))) AND E (((0 <= 0) U ((1 <= p135))))) : A (G (((((p186 <= 0)) OR ((1 <= p128))) AND (((p156 <= 0)) OR ((1 <= p168)))))) : E (G (E (F (((1 <= p127)))))) : A (G ((((p186 <= 0)) OR ((1 <= p194))))) : (E (G ((((p77 <= 0)) OR ((1 <= p43))))) AND E (F (A (G ((((p196 <= 0)) OR ((1 <= p140)))))))) : A (F (NOT(A (G ((((p47 <= 0)) OR ((1 <= p140)))))))) : A (G (E (F ((((p179 <= 0)) OR ((1 <= p20))))))) : A (G (E (G ((((p23 <= 0)) OR ((1 <= p55)) OR ((p151 <= 0)) OR ((1 <= p191))))))) : A (X (A (G (((p157 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p157 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p157))
lola: processed formula length: 13
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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p157))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p186 <= 0)) OR ((1 <= p194)))))
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 ((((p186 <= 0)) OR ((1 <= p194)))))
lola: processed formula length: 41
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p186)) AND ((p194 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p47)) AND ((p140 <= 0)))))
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 <= p47)) AND ((p140 <= 0)))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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 <= p47)) AND ((p140 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p38 <= 0)) OR ((1 <= p43)))))
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 ((((p38 <= 0)) OR ((1 <= p43)))))
lola: processed formula length: 39
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: formula 0: (((1 <= p38)) AND ((p43 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p23 <= 0)) OR ((1 <= p55)) OR ((p151 <= 0)) OR ((1 <= p191)))))
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 ((((p23 <= 0)) OR ((1 <= p55)) OR ((p151 <= 0)) OR ((1 <= p191)))))
lola: processed formula length: 75
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: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 <= p23)) AND ((p55 <= 0)) AND ((1 <= p151)) AND ((p191 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p186 <= 0)) OR ((1 <= p128))) AND (((p156 <= 0)) OR ((1 <= p168))))))
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 (((((p186 <= 0)) OR ((1 <= p128))) AND (((p156 <= 0)) OR ((1 <= p168))))))
lola: processed formula length: 81
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: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 <= p186)) AND ((p128 <= 0))) OR (((1 <= p156)) AND ((p168 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p169))))))
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:787
lola: processed formula: ((p169 <= 0))
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
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 <= p169))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: 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: ((p169 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 728751 markings, 3497494 edges, 145750 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1420609 markings, 6855096 edges, 138372 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1969307 markings, 10107538 edges, 109740 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2540443 markings, 13317107 edges, 114227 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3143882 markings, 16498876 edges, 120688 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3655848 markings, 19407074 edges, 102393 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4137528 markings, 22285830 edges, 96336 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4635142 markings, 25240172 edges, 99523 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 5161731 markings, 28186173 edges, 105318 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5644330 markings, 31106643 edges, 96520 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 6206476 markings, 34107434 edges, 112429 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6762211 markings, 37160431 edges, 111147 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 7250807 markings, 40335611 edges, 97719 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7612863 markings, 43473679 edges, 72411 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 8126265 markings, 46556836 edges, 102680 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8692324 markings, 49667346 edges, 113212 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 9280502 markings, 52755358 edges, 117636 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 9892370 markings, 56154202 edges, 122374 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 10577783 markings, 59696483 edges, 137083 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 11121427 markings, 62932965 edges, 108729 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 11624802 markings, 65911659 edges, 100675 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 12124689 markings, 69164239 edges, 99977 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 12835334 markings, 72586091 edges, 142129 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 13481719 markings, 76009037 edges, 129277 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 14079246 markings, 79169479 edges, 119505 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 14640716 markings, 82180612 edges, 112294 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 15190653 markings, 85322143 edges, 109987 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 15658610 markings, 88442939 edges, 93591 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 16104662 markings, 91547258 edges, 89210 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 16608733 markings, 94666619 edges, 100814 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 17196901 markings, 97771616 edges, 117634 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 17796701 markings, 100914508 edges, 119960 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 18338506 markings, 104303559 edges, 108361 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 18965830 markings, 107688292 edges, 125465 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 19478758 markings, 110894321 edges, 102586 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 20030635 markings, 114172606 edges, 110375 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 20681910 markings, 117246469 edges, 130255 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 21343926 markings, 120695410 edges, 132403 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 22279120 markings, 123983678 edges, 187039 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 23062365 markings, 127153074 edges, 156649 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 24006813 markings, 130015792 edges, 188890 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 24884956 markings, 132602417 edges, 175629 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 25579223 markings, 135016118 edges, 138853 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 26232684 markings, 137391339 edges, 130692 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 26858060 markings, 139808215 edges, 125075 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 27399576 markings, 142325494 edges, 108303 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 27910134 markings, 145095989 edges, 102112 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 28454745 markings, 147869915 edges, 108922 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 29006434 markings, 150661029 edges, 110338 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 29479816 markings, 153456912 edges, 94676 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 29980118 markings, 156392792 edges, 100060 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 30475139 markings, 159218966 edges, 99004 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 30955377 markings, 162229895 edges, 96048 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 31505845 markings, 165243223 edges, 110094 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 31861894 markings, 168277032 edges, 71210 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 32294272 markings, 171134158 edges, 86476 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 32763460 markings, 174037835 edges, 93838 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 33267636 markings, 177190865 edges, 100835 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 33749042 markings, 180294177 edges, 96281 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 34226187 markings, 183381096 edges, 95429 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 34677769 markings, 186481957 edges, 90316 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 35132624 markings, 189505235 edges, 90971 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 35562323 markings, 192472174 edges, 85940 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 36046226 markings, 195474191 edges, 96781 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 36487752 markings, 198670263 edges, 88305 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 36925038 markings, 201778537 edges, 87457 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 37364171 markings, 204879536 edges, 87827 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 37621681 markings, 207903881 edges, 51502 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 37837882 markings, 210628039 edges, 43240 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 38293584 markings, 213803004 edges, 91140 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 38434597 markings, 216460277 edges, 28203 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 38480705 markings, 218748699 edges, 9222 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 38578737 markings, 221046996 edges, 19606 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 38750323 markings, 223507355 edges, 34317 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 38877934 markings, 225914010 edges, 25522 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 39210761 markings, 228954378 edges, 66565 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 39515058 markings, 231945714 edges, 60859 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 39692318 markings, 234729510 edges, 35452 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 39862309 markings, 237501818 edges, 33998 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 40063399 markings, 240317038 edges, 40218 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 40290866 markings, 243226649 edges, 45493 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 40499208 markings, 246181047 edges, 41668 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 41014053 markings, 249492246 edges, 102969 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 41892516 markings, 252683839 edges, 175693 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 42628991 markings, 255916286 edges, 147295 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 43516477 markings, 258773687 edges, 177497 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 44410354 markings, 261359347 edges, 178775 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 45112739 markings, 263743772 edges, 140477 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 45738024 markings, 266056189 edges, 125057 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 46345923 markings, 268375433 edges, 121580 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 46889984 markings, 270781568 edges, 108812 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 47400858 markings, 273373853 edges, 102175 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 47916831 markings, 276121103 edges, 103195 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 48456030 markings, 278881241 edges, 107840 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 48959004 markings, 281557453 edges, 100595 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 49438119 markings, 284417119 edges, 95823 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 49934026 markings, 287329976 edges, 99181 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 50410225 markings, 290232544 edges, 95240 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 50892457 markings, 293288941 edges, 96446 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 51345863 markings, 296254185 edges, 90681 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 51793964 markings, 299209085 edges, 89620 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 52253588 markings, 302221290 edges, 91925 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 52722261 markings, 305218792 edges, 93735 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 53202071 markings, 308259005 edges, 95962 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 53593082 markings, 311304713 edges, 78202 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 54056192 markings, 314297348 edges, 92622 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 54527464 markings, 317302230 edges, 94254 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 55034569 markings, 320236364 edges, 101421 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 55530969 markings, 323199172 edges, 99280 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 55897728 markings, 326190969 edges, 73352 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 56254559 markings, 329127904 edges, 71366 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 56703100 markings, 332078912 edges, 89708 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 57128950 markings, 335367369 edges, 85170 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 57565941 markings, 338529475 edges, 87398 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 58014913 markings, 341715748 edges, 89794 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 58209435 markings, 344503984 edges, 38904 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 58242648 markings, 346958700 edges, 6643 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 58314958 markings, 349318255 edges, 14462 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown no unknown no unknown yes unknown no no
lola: memory consumption: 2844700 KB
lola: time consumption: 597 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: unknown no unknown unknown no unknown no unknown yes unknown no no
lola:
preliminary result: unknown no unknown unknown no unknown no unknown yes unknown no no
lola: memory consumption: 27796 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: 16119120 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16119120 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-06"
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-06, 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-159033547000043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-06.tgz
mv SmartHome-PT-06 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 ;