fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987881900092
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DNAwalker-PT-02track12Block2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.920 3600000.00 85780.00 83.70 FFTFTFFTFTTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900092.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DNAwalker-PT-02track12Block2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K Mar 31 04:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 04:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 20:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 20:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 06:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 16 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 37K 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 DNAwalker-PT-02track12Block2-CTLFireability-00
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-01
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-02
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-03
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-04
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-05
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-06
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-07
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-08
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-09
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-10
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-11
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-12
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-13
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-14
FORMULA_NAME DNAwalker-PT-02track12Block2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591203040639

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:50:42] [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 16:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:50:42] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2020-06-03 16:50:42] [INFO ] Transformed 14 places.
[2020-06-03 16:50:42] [INFO ] Transformed 84 transitions.
[2020-06-03 16:50:42] [INFO ] Parsed PT model containing 14 places and 84 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Incomplete random walk after 100000 steps, including 11167 resets, run finished after 214 ms. (steps per millisecond=467 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
[2020-06-03 16:50:42] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 14 cols
[2020-06-03 16:50:42] [INFO ] Computed 0 place invariants in 3 ms
[2020-06-03 16:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-03 16:50:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Nat]Absence check using state equation in 38 ms returned unsat
[2020-06-03 16:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-03 16:50:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Nat]Absence check using state equation in 32 ms returned unsat
[2020-06-03 16:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-03 16:50:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
[2020-06-03 16:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:42] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-03 16:50:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:43] [INFO ] [Nat]Absence check using state equation in 29 ms returned unsat
[2020-06-03 16:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:43] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-03 16:50:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:43] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
[2020-06-03 16:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:43] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2020-06-03 16:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:43] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 16:50:43] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 16:50:43] [INFO ] Flatten gal took : 28 ms
[2020-06-03 16:50:43] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 16:50:43] [INFO ] Flatten gal took : 8 ms
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-02track12Block2-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:50:43] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-03 16:50:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DNAwalker-PT-02track12Block2 @ 3570 seconds

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-02track12Block2-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3492
rslt: Output for CTLFireability @ DNAwalker-PT-02track12Block2

{
"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 16:50:43 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "EG(EX(((p5 <= 0) OR (p3 <= 0) OR (p10 <= 1))))",
"processed_size": 48,
"rewrites": 9
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 3,
"markings": 3,
"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": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(EX(((p1 <= 0) OR (p4 <= 1))) U AG(((p3 <= 1) OR (p6 <= 0))))",
"processed_size": 64,
"rewrites": 10
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 27064,
"markings": 5459,
"produced_by": "CTL model checker",
"value": true
},
"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": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"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": 6,
"visible_transitions": 0
},
"processed": "((((p10 <= 1) OR (p12 <= 0)) AND ((p2 <= 1) OR (p4 <= 0))) OR ((p5 <= 0) AND ((p0 <= 1) OR (p10 <= 0))))",
"processed_size": 108,
"rewrites": 10
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 38
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 4
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G (NOT DEADLOCK))",
"processed_size": 20,
"rewrites": 8
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 84
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 498
},
"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 <= p5)))",
"processed_size": 17,
"rewrites": 8
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 582
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((2 <= p3) AND (1 <= p10))",
"processed_size": 26,
"rewrites": 10
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 698
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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(EF(((1 <= p11) AND (2 <= p12))) U AG(((2 <= p1) AND (1 <= p3))))",
"processed_size": 66,
"rewrites": 10
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 27943,
"markings": 5459,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A(EF(((2 <= p1) AND (1 <= p6))) U E(((1 <= p2) AND (2 <= p8)) U ((2 <= p3) AND (1 <= p6))))",
"processed_size": 91,
"rewrites": 10
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 110,
"markings": 50,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1164
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AF((EG(((2 <= p11))) AND (EF(((p3 <= 1) OR (p8 <= 0))) AND ((p1 <= 1) OR (p11 <= 0) OR ((2 <= p3) AND (1 <= p10)) OR ((1 <= p2) AND (2 <= p12))))))",
"processed_size": 151,
"rewrites": 10
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 3,
"produced_by": "CTL model checker",
"value": false
},
"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": 1746
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "(F (((p3 <= 0) OR (p11 <= 1))) U ((1 <= p8) AND (2 <= p10) AND (p3 <= 1)))",
"processed_size": 75,
"rewrites": 9
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 3492
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3492
},
"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": "((p2 <= 1) OR (p8 <= 0))",
"processed_size": 25,
"rewrites": 10
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 27
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25840,
"runtime": 78.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : E(G(E(X(**)))) : (A(F(**)) AND A(F(**))) : A((E(F(**)) U E((** U **)))) : A((E(X(**)) U A(G(**)))) : E(G(NODEADLOCK)) : A(X(A(F(**)))) : A((A(F(*)) U **)) : E(G(**)) : E((E(F(**)) U A(G(**)))) : A(F((E(G(**)) AND (E(F(**)) AND **))))"
},
"net":
{
"arcs": 244,
"conflict_clusters": 3,
"places": 14,
"places_significant": 14,
"singleton_clusters": 0,
"transitions": 84
},
"result":
{
"preliminary_value": "no yes no no yes yes no no yes no no ",
"value": "no yes no no yes yes no no yes no 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: 98/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 84 transitions, 14 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: atomic prop true by contained trap!
lola: A (G (E (G (E (F (((2 <= p3) AND (1 <= p10)))))))) : E (G (E (X (((p5 <= 0) OR (p3 <= 0) OR (p10 <= 1)))))) : (A (F (((((1 <= p2) AND (2 <= p12) AND (1 <= p3) AND (2 <= p10)) OR ((2 <= p2) AND (1 <= p3))) AND ((p7 <= 0) OR ((2 <= p1) AND (1 <= p4)))))) AND A (F (((2 <= p2) AND (1 <= p8))))) : A ((E (F (((2 <= p1) AND (1 <= p6)))) U E ((((1 <= p2) AND (2 <= p8)) U ((2 <= p3) AND (1 <= p6)))))) : A ((E (X (((p1 <= 0) OR (p4 <= 1)))) U A (G (((p3 <= 1) OR (p6 <= 0)))))) : E (G (E (X ((0 <= 0))))) : A (X (A (F (((((2 <= p10) AND (1 <= p12)) OR ((2 <= p2) AND (1 <= p4))) AND ((1 <= p5) OR ((2 <= p0) AND (1 <= p10)))))))) : A ((NOT(E (G (((1 <= p3) AND (2 <= p11))))) U ((1 <= p8) AND (2 <= p10) AND (p3 <= 1)))) : E (G ((1 <= p5))) : E ((E (F (((1 <= p11) AND (2 <= p12)))) U A (G (((2 <= p1) AND (1 <= p3)))))) : A (F (((E (G (((2 <= p11)))) AND E (F (((p3 <= 1) OR (p8 <= 0))))) AND ((p1 <= 1) OR (p11 <= 0) OR ((2 <= p3) AND (1 <= p10)) OR ((1 <= p2) AND (2 <= p12))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p5 <= 0) OR (p3 <= 0) OR (p10 <= 1))))))
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(((p5 <= 0) OR (p3 <= 0) OR (p10 <= 1))))
lola: processed formula length: 48
lola: 9 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X (((p1 <= 0) OR (p4 <= 1)))) U A (G (((p3 <= 1) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX(((p1 <= 0) OR (p4 <= 1))) U AG(((p3 <= 1) OR (p6 <= 0))))
lola: processed formula length: 64
lola: 10 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: 5459 markings, 27064 edges
lola: ========================================
lola: subprocess 2 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((((2 <= p10) AND (1 <= p12)) OR ((2 <= p2) AND (1 <= p4))) AND ((1 <= p5) OR ((2 <= p0) AND (1 <= p10))))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((((p10 <= 1) OR (p12 <= 0)) AND ((p2 <= 1) OR (p4 <= 0))) OR ((p5 <= 0) AND ((p0 <= 1) OR (p10 <= 0))))
lola: processed formula length: 108
lola: 10 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 4 markings, 4 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((2 <= p10) AND (1 <= p12)) OR ((2 <= p2) AND (1 <= p4))) AND ((1 <= p5) OR ((2 <= p0) AND (1 <= p10))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (NOT DEADLOCK))
lola: processed formula length: 20
lola: 8 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:779
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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p5)))
lola: processed formula length: 17
lola: 8 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: (p5 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= p3) AND (1 <= p10))))))
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: ((2 <= p3) AND (1 <= p10))
lola: processed formula length: 26
lola: 10 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: SUBRESULT
lola: result: no
lola: produced by: tscc_search
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: The predicate is not live.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (((1 <= p11) AND (2 <= p12)))) U A (G (((2 <= p1) AND (1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((1 <= p11) AND (2 <= p12))) U AG(((2 <= p1) AND (1 <= p3))))
lola: processed formula length: 66
lola: 10 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: 5459 markings, 27943 edges
lola: ========================================
lola: subprocess 7 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F (((2 <= p1) AND (1 <= p6)))) U E ((((1 <= p2) AND (2 <= p8)) U ((2 <= p3) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EF(((2 <= p1) AND (1 <= p6))) U E(((1 <= p2) AND (2 <= p8)) U ((2 <= p3) AND (1 <= p6))))
lola: processed formula length: 91
lola: 10 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: 50 markings, 110 edges
lola: ========================================
lola: subprocess 8 will run for 1164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G (((2 <= p11)))) AND (E (F (((p3 <= 1) OR (p8 <= 0)))) AND ((p1 <= 1) OR (p11 <= 0) OR ((2 <= p3) AND (1 <= p10)) OR ((1 <= p2) AND (2 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG(((2 <= p11))) AND (EF(((p3 <= 1) OR (p8 <= 0))) AND ((p1 <= 1) OR (p11 <= 0) OR ((2 <= p3) AND (1 <= p10)) OR ((1 <= p2) AND (2 <= p12))))))
lola: processed formula length: 151
lola: 10 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: 3 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 1746 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F (((p3 <= 0) OR (p11 <= 1)))) U ((1 <= p8) AND (2 <= p10) AND (p3 <= 1))))
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: (F (((p3 <= 0) OR (p11 <= 1))) U ((1 <= p8) AND (2 <= p10) AND (p3 <= 1)))
lola: processed formula length: 75
lola: 9 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 universal single path CTL formula does not hold.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 3492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((((1 <= p2) AND (2 <= p12) AND (1 <= p3) AND (2 <= p10)) OR ((2 <= p2) AND (1 <= p3))) AND ((p7 <= 0) OR ((2 <= p1) AND (1 <= p4)))))) AND A (F (((2 <= p2) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p2) AND (1 <= p8))))
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: ((p2 <= 1) OR (p8 <= 0))
lola: processed formula length: 25
lola: 10 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p2) AND (1 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no no yes no no
lola:
preliminary result: no yes no no yes yes no no yes no no
lola: memory consumption: 25840 KB
lola: time consumption: 78 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="DNAwalker-PT-02track12Block2"
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 DNAwalker-PT-02track12Block2, 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 r178-tajo-158987881900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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