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-158987853300476.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 ParamProductionCell-PT-1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-CTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591150880925

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:21:23] [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-03 02:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:21:23] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-06-03 02:21:23] [INFO ] Transformed 231 places.
[2020-06-03 02:21:23] [INFO ] Transformed 202 transitions.
[2020-06-03 02:21:23] [INFO ] Found NUPN structural information;
[2020-06-03 02:21:23] [INFO ] Parsed PT model containing 231 places and 202 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 432 ms. (steps per millisecond=231 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 202 rows 231 cols
[2020-06-03 02:21:23] [INFO ] Computed 59 place invariants in 27 ms
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using 35 positive place invariants in 72 ms returned sat
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 29 ms returned unsat
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned unsat
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2020-06-03 02:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:24] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2020-06-03 02:21:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-06-03 02:21:25] [INFO ] [Real]Added 68 Read/Feed constraints in 39 ms returned sat
[2020-06-03 02:21:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 61 ms returned sat
[2020-06-03 02:21:25] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:25] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-06-03 02:21:25] [INFO ] [Nat]Added 68 Read/Feed constraints in 40 ms returned sat
[2020-06-03 02:21:25] [INFO ] Deduced a trap composed of 5 places in 289 ms
[2020-06-03 02:21:25] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 7 places in 170 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 10 places in 162 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 14 places in 139 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 50 places in 84 ms
[2020-06-03 02:21:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1355 ms
[2020-06-03 02:21:26] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned unsat
[2020-06-03 02:21:26] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 02:21:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned unsat
[2020-06-03 02:21:27] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 02:21:27] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-06-03 02:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:27] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-06-03 02:21:27] [INFO ] [Real]Added 68 Read/Feed constraints in 21 ms returned sat
[2020-06-03 02:21:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2020-06-03 02:21:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:27] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2020-06-03 02:21:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2020-06-03 02:21:27] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-03 02:21:27] [INFO ] Deduced a trap composed of 10 places in 75 ms
[2020-06-03 02:21:27] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2020-06-03 02:21:27] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2020-06-03 02:21:28] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2020-06-03 02:21:28] [INFO ] Deduced a trap composed of 49 places in 60 ms
[2020-06-03 02:21:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 539 ms
[2020-06-03 02:21:28] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 02:21:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 02:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:28] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-03 02:21:28] [INFO ] [Real]Added 68 Read/Feed constraints in 56 ms returned sat
[2020-06-03 02:21:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-06-03 02:21:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:28] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-06-03 02:21:28] [INFO ] [Nat]Added 68 Read/Feed constraints in 22 ms returned sat
[2020-06-03 02:21:29] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2020-06-03 02:21:29] [INFO ] Deduced a trap composed of 11 places in 859 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 5 places in 100 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 10 places in 203 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 5 places in 98 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 7 places in 89 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 40 places in 51 ms
[2020-06-03 02:21:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1712 ms
[2020-06-03 02:21:30] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 02:21:30] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-03 02:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:30] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-06-03 02:21:30] [INFO ] [Real]Added 68 Read/Feed constraints in 25 ms returned sat
[2020-06-03 02:21:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 02:21:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2020-06-03 02:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:31] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2020-06-03 02:21:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 31 ms returned sat
[2020-06-03 02:21:31] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-06-03 02:21:31] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2020-06-03 02:21:31] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-06-03 02:21:32] [INFO ] Deduced a trap composed of 8 places in 836 ms
[2020-06-03 02:21:33] [INFO ] Deduced a trap composed of 29 places in 957 ms
[2020-06-03 02:21:33] [INFO ] Deduced a trap composed of 7 places in 130 ms
[2020-06-03 02:21:33] [INFO ] Deduced a trap composed of 10 places in 138 ms
[2020-06-03 02:21:34] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-06-03 02:21:34] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2020-06-03 02:21:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 2736 ms
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned unsat
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Real]Added 68 Read/Feed constraints in 35 ms returned sat
[2020-06-03 02:21:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:34] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2020-06-03 02:21:35] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-06-03 02:21:35] [INFO ] Deduced a trap composed of 5 places in 96 ms
[2020-06-03 02:21:35] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2020-06-03 02:21:35] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-06-03 02:21:36] [INFO ] Deduced a trap composed of 28 places in 1130 ms
[2020-06-03 02:21:36] [INFO ] Deduced a trap composed of 7 places in 92 ms
[2020-06-03 02:21:36] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2020-06-03 02:21:36] [INFO ] Deduced a trap composed of 24 places in 126 ms
[2020-06-03 02:21:37] [INFO ] Deduced a trap composed of 35 places in 83 ms
[2020-06-03 02:21:37] [INFO ] Deduced a trap composed of 11 places in 77 ms
[2020-06-03 02:21:37] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-06-03 02:21:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 2265 ms
[2020-06-03 02:21:37] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned unsat
[2020-06-03 02:21:37] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 02:21:37] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 6 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-06-03 02:21:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 02:21:37] [INFO ] Flatten gal took : 116 ms
[2020-06-03 02:21:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 02:21:37] [INFO ] Flatten gal took : 21 ms
FORMULA ParamProductionCell-PT-1-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:21:37] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 02:21:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ParamProductionCell-PT-1 @ 3570 seconds

FORMULA ParamProductionCell-PT-1-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ ParamProductionCell-PT-1

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 02:21:38 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(EG(((p117 <= 0) OR (p123 <= 0))))",
"processed_size": 37,
"rewrites": 19
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 11432,
"markings": 3966,
"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": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((AG(((1 <= p39) AND (1 <= p41) AND (1 <= p58))) AND EG(((1 <= p101) AND (1 <= p160)))))",
"processed_size": 90,
"rewrites": 20
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 522,
"markings": 260,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "EF(AX(((1 <= p62) AND (1 <= p70))))",
"processed_size": 35,
"rewrites": 19
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 9804,
"markings": 4570,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "((p97 <= 0) OR (p177 <= 0))",
"processed_size": 28,
"rewrites": 20
},
"result":
{
"edges": 96638,
"markings": 25632,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "((p9 <= 0) OR (p89 <= 0))",
"processed_size": 26,
"rewrites": 20
},
"result":
{
"edges": 131,
"markings": 132,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G (((p44 <= 0) OR (p51 <= 0))))",
"processed_size": 35,
"rewrites": 18
},
"result":
{
"edges": 275,
"markings": 274,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p40) AND (1 <= p41) AND (1 <= p49))",
"processed_size": 42,
"rewrites": 20
},
"result":
{
"edges": 27137,
"markings": 20684,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (G (((p18 <= 0) OR (p30 <= 0) OR ((1 <= p61) AND (1 <= p187) AND (1 <= p191)))))",
"processed_size": 84,
"rewrites": 18
},
"result":
{
"edges": 265,
"markings": 264,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "EG(AF(((1 <= p164) AND (1 <= p190))))",
"processed_size": 37,
"rewrites": 19
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 55149,
"markings": 15831,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG((EF(((p112 <= 0) OR (p117 <= 0) OR (p124 <= 0))) OR ((1 <= p65) AND (1 <= p67))))",
"processed_size": 86,
"rewrites": 19
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 122508,
"markings": 25632,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EF((AG((((1 <= p64) AND (1 <= p69)) OR ((1 <= p196) AND (1 <= p220)))) AND (((1 <= p198) AND (1 <= p213)) OR ((1 <= p113) AND (1 <= p114) AND (1 <= p141)))))",
"processed_size": 159,
"rewrites": 19
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 123278,
"markings": 25632,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"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": "(((p200 <= 0) OR (p229 <= 0)) R F (((1 <= p44) AND (1 <= p51))))",
"processed_size": 65,
"rewrites": 26
},
"result":
{
"edges": 927,
"markings": 597,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 34272,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(*)))) : A(X(E(G(**)))) : E(G(**)) : E(F((A(G(**)) AND **))) : E((** U E(G(**)))) : (A(F((A(G(**)) AND E(G(**))))) OR E(F(A(X(**))))) : A(F(DEADLOCK)) : E(G(*)) : A(F(**)) : E(G(A(F(**)))) : A(G(E(F(**)))) : A(G((E(F(**)) OR **))) : E(G(**))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "yes no no no no yes no no yes yes yes yes no ",
"value": "yes no no no no yes no no yes yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: NOT(E (F (A (G (((1 <= p97) AND (1 <= p177))))))) : A (X (E (G (((p117 <= 0) OR (p123 <= 0)))))) : E (G (E (G (((p18 <= 0) OR (p30 <= 0) OR ((1 <= p61) AND (1 <= p187) AND (1 <= p191))))))) : E (F ((A (G ((((1 <= p64) AND (1 <= p69)) OR ((1 <= p196) AND (1 <= p220))))) AND (((1 <= p198) AND (1 <= p213)) OR ((1 <= p113) AND (1 <= p114) AND (1 <= p141)))))) : E ((((1 <= p200) AND (1 <= p229)) U E (G (((p44 <= 0) OR (p51 <= 0)))))) : (A (F ((A (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND E (G (((1 <= p101) AND (1 <= p160))))))) OR E (((0 <= 0) U A (X (((1 <= p62) AND (1 <= p70))))))) : A (F (A (X ((1 <= 0))))) : NOT(A (F (((1 <= p117) AND (1 <= p123))))) : A (F (((1 <= p9) AND (1 <= p89)))) : E (G (A (F (A (F (((1 <= p164) AND (1 <= p190)))))))) : A (G (E (F (E (F (((1 <= p40) AND (1 <= p41) AND (1 <= p49)))))))) : A (G ((E (F (((p112 <= 0) OR (p117 <= 0) OR (p124 <= 0)))) OR ((1 <= p65) AND (1 <= p67))))) : E (G (E (((1 <= 0) U ((p44 <= 0) OR (p51 <= 0))))))
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:461
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:392
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
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 (X (E (G (((p117 <= 0) OR (p123 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p117 <= 0) OR (p123 <= 0))))
lola: processed formula length: 37
lola: 19 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 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: 3966 markings, 11432 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((A (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND E (G (((1 <= p101) AND (1 <= p160))))))) OR E (F (A (X (((1 <= p62) AND (1 <= p70)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND E (G (((1 <= p101) AND (1 <= p160)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((1 <= p39) AND (1 <= p41) AND (1 <= p58))) AND EG(((1 <= p101) AND (1 <= p160)))))
lola: processed formula length: 90
lola: 20 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 260 markings, 522 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p62) AND (1 <= p70))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p62) AND (1 <= p70))))
lola: processed formula length: 35
lola: 19 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4570 markings, 9804 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (DEADLOCK))
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:776
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 20 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 / 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: DEADLOCK
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 / EG
lola: The predicate does not eventually occur.
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p97 <= 0) OR (p177 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p97 <= 0) OR (p177 <= 0))
lola: processed formula length: 28
lola: 20 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
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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p97 <= 0) OR (p177 <= 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-3-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-1.sara.
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 <= p97) AND (1 <= p177))
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 CTLFireability-3-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 25632 markings, 96638 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p117 <= 0) OR (p123 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p117 <= 0) OR (p123 <= 0))))
lola: processed formula length: 37
lola: 18 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 / 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: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 <= p117) AND (1 <= p123))
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 CTLFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 147 markings, 146 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p9) AND (1 <= p89))))
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: ((p9 <= 0) OR (p89 <= 0))
lola: processed formula length: 26
lola: 20 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 / 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 <= p9) AND (1 <= p89))
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 eventually occurs.
lola: 132 markings, 131 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p44 <= 0) OR (p51 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p44 <= 0) OR (p51 <= 0))))
lola: processed formula length: 35
lola: 18 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 / 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 274 markings, 275 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p40) AND (1 <= p41) AND (1 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p40) AND (1 <= p41) AND (1 <= p49))
lola: processed formula length: 42
lola: 20 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p40 <= 0) OR (p41 <= 0) OR (p49 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
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: ((1 <= p40) AND (1 <= p41) AND (1 <= p49))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 20684 markings, 27137 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p18 <= 0) OR (p30 <= 0) OR ((1 <= p61) AND (1 <= p187) AND (1 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p18 <= 0) OR (p30 <= 0) OR ((1 <= p61) AND (1 <= p187) AND (1 <= p191)))))
lola: processed formula length: 84
lola: 18 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 / 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 <= p18) AND (1 <= p30) AND ((p61 <= 0) OR (p187 <= 0) OR (p191 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 264 markings, 265 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((1 <= p164) AND (1 <= p190))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((1 <= p164) AND (1 <= p190))))
lola: processed formula length: 37
lola: 19 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15831 markings, 55149 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (((p112 <= 0) OR (p117 <= 0) OR (p124 <= 0)))) OR ((1 <= p65) AND (1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF(((p112 <= 0) OR (p117 <= 0) OR (p124 <= 0))) OR ((1 <= p65) AND (1 <= p67))))
lola: processed formula length: 86
lola: 19 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 25632 markings, 122508 edges
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((((1 <= p64) AND (1 <= p69)) OR ((1 <= p196) AND (1 <= p220))))) AND (((1 <= p198) AND (1 <= p213)) OR ((1 <= p113) AND (1 <= p114) AND (1 <= p141))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((((1 <= p64) AND (1 <= p69)) OR ((1 <= p196) AND (1 <= p220)))) AND (((1 <= p198) AND (1 <= p213)) OR ((1 <= p113) AND (1 <= p114) AND (1 <= p141)))))
lola: processed formula length: 159
lola: 19 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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25632 markings, 123278 edges
lola: ========================================
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p200) AND (1 <= p229)) U E (G (((p44 <= 0) OR (p51 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p200 <= 0) OR (p229 <= 0)) R F (((1 <= p44) AND (1 <= p51))))
lola: processed formula length: 65
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 597 markings, 927 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no yes yes yes yes no
lola:
preliminary result: yes no no no no yes no no yes yes yes yes no
lola: memory consumption: 34272 KB
lola: time consumption: 4 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: 16427364 kB
MemFree: 193328 kB
After kill :
MemTotal: 16427364 kB
MemFree: 190208 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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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-158987853300476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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