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-159033476900067.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 ShieldIIPs-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.6K May 14 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 33K 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 ShieldIIPs-PT-002B-CTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591284231089

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:52] [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 15:23:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:52] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-04 15:23:52] [INFO ] Transformed 123 places.
[2020-06-04 15:23:52] [INFO ] Transformed 121 transitions.
[2020-06-04 15:23:52] [INFO ] Found NUPN structural information;
[2020-06-04 15:23:52] [INFO ] Parsed PT model containing 123 places and 121 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Incomplete random walk after 100000 steps, including 296 resets, run finished after 230 ms. (steps per millisecond=434 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 121 rows 123 cols
[2020-06-04 15:23:53] [INFO ] Computed 19 place invariants in 10 ms
[2020-06-04 15:23:53] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2020-06-04 15:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:53] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-04 15:23:53] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-06-04 15:23:53] [INFO ] Deduced a trap composed of 20 places in 73 ms
[2020-06-04 15:23:53] [INFO ] Deduced a trap composed of 16 places in 162 ms
[2020-06-04 15:23:53] [INFO ] Deduced a trap composed of 11 places in 43 ms
[2020-06-04 15:23:53] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2020-06-04 15:23:53] [INFO ] Deduced a trap composed of 18 places in 37 ms
[2020-06-04 15:23:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 537 ms
[2020-06-04 15:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2020-06-04 15:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:53] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 20 places in 33 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 17 places in 138 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 16 places in 32 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 11 places in 74 ms
[2020-06-04 15:23:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 361 ms
[2020-06-04 15:23:54] [INFO ] Computed and/alt/rep : 120/251/120 causal constraints in 7 ms.
[2020-06-04 15:23:54] [INFO ] Added : 90 causal constraints over 18 iterations in 180 ms. Result :unsat
[2020-06-04 15:23:54] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2020-06-04 15:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:54] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 14 places in 26 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 11 places in 78 ms
[2020-06-04 15:23:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2020-06-04 15:23:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2020-06-04 15:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:54] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 14 places in 29 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 18 places in 21 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 20 places in 19 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2020-06-04 15:23:54] [INFO ] Deduced a trap composed of 21 places in 17 ms
[2020-06-04 15:23:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 138 ms
[2020-06-04 15:23:54] [INFO ] Computed and/alt/rep : 120/251/120 causal constraints in 6 ms.
[2020-06-04 15:23:55] [INFO ] Added : 108 causal constraints over 23 iterations in 199 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 15:23:55] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 15:23:55] [INFO ] Flatten gal took : 54 ms
[2020-06-04 15:23:55] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 15:23:55] [INFO ] Flatten gal took : 13 ms
FORMULA ShieldIIPs-PT-002B-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:55] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 15:23:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldIIPs-PT-002B @ 3570 seconds

FORMULA ShieldIIPs-PT-002B-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002B-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLCardinality @ ShieldIIPs-PT-002B

{
"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 15:23:55 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p113 <= 0)) OR ((1 <= p75)))))",
"processed_size": 40,
"rewrites": 10
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (((p108 <= 0) OR (p88 <= 0) OR (((1 <= p88)) AND ((p41 <= 0))))))",
"processed_size": 72,
"rewrites": 10
},
"result":
{
"edges": 87,
"markings": 88,
"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"
},
"stateequation":
{
"literals": 3,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"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": "A (G ((((p40 <= 0)) OR ((1 <= p94)) OR ((1 <= p27)) OR ((p34 <= 0)) OR ((1 <= p29)))))",
"processed_size": 90,
"rewrites": 10
},
"result":
{
"edges": 49,
"markings": 50,
"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": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p46 <= 0))",
"processed_size": 12,
"rewrites": 11
},
"result":
{
"edges": 209,
"markings": 209,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((((p75 <= 0)) OR ((1 <= p103)))))",
"processed_size": 40,
"rewrites": 9
},
"result":
{
"edges": 288,
"markings": 288,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((p54 <= 0)) OR ((1 <= p64)))",
"processed_size": 31,
"rewrites": 11
},
"result":
{
"edges": 7770,
"markings": 6571,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (((((p95 <= 0)) OR ((1 <= p66))) AND (((p94 <= 0)) OR ((1 <= p40))))))",
"processed_size": 77,
"rewrites": 9
},
"result":
{
"edges": 698042,
"markings": 535417,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"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": "((((1 <= p90)) AND ((p72 <= 0))) OR (((1 <= p111)) AND ((p67 <= 0))))",
"processed_size": 70,
"rewrites": 12
},
"result":
{
"edges": 2740,
"markings": 2230,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 24948,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(**)) : A(F(**)) : A(F(*)) : E(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(A(G(**))))"
},
"net":
{
"arcs": 362,
"conflict_clusters": 87,
"places": 123,
"places_significant": 104,
"singleton_clusters": 0,
"transitions": 121
},
"result":
{
"preliminary_value": "no yes no yes no no no yes ",
"value": "no yes no yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 244/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3936
lola: finding significant places
lola: 123 places, 121 transitions, 104 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: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: (E (X ((1 <= 0))) OR E (G (((((p95 <= 0)) OR ((1 <= p66))) AND (((p94 <= 0)) OR ((1 <= p40))))))) : A (((0 <= 0) U (((1 <= p54)) AND ((p64 <= 0))))) : NOT(E (G (((p46 <= 0))))) : E (G ((((p75 <= 0)) OR ((1 <= p103))))) : A (G ((((p40 <= 0)) OR ((1 <= p94)) OR ((1 <= p27)) OR ((p34 <= 0)) OR ((1 <= p29))))) : A (G ((((p113 <= 0)) OR ((1 <= p75))))) : A (G (((p108 <= 0) OR (p88 <= 0) OR (((1 <= p88)) AND ((p41 <= 0)))))) : E (F (A (G (((((p90 <= 0)) OR ((1 <= p72))) AND (((p111 <= 0)) OR ((1 <= p67))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p113 <= 0)) OR ((1 <= p75)))))
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 ((((p113 <= 0)) OR ((1 <= p75)))))
lola: processed formula length: 40
lola: 10 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 <= p113)) AND ((p75 <= 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: 27 markings, 26 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p108 <= 0) OR (p88 <= 0) OR (((1 <= p88)) AND ((p41 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p108 <= 0) OR (p88 <= 0) OR (((1 <= p88)) AND ((p41 <= 0))))))
lola: processed formula length: 72
lola: 10 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: 88 markings, 87 edges
lola: formula 0: ((1 <= p108) AND (1 <= p88) AND (((p88 <= 0)) OR ((1 <= p41))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p40 <= 0)) OR ((1 <= p94)) OR ((1 <= p27)) OR ((p34 <= 0)) OR ((1 <= p29)))))
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 ((((p40 <= 0)) OR ((1 <= p94)) OR ((1 <= p27)) OR ((p34 <= 0)) OR ((1 <= p29)))))
lola: processed formula length: 90
lola: 10 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: 50 markings, 49 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p40)) AND ((p94 <= 0)) AND ((p27 <= 0)) AND ((1 <= p34)) AND ((p29 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p46 <= 0))
lola: processed formula length: 12
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 209 markings, 209 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p75 <= 0)) OR ((1 <= p103)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p75 <= 0)) OR ((1 <= p103)))))
lola: processed formula length: 40
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p75)) AND ((p103 <= 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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 288 markings, 288 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p54)) AND ((p64 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p54 <= 0)) OR ((1 <= p64)))
lola: processed formula length: 31
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p54)) AND ((p64 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 6571 markings, 7770 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((((p95 <= 0)) OR ((1 <= p66))) AND (((p94 <= 0)) OR ((1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((((p95 <= 0)) OR ((1 <= p66))) AND (((p94 <= 0)) OR ((1 <= p40))))))
lola: processed formula length: 77
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p95)) AND ((p66 <= 0))) OR (((1 <= p94)) AND ((p40 <= 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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 535417 markings, 698042 edges
lola: ========================================
lola: subprocess 7 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((((p90 <= 0)) OR ((1 <= p72))) AND (((p111 <= 0)) OR ((1 <= p67))))))))
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 <= p90)) AND ((p72 <= 0))) OR (((1 <= p111)) AND ((p67 <= 0))))
lola: processed formula length: 70
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
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 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 <= p90)) AND ((p72 <= 0))) OR (((1 <= p111)) AND ((p67 <= 0))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
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: ((((p90 <= 0)) OR ((1 <= p72))) AND (((p111 <= 0)) OR ((1 <= p67))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 2230 markings, 2740 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no yes
lola:
preliminary result: no yes no yes no no no yes
lola: memory consumption: 24948 KB
lola: time consumption: 4 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="ShieldIIPs-PT-002B"
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 ShieldIIPs-PT-002B, 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-159033476900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002B.tgz
mv ShieldIIPs-PT-002B 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 ;