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.r180-ebro-158987900300515.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 DLCround-PT-07a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900300515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 3.2K Mar 30 19:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 19:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 29 09:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 29 09:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 04:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 398K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-07a-CTLCardinality-00
FORMULA_NAME DLCround-PT-07a-CTLCardinality-01
FORMULA_NAME DLCround-PT-07a-CTLCardinality-02
FORMULA_NAME DLCround-PT-07a-CTLCardinality-03
FORMULA_NAME DLCround-PT-07a-CTLCardinality-04
FORMULA_NAME DLCround-PT-07a-CTLCardinality-05
FORMULA_NAME DLCround-PT-07a-CTLCardinality-06
FORMULA_NAME DLCround-PT-07a-CTLCardinality-07
FORMULA_NAME DLCround-PT-07a-CTLCardinality-08
FORMULA_NAME DLCround-PT-07a-CTLCardinality-09
FORMULA_NAME DLCround-PT-07a-CTLCardinality-10
FORMULA_NAME DLCround-PT-07a-CTLCardinality-11
FORMULA_NAME DLCround-PT-07a-CTLCardinality-12
FORMULA_NAME DLCround-PT-07a-CTLCardinality-13
FORMULA_NAME DLCround-PT-07a-CTLCardinality-14
FORMULA_NAME DLCround-PT-07a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591241254598

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:27:37] [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 03:27:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:27:38] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2020-06-04 03:27:38] [INFO ] Transformed 229 places.
[2020-06-04 03:27:38] [INFO ] Transformed 1597 transitions.
[2020-06-04 03:27:38] [INFO ] Found NUPN structural information;
[2020-06-04 03:27:38] [INFO ] Parsed PT model containing 229 places and 1597 transitions in 409 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 112 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1041 ms. (steps per millisecond=96 ) properties seen :[0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0]
[2020-06-04 03:27:39] [INFO ] Flow matrix only has 170 transitions (discarded 1267 similar events)
// Phase 1: matrix 170 rows 229 cols
[2020-06-04 03:27:39] [INFO ] Computed 132 place invariants in 18 ms
[2020-06-04 03:27:40] [INFO ] [Real]Absence check using 132 positive place invariants in 160 ms returned sat
[2020-06-04 03:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:40] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2020-06-04 03:27:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:40] [INFO ] [Nat]Absence check using 132 positive place invariants in 29 ms returned unsat
[2020-06-04 03:27:40] [INFO ] [Real]Absence check using 132 positive place invariants in 100 ms returned sat
[2020-06-04 03:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:41] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2020-06-04 03:27:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:41] [INFO ] [Nat]Absence check using 132 positive place invariants in 70 ms returned unsat
[2020-06-04 03:27:41] [INFO ] [Real]Absence check using 132 positive place invariants in 66 ms returned sat
[2020-06-04 03:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:41] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2020-06-04 03:27:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:42] [INFO ] [Nat]Absence check using 132 positive place invariants in 158 ms returned unsat
[2020-06-04 03:27:42] [INFO ] [Real]Absence check using 132 positive place invariants in 66 ms returned sat
[2020-06-04 03:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:42] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-06-04 03:27:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:42] [INFO ] [Nat]Absence check using 132 positive place invariants in 51 ms returned unsat
[2020-06-04 03:27:42] [INFO ] [Real]Absence check using 132 positive place invariants in 81 ms returned sat
[2020-06-04 03:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:43] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-04 03:27:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:43] [INFO ] [Nat]Absence check using 132 positive place invariants in 26 ms returned unsat
[2020-06-04 03:27:43] [INFO ] [Real]Absence check using 132 positive place invariants in 157 ms returned sat
[2020-06-04 03:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:44] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-06-04 03:27:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:44] [INFO ] [Nat]Absence check using 132 positive place invariants in 79 ms returned unsat
[2020-06-04 03:27:44] [INFO ] [Real]Absence check using 132 positive place invariants in 250 ms returned sat
[2020-06-04 03:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:45] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-06-04 03:27:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:45] [INFO ] [Nat]Absence check using 132 positive place invariants in 74 ms returned unsat
[2020-06-04 03:27:45] [INFO ] [Real]Absence check using 132 positive place invariants in 69 ms returned sat
[2020-06-04 03:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:45] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-06-04 03:27:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:45] [INFO ] [Nat]Absence check using 132 positive place invariants in 59 ms returned unsat
[2020-06-04 03:27:45] [INFO ] [Real]Absence check using 132 positive place invariants in 88 ms returned sat
[2020-06-04 03:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:46] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2020-06-04 03:27:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:46] [INFO ] [Nat]Absence check using 132 positive place invariants in 162 ms returned unsat
[2020-06-04 03:27:46] [INFO ] [Real]Absence check using 132 positive place invariants in 65 ms returned sat
[2020-06-04 03:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:47] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2020-06-04 03:27:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:47] [INFO ] [Nat]Absence check using 132 positive place invariants in 50 ms returned unsat
[2020-06-04 03:27:47] [INFO ] [Real]Absence check using 132 positive place invariants in 161 ms returned sat
[2020-06-04 03:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:27:47] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-06-04 03:27:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:27:48] [INFO ] [Nat]Absence check using 132 positive place invariants in 42 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-06-04 03:27:48] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-04 03:27:48] [INFO ] Flatten gal took : 244 ms
[2020-06-04 03:27:48] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-04 03:27:48] [INFO ] Flatten gal took : 129 ms
FORMULA DLCround-PT-07a-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:27:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-04 03:27:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DLCround-PT-07a @ 3570 seconds

FORMULA DLCround-PT-07a-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-07a-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-07a-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-07a-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ DLCround-PT-07a

{
"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",
"--safe",
"--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 03:27:49 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "EX(((1 <= p34)))",
"processed_size": 16,
"rewrites": 21
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p104 <= 0))))",
"processed_size": 21,
"rewrites": 22
},
"result":
{
"edges": 5,
"markings": 6,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "A (G (((p3 <= 0) OR (((1 <= p209)) AND ((p72 <= 0))))))",
"processed_size": 56,
"rewrites": 22
},
"result":
{
"edges": 5,
"markings": 6,
"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": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((DEADLOCK AND ((((1 <= p49)) AND ((p160 <= 0))) OR (((1 <= p46)) AND ((p86 <= 0)))))))",
"processed_size": 93,
"rewrites": 22
},
"result":
{
"edges": 148,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28628,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F((DEADLOCK AND **))) : (A(G(*)) AND (A(X(**)) OR E(X(**)))) : A(X(A(G(**))))"
},
"net":
{
"arcs": 5565,
"conflict_clusters": 22,
"places": 229,
"places_significant": 97,
"singleton_clusters": 0,
"transitions": 1437
},
"result":
{
"preliminary_value": "no no no yes ",
"value": "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: 1666/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 229
lola: finding significant places
lola: 229 places, 1437 transitions, 97 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: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: (A (((0 <= 0) U (1 <= 0))) OR A (G (((p3 <= 0) OR (((1 <= p209)) AND ((p72 <= 0))))))) : E (F ((A (X ((1 <= 0))) AND ((((1 <= p49)) AND ((p160 <= 0))) OR (((1 <= p46)) AND ((p86 <= 0))))))) : (NOT(E (((0 <= 0) U ((1 <= p104))))) AND (A (X ((((p60 <= 0)) OR ((1 <= p47))))) OR E (X (((1 <= p34)))))) : (A (G (A (X (((1 <= p199)))))) OR A (((0 <= 0) U (1 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p104 <= 0)))) AND (A (X ((((p60 <= 0)) OR ((1 <= p47))))) OR E (X (((1 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p34)))
lola: processed formula length: 16
lola: 21 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: subprocess 1 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p104 <= 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:788
lola: processed formula: A (G (((p104 <= 0))))
lola: processed formula length: 21
lola: 22 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p104))
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
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p199))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p199 <= 0))
lola: processed formula length: 13
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p199 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is invariant from successors.
lola: 1 markings, 0 edges
lola: subprocess 2 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3 <= 0) OR (((1 <= p209)) AND ((p72 <= 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 (((p3 <= 0) OR (((1 <= p209)) AND ((p72 <= 0))))))
lola: processed formula length: 56
lola: 22 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: ========================================
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 <= p3) AND (((p209 <= 0)) OR ((1 <= p72))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((DEADLOCK AND ((((1 <= p49)) AND ((p160 <= 0))) OR (((1 <= p46)) AND ((p86 <= 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: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: E (F ((DEADLOCK AND ((((1 <= p49)) AND ((p160 <= 0))) OR (((1 <= p46)) AND ((p86 <= 0)))))))
lola: processed formula length: 93
lola: 22 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: (DEADLOCK AND ((((1 <= p49)) AND ((p160 <= 0))) OR (((1 <= p46)) AND ((p86 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 11 markings, 148 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes
lola:
preliminary result: no no no yes
lola: memory consumption: 28628 KB
lola: time consumption: 5 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="DLCround-PT-07a"
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 DLCround-PT-07a, 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 r180-ebro-158987900300515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07a.tgz
mv DLCround-PT-07a 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 ;