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.r176-tajo-158987872200643.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 PolyORBNT-PT-S05J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872200643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 11K Apr 12 06:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 12 06:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 11 05:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 137K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 10 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 10 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 9 18:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 9 18:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 PolyORBNT-PT-S05J30-CTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591171634374

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:07:16] [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 08:07:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:07:16] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2020-06-03 08:07:16] [INFO ] Transformed 489 places.
[2020-06-03 08:07:16] [INFO ] Transformed 1400 transitions.
[2020-06-03 08:07:16] [INFO ] Parsed PT model containing 489 places and 1400 transitions in 268 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 64 ms.
Incomplete random walk after 100000 steps, including 6855 resets, run finished after 1004 ms. (steps per millisecond=99 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1]
[2020-06-03 08:07:17] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2020-06-03 08:07:17] [INFO ] Computed 82 place invariants in 46 ms
[2020-06-03 08:07:18] [INFO ] [Real]Absence check using 58 positive place invariants in 133 ms returned sat
[2020-06-03 08:07:18] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 59 ms returned unsat
[2020-06-03 08:07:18] [INFO ] [Real]Absence check using 58 positive place invariants in 227 ms returned sat
[2020-06-03 08:07:18] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 144 ms returned unsat
[2020-06-03 08:07:18] [INFO ] [Real]Absence check using 58 positive place invariants in 59 ms returned sat
[2020-06-03 08:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 54 ms returned unsat
[2020-06-03 08:07:19] [INFO ] [Real]Absence check using 58 positive place invariants in 48 ms returned sat
[2020-06-03 08:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 62 ms returned unsat
[2020-06-03 08:07:19] [INFO ] [Real]Absence check using 58 positive place invariants in 35 ms returned sat
[2020-06-03 08:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 08:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:07:20] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2020-06-03 08:07:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:07:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 91 ms returned sat
[2020-06-03 08:07:20] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 69 ms returned sat
[2020-06-03 08:07:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 08:07:21] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2020-06-03 08:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:07:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-03 08:07:22] [INFO ] Deduced a trap composed of 14 places in 427 ms
[2020-06-03 08:07:22] [INFO ] Deduced a trap composed of 12 places in 278 ms
[2020-06-03 08:07:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 852 ms
[2020-06-03 08:07:22] [INFO ] Computed and/alt/rep : 739/14232/735 causal constraints in 56 ms.
[2020-06-03 08:07:25] [INFO ] Added : 79 causal constraints over 16 iterations in 2979 ms. Result :sat
[2020-06-03 08:07:25] [INFO ] [Real]Absence check using 58 positive place invariants in 26 ms returned sat
[2020-06-03 08:07:25] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 14 ms returned unsat
[2020-06-03 08:07:25] [INFO ] [Real]Absence check using 58 positive place invariants in 39 ms returned sat
[2020-06-03 08:07:25] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 08:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2020-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:07:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 24 ms returned sat
[2020-06-03 08:07:27] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 16 ms returned unsat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive place invariants in 25 ms returned unsat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive place invariants in 30 ms returned sat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 20 ms returned unsat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive place invariants in 32 ms returned sat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 5 ms returned unsat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned unsat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive place invariants in 61 ms returned sat
[2020-06-03 08:07:27] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 08:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 08:07:29] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2020-06-03 08:07:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 08:07:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 55 ms returned sat
[2020-06-03 08:07:29] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 37 ms returned unsat
[2020-06-03 08:07:29] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-06-03 08:07:29] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 08:07:29] [INFO ] Flatten gal took : 168 ms
[2020-06-03 08:07:29] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 08:07:29] [INFO ] Flatten gal took : 113 ms
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:07:30] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 08:07:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 22 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBNT-PT-S05J30 @ 3570 seconds

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J30-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3466
rslt: Output for CTLCardinality @ PolyORBNT-PT-S05J30

{
"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": "Wed Jun 3 08:07:30 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"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": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "AG((EX((p259 <= p189)) OR ((p313 <= p110) AND (p101 <= p465) AND ((2 <= p92) OR (1 <= p251)))))",
"processed_size": 96,
"rewrites": 12
},
"net":
{
"conflict_clusters": 114,
"singleton_clusters": 0
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p400 <= p152) AND ((p328 + 1 <= p60) OR (p216 <= 0)))",
"processed_size": 56,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 577
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p461 <= p145)",
"processed_size": 14,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 693
},
"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": "(p126 + 1 <= p242)",
"processed_size": 18,
"rewrites": 13
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 577
},
"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 <= p302)",
"processed_size": 11,
"rewrites": 13
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 693
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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 (G (((p160 <= 0) OR ((p318 + 1 <= p482)))))",
"processed_size": 46,
"rewrites": 11
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 866
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(p25 + p475 + p421 + p262 + p69 <= 0)",
"processed_size": 37,
"rewrites": 13
},
"result":
{
"edges": 45,
"markings": 37,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 1155
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(EG(((p289 <= p445) AND (p181 <= p106))))",
"processed_size": 43,
"rewrites": 12
},
"net":
{
"conflict_clusters": 114,
"singleton_clusters": 0
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "CTL model checker",
"value": true
},
"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": 1733
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p102 <= p420)",
"processed_size": 14,
"rewrites": 13
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3466
},
"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": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "(p1 + p137 + p152 + p161 + p179 + p195 + p210 + p242 + p275 + p278 + p297 + p300 + p305 + p326 + p346 + p361 + p368 + p374 + p375 + p388 + p397 + p422 + p40 + p459 + p31 + p476 + p11 + p14 + p468 + p73 + p93 <= p78)",
"processed_size": 215,
"rewrites": 13
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 285
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 38052,
"runtime": 104.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(E(F(**)))) : E(G(E(F(**)))) : NODEADLOCK : A(G(E(F(**)))) : A(F(E(G(**)))) : E(G(*)) : E(G(E(F(**)))) : A(G((E(X(**)) OR **))) : ((A(F(**)) OR **) AND (** OR (E(G(**)) AND E(X(**)))))"
},
"net":
{
"arcs": 3959,
"conflict_clusters": 114,
"places": 489,
"places_significant": 407,
"singleton_clusters": 0,
"transitions": 745
},
"result":
{
"preliminary_value": "no yes yes no yes yes yes no yes ",
"value": "no yes yes no yes yes yes no 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: 1234/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15648
lola: finding significant places
lola: 489 places, 745 transitions, 407 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 false: (2 <= p52)
lola: A (G (E (F ((p25 + p475 + p421 + p262 + p69 <= 0))))) : E (G (E (F ((p1 + p137 + p152 + p161 + p179 + p195 + p210 + p242 + p275 + p278 + p297 + p300 + p305 + p326 + p346 + p361 + p368 + p374 + p375 + p388 + p397 + p422 + p40 + p459 + p31 + p476 + p11 + p14 + p468 + p73 + p93 <= p78))))) : NOT(A (X ((1 <= 0)))) : A (G (E (F ((1 <= p302))))) : A (F (E (G (((p289 <= p445) AND (p181 <= p106)))))) : NOT(A (F (((1 <= p160) AND ((p482 <= p318)))))) : E (G (E (F ((p102 <= p420))))) : A (G ((E (X ((p259 <= p189))) OR ((p313 <= p110) AND (p101 <= p465) AND ((2 <= p92) OR (1 <= p251)))))) : ((E (G ((0 <= 0))) AND (A (F ((p242 <= p126))) OR (p461 <= p145))) AND (((p400 <= p152) AND ((p328 + 1 <= p60) OR (p216 <= 0))) OR (E (G ((p68 <= p335))) AND E (X ((p27 <= p384))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 10 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 1 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((p259 <= p189))) OR ((p313 <= p110) AND (p101 <= p465) AND ((2 <= p92) OR (1 <= p251))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX((p259 <= p189)) OR ((p313 <= p110) AND (p101 <= p465) AND ((2 <= p92) OR (1 <= p251)))))
lola: processed formula length: 96
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 2 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((p242 <= p126))) OR (p461 <= p145)) AND (((p400 <= p152) AND ((p328 + 1 <= p60) OR (p216 <= 0))) OR (E (G ((p68 <= p335))) AND E (X ((p27 <= p384))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p400 <= p152) AND ((p328 + 1 <= p60) OR (p216 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p400 <= p152) AND ((p328 + 1 <= p60) OR (p216 <= 0)))
lola: processed formula length: 56
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 3 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p461 <= p145)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p461 <= p145)
lola: processed formula length: 14
lola: 10 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 4 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p242 <= p126)))
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: (p126 + 1 <= p242)
lola: processed formula length: 18
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p242 <= p126)
lola: state equation task get result unparse finished id 0
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p302)))))
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: (1 <= p302)
lola: processed formula length: 11
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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 unparse finished++ id 0
lola: formula 0: (p302 <= 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: tscc_search
lola: The predicate is not live.
lola: 42 markings, 41 edges
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: (1 <= p302)
lola: state equation task get result unparse finished id 1
lola: ========================================
lola: subprocess 4 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p160 <= 0) OR ((p318 + 1 <= p482)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p160 <= 0) OR ((p318 + 1 <= p482)))))
lola: processed formula length: 46
lola: 11 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p160) AND ((p482 <= p318)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p25 + p475 + p421 + p262 + p69 <= 0)))))
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: (p25 + p475 + p421 + p262 + p69 <= 0)
lola: processed formula length: 37
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
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 unparse finished++ id 0
lola: formula 0: (1 <= p25 + p475 + p421 + p262 + p69)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p25 + p475 + p421 + p262 + p69 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 37 markings, 45 edges
lola: ========================================
lola: subprocess 6 will run for 1155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p289 <= p445) AND (p181 <= p106))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p289 <= p445) AND (p181 <= p106))))
lola: processed formula length: 43
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 7 will run for 1733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p102 <= p420)))))
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: (p102 <= p420)
lola: processed formula length: 14
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: (p420 + 1 <= p102)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 3466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p1 + p137 + p152 + p161 + p179 + p195 + p210 + p242 + p275 + p278 + p297 + p300 + p305 + p326 + p346 + p361 + p368 + p374 + p375 + p388 + p397 + p422 + p40 + p459 + p31 + p476 + p11 + p14 + p468 + p73 + p93 <= p78)))))
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: (p1 + p137 + p152 + p161 + p179 + p195 + p210 + p242 + p275 + p278 + p297 + p300 + p305 + p326 + p346 + p361 + p368 + p374 + p375 + p388 + p397 + p422 + p40 + p459 + p31 + p476 + p11 + p14 + p468 + p73 + p93 <= p78)
lola: processed formula length: 215
lola: 13 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 13 markings, 12 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no yes
lola:
preliminary result: no yes yes no yes yes yes no yes
lola: memory consumption: 38052 KB
lola: time consumption: 104 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J30"
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 PolyORBNT-PT-S05J30, 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 r176-tajo-158987872200643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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