Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700084.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is MAPK-PT-10240, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.2K Apr 8 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 16:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-10240-CTLFireability-00
FORMULA_NAME MAPK-PT-10240-CTLFireability-01
FORMULA_NAME MAPK-PT-10240-CTLFireability-02
FORMULA_NAME MAPK-PT-10240-CTLFireability-03
FORMULA_NAME MAPK-PT-10240-CTLFireability-04
FORMULA_NAME MAPK-PT-10240-CTLFireability-05
FORMULA_NAME MAPK-PT-10240-CTLFireability-06
FORMULA_NAME MAPK-PT-10240-CTLFireability-07
FORMULA_NAME MAPK-PT-10240-CTLFireability-08
FORMULA_NAME MAPK-PT-10240-CTLFireability-09
FORMULA_NAME MAPK-PT-10240-CTLFireability-10
FORMULA_NAME MAPK-PT-10240-CTLFireability-11
FORMULA_NAME MAPK-PT-10240-CTLFireability-12
FORMULA_NAME MAPK-PT-10240-CTLFireability-13
FORMULA_NAME MAPK-PT-10240-CTLFireability-14
FORMULA_NAME MAPK-PT-10240-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591129721826

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:28:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:28:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:28:44] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2020-06-02 20:28:44] [INFO ] Transformed 22 places.
[2020-06-02 20:28:44] [INFO ] Transformed 30 transitions.
[2020-06-02 20:28:44] [INFO ] Parsed PT model containing 22 places and 30 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 102434 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=1164 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 20:28:44] [INFO ] Computed 7 place invariants in 6 ms
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 11 ms.
[2020-06-02 20:28:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 25 ms.
[2020-06-02 20:28:45] [INFO ] Added : 26 causal constraints over 6 iterations in 110 ms. Result :sat
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 7 ms.
[2020-06-02 20:28:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:45] [INFO ] Added : 26 causal constraints over 6 iterations in 139 ms. Result :sat
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 36 ms.
[2020-06-02 20:28:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:45] [INFO ] Added : 25 causal constraints over 6 iterations in 43 ms. Result :sat
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:45] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-02 20:28:45] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:46] [INFO ] Added : 25 causal constraints over 5 iterations in 26 ms. Result :sat
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:46] [INFO ] Added : 25 causal constraints over 7 iterations in 86 ms. Result :sat
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:46] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 23 ms.
[2020-06-02 20:28:46] [INFO ] Added : 26 causal constraints over 6 iterations in 69 ms. Result :sat
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:46] [INFO ] Added : 26 causal constraints over 6 iterations in 46 ms. Result :sat
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 20:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-02 20:28:46] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:47] [INFO ] Added : 23 causal constraints over 6 iterations in 131 ms. Result :sat
[2020-06-02 20:28:47] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-02 20:28:47] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-02 20:28:47] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:47] [INFO ] Added : 26 causal constraints over 6 iterations in 41 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 20:28:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 20:28:47] [INFO ] Flatten gal took : 34 ms
[2020-06-02 20:28:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 20:28:47] [INFO ] Flatten gal took : 8 ms
FORMULA MAPK-PT-10240-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:47] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2020-06-02 20:28:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ MAPK-PT-10240 @ 3570 seconds

FORMULA MAPK-PT-10240-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ MAPK-PT-10240

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:28:47 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p3 <= 0) OR (p16 <= 0))",
"processed_size": 26,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (((p19 <= 0) R (p14 <= 0)))",
"processed_size": 29,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p20 <= 0) OR (p21 <= 0))",
"processed_size": 27,
"rewrites": 32
},
"result":
{
"edges": 2564,
"markings": 2564,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 26232,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A((* R *)) AND (E(F(E(G(*)))) AND (** OR A(X(*))))) : (A(G((E(X(**)) OR (** OR **)))) OR **) : E(F((A(G(*)) AND A(X(**))))) : A(G(E(F(*)))) : E(F(A(G(**)))) : E(F(A(G(**)))) : E(F(A(G(**)))) : E((** U E(X(**)))) : ((** OR (A(X(**)) OR **)) AND (E(G(**)) OR A(G(*)))) : E(F(A(G(**)))) : E(F((** AND E(X(**))))) : (** OR (E(F(**)) OR (A(G(**)) OR **))) : E(X(A((** U **))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"interim_value": "yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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 CTLFireability.xml
lola: ((NOT(E (((1 <= p19) U (1 <= p14)))) AND NOT(A (G (A (F (((1 <= p20) AND (1 <= p21)))))))) AND (((p3 <= 0) OR (p16 <= 0)) OR NOT(E (X ((1 <= p17)))))) : (A (G (((E (X (((1 <= p10) AND (1 <= p16)))) OR ((1 <= p18) AND (1 <= p6) AND (1 <= p9))) OR (p18 <= 0)))) OR ((1 <= p2) AND (1 <= p16))) : E (F ((NOT(E (F ((1 <= p1)))) AND A (X (((1 <= p6) AND (1 <= p9) AND (1 <= p5))))))) : NOT(E (F (A (G (((1 <= p13) OR (1 <= p17))))))) : E (F (A (G (((1 <= p8) AND (1 <= p10)))))) : E (F (A (G ((1 <= p14))))) : E (F (A (G ((((1 <= p7) AND (1 <= p8) AND (1 <= p5)) OR ((1 <= p19) AND (1 <= p6) AND (1 <= p7))))))) : E ((((p4 <= 0) AND (p18 <= 0)) U E (X ((1 <= p0))))) : ((((1 <= p1) OR A (X (((1 <= p13))))) OR ((1 <= p17) AND ((1 <= p12) OR (p7 <= 0) OR (p15 <= 0)))) AND (E (G ((((1 <= p10) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p11))))) OR NOT(E (F (((p20 <= 0) OR (p21 <= 0))))))) : E (F (A (G ((1 <= p19))))) : E (F ((((1 <= p4) AND (1 <= p12)) AND E (X ((1 <= p4)))))) : ((((1 <= p19) OR E (F (((1 <= p19) OR (1 <= p0))))) OR A (G ((1 <= p19)))) OR ((1 <= p13) AND (p4 <= 0) AND (p14 <= 0))) : E (X (A (((1 <= p18) U ((1 <= p6) AND (1 <= p7) AND (1 <= p4))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p19 <= 0) R (p14 <= 0))) AND (E (F (E (G (((p20 <= 0) OR (p21 <= 0)))))) AND (((p3 <= 0) OR (p16 <= 0)) OR A (X ((p17 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3 <= 0) OR (p16 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 <= 0) OR (p16 <= 0))
lola: processed formula length: 26
lola: 29 rewrites
lola: closed formula file CTLFireability.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 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p19 <= 0) R (p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p19 <= 0) R (p14 <= 0)))
lola: processed formula length: 29
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
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: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: formula 0: (1 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p20 <= 0) OR (p21 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((p20 <= 0) OR (p21 <= 0))
lola: processed formula length: 27
lola: 32 rewrites
lola: closed formula file CTLFireability.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: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 <= p20) AND (1 <= p21))
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 /EFEG
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p20 <= 0) OR (p21 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: The predicate is possibly preserved from a reachable marking.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-1.sara.
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.

lola: 2564 markings, 2564 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((E (X (((1 <= p10) AND (1 <= p16)))) OR (((1 <= p18) AND (1 <= p6) AND (1 <= p9)) OR (p18 <= 0))))) OR ((1 <= p2) AND (1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 26232 KB
lola: time consumption: 301 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 26232 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16123680 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16123696 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-10240"
export BK_EXAMINATION="CTLFireability"
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 MAPK-PT-10240, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987852700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-10240.tgz
mv MAPK-PT-10240 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;