fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033478301035
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldRVt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.450 3600000.00 619104.00 28890.20 TF?FFFTFFTTFTT?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478301035.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldRVt-PT-030A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.2K May 14 02:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.2K May 13 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:41 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 82K 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 ShieldRVt-PT-030A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-030A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591338723162

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:32:04] [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-05 06:32:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:32:05] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-05 06:32:05] [INFO ] Transformed 243 places.
[2020-06-05 06:32:05] [INFO ] Transformed 243 transitions.
[2020-06-05 06:32:05] [INFO ] Found NUPN structural information;
[2020-06-05 06:32:05] [INFO ] Parsed PT model containing 243 places and 243 transitions in 87 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 353 ms. (steps per millisecond=283 ) properties seen :[0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0]
// Phase 1: matrix 242 rows 243 cols
[2020-06-05 06:32:05] [INFO ] Computed 121 place invariants in 8 ms
[2020-06-05 06:32:05] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:05] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-05 06:32:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 42 ms returned sat
[2020-06-05 06:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:06] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-05 06:32:06] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 22 ms.
[2020-06-05 06:32:07] [INFO ] Added : 239 causal constraints over 49 iterations in 1336 ms. Result :sat
[2020-06-05 06:32:07] [INFO ] [Real]Absence check using 121 positive place invariants in 40 ms returned sat
[2020-06-05 06:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:07] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-05 06:32:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2020-06-05 06:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:08] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-06-05 06:32:08] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:09] [INFO ] Added : 235 causal constraints over 48 iterations in 1097 ms. Result :sat
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-06-05 06:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-05 06:32:09] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2020-06-05 06:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:09] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-06-05 06:32:09] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:10] [INFO ] Added : 238 causal constraints over 48 iterations in 844 ms. Result :sat
[2020-06-05 06:32:10] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2020-06-05 06:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:10] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-06-05 06:32:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2020-06-05 06:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:11] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2020-06-05 06:32:11] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-06-05 06:32:12] [INFO ] Added : 239 causal constraints over 49 iterations in 898 ms. Result :sat
[2020-06-05 06:32:12] [INFO ] [Real]Absence check using 121 positive place invariants in 46 ms returned sat
[2020-06-05 06:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:12] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-06-05 06:32:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 6 ms returned unsat
[2020-06-05 06:32:12] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2020-06-05 06:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:12] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-05 06:32:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 57 ms returned sat
[2020-06-05 06:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:12] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-05 06:32:12] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 21 ms.
[2020-06-05 06:32:14] [INFO ] Added : 239 causal constraints over 48 iterations in 1121 ms. Result :sat
[2020-06-05 06:32:14] [INFO ] [Real]Absence check using 121 positive place invariants in 169 ms returned sat
[2020-06-05 06:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:14] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-06-05 06:32:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2020-06-05 06:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:14] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2020-06-05 06:32:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:15] [INFO ] Added : 236 causal constraints over 48 iterations in 931 ms. Result :sat
[2020-06-05 06:32:15] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2020-06-05 06:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:16] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-05 06:32:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-06-05 06:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:16] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2020-06-05 06:32:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:17] [INFO ] Added : 240 causal constraints over 49 iterations in 1074 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 06:32:17] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-05 06:32:17] [INFO ] Flatten gal took : 77 ms
[2020-06-05 06:32:17] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-05 06:32:17] [INFO ] Flatten gal took : 30 ms
FORMULA ShieldRVt-PT-030A-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:32:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-05 06:32:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldRVt-PT-030A @ 3570 seconds

FORMULA ShieldRVt-PT-030A-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2991
rslt: Output for CTLCardinality @ ShieldRVt-PT-030A

{
"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": "Fri Jun 5 06:32:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((1 <= p128)) AND ((p226 <= 0))) OR (((1 <= p54)) AND ((p207 <= 0))))",
"processed_size": 71,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p114 <= 0)) OR ((1 <= p126)))",
"processed_size": 33,
"rewrites": 3
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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 ((((p83 <= 0)) OR ((1 <= p84)))))",
"processed_size": 39,
"rewrites": 5
},
"result":
{
"edges": 919,
"markings": 823,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(((1 <= p79)))",
"processed_size": 16,
"rewrites": 4
},
"net":
{
"conflict_clusters": 63,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"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": "E (F ((((1 <= p2)) AND ((p142 <= 0)) AND (((p213 <= 0)) OR ((1 <= p62))))))",
"processed_size": 76,
"rewrites": 4
},
"result":
{
"edges": 33,
"markings": 34,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p189)) AND ((p197 <= 0)) AND ((1 <= p176)) AND ((p178 <= 0)) AND (1 <= p71))))",
"processed_size": 92,
"rewrites": 4
},
"result":
{
"edges": 3973,
"markings": 3710,
"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": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3277
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0))))))",
"processed_size": 59,
"rewrites": 4
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0))))))",
"processed_size": 59,
"rewrites": 4
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p73)) AND ((p69 <= 0)))",
"processed_size": 31,
"rewrites": 7
},
"result":
{
"edges": 1372,
"markings": 1372,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4060,
"runtime": 579.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : (** AND (A(G(**)) OR (A(X(**)) OR (** OR **)))) : E(F((A(G(**)) AND **))) : (E(F(**)) AND A(G(A(F(**))))) : E(F(**)) : E(F(A(G(**))))"
},
"net":
{
"arcs": 1024,
"conflict_clusters": 63,
"places": 243,
"places_significant": 122,
"singleton_clusters": 0,
"transitions": 242
},
"result":
{
"preliminary_value": "yes no unknown no yes unknown ",
"value": "yes no unknown no yes 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: 485/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7776
lola: finding significant places
lola: 243 places, 242 transitions, 122 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: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: E (F ((((1 <= p189)) AND ((p197 <= 0)) AND ((1 <= p176)) AND ((p178 <= 0)) AND (1 <= p71)))) : ((((p114 <= 0)) OR ((1 <= p126))) AND (((A (G ((((p83 <= 0)) OR ((1 <= p84))))) OR A (X (((1 <= p79))))) OR (((1 <= p128)) AND ((p226 <= 0)))) OR (((1 <= p54)) AND ((p207 <= 0))))) : E (F ((A (G (((1 <= p224)))) AND (((1 <= p176)) OR ((((p139 <= 0)) OR ((1 <= p95))) AND (((p120 <= 0)) OR ((1 <= p194)))))))) : (E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0)))))) AND A (G (A (F ((((p73 <= 0)) OR ((1 <= p69)))))))) : E (F ((((1 <= p2)) AND ((p142 <= 0)) AND (((p213 <= 0)) OR ((1 <= p62)))))) : E (F (A (G (((p215 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p114 <= 0)) OR ((1 <= p126))) AND (A (G ((((p83 <= 0)) OR ((1 <= p84))))) OR (A (X (((1 <= p79)))) OR ((((1 <= p128)) AND ((p226 <= 0))) OR (((1 <= p54)) AND ((p207 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p128)) AND ((p226 <= 0))) OR (((1 <= p54)) AND ((p207 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((((1 <= p128)) AND ((p226 <= 0))) OR (((1 <= p54)) AND ((p207 <= 0))))
lola: processed formula length: 71
lola: 4 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p114 <= 0)) OR ((1 <= p126)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p114 <= 0)) OR ((1 <= p126)))
lola: processed formula length: 33
lola: 3 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p83 <= 0)) OR ((1 <= p84)))))
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 ((((p83 <= 0)) OR ((1 <= p84)))))
lola: processed formula length: 39
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p83)) AND ((p84 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 823 markings, 919 edges
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p79)))
lola: processed formula length: 16
lola: 4 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p2)) AND ((p142 <= 0)) AND (((p213 <= 0)) OR ((1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p2)) AND ((p142 <= 0)) AND (((p213 <= 0)) OR ((1 <= p62))))))
lola: processed formula length: 76
lola: 4 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2)) AND ((p142 <= 0)) AND (((p213 <= 0)) OR ((1 <= p62))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p189)) AND ((p197 <= 0)) AND ((1 <= p176)) AND ((p178 <= 0)) AND (1 <= p71))))
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 <= p189)) AND ((p197 <= 0)) AND ((1 <= p176)) AND ((p178 <= 0)) AND (1 <= p71))))
lola: processed formula length: 92
lola: 4 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 <= p189)) AND ((p197 <= 0)) AND ((1 <= p176)) AND ((p178 <= 0)) AND (1 <= p71))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3710 markings, 3973 edges
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p215 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p215))
lola: processed formula length: 13
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p215))
lola: state equation task get result unparse finished id 1
lola: formula 0: ((p215 <= 0))
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-1.sara.
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2530226 markings, 2781445 edges, 506045 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5248281 markings, 5769377 edges, 543611 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7967871 markings, 8758997 edges, 543918 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10609120 markings, 11662495 edges, 528250 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13263714 markings, 14580668 edges, 530919 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15901261 markings, 17480100 edges, 527509 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18567449 markings, 20411015 edges, 533238 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21209055 markings, 23314910 edges, 528321 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23863752 markings, 26233192 edges, 530939 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26509896 markings, 29142077 edges, 529229 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 29143742 markings, 32037436 edges, 526769 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 31485931 markings, 34612187 edges, 468438 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33900511 markings, 37266510 edges, 482916 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 36382079 markings, 39994479 edges, 496314 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38804852 markings, 42657809 edges, 484555 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39687495 markings, 43628089 edges, 176529 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 40795802 markings, 44846443 edges, 221661 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 42374943 markings, 46582374 edges, 315828 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 43661003 markings, 47996130 edges, 257212 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 44734932 markings, 49176690 edges, 214786 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 45870820 markings, 50425366 edges, 227178 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 46741572 markings, 51382569 edges, 174150 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 47823053 markings, 52571433 edges, 216296 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 1721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (((1 <= p224)))) AND (((1 <= p176)) OR ((((p139 <= 0)) OR ((1 <= p95))) AND (((p120 <= 0)) OR ((1 <= p194))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG(((1 <= p224))) AND (((1 <= p176)) OR ((((p139 <= 0)) OR ((1 <= p95))) AND (((p120 <= 0)) OR ((1 <= p194)))))))
lola: processed formula length: 120
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1391286 markings, 2920713 edges, 278257 markings/sec, 0 secs
lola: 2971930 markings, 6238939 edges, 316129 markings/sec, 5 secs
lola: 4626042 markings, 9711403 edges, 330822 markings/sec, 10 secs
lola: 6342205 markings, 13314133 edges, 343233 markings/sec, 15 secs
lola: 8046331 markings, 16891584 edges, 340825 markings/sec, 20 secs
lola: 9767810 markings, 20505473 edges, 344296 markings/sec, 25 secs
lola: 11483038 markings, 24106236 edges, 343046 markings/sec, 30 secs
lola: 13192688 markings, 27695288 edges, 341930 markings/sec, 35 secs
lola: 14758009 markings, 30981354 edges, 313064 markings/sec, 40 secs
lola: 16228109 markings, 34067518 edges, 294020 markings/sec, 45 secs
lola: 17800598 markings, 37368629 edges, 314498 markings/sec, 50 secs
lola: 19261265 markings, 40434995 edges, 292133 markings/sec, 55 secs
lola: 20697580 markings, 43450239 edges, 287263 markings/sec, 60 secs
lola: 22271085 markings, 46753483 edges, 314701 markings/sec, 65 secs
lola: 23912525 markings, 50199344 edges, 328288 markings/sec, 70 secs
lola: 25473141 markings, 53475533 edges, 312123 markings/sec, 75 secs
lola: 27106540 markings, 56904512 edges, 326680 markings/sec, 80 secs
lola: 28654661 markings, 60154480 edges, 309624 markings/sec, 85 secs
lola: 30304275 markings, 63617486 edges, 329923 markings/sec, 90 secs
lola: 31951016 markings, 67074477 edges, 329348 markings/sec, 95 secs
lola: 33646138 markings, 70633029 edges, 339024 markings/sec, 100 secs
lola: 35322281 markings, 74151738 edges, 335229 markings/sec, 105 secs
lola: 36224507 markings, 76046730 edges, 180445 markings/sec, 110 secs
lola: 37287693 markings, 78278000 edges, 212637 markings/sec, 115 secs
lola: 38212970 markings, 80220374 edges, 185055 markings/sec, 120 secs
lola: 39155345 markings, 82198459 edges, 188475 markings/sec, 125 secs
lola: 40112365 markings, 84207522 edges, 191404 markings/sec, 130 secs
lola: 41286944 markings, 86673305 edges, 234916 markings/sec, 135 secs
lola: 42310758 markings, 88822589 edges, 204763 markings/sec, 140 secs
lola: 43165408 markings, 90616743 edges, 170930 markings/sec, 145 secs
lola: 43965875 markings, 92297158 edges, 160093 markings/sec, 150 secs
lola: 44829883 markings, 94110960 edges, 172802 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 3277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0)))))) AND A (G (A (F ((((p73 <= 0)) OR ((1 <= p69))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 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 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0))))))
lola: processed formula length: 59
lola: 4 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 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p215 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p215))
lola: processed formula length: 13
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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: ((p215 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p215))
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-0.sara
lola: state equation: calling and running sara
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-0.sara.
sara: try reading problem file CTLCardinality-6-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2396966 markings, 2634951 edges, 479393 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4936972 markings, 5427159 edges, 508001 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7666297 markings, 8427480 edges, 545865 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10331429 markings, 11357236 edges, 533026 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12985027 markings, 14274309 edges, 530720 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15648519 markings, 17202265 edges, 532698 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18327724 markings, 20147488 edges, 535841 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20792985 markings, 22857527 edges, 493052 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23493349 markings, 25826014 edges, 540073 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26121249 markings, 28714841 edges, 525580 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28603695 markings, 31443768 edges, 496489 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 31272267 markings, 34377306 edges, 533714 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33981447 markings, 37355484 edges, 541836 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 36678080 markings, 40319868 edges, 539327 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 39249404 markings, 43146504 edges, 514265 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40640018 markings, 44675190 edges, 278123 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42010024 markings, 46181226 edges, 274001 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43301742 markings, 47601198 edges, 258344 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44570035 markings, 48995418 edges, 253659 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 45937431 markings, 50498583 edges, 273479 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 46914603 markings, 51572779 edges, 195434 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 48487303 markings, 53301637 edges, 314540 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (((1 <= p224)))) AND (((1 <= p176)) OR ((((p139 <= 0)) OR ((1 <= p95))) AND (((p120 <= 0)) OR ((1 <= p194))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG(((1 <= p224))) AND (((1 <= p176)) OR ((((p139 <= 0)) OR ((1 <= p95))) AND (((p120 <= 0)) OR ((1 <= p194)))))))
lola: processed formula length: 120
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1567525 markings, 3290692 edges, 313505 markings/sec, 0 secs
lola: 3273733 markings, 6872545 edges, 341242 markings/sec, 5 secs
lola: 4989644 markings, 10474715 edges, 343182 markings/sec, 10 secs
lola: 6525741 markings, 13699425 edges, 307219 markings/sec, 15 secs
lola: 8128104 markings, 17063255 edges, 320473 markings/sec, 20 secs
lola: 9761353 markings, 20491919 edges, 326650 markings/sec, 25 secs
lola: 11417574 markings, 23968807 edges, 331244 markings/sec, 30 secs
lola: 13006276 markings, 27303953 edges, 317740 markings/sec, 35 secs
lola: 14649922 markings, 30754443 edges, 328729 markings/sec, 40 secs
lola: 16152895 markings, 33909631 edges, 300595 markings/sec, 45 secs
lola: 17722389 markings, 37204450 edges, 313899 markings/sec, 50 secs
lola: 19348778 markings, 40618712 edges, 325278 markings/sec, 55 secs
lola: 20912461 markings, 43901338 edges, 312737 markings/sec, 60 secs
lola: 22528044 markings, 47292912 edges, 323117 markings/sec, 65 secs
lola: 24086195 markings, 50563927 edges, 311630 markings/sec, 70 secs
lola: 25608979 markings, 53760691 edges, 304557 markings/sec, 75 secs
lola: 27196818 markings, 57094029 edges, 317568 markings/sec, 80 secs
lola: 28765747 markings, 60387670 edges, 313786 markings/sec, 85 secs
lola: 30247797 markings, 63498922 edges, 296410 markings/sec, 90 secs
lola: 31731071 markings, 66612741 edges, 296655 markings/sec, 95 secs
lola: 33342372 markings, 69995335 edges, 322260 markings/sec, 100 secs
lola: 34903040 markings, 73271632 edges, 312134 markings/sec, 105 secs
lola: 36302477 markings, 76209503 edges, 279887 markings/sec, 110 secs
lola: 37451813 markings, 78622574 edges, 229867 markings/sec, 115 secs
lola: 38548953 markings, 80925530 edges, 219428 markings/sec, 120 secs
lola: 39416415 markings, 82746517 edges, 173492 markings/sec, 125 secs
lola: 40269376 markings, 84537127 edges, 170592 markings/sec, 130 secs
lola: 41246538 markings, 86588480 edges, 195432 markings/sec, 135 secs
lola: 42325245 markings, 88852994 edges, 215741 markings/sec, 140 secs
lola: 43070332 markings, 90417150 edges, 149017 markings/sec, 145 secs
lola: 43940317 markings, 92243504 edges, 173997 markings/sec, 150 secs
lola: 44803803 markings, 94056209 edges, 172697 markings/sec, 155 secs
lola: 44902049 markings, 94262457 edges, 19649 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0)))))) AND A (G (A (F ((((p73 <= 0)) OR ((1 <= p69))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p235)) OR (((1 <= p58)) AND ((p77 <= 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 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0))))))
lola: processed formula length: 59
lola: 4 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 <= p235)) OR (((1 <= p58)) AND ((p77 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p73 <= 0)) OR ((1 <= p69)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p73)) AND ((p69 <= 0)))
lola: processed formula length: 31
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
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: (((p73 <= 0)) OR ((1 <= p69)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p73)) AND ((p69 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 1372 markings, 1372 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no yes unknown
lola:
preliminary result: yes no unknown no yes unknown
lola: memory consumption: 4060 KB
lola: time consumption: 579 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-030A"
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 ShieldRVt-PT-030A, 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 r211-tajo-159033478301035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030A.tgz
mv ShieldRVt-PT-030A 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;