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.r182-oct2-158987913900451.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 BusinessProcesses-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 47K 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 BusinessProcesses-PT-01-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591156189474

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:49:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:49:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:49:50] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-06-03 03:49:50] [INFO ] Transformed 200 places.
[2020-06-03 03:49:50] [INFO ] Transformed 178 transitions.
[2020-06-03 03:49:50] [INFO ] Found NUPN structural information;
[2020-06-03 03:49:50] [INFO ] Parsed PT model containing 200 places and 178 transitions in 77 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Finished random walk after 28072 steps, including 327 resets, run visited all 17 properties in 56 ms. (steps per millisecond=501 )
[2020-06-03 03:49:51] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 03:49:51] [INFO ] Flatten gal took : 37 ms
[2020-06-03 03:49:51] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 03:49:51] [INFO ] Flatten gal took : 11 ms
FORMULA BusinessProcesses-PT-01-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:49:51] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 03:49:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-01 @ 3570 seconds

FORMULA BusinessProcesses-PT-01-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-01-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for CTLCardinality @ BusinessProcesses-PT-01

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:49:51 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p80 <= 0)) OR ((1 <= p58)))",
"processed_size": 31,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"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": "AX((((1 <= p115)) AND ((p19 <= 0))))",
"processed_size": 36,
"rewrites": 12
},
"net":
{
"conflict_clusters": 155,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AG((((p116 <= 0)) OR ((1 <= p37)))))",
"processed_size": 40,
"rewrites": 13
},
"net":
{
"conflict_clusters": 155,
"singleton_clusters": 0
},
"result":
{
"edges": 86,
"markings": 87,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 <= p41)) AND ((p159 <= 0)))))",
"processed_size": 40,
"rewrites": 12
},
"result":
{
"edges": 1512,
"markings": 865,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p40 <= 0)) OR ((1 <= p153)))))",
"processed_size": 40,
"rewrites": 13
},
"result":
{
"edges": 1513,
"markings": 866,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p161 <= 0)) OR ((1 <= p177)))))",
"processed_size": 41,
"rewrites": 13
},
"result":
{
"edges": 176,
"markings": 149,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p198 <= 0)) OR ((1 <= p114)) OR ((p123 <= 0)) OR ((1 <= p5)))))",
"processed_size": 75,
"rewrites": 13
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"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(E((((p146 <= 0)) OR ((1 <= p29))) U ((1 <= p65))))",
"processed_size": 54,
"rewrites": 13
},
"net":
{
"conflict_clusters": 155,
"singleton_clusters": 0
},
"result":
{
"edges": 2829974,
"markings": 421817,
"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": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((1 <= p171)) AND ((p147 <= 0)))",
"processed_size": 33,
"rewrites": 15
},
"result":
{
"edges": 591059,
"markings": 99144,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 <= p93)) AND ((p173 <= 0)))))",
"processed_size": 40,
"rewrites": 12
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28912,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : A(F(A(G(**)))) : (E(F(A(G(**)))) OR (E(F(**)) OR E(F(**)))) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(G(E((** U **)))) : (E(X(A(G(**)))) OR (A(X(*)) AND **))"
},
"net":
{
"arcs": 485,
"conflict_clusters": 155,
"places": 199,
"places_significant": 169,
"singleton_clusters": 0,
"transitions": 177
},
"result":
{
"preliminary_value": "no no no no yes no yes no no yes no ",
"value": "no no no no yes no yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 376/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 199
lola: finding significant places
lola: 199 places, 177 transitions, 169 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: E (G (A (G ((((p122 <= 0)) OR ((1 <= p102))))))) : E (G (A (G ((((p198 <= 0)) OR ((1 <= p114)) OR ((p123 <= 0)) OR ((1 <= p5))))))) : A (G ((((p41 <= 0)) OR ((1 <= p178))))) : A (F (A (G ((((p171 <= 0)) OR ((1 <= p147))))))) : E (F (((A (G (((1 <= p161)))) OR (((1 <= p94)) AND ((p11 <= 0)))) OR (((1 <= p93)) AND ((p173 <= 0)))))) : A (G (E (G ((((p33 <= 0)) OR ((1 <= p103))))))) : E (F ((((1 <= p41)) AND ((p159 <= 0))))) : E (G (A (G ((((p40 <= 0)) OR ((1 <= p153))))))) : E (G (A (G ((((p161 <= 0)) OR ((1 <= p177))))))) : E (G (E (((((p146 <= 0)) OR ((1 <= p29))) U ((1 <= p65)))))) : (E (X (A (G ((((p116 <= 0)) OR ((1 <= p37))))))) OR (NOT(E (X ((((p115 <= 0)) OR ((1 <= p19)))))) AND (((p80 <= 0)) OR ((1 <= p58)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((((p116 <= 0)) OR ((1 <= p37))))))) OR (A (X ((((1 <= p115)) AND ((p19 <= 0))))) AND (((p80 <= 0)) OR ((1 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p80 <= 0)) OR ((1 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p80 <= 0)) OR ((1 <= p58)))
lola: processed formula length: 31
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p115)) AND ((p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p115)) AND ((p19 <= 0))))
lola: processed formula length: 36
lola: 12 rewrites
lola: closed formula file CTLCardinality.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).
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 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p116 <= 0)) OR ((1 <= p37)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p116 <= 0)) OR ((1 <= p37)))))
lola: processed formula length: 40
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 87 markings, 86 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p41 <= 0)) OR ((1 <= p178)))))
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:787
lola: processed formula: A (G ((((p41 <= 0)) OR ((1 <= p178)))))
lola: processed formula length: 40
lola: 13 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p41)) AND ((p178 <= 0)))
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 CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 865 markings, 1512 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p33 <= 0)) OR ((1 <= p103)))))
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:787
lola: processed formula: A (G ((((p33 <= 0)) OR ((1 <= p103)))))
lola: processed formula length: 40
lola: 13 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p33)) AND ((p103 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 156 markings, 187 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p41)) AND ((p159 <= 0)))))
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 <= p41)) AND ((p159 <= 0)))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file CTLCardinality.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 <= p41)) AND ((p159 <= 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
lola: The predicate is reachable.
lola: 865 markings, 1512 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p40 <= 0)) OR ((1 <= p153)))))
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:787
lola: processed formula: A (G ((((p40 <= 0)) OR ((1 <= p153)))))
lola: processed formula length: 40
lola: 13 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p40)) AND ((p153 <= 0)))
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 CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 866 markings, 1513 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p161 <= 0)) OR ((1 <= p177)))))
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:787
lola: processed formula: A (G ((((p161 <= 0)) OR ((1 <= p177)))))
lola: processed formula length: 41
lola: 13 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p161)) AND ((p177 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 149 markings, 176 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p122 <= 0)) OR ((1 <= p102)))))
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:787
lola: processed formula: A (G ((((p122 <= 0)) OR ((1 <= p102)))))
lola: processed formula length: 41
lola: 13 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p122)) AND ((p102 <= 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p198 <= 0)) OR ((1 <= p114)) OR ((p123 <= 0)) OR ((1 <= p5)))))
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:787
lola: processed formula: A (G ((((p198 <= 0)) OR ((1 <= p114)) OR ((p123 <= 0)) OR ((1 <= p5)))))
lola: processed formula length: 75
lola: 13 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p198)) AND ((p114 <= 0)) AND ((1 <= p123)) AND ((p5 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((((p146 <= 0)) OR ((1 <= p29))) U ((1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((((p146 <= 0)) OR ((1 <= p29))) U ((1 <= p65))))
lola: processed formula length: 54
lola: 13 rewrites
lola: closed formula file CTLCardinality.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: 421817 markings, 2829974 edges
lola: ========================================
lola: subprocess 9 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((p171 <= 0)) OR ((1 <= p147)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p171)) AND ((p147 <= 0)))
lola: processed formula length: 33
lola: 15 rewrites
lola: closed formula file CTLCardinality.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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p171 <= 0)) OR ((1 <= p147)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p171)) AND ((p147 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
sara: try reading problem file CTLCardinality-9-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: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 99144 markings, 591059 edges
lola: ========================================
lola: subprocess 10 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p161)))))) OR (E (F ((((1 <= p94)) AND ((p11 <= 0))))) OR E (F ((((1 <= p93)) AND ((p173 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p93)) AND ((p173 <= 0)))))
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 <= p93)) AND ((p173 <= 0)))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: formula 0: (((1 <= p93)) AND ((p173 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no yes no no yes no
lola:
preliminary result: no no no no yes no yes no no yes no
lola: memory consumption: 28912 KB
lola: time consumption: 7 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="BusinessProcesses-PT-01"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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