Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.2K May 14 00:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 12 20:42 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 SatelliteMemory-PT-X03000Y0094-CTLCardinality-00
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-01
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-02
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-03
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-04
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-05
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-06
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-07
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-08
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-09
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-10
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-11
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-12
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-13
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-14
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591284180627

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:02] [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-04 15:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:02] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-06-04 15:23:02] [INFO ] Transformed 13 places.
[2020-06-04 15:23:02] [INFO ] Transformed 10 transitions.
[2020-06-04 15:23:02] [INFO ] Parsed PT model containing 13 places and 10 transitions in 74 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 128 ms. (steps per millisecond=781 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0]
// Phase 1: matrix 10 rows 12 cols
[2020-06-04 15:23:02] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned unsat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned unsat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 15:23:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-04 15:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2020-06-04 15:23:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 15:23:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:02] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2020-06-04 15:23:02] [INFO ] Added : 7 causal constraints over 2 iterations in 25 ms. Result :sat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:02] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-04 15:23:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 15:23:03] [INFO ] Flatten gal took : 24 ms
[2020-06-04 15:23:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 15:23:03] [INFO ] Flatten gal took : 3 ms
FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:03] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 15:23:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SatelliteMemory-PT-X03000Y0094 @ 3570 seconds

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3186
rslt: Output for CTLCardinality @ SatelliteMemory-PT-X03000Y0094

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 15:23:03 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3 + 1 <= p9)",
"processed_size": 14,
"rewrites": 24
},
"result":
{
"edges": 42155439,
"markings": 33725627,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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((p4 <= p6))",
"processed_size": 14,
"rewrites": 22
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p9 <= p11)))",
"processed_size": 19,
"rewrites": 23
},
"result":
{
"edges": 381,
"markings": 382,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p1 + 1 <= p6)))",
"processed_size": 22,
"rewrites": 23
},
"result":
{
"edges": 5625,
"markings": 5626,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p3)",
"processed_size": 9,
"rewrites": 24
},
"result":
{
"edges": 185605671,
"markings": 67522502,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1133
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF(((p2 <= p10) AND AG((p7 <= p11))))",
"processed_size": 37,
"rewrites": 23
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 320700013,
"markings": 67522502,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p5)",
"processed_size": 9,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p11 + 1 <= p4)))",
"processed_size": 23,
"rewrites": 22
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 19352,
"runtime": 384.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR A(G(**))) : (E(F(**)) OR **) : (A(X(A(G(**)))) AND A(F(**))) : A(G(**)) : A(G(**)) : E(F((** AND A(G(**))))) : A(G(**)) : A(G(E(F(**)))) : E(F(**)) : A(X(A(G(**)))) : A(G(*)) : (A(X(**)) AND A(X(A(G(**)))))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "no yes no yes no no no yes yes no no no ",
"value": "no yes no yes no no no yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 384
lola: finding significant places
lola: 12 places, 10 transitions, 6 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: ((1 <= p9) OR A (G (E (G ((1 <= p1)))))) : ((E (((1 <= p9) U (1 <= 0))) OR E (F ((p11 + 1 <= p4)))) OR (2 <= p5)) : (A (X (A (G ((p9 <= p3))))) AND A (F ((p4 <= p1)))) : A (G (E (((1 <= 0) U (p0 <= p8))))) : (E (X ((1 <= 0))) OR A (G ((p9 <= p11)))) : E (F (((p2 <= p10) AND A (G ((p7 <= p11)))))) : A (G ((3 <= p6))) : A (G (E (F ((2 <= p3))))) : E (F ((p6 + 1 <= p5))) : (A (G (A (X ((p9 <= p5))))) OR (A (G ((p4 <= p9))) AND E (((p6 <= p7) U (1 <= 0))))) : A (G (NOT(A (F ((p6 <= p1)))))) : A (X (((p4 <= p6) AND A (G ((1 <= p6))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((p9 <= p3))))) AND A (F ((p4 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p4 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1 + 1 <= p4)
lola: processed formula length: 14
lola: 24 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= p1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p9 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 + 1 <= p9)
lola: processed formula length: 14
lola: 24 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p3 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 7821634 markings, 9774368 edges, 1564327 markings/sec, 0 secs
lola: sara is running 5 secs || 14315156 markings, 17891542 edges, 1298704 markings/sec, 5 secs
lola: sara is running 10 secs || 20475866 markings, 25592687 edges, 1232142 markings/sec, 10 secs
lola: sara is running 15 secs || 26093135 markings, 32614508 edges, 1123454 markings/sec, 15 secs
lola: sara is running 20 secs || 30984646 markings, 38729099 edges, 978302 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 33725627 markings, 42155439 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p9 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p5 + 1 <= p9)
lola: processed formula length: 14
lola: 24 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p5 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 12002 markings, 12001 edges
lola: ========================================
lola: subprocess 2 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p4 <= p6))) AND A (X (A (G ((1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p4 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p4 <= p6))
lola: processed formula length: 14
lola: 22 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p6 <= 0)
lola: processed formula length: 9
lola: 24 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 5626 markings, 5625 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p6)))
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 ((3 <= p6)))
lola: processed formula length: 17
lola: 23 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: (p6 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5626 markings, 5625 edges
lola: ========================================
lola: subprocess 4 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p6 + 1 <= p5)))
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 ((p6 + 1 <= p5)))
lola: processed formula length: 22
lola: 22 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: (p6 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3002 markings, 3001 edges
lola: ========================================
lola: subprocess 5 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p9 <= p11)))
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 ((p9 <= p11)))
lola: processed formula length: 19
lola: 23 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: (p11 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 382 markings, 381 edges
lola: ========================================
lola: subprocess 6 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1 + 1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p1 + 1 <= p6)))
lola: processed formula length: 22
lola: 23 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 <= p1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-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: 5626 markings, 5625 edges
lola: ========================================
lola: subprocess 7 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= p8)))
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 ((p0 <= p8)))
lola: processed formula length: 18
lola: 23 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: (p8 + 1 <= p0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: 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: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (2 <= p3)
lola: processed formula length: 9
lola: 24 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (p3 <= 1)
lola: state equation task get result unparse finished id 0
lola: formula 1: (2 <= p3)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

sara: try reading problem file CTLCardinality-8-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 5542611 markings, 8999625 edges, 1108522 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 10794161 markings, 17536548 edges, 1050310 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 15913993 markings, 25854950 edges, 1023966 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 20491454 markings, 33295975 edges, 915492 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 24852812 markings, 40383090 edges, 872272 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 29563995 markings, 48040110 edges, 942237 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 33920090 markings, 55118055 edges, 871219 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 38317391 markings, 62263669 edges, 879460 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 42815000 markings, 69574549 edges, 899522 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 47386169 markings, 77002159 edges, 914234 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 52123797 markings, 84703026 edges, 947526 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 56758967 markings, 92233371 edges, 927034 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 61287686 markings, 99595054 edges, 905744 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 66464802 markings, 108007710 edges, 1035423 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 67519113 markings, 114455972 edges, 210862 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 67519313 markings, 119876465 edges, 40 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 67519509 markings, 125131865 edges, 39 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 67519707 markings, 130516526 edges, 40 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 67519899 markings, 135660060 edges, 38 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 67520087 markings, 140765276 edges, 38 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 67520275 markings, 145851988 edges, 38 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 67520459 markings, 150822345 edges, 37 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 67520631 markings, 155452494 edges, 34 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 67520819 markings, 160500618 edges, 38 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 67521023 markings, 166056655 edges, 41 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 67521225 markings, 171481149 edges, 40 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 67521467 markings, 177938041 edges, 48 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 67522502 markings, 185605671 edges
lola: ========================================
lola: subprocess 9 will run for 1133 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p2 <= p10) AND A (G ((p7 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(((p2 <= p10) AND AG((p7 <= p11))))
lola: processed formula length: 37
lola: 23 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: 2080137 markings, 7539008 edges, 416027 markings/sec, 0 secs
lola: 4398131 markings, 15941719 edges, 463599 markings/sec, 5 secs
lola: 6668462 markings, 24169504 edges, 454066 markings/sec, 10 secs
lola: 8892675 markings, 32232391 edges, 444843 markings/sec, 15 secs
lola: 11097240 markings, 40222997 edges, 440913 markings/sec, 20 secs
lola: 13291148 markings, 48175796 edges, 438782 markings/sec, 25 secs
lola: 15464249 markings, 56052219 edges, 434620 markings/sec, 30 secs
lola: 17615878 markings, 63851632 edges, 430326 markings/sec, 35 secs
lola: 19766898 markings, 71649841 edges, 430204 markings/sec, 40 secs
lola: 21896677 markings, 79368273 edges, 425956 markings/sec, 45 secs
lola: 24003575 markings, 87005651 edges, 421380 markings/sec, 50 secs
lola: 26145753 markings, 94772772 edges, 428436 markings/sec, 55 secs
lola: 28274347 markings, 102486500 edges, 425719 markings/sec, 60 secs
lola: 30374050 markings, 110099106 edges, 419941 markings/sec, 65 secs
lola: 32477195 markings, 117722508 edges, 420629 markings/sec, 70 secs
lola: 34552204 markings, 125243949 edges, 415002 markings/sec, 75 secs
lola: 36600297 markings, 132667342 edges, 409619 markings/sec, 80 secs
lola: 38710077 markings, 140314505 edges, 421956 markings/sec, 85 secs
lola: 40741298 markings, 147678745 edges, 406244 markings/sec, 90 secs
lola: 42630606 markings, 154525203 edges, 377862 markings/sec, 95 secs
lola: 44516255 markings, 161360290 edges, 377130 markings/sec, 100 secs
lola: 46564994 markings, 168786713 edges, 409748 markings/sec, 105 secs
lola: 48549795 markings, 175981090 edges, 396960 markings/sec, 110 secs
lola: 50477012 markings, 182967692 edges, 385443 markings/sec, 115 secs
lola: 52334212 markings, 189698211 edges, 371440 markings/sec, 120 secs
lola: 54358461 markings, 197036203 edges, 404850 markings/sec, 125 secs
lola: 56210292 markings, 203749652 edges, 370366 markings/sec, 130 secs
lola: 58062788 markings, 210464544 edges, 370499 markings/sec, 135 secs
lola: 60081077 markings, 217780453 edges, 403658 markings/sec, 140 secs
lola: 61975420 markings, 224646634 edges, 378869 markings/sec, 145 secs
lola: 63862969 markings, 231487835 edges, 377510 markings/sec, 150 secs
lola: 65783001 markings, 238447475 edges, 384006 markings/sec, 155 secs
lola: 67519726 markings, 245650855 edges, 347345 markings/sec, 160 secs
lola: 67520000 markings, 253058347 edges, 55 markings/sec, 165 secs
lola: 67520242 markings, 259617997 edges, 48 markings/sec, 170 secs
lola: 67520498 markings, 266522257 edges, 51 markings/sec, 175 secs
lola: 67520754 markings, 273444760 edges, 51 markings/sec, 180 secs
lola: 67521026 markings, 280766752 edges, 54 markings/sec, 185 secs
lola: 67521316 markings, 288599685 edges, 58 markings/sec, 190 secs
lola: 67521630 markings, 297072668 edges, 63 markings/sec, 195 secs
lola: 67521964 markings, 306137886 edges, 67 markings/sec, 200 secs
lola: 67522328 markings, 315940563 edges, 73 markings/sec, 205 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 67522502 markings, 320700013 edges
lola: ========================================
lola: subprocess 10 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p9) OR A (G ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p9)
lola: processed formula length: 9
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p1)))
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 ((1 <= p1)))
lola: processed formula length: 17
lola: 23 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: (p1 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 377 markings, 376 edges
lola: SUBRESULT
lola: result: no
lola: lola: The Boolean predicate is false.
state equation: write sara problem file to CTLCardinality-11-0.sara
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p11 + 1 <= p4))) OR (2 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p5)
lola: processed formula length: 9
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((p11 + 1 <= p4))) OR (2 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p5)
lola: processed formula length: 9
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p11 + 1 <= p4)))
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 ((p11 + 1 <= p4)))
lola: processed formula length: 23
lola: 22 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: (p11 + 1 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no yes yes no no no
lola:
preliminary result: no yes no yes no no no yes yes no no no
lola: memory consumption: 19352 KB
lola: time consumption: 384 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: 16427456 kB
MemFree: 16126132 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16126108 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="SatelliteMemory-PT-X03000Y0094"
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 SatelliteMemory-PT-X03000Y0094, 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 r211-tajo-159033476900027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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