Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.4K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 13 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 07:34 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:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 43K May 12 20:53 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 ResAllocation-PT-R010C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R010C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591238826547

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:47:08] [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 02:47:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:47:08] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-06-04 02:47:08] [INFO ] Transformed 40 places.
[2020-06-04 02:47:08] [INFO ] Transformed 22 transitions.
[2020-06-04 02:47:08] [INFO ] Parsed PT model containing 40 places and 22 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Incomplete random walk after 100000 steps, including 2987 resets, run finished after 251 ms. (steps per millisecond=398 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0]
// Phase 1: matrix 22 rows 40 cols
[2020-06-04 02:47:09] [INFO ] Computed 20 place invariants in 4 ms
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-06-04 02:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-04 02:47:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:47:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 40 ms returned unsat
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-04 02:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-04 02:47:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:47:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2020-06-04 02:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:09] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-04 02:47:10] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-04 02:47:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 82 ms
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned unsat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-06-04 02:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-04 02:47:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:47:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2020-06-04 02:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-04 02:47:10] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints in 4 ms.
[2020-06-04 02:47:10] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-06-04 02:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-04 02:47:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:47:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-06-04 02:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:10] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-04 02:47:10] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints in 7 ms.
[2020-06-04 02:47:10] [INFO ] Added : 17 causal constraints over 4 iterations in 77 ms. Result :sat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 73 ms returned unsat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned unsat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-06-04 02:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-04 02:47:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:47:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned unsat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned unsat
[2020-06-04 02:47:10] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2020-06-04 02:47:10] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 02:47:10] [INFO ] Flatten gal took : 54 ms
[2020-06-04 02:47:10] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 02:47:10] [INFO ] Flatten gal took : 8 ms
FORMULA ResAllocation-PT-R010C002-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:47:10] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 9 ms.
[2020-06-04 02:47:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ResAllocation-PT-R010C002 @ 3570 seconds

FORMULA ResAllocation-PT-R010C002-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R010C002-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R010C002-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R010C002-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R010C002-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R010C002-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ ResAllocation-PT-R010C002

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:47:11 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 <= p7)))",
"processed_size": 17,
"rewrites": 5
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"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": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(p32 + 1 <= p23)",
"processed_size": 16,
"rewrites": 3
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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 ((p16 <= p21)))",
"processed_size": 20,
"rewrites": 5
},
"result":
{
"edges": 148,
"markings": 84,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p12 <= p5))",
"processed_size": 13,
"rewrites": 6
},
"result":
{
"edges": 10345,
"markings": 3610,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "A (((p22 <= 0) U (p17 <= p36)))",
"processed_size": 31,
"rewrites": 8
},
"result":
{
"edges": 976,
"markings": 392,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": "E (((p24 <= p10) U (p25 + 1 <= p26)))",
"processed_size": 37,
"rewrites": 6
},
"result":
{
"edges": 15104,
"markings": 4608,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 18236,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(A(G(**)))) AND (E(X(**)) AND A(G(**)))) : E(X(A(X(**)))) : E((** U **)) : (A(X(**)) AND (** AND A(G(**)))) : A(G(E(F(**)))) : A((** U **))"
},
"net":
{
"arcs": 100,
"conflict_clusters": 12,
"places": 40,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no yes no yes no yes ",
"value": "no yes no 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: 62/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40
lola: finding significant places
lola: 40 places, 22 transitions, 20 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 <= p31)
lola: LP says that atomic proposition is always false: (2 <= p9)
lola: ((E (F (A (G ((1 <= p0))))) AND E (X ((p30 <= p16)))) AND A (G ((1 <= p7)))) : E (X (A (X ((p34 <= p1))))) : E (((p24 <= p10) U (p25 + 1 <= p26))) : ((A (X (((p20 <= p23)))) AND (p32 + 1 <= p23)) AND A (G (A (G ((p16 <= p21)))))) : A (G (E (F (((p12 <= p5)))))) : A (((p22 <= 0) U (p17 <= p36)))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((1 <= p0))))) AND (E (X ((p30 <= p16))) AND A (G ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p7)))
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 <= p7)))
lola: processed formula length: 17
lola: 5 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: (p7 <= 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: state equation: write sara problem file to CTLCardinality-0.sara
lola: result: no
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((p34 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX((p34 <= p1)))
lola: processed formula length: 19
lola: 5 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
sara: try reading problem file CTLCardinality-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic

lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p20 <= p23)))) AND ((p32 + 1 <= p23) AND A (G ((p16 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p32 + 1 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p32 + 1 <= p23)
lola: processed formula length: 16
lola: 3 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p16 <= p21)))
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 ((p16 <= p21)))
lola: processed formula length: 20
lola: 5 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: (p21 + 1 <= p16)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 84 markings, 148 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p20 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p20 <= p23)))
lola: processed formula length: 18
lola: 4 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p12 <= p5))))))
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: ((p12 <= p5))
lola: processed formula length: 13
lola: 6 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: ((p5 + 1 <= p12))
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: ((p12 <= p5))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: try reading problem file CTLCardinality-3-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 3610 markings, 10345 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p22 <= 0) U (p17 <= p36)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p22 <= 0) U (p17 <= p36)))
lola: processed formula length: 31
lola: 8 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: (p22 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 392 markings, 976 edges
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p24 <= p10) U (p25 + 1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p24 <= p10) U (p25 + 1 <= p26)))
lola: processed formula length: 37
lola: 6 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (p25 + 1 <= p26)
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: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 4608 markings, 15104 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no yes
lola:
preliminary result: no yes no yes no yes
lola: memory consumption: 18236 KB
lola: time consumption: 3 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="ResAllocation-PT-R010C002"
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 ResAllocation-PT-R010C002, 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 r194-csrt-159033390400707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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