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.r180-ebro-158987900400561.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 DLCround-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900400561
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 3.4K Mar 30 19:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 19:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 09:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 09:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 00:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 00:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K 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 DLCround-PT-10a-00
FORMULA_NAME DLCround-PT-10a-01
FORMULA_NAME DLCround-PT-10a-02
FORMULA_NAME DLCround-PT-10a-03
FORMULA_NAME DLCround-PT-10a-04
FORMULA_NAME DLCround-PT-10a-05
FORMULA_NAME DLCround-PT-10a-06
FORMULA_NAME DLCround-PT-10a-07
FORMULA_NAME DLCround-PT-10a-08
FORMULA_NAME DLCround-PT-10a-09
FORMULA_NAME DLCround-PT-10a-10
FORMULA_NAME DLCround-PT-10a-11
FORMULA_NAME DLCround-PT-10a-12
FORMULA_NAME DLCround-PT-10a-13
FORMULA_NAME DLCround-PT-10a-14
FORMULA_NAME DLCround-PT-10a-15

=== Now, execution of the tool begins

BK_START 1591249312874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 05:41:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 05:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 05:41:57] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2020-06-04 05:41:57] [INFO ] Transformed 337 places.
[2020-06-04 05:41:57] [INFO ] Transformed 2605 transitions.
[2020-06-04 05:41:57] [INFO ] Found NUPN structural information;
[2020-06-04 05:41:57] [INFO ] Parsed PT model containing 337 places and 2605 transitions in 457 ms.
Ensure Unique test removed 247 transitions
Reduce redundant transitions removed 247 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1772 ms. (steps per millisecond=56 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0]
[2020-06-04 05:41:59] [INFO ] Flow matrix only has 218 transitions (discarded 2140 similar events)
// Phase 1: matrix 218 rows 337 cols
[2020-06-04 05:41:59] [INFO ] Computed 213 place invariants in 24 ms
[2020-06-04 05:42:00] [INFO ] [Real]Absence check using 213 positive place invariants in 284 ms returned sat
[2020-06-04 05:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:00] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2020-06-04 05:42:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:00] [INFO ] [Nat]Absence check using 213 positive place invariants in 30 ms returned unsat
[2020-06-04 05:42:01] [INFO ] [Real]Absence check using 213 positive place invariants in 122 ms returned sat
[2020-06-04 05:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:01] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-06-04 05:42:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:01] [INFO ] [Nat]Absence check using 213 positive place invariants in 24 ms returned unsat
[2020-06-04 05:42:02] [INFO ] [Real]Absence check using 213 positive place invariants in 126 ms returned sat
[2020-06-04 05:42:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:02] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2020-06-04 05:42:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:03] [INFO ] [Nat]Absence check using 213 positive place invariants in 29 ms returned unsat
[2020-06-04 05:42:03] [INFO ] [Real]Absence check using 213 positive place invariants in 126 ms returned sat
[2020-06-04 05:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:03] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2020-06-04 05:42:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:03] [INFO ] [Nat]Absence check using 213 positive place invariants in 105 ms returned unsat
[2020-06-04 05:42:04] [INFO ] [Real]Absence check using 213 positive place invariants in 132 ms returned sat
[2020-06-04 05:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:04] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2020-06-04 05:42:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:04] [INFO ] [Nat]Absence check using 213 positive place invariants in 20 ms returned unsat
[2020-06-04 05:42:05] [INFO ] [Real]Absence check using 213 positive place invariants in 122 ms returned sat
[2020-06-04 05:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:05] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2020-06-04 05:42:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:05] [INFO ] [Nat]Absence check using 213 positive place invariants in 47 ms returned unsat
[2020-06-04 05:42:06] [INFO ] [Real]Absence check using 213 positive place invariants in 133 ms returned sat
[2020-06-04 05:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:06] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2020-06-04 05:42:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:06] [INFO ] [Nat]Absence check using 213 positive place invariants in 29 ms returned unsat
[2020-06-04 05:42:06] [INFO ] [Real]Absence check using 213 positive place invariants in 119 ms returned sat
[2020-06-04 05:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:07] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2020-06-04 05:42:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:07] [INFO ] [Nat]Absence check using 213 positive place invariants in 35 ms returned unsat
[2020-06-04 05:42:08] [INFO ] [Real]Absence check using 213 positive place invariants in 121 ms returned sat
[2020-06-04 05:42:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:08] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2020-06-04 05:42:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:08] [INFO ] [Nat]Absence check using 213 positive place invariants in 177 ms returned unsat
[2020-06-04 05:42:09] [INFO ] [Real]Absence check using 213 positive place invariants in 110 ms returned sat
[2020-06-04 05:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:09] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2020-06-04 05:42:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:09] [INFO ] [Nat]Absence check using 213 positive place invariants in 137 ms returned unsat
[2020-06-04 05:42:10] [INFO ] [Real]Absence check using 213 positive place invariants in 113 ms returned sat
[2020-06-04 05:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:10] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2020-06-04 05:42:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:10] [INFO ] [Nat]Absence check using 213 positive place invariants in 224 ms returned unsat
[2020-06-04 05:42:11] [INFO ] [Real]Absence check using 213 positive place invariants in 114 ms returned sat
[2020-06-04 05:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:12] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2020-06-04 05:42:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:12] [INFO ] [Nat]Absence check using 213 positive place invariants in 160 ms returned unsat
[2020-06-04 05:42:12] [INFO ] [Real]Absence check using 213 positive place invariants in 129 ms returned sat
[2020-06-04 05:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:12] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-04 05:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:13] [INFO ] [Nat]Absence check using 213 positive place invariants in 30 ms returned unsat
[2020-06-04 05:42:13] [INFO ] [Real]Absence check using 213 positive place invariants in 121 ms returned sat
[2020-06-04 05:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:13] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2020-06-04 05:42:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:13] [INFO ] [Nat]Absence check using 213 positive place invariants in 17 ms returned unsat
[2020-06-04 05:42:14] [INFO ] [Real]Absence check using 213 positive place invariants in 122 ms returned sat
[2020-06-04 05:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:14] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2020-06-04 05:42:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:14] [INFO ] [Nat]Absence check using 213 positive place invariants in 114 ms returned unsat
[2020-06-04 05:42:15] [INFO ] [Real]Absence check using 213 positive place invariants in 123 ms returned sat
[2020-06-04 05:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:15] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2020-06-04 05:42:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:15] [INFO ] [Nat]Absence check using 213 positive place invariants in 20 ms returned unsat
[2020-06-04 05:42:16] [INFO ] [Real]Absence check using 213 positive place invariants in 146 ms returned sat
[2020-06-04 05:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:16] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-06-04 05:42:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:16] [INFO ] [Nat]Absence check using 213 positive place invariants in 89 ms returned unsat
[2020-06-04 05:42:16] [INFO ] [Real]Absence check using 213 positive place invariants in 114 ms returned sat
[2020-06-04 05:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:17] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2020-06-04 05:42:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:17] [INFO ] [Nat]Absence check using 213 positive place invariants in 22 ms returned unsat
[2020-06-04 05:42:17] [INFO ] [Real]Absence check using 213 positive place invariants in 126 ms returned sat
[2020-06-04 05:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 05:42:18] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2020-06-04 05:42:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 05:42:18] [INFO ] [Nat]Absence check using 213 positive place invariants in 98 ms returned unsat
Successfully simplified 19 atomic propositions for a total of 22 simplifications.
[2020-06-04 05:42:19] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 05:42:19] [INFO ] Flatten gal took : 346 ms
FORMULA DLCround-PT-10a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 05:42:19] [INFO ] Applying decomposition
[2020-06-04 05:42:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 05:42:19] [INFO ] Flatten gal took : 185 ms
[2020-06-04 05:42:19] [INFO ] Decomposing Gal with order
[2020-06-04 05:42:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 05:42:20] [INFO ] Removed a total of 3958 redundant transitions.
[2020-06-04 05:42:20] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 05:42:20] [INFO ] Flatten gal took : 445 ms
[2020-06-04 05:42:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 177 ms.
[2020-06-04 05:42:20] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA DLCround-PT-10a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 05:42:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2020-06-04 05:42:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 77 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCround-PT-10a @ 3570 seconds

FORMULA DLCround-PT-10a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-10a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-10a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-10a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLCardinality @ DLCround-PT-10a

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 05:42:21 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p80 <= 0))",
"processed_size": 12,
"rewrites": 22
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((((((1 <= p30)) AND ((p82 <= 0))) U ((1 <= p110))) AND ((1 <= p72)))) AND G (((1 <= p110)))))",
"processed_size": 100,
"rewrites": 20
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "G (F (((1 <= p10))))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p151)) AND ((p97 <= 0)))))",
"processed_size": 40,
"rewrites": 20
},
"result":
{
"edges": 2272,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 36764,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(**) AND F(**)) : G(F(**)) : X((X(((** U **) AND **)) AND G(**))) : ((** OR (G(**) AND F(**))) AND G(F(*)))"
},
"net":
{
"arcs": 9240,
"conflict_clusters": 25,
"places": 337,
"places_significant": 124,
"singleton_clusters": 0,
"transitions": 2358
},
"result":
{
"preliminary_value": "no no no no ",
"value": "no 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: 2695/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 337
lola: finding significant places
lola: 337 places, 2358 transitions, 124 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: ((1 <= 0) U (X ((((1 <= p169)) AND ((p53 <= 0)))) AND F (((1 <= p80))))) : F (G (X ((((0 <= 0) U ((1 <= p10))) OR ((1 <= 0) U (1 <= 0)))))) : X ((X (((((((1 <= p30)) AND ((p82 <= 0))) U ((1 <= p110))) U ((1 <= p110))) AND ((1 <= p72)))) AND G (((1 <= p110))))) : ((G ((((p151 <= 0)) OR ((1 <= p97)))) U (((p151 <= 0)) OR ((1 <= p97)))) AND NOT(G (F (G (X ((((p151 <= 0)) OR ((1 <= p97)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:482
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p169)) AND ((p53 <= 0)))) AND F (((1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p80 <= 0))
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((((1 <= p30)) AND ((p82 <= 0))) U ((1 <= p110))) AND ((1 <= p72)))) AND G (((1 <= p110)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((((1 <= p30)) AND ((p82 <= 0))) U ((1 <= p110))) AND ((1 <= p72)))) AND G (((1 <= p110)))))
lola: processed formula length: 100
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p10))))
lola: processed formula length: 20
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p151 <= 0)) OR ((1 <= p97))) OR (G ((((p151 <= 0)) OR ((1 <= p97)))) AND F ((((p151 <= 0)) OR ((1 <= p97)))))) AND G (F ((((1 <= p151)) AND ((p97 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p151 <= 0)) OR ((1 <= p97)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p151 <= 0)) OR ((1 <= p97)))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: (((((p151 <= 0)) OR ((1 <= p97))) OR (G ((((p151 <= 0)) OR ((1 <= p97)))) AND F ((((p151 <= 0)) OR ((1 <= p97)))))) AND G (F ((((1 <= p151)) AND ((p97 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p151 <= 0)) OR ((1 <= p97)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p151 <= 0)) OR ((1 <= p97)))
lola: processed formula length: 32
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p151)) AND ((p97 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p151)) AND ((p97 <= 0)))))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 2272 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no
lola:
preliminary result: no no no no
lola: memory consumption: 36764 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="DLCround-PT-10a"
export BK_EXAMINATION="LTLCardinality"
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 DLCround-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900400561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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