Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853300475.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ParamProductionCell-PT-1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-1-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591150865962

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:21:09] [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 02:21:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:21:09] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2020-06-03 02:21:09] [INFO ] Transformed 231 places.
[2020-06-03 02:21:09] [INFO ] Transformed 202 transitions.
[2020-06-03 02:21:09] [INFO ] Found NUPN structural information;
[2020-06-03 02:21:09] [INFO ] Parsed PT model containing 231 places and 202 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 349 ms. (steps per millisecond=286 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 202 rows 231 cols
[2020-06-03 02:21:10] [INFO ] Computed 59 place invariants in 15 ms
[2020-06-03 02:21:10] [INFO ] [Real]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-06-03 02:21:10] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 77 ms returned sat
[2020-06-03 02:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:11] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2020-06-03 02:21:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 71 ms returned sat
[2020-06-03 02:21:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2020-06-03 02:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:11] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2020-06-03 02:21:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2020-06-03 02:21:11] [INFO ] [Nat]Added 68 Read/Feed constraints in 41 ms returned sat
[2020-06-03 02:21:12] [INFO ] Deduced a trap composed of 7 places in 879 ms
[2020-06-03 02:21:13] [INFO ] Deduced a trap composed of 8 places in 647 ms
[2020-06-03 02:21:14] [INFO ] Deduced a trap composed of 29 places in 603 ms
[2020-06-03 02:21:14] [INFO ] Deduced a trap composed of 11 places in 160 ms
[2020-06-03 02:21:15] [INFO ] Deduced a trap composed of 10 places in 1543 ms
[2020-06-03 02:21:16] [INFO ] Deduced a trap composed of 59 places in 323 ms
[2020-06-03 02:21:16] [INFO ] Deduced a trap composed of 21 places in 203 ms
[2020-06-03 02:21:17] [INFO ] Deduced a trap composed of 28 places in 579 ms
[2020-06-03 02:21:17] [INFO ] Deduced a trap composed of 41 places in 451 ms
[2020-06-03 02:21:18] [INFO ] Deduced a trap composed of 7 places in 361 ms
[2020-06-03 02:21:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 6143 ms
[2020-06-03 02:21:18] [INFO ] [Real]Absence check using 35 positive place invariants in 130 ms returned sat
[2020-06-03 02:21:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 64 ms returned unsat
[2020-06-03 02:21:18] [INFO ] [Real]Absence check using 35 positive place invariants in 179 ms returned sat
[2020-06-03 02:21:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 107 ms returned sat
[2020-06-03 02:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:19] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2020-06-03 02:21:19] [INFO ] [Real]Added 68 Read/Feed constraints in 74 ms returned sat
[2020-06-03 02:21:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 86 ms returned sat
[2020-06-03 02:21:19] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2020-06-03 02:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:20] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2020-06-03 02:21:20] [INFO ] [Nat]Added 68 Read/Feed constraints in 49 ms returned sat
[2020-06-03 02:21:20] [INFO ] Deduced a trap composed of 8 places in 174 ms
[2020-06-03 02:21:21] [INFO ] Deduced a trap composed of 6 places in 1528 ms
[2020-06-03 02:21:23] [INFO ] Deduced a trap composed of 10 places in 1348 ms
[2020-06-03 02:21:24] [INFO ] Deduced a trap composed of 27 places in 1188 ms
[2020-06-03 02:21:26] [INFO ] Deduced a trap composed of 7 places in 1459 ms
[2020-06-03 02:21:27] [INFO ] Deduced a trap composed of 25 places in 1678 ms
[2020-06-03 02:21:28] [INFO ] Deduced a trap composed of 7 places in 573 ms
[2020-06-03 02:21:29] [INFO ] Deduced a trap composed of 10 places in 679 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 55 places in 916 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 85 places in 326 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 19 places in 267 ms
[2020-06-03 02:21:30] [INFO ] Deduced a trap composed of 8 places in 254 ms
[2020-06-03 02:21:31] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-06-03 02:21:32] [INFO ] Deduced a trap composed of 7 places in 962 ms
[2020-06-03 02:21:33] [INFO ] Deduced a trap composed of 46 places in 1090 ms
[2020-06-03 02:21:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 13125 ms
[2020-06-03 02:21:33] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 02:21:33] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 49 ms returned sat
[2020-06-03 02:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2020-06-03 02:21:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned unsat
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 95 ms returned sat
[2020-06-03 02:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:35] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-06-03 02:21:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 111 ms returned sat
[2020-06-03 02:21:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 73 ms returned sat
[2020-06-03 02:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:36] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2020-06-03 02:21:36] [INFO ] [Nat]Added 68 Read/Feed constraints in 34 ms returned sat
[2020-06-03 02:21:37] [INFO ] Deduced a trap composed of 7 places in 1781 ms
[2020-06-03 02:21:38] [INFO ] Deduced a trap composed of 10 places in 857 ms
[2020-06-03 02:21:39] [INFO ] Deduced a trap composed of 8 places in 345 ms
[2020-06-03 02:21:39] [INFO ] Deduced a trap composed of 16 places in 251 ms
[2020-06-03 02:21:41] [INFO ] Deduced a trap composed of 79 places in 1744 ms
[2020-06-03 02:21:41] [INFO ] Deduced a trap composed of 46 places in 81 ms
[2020-06-03 02:21:41] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2020-06-03 02:21:41] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-06-03 02:21:41] [INFO ] Deduced a trap composed of 25 places in 114 ms
[2020-06-03 02:21:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 5816 ms
[2020-06-03 02:21:42] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2020-06-03 02:21:42] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 26 ms returned sat
[2020-06-03 02:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:42] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-03 02:21:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 122 ms returned sat
[2020-06-03 02:21:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 123 ms returned sat
[2020-06-03 02:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:43] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2020-06-03 02:21:43] [INFO ] [Nat]Added 68 Read/Feed constraints in 30 ms returned sat
[2020-06-03 02:21:43] [INFO ] Deduced a trap composed of 7 places in 410 ms
[2020-06-03 02:21:44] [INFO ] Deduced a trap composed of 5 places in 742 ms
[2020-06-03 02:21:44] [INFO ] Deduced a trap composed of 7 places in 322 ms
[2020-06-03 02:21:44] [INFO ] Deduced a trap composed of 28 places in 165 ms
[2020-06-03 02:21:45] [INFO ] Deduced a trap composed of 11 places in 120 ms
[2020-06-03 02:21:45] [INFO ] Deduced a trap composed of 7 places in 112 ms
[2020-06-03 02:21:45] [INFO ] Deduced a trap composed of 5 places in 167 ms
[2020-06-03 02:21:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 2240 ms
[2020-06-03 02:21:45] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-06-03 02:21:45] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2020-06-03 02:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:46] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2020-06-03 02:21:46] [INFO ] [Real]Added 68 Read/Feed constraints in 43 ms returned sat
[2020-06-03 02:21:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:21:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 02:21:46] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 21 ms returned sat
[2020-06-03 02:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:21:46] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2020-06-03 02:21:46] [INFO ] [Nat]Added 68 Read/Feed constraints in 24 ms returned sat
[2020-06-03 02:21:51] [INFO ] Deduced a trap composed of 7 places in 4639 ms
[2020-06-03 02:21:52] [INFO ] Deduced a trap composed of 5 places in 448 ms
[2020-06-03 02:21:53] [INFO ] Deduced a trap composed of 12 places in 1009 ms
[2020-06-03 02:21:54] [INFO ] Deduced a trap composed of 6 places in 1233 ms
[2020-06-03 02:21:55] [INFO ] Deduced a trap composed of 5 places in 776 ms
[2020-06-03 02:21:55] [INFO ] Deduced a trap composed of 10 places in 300 ms
[2020-06-03 02:21:56] [INFO ] Deduced a trap composed of 8 places in 1218 ms
[2020-06-03 02:21:57] [INFO ] Deduced a trap composed of 46 places in 1164 ms
[2020-06-03 02:21:59] [INFO ] Deduced a trap composed of 16 places in 1123 ms
[2020-06-03 02:22:00] [INFO ] Deduced a trap composed of 8 places in 1459 ms
[2020-06-03 02:22:00] [INFO ] Deduced a trap composed of 49 places in 204 ms
[2020-06-03 02:22:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 13860 ms
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-03 02:22:01] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 02:22:01] [INFO ] Flatten gal took : 186 ms
[2020-06-03 02:22:01] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 02:22:01] [INFO ] Flatten gal took : 58 ms
FORMULA ParamProductionCell-PT-1-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:22:01] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 13 ms.
[2020-06-03 02:22:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ParamProductionCell-PT-1 @ 3570 seconds

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

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

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

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

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

FORMULA ParamProductionCell-PT-1-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ ParamProductionCell-PT-1

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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 02:22:02 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AF(EX((((1 <= p61)) AND ((p195 <= 0)))))",
"processed_size": 40,
"rewrites": 16
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 24039,
"markings": 7509,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((((p35 <= 0)) OR ((1 <= p82))) OR NOT DEADLOCK)))",
"processed_size": 57,
"rewrites": 19
},
"result":
{
"edges": 163,
"markings": 163,
"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": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 <= p95)) AND ((p100 <= 0)))",
"processed_size": 32,
"rewrites": 18
},
"result":
{
"edges": 1504,
"markings": 1129,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"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": "E(EF((((p207 <= 0)) OR ((1 <= p147)))) U EG(((1 <= p65))))",
"processed_size": 59,
"rewrites": 17
},
"net":
{
"conflict_clusters": 59,
"singleton_clusters": 0
},
"result":
{
"edges": 260080,
"markings": 25632,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": "(((p123 <= 0)) OR ((1 <= p182)))",
"processed_size": 33,
"rewrites": 17
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 22848,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((** OR NODEADLOCK))) : A(G(A(F(**)))) : (** AND (E(X(**)) AND DEADLOCK)) : DEADLOCK : E((E(F(**)) U E(G(**)))) : TRUE : A(F(E(X(**)))) : E(G(E(F(**))))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "yes yes no no no yes yes yes ",
"value": "yes yes no no no 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: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: A (G (((((p35 <= 0)) OR ((1 <= p82))) OR E (X ((0 <= 0)))))) : A (G (A (F ((((p95 <= 0)) OR ((1 <= p100))))))) : ((((p169 <= 0)) AND E (X ((((p163 <= 0)) OR ((1 <= p167)))))) AND A (X ((1 <= 0)))) : A (X ((1 <= 0))) : E ((E (F ((((p207 <= 0)) OR ((1 <= p147))))) U E (G (((1 <= p65)))))) : E (G (E (G ((0 <= 0))))) : A (F (E (X ((((1 <= p61)) AND ((p195 <= 0))))))) : E (G (E (((0 <= 0) U (((p123 <= 0)) OR ((1 <= p182)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p169 <= 0)) AND (E (X ((((p163 <= 0)) OR ((1 <= p167))))) AND DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((((1 <= p61)) AND ((p195 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX((((1 <= p61)) AND ((p195 <= 0)))))
lola: processed formula length: 40
lola: 16 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7509 markings, 24039 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p35 <= 0)) OR ((1 <= p82))) OR NOT DEADLOCK)))
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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:779
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G (((((p35 <= 0)) OR ((1 <= p82))) OR NOT DEADLOCK)))
lola: processed formula length: 57
lola: 19 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: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:779
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p35)) AND ((p82 <= 0))) AND DEADLOCK)
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 163 markings, 163 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p95 <= 0)) OR ((1 <= p100)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p95)) AND ((p100 <= 0)))
lola: processed formula length: 32
lola: 18 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p95 <= 0)) OR ((1 <= p100)))
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 <= p95)) AND ((p100 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 1129 markings, 1504 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-5-1.sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: state equation: calling and running sara
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((p207 <= 0)) OR ((1 <= p147))))) U E (G (((1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((((p207 <= 0)) OR ((1 <= p147)))) U EG(((1 <= p65))))
lola: processed formula length: 59
lola: 17 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLCardinality-5-1.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
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: 25632 markings, 260080 edges
lola: subprocess 7 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p123 <= 0)) OR ((1 <= p182)))))))
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: (((p123 <= 0)) OR ((1 <= p182)))
lola: processed formula length: 33
lola: 17 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: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 <= p123)) AND ((p182 <= 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 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: (((p123 <= 0)) OR ((1 <= p182)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: lola: state equation: write sara problem file to CTLCardinality-7-0.sara
========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 260 markings, 260 edges
lola: ========================================
lola: state equation: calling and running sara
lola: RESULT
lola:
SUMMARY: yes yes no no no yes yes yes
lola:
preliminary result: yes yes no no no yes yes yes
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: memory consumption: 22848 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 5086792 kB
After kill :
MemTotal: 16427332 kB
MemFree: 5082916 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-1"
export BK_EXAMINATION="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 ParamProductionCell-PT-1, 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 r174-csrt-158987853300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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