Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928500436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 JoinFreeModules-PT-0100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928500436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 3.4K Apr 7 19:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 7 19:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 04:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 04:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 5 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 5 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 566K 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 JoinFreeModules-PT-0100-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591207830860

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:10:48] [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 18:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:10:49] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-06-03 18:10:49] [INFO ] Transformed 501 places.
[2020-06-03 18:10:49] [INFO ] Transformed 801 transitions.
[2020-06-03 18:10:49] [INFO ] Parsed PT model containing 501 places and 801 transitions in 232 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 44 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 922 ms. (steps per millisecond=108 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 801 rows 500 cols
[2020-06-03 18:10:50] [INFO ] Computed 100 place invariants in 17 ms
[2020-06-03 18:10:50] [INFO ] [Real]Absence check using 100 positive place invariants in 47 ms returned sat
[2020-06-03 18:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:10:51] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2020-06-03 18:10:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:10:52] [INFO ] [Nat]Absence check using 100 positive place invariants in 70 ms returned sat
[2020-06-03 18:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:11:03] [INFO ] [Nat]Absence check using state equation in 11380 ms returned sat
[2020-06-03 18:11:04] [INFO ] Deduced a trap composed of 3 places in 1314 ms
[2020-06-03 18:11:05] [INFO ] Deduced a trap composed of 3 places in 226 ms
[2020-06-03 18:11:05] [INFO ] Deduced a trap composed of 3 places in 71 ms
[2020-06-03 18:11:05] [INFO ] Deduced a trap composed of 3 places in 58 ms
[2020-06-03 18:11:05] [INFO ] Deduced a trap composed of 3 places in 256 ms
[2020-06-03 18:11:06] [INFO ] Deduced a trap composed of 3 places in 76 ms
[2020-06-03 18:11:06] [INFO ] Deduced a trap composed of 3 places in 45 ms
[2020-06-03 18:11:06] [INFO ] Deduced a trap composed of 3 places in 153 ms
[2020-06-03 18:11:06] [INFO ] Deduced a trap composed of 3 places in 48 ms
[2020-06-03 18:11:07] [INFO ] Deduced a trap composed of 3 places in 59 ms
[2020-06-03 18:11:07] [INFO ] Deduced a trap composed of 3 places in 74 ms
[2020-06-03 18:11:07] [INFO ] Deduced a trap composed of 3 places in 38 ms
[2020-06-03 18:11:07] [INFO ] Deduced a trap composed of 3 places in 356 ms
[2020-06-03 18:11:08] [INFO ] Deduced a trap composed of 3 places in 90 ms
[2020-06-03 18:11:08] [INFO ] Deduced a trap composed of 3 places in 51 ms
[2020-06-03 18:11:08] [INFO ] Deduced a trap composed of 3 places in 94 ms
[2020-06-03 18:11:08] [INFO ] Deduced a trap composed of 3 places in 48 ms
[2020-06-03 18:11:08] [INFO ] Deduced a trap composed of 3 places in 36 ms
[2020-06-03 18:11:08] [INFO ] Deduced a trap composed of 3 places in 108 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 64 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 45 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 57 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 53 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 48 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 16 ms
[2020-06-03 18:11:09] [INFO ] Deduced a trap composed of 3 places in 19 ms
[2020-06-03 18:11:10] [INFO ] Deduced a trap composed of 3 places in 26 ms
[2020-06-03 18:11:10] [INFO ] Deduced a trap composed of 3 places in 51 ms
[2020-06-03 18:11:10] [INFO ] Deduced a trap composed of 3 places in 26 ms
[2020-06-03 18:11:10] [INFO ] Deduced a trap composed of 3 places in 17 ms
[2020-06-03 18:11:11] [INFO ] Deduced a trap composed of 3 places in 17 ms
[2020-06-03 18:11:11] [INFO ] Deduced a trap composed of 3 places in 33 ms
[2020-06-03 18:11:11] [INFO ] Deduced a trap composed of 3 places in 89 ms
[2020-06-03 18:11:11] [INFO ] Deduced a trap composed of 3 places in 24 ms
[2020-06-03 18:11:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:11:12] [INFO ] Deduced a trap composed of 3 places in 209 ms
[2020-06-03 18:11:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s471 s472 s474) 0)") while checking expression at index 0
[2020-06-03 18:11:12] [INFO ] Flatten gal took : 71 ms
[2020-06-03 18:11:12] [INFO ] Flatten gal took : 29 ms
[2020-06-03 18:11:12] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 18:11:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0100 @ 3570 seconds

FORMULA JoinFreeModules-PT-0100-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2862
rslt: Output for CTLFireability @ JoinFreeModules-PT-0100

{
"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": "Wed Jun 3 18:11:15 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(EX((2 <= p231)))",
"processed_size": 19,
"rewrites": 29
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "CTL model checker",
"value": true
},
"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": 236
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(AF(AX((3 <= p235))))",
"processed_size": 23,
"rewrites": 30
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 301,
"markings": 301,
"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": 253
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p359 <= 4)))",
"processed_size": 19,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"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": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((2 <= p221) OR (3 <= p95) OR (2 <= p157) OR (3 <= p93))))",
"processed_size": 67,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(AX((p308 <= 3)) U ((2 <= p376) OR ((5 <= p319) AND (p406 <= 1))))",
"processed_size": 68,
"rewrites": 29
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((2 <= p337) OR (1 <= p257) OR (5 <= p369))))",
"processed_size": 53,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EF((p468 <= 3)) OR (((p298 <= 3) AND (p24 <= 4)) OR (p207 <= 1))))",
"processed_size": 70,
"rewrites": 29
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 604,
"markings": 302,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(((p32 <= 1) AND (((p22 <= 0) OR (p108 <= 2)) OR EG((4 <= p373)))))",
"processed_size": 70,
"rewrites": 29
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "CTL model checker",
"value": false
},
"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": 591
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"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": "E(AG((p28 <= 3)) U EG((p343 <= 2)))",
"processed_size": 35,
"rewrites": 30
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 303,
"markings": 302,
"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": 843
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 843
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p119 <= 4) AND (4 <= p453) AND (p330 <= 4) AND (2 <= p97) AND (4 <= p73))",
"processed_size": 75,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1125
},
"exit":
{
"localtimelimitreached": false
},
"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 (((2 <= p446) OR (2 <= p392))))",
"processed_size": 37,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1125
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"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": "G (((2 <= p217) U ((2 <= p427) AND (1 <= p147))))",
"processed_size": 49,
"rewrites": 29
},
"result":
{
"edges": 690923,
"markings": 427376,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1686
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p40)",
"processed_size": 10,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3195
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((p118 <= 2) OR (p480 <= 4) OR ((p198 <= 3) AND (p319 <= 4))) AND ((p178 <= 3) OR (p180 <= 4)) AND (p62 <= 1))",
"processed_size": 114,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p40)",
"processed_size": 10,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3756,
"runtime": 708.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : (E(G(**)) OR **) : E(G((E(F(*)) OR (* OR *)))) : E(F(**)) : A(G(A((** U **)))) : E(G(E(X(**)))) : (A(G(A(F(**)))) AND (A(G(A(F(**)))) AND A(F(**)))) : (E(F(A(G(**)))) OR (E(F(**)) AND **)) : A((E((** U **)) U (A(G(**)) AND (** AND (** AND **))))) : A(X(A(F(A(X(**)))))) : E((A(G(**)) U E(G(**)))) : A(F((** AND (** OR E(G(**)))))) : (E(G(*)) AND (E(G(**)) OR (A(X(**)) OR (E(F(**)) OR **)))) : E(G(**)) : E(G(*)) : A((A(X(*)) U **))"
},
"net":
{
"arcs": 2300,
"conflict_clusters": 401,
"places": 500,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 801
},
"result":
{
"preliminary_value": "yes yes yes yes no yes no unknown unknown no yes no yes yes yes no ",
"value": "yes yes yes yes no yes no unknown unknown no yes no 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: 1301/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16000
lola: finding significant places
lola: 500 places, 801 transitions, 400 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: E (F ((4 <= p143))) : (E (G (((2 <= p446) OR (2 <= p392)))) OR ((p119 <= 4) AND (4 <= p453) AND (p330 <= 4) AND (2 <= p97) AND (4 <= p73))) : NOT(A (F (((A (G ((4 <= p468))) AND ((4 <= p298) OR (5 <= p24))) AND (2 <= p207))))) : E (F ((4 <= p148))) : A (G (A (((2 <= p217) U ((2 <= p427) AND (1 <= p147)))))) : E (G (E (X ((2 <= p231))))) : (A (G ((A (F ((4 <= p268))) AND A (F ((3 <= p223)))))) AND A (F ((((3 <= p118) AND (5 <= p480) AND ((4 <= p198) OR (5 <= p319))) OR ((4 <= p178) AND (5 <= p180)) OR (2 <= p62))))) : (E (F (A (G (((3 <= p255) OR (5 <= p84)))))) OR (E (F (((3 <= p333) OR ((2 <= p106) AND (3 <= p138))))) AND (3 <= p40))) : A ((E (((2 <= p497) U (4 <= p358))) U (((A (G ((5 <= p349))) AND (2 <= p231)) AND (2 <= p402)) AND (2 <= p426)))) : A (X (A (F (A (X ((3 <= p235))))))) : E ((A (G ((p28 <= 3))) U E (G ((p343 <= 2))))) : A (F (((p32 <= 1) AND (((p22 <= 0) OR (p108 <= 2)) OR E (G ((4 <= p373))))))) : (NOT(A (F ((5 <= p359)))) AND (((E (G (((2 <= p221) OR (3 <= p95) OR (2 <= p157) OR (3 <= p93)))) OR A (X ((5 <= p64)))) OR E (F ((3 <= p318)))) OR ((5 <= p154) AND ((p460 <= 4) OR (5 <= p229))))) : E (G ((1 <= p12))) : NOT(A (F (((p337 <= 1) AND (p257 <= 0) AND (p369 <= 4))))) : A ((NOT(E (X ((4 <= p308)))) U ((2 <= p376) OR ((5 <= p319) AND (p406 <= 1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((2 <= p231)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((2 <= p231)))
lola: processed formula length: 19
lola: 29 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: 302 markings, 302 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (A (X ((3 <= p235)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AF(AX((3 <= p235))))
lola: processed formula length: 23
lola: 30 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: 301 markings, 301 edges
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p359 <= 4))) AND (E (G (((2 <= p221) OR (3 <= p95) OR (2 <= p157) OR (3 <= p93)))) OR (A (X ((5 <= p64))) OR (E (F ((3 <= p318))) OR ((5 <= p154) AND ((p460 <= 4) OR (5 <= p229)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p359 <= 4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p359 <= 4)))
lola: processed formula length: 19
lola: 28 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p359)
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p221) OR (3 <= p95) OR (2 <= p157) OR (3 <= p93))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p221) OR (3 <= p95) OR (2 <= p157) OR (3 <= p93))))
lola: processed formula length: 67
lola: 28 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: ((p221 <= 1) AND (p95 <= 2) AND (p157 <= 1) AND (p93 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p308 <= 3))) U ((2 <= p376) OR ((5 <= p319) AND (p406 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AX((p308 <= 3)) U ((2 <= p376) OR ((5 <= p319) AND (p406 <= 1))))
lola: processed formula length: 68
lola: 29 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: 302 markings, 302 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((4 <= p143)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((4 <= p143)))
lola: processed formula length: 19
lola: 28 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p143)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: ========================================
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((4 <= p148)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((4 <= p148)))
lola: processed formula length: 19
lola: 28 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p148)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p12)))
lola: processed formula length: 18
lola: 28 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: (p12 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-6-0.sara.
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p337) OR (1 <= p257) OR (5 <= p369))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p337) OR (1 <= p257) OR (5 <= p369))))
lola: processed formula length: 53
lola: 28 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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
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: ((p337 <= 1) AND (p257 <= 0) AND (p369 <= 4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p468 <= 3))) OR (((p298 <= 3) AND (p24 <= 4)) OR (p207 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((p468 <= 3)) OR (((p298 <= 3) AND (p24 <= 4)) OR (p207 <= 1))))
lola: processed formula length: 70
lola: 29 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: 302 markings, 604 edges
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p32 <= 1) AND (((p22 <= 0) OR (p108 <= 2)) OR E (G ((4 <= p373)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((p32 <= 1) AND (((p22 <= 0) OR (p108 <= 2)) OR EG((4 <= p373)))))
lola: processed formula length: 70
lola: 29 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: 302 markings, 302 edges
lola: ========================================
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p28 <= 3))) U E (G ((p343 <= 2)))))
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:809
lola: processed formula: E(AG((p28 <= 3)) U EG((p343 <= 2)))
lola: processed formula length: 35
lola: 30 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 302 markings, 303 edges
lola: ========================================
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (((2 <= p497) U (4 <= p358))) U (A (G ((5 <= p349))) AND ((2 <= p231) AND ((2 <= p402) AND (2 <= p426))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(E((2 <= p497) U (4 <= p358)) U (AG((5 <= p349)) AND ((2 <= p231) AND ((2 <= p402) AND (2 <= p426)))))
lola: processed formula length: 103
lola: 30 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).
sara: place or transition ordering is non-deterministic

lola: 1082067 markings, 1540686 edges, 216413 markings/sec, 0 secs
lola: 2115603 markings, 3012619 edges, 206707 markings/sec, 5 secs
lola: 3179868 markings, 4528164 edges, 212853 markings/sec, 10 secs
lola: 4236371 markings, 6032779 edges, 211301 markings/sec, 15 secs
lola: 5281506 markings, 7521168 edges, 209027 markings/sec, 20 secs
lola: 6290595 markings, 8958184 edges, 201818 markings/sec, 25 secs
lola: 7319034 markings, 10422831 edges, 205688 markings/sec, 30 secs
lola: 8342122 markings, 11879882 edges, 204618 markings/sec, 35 secs
lola: 9363121 markings, 13333972 edges, 204200 markings/sec, 40 secs
lola: 10375302 markings, 14775291 edges, 202436 markings/sec, 45 secs
lola: 11403933 markings, 16240178 edges, 205726 markings/sec, 50 secs
lola: 12413988 markings, 17678682 edges, 202011 markings/sec, 55 secs
lola: 13445585 markings, 19147740 edges, 206319 markings/sec, 60 secs
lola: 14458465 markings, 20590245 edges, 202576 markings/sec, 65 secs
lola: 15496825 markings, 22068926 edges, 207672 markings/sec, 70 secs
lola: 16548302 markings, 23566412 edges, 210295 markings/sec, 75 secs
lola: 16924853 markings, 24105217 edges, 75310 markings/sec, 80 secs
lola: 17109495 markings, 24365560 edges, 36928 markings/sec, 85 secs
lola: 17228992 markings, 24535689 edges, 23899 markings/sec, 90 secs
lola: 17435817 markings, 24830291 edges, 41365 markings/sec, 95 secs
lola: 17565422 markings, 25014813 edges, 25921 markings/sec, 100 secs
lola: 17745299 markings, 25271029 edges, 35975 markings/sec, 105 secs
lola: 17875726 markings, 25456770 edges, 26085 markings/sec, 110 secs
lola: 18062258 markings, 25722426 edges, 37306 markings/sec, 115 secs
lola: 18326486 markings, 26098649 edges, 52846 markings/sec, 120 secs
lola: 18564678 markings, 26437814 edges, 47638 markings/sec, 125 secs
lola: 18719735 markings, 26658672 edges, 31011 markings/sec, 130 secs
lola: 18960377 markings, 27001364 edges, 48128 markings/sec, 135 secs
lola: 19152834 markings, 27275474 edges, 38491 markings/sec, 140 secs
lola: 19519885 markings, 27798293 edges, 73410 markings/sec, 145 secs
lola: 19762577 markings, 28143848 edges, 48538 markings/sec, 150 secs
lola: 20352865 markings, 28984475 edges, 118058 markings/sec, 155 secs
lola: 20907912 markings, 29774970 edges, 111009 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((2 <= p446) OR (2 <= p392)))) OR ((p119 <= 4) AND (4 <= p453) AND (p330 <= 4) AND (2 <= p97) AND (4 <= p73)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p119 <= 4) AND (4 <= p453) AND (p330 <= 4) AND (2 <= p97) AND (4 <= p73))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p119 <= 4) AND (4 <= p453) AND (p330 <= 4) AND (2 <= p97) AND (4 <= p73))
lola: processed formula length: 75
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p446) OR (2 <= p392))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p446) OR (2 <= p392))))
lola: processed formula length: 37
lola: 28 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: ((p446 <= 1) AND (p392 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: ========================================
lola: subprocess 13 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= p217) U ((2 <= p427) AND (1 <= p147))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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: G (((2 <= p217) U ((2 <= p427) AND (1 <= p147))))
lola: processed formula length: 49
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 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 universal single path CTL formula does not hold.
lola: 427376 markings, 690923 edges
lola: ========================================
lola: subprocess 14 will run for 1686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((3 <= p255) OR (5 <= p84)))))) OR (E (F (((3 <= p333) OR ((2 <= p106) AND (3 <= p138))))) AND (3 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p40)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p40)
lola: processed formula length: 10
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= p255) OR (5 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p255 <= 2) AND (p84 <= 4))
lola: processed formula length: 28
lola: 31 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p255) OR (5 <= p84))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p255 <= 2) AND (p84 <= 4))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
sara: try reading problem file CTLFireability-15-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 924583 markings, 1316349 edges, 184917 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1966534 markings, 2800230 edges, 208390 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2993155 markings, 4262365 edges, 205324 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4014403 markings, 5716615 edges, 204250 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5029467 markings, 7162302 edges, 203013 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6043301 markings, 8606116 edges, 202767 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7076820 markings, 10077797 edges, 206704 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8106233 markings, 11543989 edges, 205883 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9120032 markings, 12987660 edges, 202760 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10138166 markings, 14437577 edges, 203627 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11161954 markings, 15895668 edges, 204758 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12172418 markings, 17334650 edges, 202093 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13201888 markings, 18800650 edges, 205894 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14217494 markings, 20246975 edges, 203121 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15234197 markings, 21694902 edges, 203341 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16244826 markings, 23134121 edges, 202126 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17268303 markings, 24591648 edges, 204695 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 17826948 markings, 25387340 edges, 111729 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 18241220 markings, 25977314 edges, 82854 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 18420732 markings, 26232891 edges, 35902 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 18665931 markings, 26582019 edges, 49040 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 18865677 markings, 26866601 edges, 39949 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 19151154 markings, 27273133 edges, 57095 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 19466273 markings, 27721894 edges, 63024 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 19734017 markings, 28103183 edges, 53549 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 19960606 markings, 28425865 edges, 45318 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 20136163 markings, 28675877 edges, 35111 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 20299575 markings, 28908533 edges, 32682 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 20497282 markings, 29190154 edges, 39541 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 20654158 markings, 29413590 edges, 31375 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 20827677 markings, 29660732 edges, 34704 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 20996092 markings, 29900467 edges, 33683 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 21244560 markings, 30254337 edges, 49694 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 21496352 markings, 30612938 edges, 50358 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 21777865 markings, 31013970 edges, 56303 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((4 <= p268))))) AND (A (G (A (F ((3 <= p223))))) AND A (F ((((3 <= p118) AND (5 <= p480) AND ((4 <= p198) OR (5 <= p319))) OR ((4 <= p178) AND (5 <= p180)) OR (2 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((3 <= p118) AND (5 <= p480) AND ((4 <= p198) OR (5 <= p319))) OR ((4 <= p178) AND (5 <= p180)) OR (2 <= p62))))
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: (((p118 <= 2) OR (p480 <= 4) OR ((p198 <= 3) AND (p319 <= 4))) AND ((p178 <= 3) OR (p180 <= 4)) AND (p62 <= 1))
lola: processed formula length: 114
lola: 30 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: (((3 <= p118) AND (5 <= p480) AND ((4 <= p198) OR (5 <= p319))) OR ((4 <= p178) AND (5 <= p180)) OR (2 <= p62))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((4 <= p268)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p268 <= 3)
lola: processed formula length: 11
lola: 31 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p268)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p268 <= 3)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: ========================================
lola: state equation: calling and running sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((E (((2 <= p497) U (4 <= p358))) U (A (G ((5 <= p349))) AND ((2 <= p231) AND ((2 <= p402) AND (2 <= p426))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
sara: try reading problem file CTLFireability-17-1.sara.
lola: processed formula: A(E((2 <= p497) U (4 <= p358)) U (AG((5 <= p349)) AND ((2 <= p231) AND ((2 <= p402) AND (2 <= p426)))))
lola: processed formula length: 103
lola: 30 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).
sara: place or transition ordering is non-deterministic

lola: 992978 markings, 1413846 edges, 198596 markings/sec, 0 secs
lola: 2048884 markings, 2917549 edges, 211181 markings/sec, 5 secs
lola: 3089859 markings, 4400022 edges, 208195 markings/sec, 10 secs
lola: 4106926 markings, 5848370 edges, 203413 markings/sec, 15 secs
lola: 5115876 markings, 7285312 edges, 201790 markings/sec, 20 secs
lola: 6140415 markings, 8744341 edges, 204908 markings/sec, 25 secs
lola: 7156300 markings, 10191023 edges, 203177 markings/sec, 30 secs
lola: 8184235 markings, 11655008 edges, 205587 markings/sec, 35 secs
lola: 9219260 markings, 13128964 edges, 207005 markings/sec, 40 secs
lola: 10259137 markings, 14609882 edges, 207975 markings/sec, 45 secs
lola: 11300013 markings, 16092232 edges, 208175 markings/sec, 50 secs
lola: 12345606 markings, 17581235 edges, 209119 markings/sec, 55 secs
lola: 13372383 markings, 19043521 edges, 205355 markings/sec, 60 secs
lola: 14430333 markings, 20550107 edges, 211590 markings/sec, 65 secs
lola: 15463137 markings, 22020961 edges, 206561 markings/sec, 70 secs
lola: 16527875 markings, 23537316 edges, 212948 markings/sec, 75 secs
lola: 17040143 markings, 24266796 edges, 102454 markings/sec, 80 secs
lola: 17414904 markings, 24803971 edges, 74952 markings/sec, 85 secs
lola: 18080513 markings, 25748859 edges, 133122 markings/sec, 90 secs
lola: 18273500 markings, 26023184 edges, 38597 markings/sec, 95 secs
lola: 18579515 markings, 26458943 edges, 61203 markings/sec, 100 secs
lola: 18874814 markings, 26879537 edges, 59060 markings/sec, 105 secs
lola: 19099532 markings, 27199638 edges, 44944 markings/sec, 110 secs
lola: 19300096 markings, 27485306 edges, 40113 markings/sec, 115 secs
lola: 19575631 markings, 27877678 edges, 55107 markings/sec, 120 secs
lola: 19718601 markings, 28081219 edges, 28594 markings/sec, 125 secs
lola: 19965305 markings, 28432555 edges, 49341 markings/sec, 130 secs
lola: 20111607 markings, 28640935 edges, 29260 markings/sec, 135 secs
lola: 20360147 markings, 28994784 edges, 49708 markings/sec, 140 secs
lola: 20528111 markings, 29233975 edges, 33593 markings/sec, 145 secs
lola: 20625172 markings, 29372307 edges, 19412 markings/sec, 150 secs
lola: 20877314 markings, 29731411 edges, 50428 markings/sec, 155 secs
lola: 21037053 markings, 29958853 edges, 31948 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((3 <= p255) OR (5 <= p84)))))) OR (E (F (((3 <= p333) OR ((2 <= p106) AND (3 <= p138))))) AND (3 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p40)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p40)
lola: processed formula length: 10
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= p255) OR (5 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p255 <= 2) AND (p84 <= 4))
lola: processed formula length: 28
lola: 31 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p255) OR (5 <= p84))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p255 <= 2) AND (p84 <= 4))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-1.sara
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-18-0.sara.
sara: try reading problem file CTLFireability-18-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 951169 markings, 1354226 edges, 190234 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1919713 markings, 2733584 edges, 193709 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2949690 markings, 4200399 edges, 205995 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3980607 markings, 5668568 edges, 206183 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4985690 markings, 7099948 edges, 201017 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6000178 markings, 8544657 edges, 202898 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7013864 markings, 9988237 edges, 202737 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8029733 markings, 11434971 edges, 203174 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9034924 markings, 12866428 edges, 201038 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10057896 markings, 14323231 edges, 204594 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11071930 markings, 15767386 edges, 202807 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12096982 markings, 17227212 edges, 205010 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13130509 markings, 18699011 edges, 206705 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14143925 markings, 20142169 edges, 202683 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15158038 markings, 21586468 edges, 202823 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16169947 markings, 23027474 edges, 202382 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17173617 markings, 24456834 edges, 200734 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 17816606 markings, 25372559 edges, 128598 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 18292188 markings, 26049878 edges, 95116 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 18671280 markings, 26589674 edges, 75818 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 19235727 markings, 27393582 edges, 112889 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 19528582 markings, 27810631 edges, 58571 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 19908735 markings, 28351945 edges, 76031 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 20088643 markings, 28608150 edges, 35982 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 20410523 markings, 29066539 edges, 64376 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 20670412 markings, 29436728 edges, 51978 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 20883857 markings, 29740633 edges, 42689 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 21149860 markings, 30119460 edges, 53201 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 21468643 markings, 30573398 edges, 63757 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 21808146 markings, 31056971 edges, 67901 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no unknown unknown no yes no yes yes yes no
lola:
preliminary result: yes yes yes yes no yes no unknown unknown no yes no yes yes yes no
lola: memory consumption: 3756 KB
lola: time consumption: 708 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0100"
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 JoinFreeModules-PT-0100, 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 r184-oct2-158987928500436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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