fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r184-oct2-158987928500444
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for JoinFreeModules-PT-0200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15793.480 3600000.00 890177.00 26031.80 TT?FFTFTFF?TTTTT normal

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-158987928500444.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-0200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928500444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.5K Apr 7 19:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 7 19:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 21:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 21:00 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.5K 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.7K Apr 6 04:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 5 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 10:47 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 1.2M 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-0200-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0200-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591207969868

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:12:52] [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:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:12:52] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2020-06-03 18:12:52] [INFO ] Transformed 1001 places.
[2020-06-03 18:12:52] [INFO ] Transformed 1601 transitions.
[2020-06-03 18:12:52] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 169 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100026 steps, including 0 resets, run finished after 1005 ms. (steps per millisecond=99 ) properties seen :[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, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 1601 rows 1000 cols
[2020-06-03 18:12:53] [INFO ] Computed 200 place invariants in 32 ms
[2020-06-03 18:12:53] [INFO ] [Real]Absence check using 200 positive place invariants in 118 ms returned sat
[2020-06-03 18:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:57] [INFO ] [Real]Absence check using state equation in 3312 ms returned sat
[2020-06-03 18:12:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:12:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 86 ms returned sat
[2020-06-03 18:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:13:08] [INFO ] [Nat]Absence check using state equation in 11583 ms returned unknown
[2020-06-03 18:13:09] [INFO ] [Real]Absence check using 200 positive place invariants in 95 ms returned sat
[2020-06-03 18:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:11] [INFO ] [Real]Absence check using state equation in 2663 ms returned sat
[2020-06-03 18:13:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 96 ms returned sat
[2020-06-03 18:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:13:31] [INFO ] [Nat]Absence check using state equation in 19876 ms returned unknown
[2020-06-03 18:13:32] [INFO ] [Real]Absence check using 200 positive place invariants in 156 ms returned sat
[2020-06-03 18:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:37] [INFO ] [Real]Absence check using state equation in 5764 ms returned sat
[2020-06-03 18:13:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 198 ms returned sat
[2020-06-03 18:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:13:58] [INFO ] [Nat]Absence check using state equation in 19567 ms returned unknown
[2020-06-03 18:13:58] [INFO ] Flatten gal took : 199 ms
[2020-06-03 18:13:58] [INFO ] Flatten gal took : 82 ms
[2020-06-03 18:13:58] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2020-06-03 18:13:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 27 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0200 @ 3570 seconds

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

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

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

FORMULA JoinFreeModules-PT-0200-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0200-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA JoinFreeModules-PT-0200-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2766
rslt: Output for CTLFireability @ JoinFreeModules-PT-0200

{
"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:13:59 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 210
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G (((2 <= p692) OR (1 <= p927))))",
"processed_size": 37,
"rewrites": 36
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(AX((p398 <= 2)))",
"processed_size": 19,
"rewrites": 37
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 602,
"markings": 602,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p893)",
"processed_size": 11,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 240
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(AX((p550 <= 2)))",
"processed_size": 19,
"rewrites": 37
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 240
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "EX(EX(((2 <= p96) AND (4 <= p958) AND (p437 <= 1))))",
"processed_size": 52,
"rewrites": 37
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 258
},
"exit":
{
"localtimelimitreached": false
},
"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 <= p510)",
"processed_size": 11,
"rewrites": 38
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 280
},
"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 ((3 <= p370)))",
"processed_size": 19,
"rewrites": 36
},
"result":
{
"edges": 2,
"markings": 3,
"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": 305
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((3 <= p665) AND (2 <= p37))))",
"processed_size": 36,
"rewrites": 36
},
"result":
{
"edges": 2,
"markings": 3,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"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 ((p590 <= 2)))",
"processed_size": 19,
"rewrites": 36
},
"result":
{
"edges": 12,
"markings": 12,
"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"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 373
},
"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 ((2 <= p297)))",
"processed_size": 19,
"rewrites": 36
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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(AF(((2 <= p41) OR (4 <= p348) OR (p290 <= 2))))",
"processed_size": 52,
"rewrites": 37
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 1204,
"markings": 602,
"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": 480
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((E((2 <= p546) U (2 <= p767)) AND ((p532 <= 1) AND ((5 <= p774) OR (4 <= p968)))))",
"processed_size": 86,
"rewrites": 37
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 1204,
"markings": 602,
"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": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((EG((4 <= p148)) AND ((3 <= p133) OR ((2 <= p702) AND (1 <= p562) AND (4 <= p463)))))",
"processed_size": 89,
"rewrites": 37
},
"net":
{
"conflict_clusters": 801,
"singleton_clusters": 0
},
"result":
{
"edges": 1204,
"markings": 602,
"produced_by": "CTL model checker",
"value": false
},
"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": 1015
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1015
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((2 <= p756) AND (p114 <= 4) AND ((p611 <= 1) OR (p952 <= 1)))",
"processed_size": 63,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1523
},
"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 ((2 <= p917)))",
"processed_size": 19,
"rewrites": 36
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1523
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((p987 <= 0)))",
"processed_size": 19,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3046
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p467) AND (3 <= p570))))",
"processed_size": 37,
"rewrites": 36
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3041
},
"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": "(p312 <= 1)",
"processed_size": 11,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(p50 <= 2)",
"processed_size": 10,
"rewrites": 38
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3348,
"runtime": 804.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G(*)) AND E(G(A(X(*))))) : (E(G(**)) OR (E(F(*)) AND (** AND (** AND **)))) : E(G(E(F(**)))) : ((A((* R *)) AND **) OR (A(F(**)) AND E(F(**)))) : A(F((E((** U **)) AND (** AND **)))) : (** OR E(G(A(X(*))))) : E(X(E(X(**)))) : E(G(**)) : A(X(A(G(*)))) : A(F((E(G(**)) AND **))) : E(F((A((** U **)) AND **))) : E(F(**)) : (E(F(**)) OR (A(G(*)) AND E(F(**)))) : E(G(**)) : E(G(A(F(**)))) : E(F(**))"
},
"net":
{
"arcs": 4600,
"conflict_clusters": 801,
"places": 1000,
"places_significant": 800,
"singleton_clusters": 0,
"transitions": 1601
},
"result":
{
"preliminary_value": "yes yes unknown no no yes no yes no no unknown yes yes yes yes yes ",
"value": "yes yes unknown no no yes no yes no no unknown yes yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32000
lola: finding significant places
lola: 1000 places, 1601 transitions, 800 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (NOT(A (F (((p692 <= 1) AND (p927 <= 0))))) AND NOT(A (F (E (X ((3 <= p398))))))) : (E (G ((2 <= p917))) OR (((NOT(A (G (((2 <= p887) AND (3 <= p683))))) AND (2 <= p756)) AND (p114 <= 4)) AND ((p611 <= 1) OR (p952 <= 1)))) : E (G (E (F ((2 <= p741))))) : ((NOT(E (((3 <= p443) U (2 <= p742)))) AND (p312 <= 1)) OR (A (F ((3 <= p50))) AND E (F ((3 <= p320))))) : A (F (((E (((2 <= p546) U (2 <= p767))) AND (p532 <= 1)) AND ((5 <= p774) OR (4 <= p968))))) : ((3 <= p893) OR NOT(A (F (E (X ((3 <= p550))))))) : E (X (E (X (((2 <= p96) AND (4 <= p958) AND (p437 <= 1)))))) : E (G ((2 <= p297))) : NOT(E (F (E (X ((3 <= p510)))))) : A (F ((E (G ((4 <= p148))) AND ((3 <= p133) OR ((2 <= p702) AND (1 <= p562) AND (4 <= p463)))))) : E (F ((A (((3 <= p940) U (1 <= p397))) AND ((4 <= p188) OR (5 <= p255) OR (5 <= p109) OR ((4 <= p368) AND (5 <= p260)))))) : E (F (((3 <= p665) AND (2 <= p37)))) : A ((NOT(E (F ((1 <= p987)))) U E (F (((1 <= p467) AND (3 <= p570)))))) : E (G ((p590 <= 2))) : E (G (A (F (((2 <= p41) OR (4 <= p348) OR (p290 <= 2)))))) : E (F ((3 <= p370)))
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((2 <= p692) OR (1 <= p927)))) AND E (G (A (X ((p398 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p692) OR (1 <= p927))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p692) OR (1 <= p927))))
lola: processed formula length: 37
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p692 <= 1) AND (p927 <= 0))
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: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((p398 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: ========================================
lola: processed formula: EG(AX((p398 <= 2)))
lola: processed formula length: 19
lola: 37 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
sara: try reading problem file CTLFireability-0.sara.
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: 602 markings, 602 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p893) OR E (G (A (X ((p550 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p893)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p893)
lola: processed formula length: 11
lola: 35 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: subprocess 2 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((p550 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX((p550 <= 2)))
lola: processed formula length: 19
lola: 37 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: 602 markings, 602 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (((2 <= p96) AND (4 <= p958) AND (p437 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX(((2 <= p96) AND (4 <= p958) AND (p437 <= 1))))
lola: processed formula length: 52
lola: 37 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p510 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= p510)
lola: processed formula length: 11
lola: 38 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p510)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 3 markings, 2 edges

lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p370)))
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 ((3 <= p370)))
lola: processed formula length: 19
lola: 36 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: (3 <= p370)
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: 3 markings, 2 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p665) AND (2 <= p37))))
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 (((3 <= p665) AND (2 <= p37))))
lola: processed formula length: 36
lola: 36 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: ((3 <= p665) AND (2 <= p37))
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
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-5-0.sara.
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p590 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p590 <= 2)))
lola: processed formula length: 19
lola: 36 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p297)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((2 <= p297)))
lola: processed formula length: 19
lola: 36 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: (p297 <= 1)
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: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: ========================================
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: E (G (A (F (((2 <= p41) OR (4 <= p348) OR (p290 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((2 <= p41) OR (4 <= p348) OR (p290 <= 2))))
lola: processed formula length: 52
lola: 37 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: 602 markings, 1204 edges
lola: ========================================
lola: subprocess 9 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (((2 <= p546) U (2 <= p767))) AND ((p532 <= 1) AND ((5 <= p774) OR (4 <= p968))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((E((2 <= p546) U (2 <= p767)) AND ((p532 <= 1) AND ((5 <= p774) OR (4 <= p968)))))
lola: processed formula length: 86
lola: 37 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: 602 markings, 1204 edges

lola: ========================================
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((4 <= p148))) AND ((3 <= p133) OR ((2 <= p702) AND (1 <= p562) AND (4 <= p463))))))
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((EG((4 <= p148)) AND ((3 <= p133) OR ((2 <= p702) AND (1 <= p562) AND (4 <= p463)))))
lola: processed formula length: 89
lola: 37 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: 602 markings, 1204 edges
lola: ========================================
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (((3 <= p940) U (1 <= p397))) AND ((4 <= p188) OR (5 <= p255) OR (5 <= p109) OR ((4 <= p368) AND (5 <= p260))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((A((3 <= p940) U (1 <= p397)) AND ((4 <= p188) OR (5 <= p255) OR (5 <= p109) OR ((4 <= p368) AND (5 <= p260)))))
lola: processed formula length: 118
lola: 37 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).
sara: place or transition ordering is non-deterministic

lola: 350194 markings, 849538 edges, 70039 markings/sec, 0 secs
lola: 694641 markings, 1685154 edges, 68889 markings/sec, 5 secs
lola: 1038393 markings, 2519121 edges, 68750 markings/sec, 10 secs
lola: 1378418 markings, 3344270 edges, 68005 markings/sec, 15 secs
lola: 1712275 markings, 4154269 edges, 66771 markings/sec, 20 secs
lola: 2048981 markings, 4971209 edges, 67341 markings/sec, 25 secs
lola: 2381637 markings, 5778341 edges, 66531 markings/sec, 30 secs
lola: 2716288 markings, 6590299 edges, 66930 markings/sec, 35 secs
lola: 3051354 markings, 7403377 edges, 67013 markings/sec, 40 secs
lola: 3380714 markings, 8202407 edges, 65872 markings/sec, 45 secs
lola: 3710992 markings, 9003965 edges, 66056 markings/sec, 50 secs
lola: 4044907 markings, 9814134 edges, 66783 markings/sec, 55 secs
lola: 4378915 markings, 10624560 edges, 66802 markings/sec, 60 secs
lola: 4711271 markings, 11430936 edges, 66471 markings/sec, 65 secs
lola: 5047243 markings, 12246158 edges, 67194 markings/sec, 70 secs
lola: 5376611 markings, 13045319 edges, 65874 markings/sec, 75 secs
lola: 5711617 markings, 13858041 edges, 67001 markings/sec, 80 secs
lola: 6045317 markings, 14667663 edges, 66740 markings/sec, 85 secs
lola: 6368353 markings, 15451441 edges, 64607 markings/sec, 90 secs
lola: 6699673 markings, 16255440 edges, 66264 markings/sec, 95 secs
lola: 7035309 markings, 17069854 edges, 67127 markings/sec, 100 secs
lola: 7369716 markings, 17881394 edges, 66881 markings/sec, 105 secs
lola: 7703777 markings, 18691990 edges, 66812 markings/sec, 110 secs
lola: 8008248 markings, 19433533 edges, 60894 markings/sec, 115 secs
lola: 8319561 markings, 20186005 edges, 62263 markings/sec, 120 secs
lola: 8620895 markings, 20917075 edges, 60267 markings/sec, 125 secs
lola: 8654043 markings, 20997454 edges, 6630 markings/sec, 130 secs
lola: 8666988 markings, 21029034 edges, 2589 markings/sec, 135 secs
lola: 8917959 markings, 21637896 edges, 50194 markings/sec, 140 secs
lola: 9023536 markings, 21893960 edges, 21115 markings/sec, 145 secs
lola: 9033028 markings, 21917061 edges, 1898 markings/sec, 150 secs
lola: 9079305 markings, 22029342 edges, 9255 markings/sec, 155 secs
lola: 9217693 markings, 22365240 edges, 27678 markings/sec, 160 secs
lola: 9292069 markings, 22545673 edges, 14875 markings/sec, 165 secs
lola: 9297413 markings, 22558584 edges, 1069 markings/sec, 170 secs
lola: 9560803 markings, 23197659 edges, 52678 markings/sec, 175 secs
lola: 9845920 markings, 23889475 edges, 57023 markings/sec, 180 secs
lola: 9972762 markings, 24197290 edges, 25368 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p741)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (2 <= p741)
lola: processed formula length: 11
lola: 38 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p741)
lola: state equation task get result unparse finished id 1
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: (p741 <= 1)
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: try reading problem file CTLFireability-12-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 || 504488 markings, 719311 edges, 100898 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1026553 markings, 1464036 edges, 104413 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1543729 markings, 2201520 edges, 103435 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2060505 markings, 2938760 edges, 103355 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2583583 markings, 3684842 edges, 104616 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3110621 markings, 4436545 edges, 105408 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3635161 markings, 5184821 edges, 104908 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4160521 markings, 5934019 edges, 105072 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4683669 markings, 6680294 edges, 104630 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5206485 markings, 7425929 edges, 104563 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5730474 markings, 8173374 edges, 104798 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6252468 markings, 8917783 edges, 104399 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6770239 markings, 9656469 edges, 103554 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7291692 markings, 10400141 edges, 104291 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7803599 markings, 11130420 edges, 102381 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8259908 markings, 11781448 edges, 91262 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8619653 markings, 12294409 edges, 71949 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 9018991 markings, 12864113 edges, 79868 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 9316211 markings, 13287869 edges, 59444 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 9770659 markings, 13936190 edges, 90890 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 9779808 markings, 13949214 edges, 1830 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 10050606 markings, 14335408 edges, 54160 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((2 <= p917))) OR (E (F (((p887 <= 1) OR (p683 <= 2)))) AND ((2 <= p756) AND ((p114 <= 4) AND ((p611 <= 1) OR (p952 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p756) AND ((p114 <= 4) AND ((p611 <= 1) OR (p952 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((2 <= p756) AND (p114 <= 4) AND ((p611 <= 1) OR (p952 <= 1)))
lola: processed formula length: 63
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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 14 will run for 1523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p917)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((2 <= p917)))
lola: processed formula length: 19
lola: 36 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: (p917 <= 1)
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: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file CTLFireability-14-0.sara.
lola: subprocess 14 will run for 1523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p467) AND (3 <= p570)))) OR (A (G ((p987 <= 0))) AND E (F (((1 <= p467) AND (3 <= p570))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p987 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p987 <= 0)))
lola: processed formula length: 19
lola: 37 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p987)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3046 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p467) AND (3 <= p570))))
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 (((1 <= p467) AND (3 <= p570))))
lola: processed formula length: 37
lola: 36 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: ((1 <= p467) AND (3 <= p570))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3041 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (((p443 <= 2) R (p742 <= 1))) AND (p312 <= 1)) OR (A (F ((3 <= p50))) AND E (F ((3 <= p320)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3041 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p312 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p312 <= 1)
lola: processed formula length: 11
lola: 35 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: 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 (F ((3 <= p50)))
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: (p50 <= 2)
lola: processed formula length: 10
lola: 38 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 <= p50)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 12 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-17-0.sara.
lola: ========================================
lola: ...considering subproblem: E (F ((A (((3 <= p940) U (1 <= p397))) AND ((4 <= p188) OR (5 <= p255) OR (5 <= p109) OR ((4 <= p368) AND (5 <= p260))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((A((3 <= p940) U (1 <= p397)) AND ((4 <= p188) OR (5 <= p255) OR (5 <= p109) OR ((4 <= p368) AND (5 <= p260)))))
lola: processed formula length: 118
lola: 37 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).
sara: place or transition ordering is non-deterministic

lola: 213747 markings, 518542 edges, 42749 markings/sec, 0 secs
lola: 542134 markings, 1315263 edges, 65677 markings/sec, 5 secs
lola: 870633 markings, 2112292 edges, 65700 markings/sec, 10 secs
lola: 1200685 markings, 2913115 edges, 66010 markings/sec, 15 secs
lola: 1528686 markings, 3708801 edges, 65600 markings/sec, 20 secs
lola: 1857283 markings, 4506135 edges, 65719 markings/sec, 25 secs
lola: 2189963 markings, 5313321 edges, 66536 markings/sec, 30 secs
lola: 2523992 markings, 6123808 edges, 66806 markings/sec, 35 secs
lola: 2859021 markings, 6936564 edges, 67006 markings/sec, 40 secs
lola: 3193743 markings, 7748771 edges, 66944 markings/sec, 45 secs
lola: 3526820 markings, 8556870 edges, 66615 markings/sec, 50 secs
lola: 3860818 markings, 9367327 edges, 66800 markings/sec, 55 secs
lola: 4191338 markings, 10169456 edges, 66104 markings/sec, 60 secs
lola: 4523526 markings, 10975347 edges, 66438 markings/sec, 65 secs
lola: 4852156 markings, 11772841 edges, 65726 markings/sec, 70 secs
lola: 5185189 markings, 12580870 edges, 66607 markings/sec, 75 secs
lola: 5519600 markings, 13392091 edges, 66882 markings/sec, 80 secs
lola: 5852692 markings, 14200411 edges, 66618 markings/sec, 85 secs
lola: 6184028 markings, 15004381 edges, 66267 markings/sec, 90 secs
lola: 6514966 markings, 15807296 edges, 66188 markings/sec, 95 secs
lola: 6846602 markings, 16612135 edges, 66327 markings/sec, 100 secs
lola: 7179918 markings, 17420634 edges, 66663 markings/sec, 105 secs
lola: 7512097 markings, 18226795 edges, 66436 markings/sec, 110 secs
lola: 7844287 markings, 19032880 edges, 66438 markings/sec, 115 secs
lola: 8163471 markings, 19809270 edges, 63837 markings/sec, 120 secs
lola: 8468464 markings, 20547423 edges, 60999 markings/sec, 125 secs
lola: 8754223 markings, 21240593 edges, 57152 markings/sec, 130 secs
lola: 9055594 markings, 21971725 edges, 60274 markings/sec, 135 secs
lola: 9360524 markings, 22711597 edges, 60986 markings/sec, 140 secs
lola: 9666137 markings, 23453375 edges, 61123 markings/sec, 145 secs
lola: 9971126 markings, 24193346 edges, 60998 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p741)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (2 <= p741)
lola: processed formula length: 11
lola: 38 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p741 <= 1)
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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p741)
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-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-17-0.sara
sara: try reading problem file CTLFireability-17-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.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 || 517900 markings, 738480 edges, 103580 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1036950 markings, 1478699 edges, 103810 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1553865 markings, 2216137 edges, 103383 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2071960 markings, 2954918 edges, 103619 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2592568 markings, 3697498 edges, 104122 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3110455 markings, 4436255 edges, 103577 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 3630702 markings, 5178376 edges, 104049 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4152118 markings, 5921997 edges, 104283 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 4670449 markings, 6661452 edges, 103666 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5188768 markings, 7400740 edges, 103664 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 5708519 markings, 8142008 edges, 103950 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6229557 markings, 8885284 edges, 104208 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 6746126 markings, 9622164 edges, 103314 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7260028 markings, 10355005 edges, 102780 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 7765664 markings, 11076468 edges, 101127 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 8217112 markings, 11720404 edges, 90290 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 8516165 markings, 12146815 edges, 59811 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 8834584 markings, 12600848 edges, 63684 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 9159827 markings, 13064965 edges, 65049 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 9216687 markings, 13145959 edges, 11372 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 9659642 markings, 13777881 edges, 88591 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 10056663 markings, 14344221 edges, 79404 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes unknown no no yes no yes no no unknown yes yes yes yes yes
lola:
preliminary result: yes yes unknown no no yes no yes no no unknown yes yes yes yes yes
lola: memory consumption: 3348 KB
lola: time consumption: 804 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-0200"
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-0200, 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-158987928500444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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