Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089433000409.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is ResAllocation-PT-R100C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089433000409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 422K May 5 16:51 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-R100C002-00
FORMULA_NAME ResAllocation-PT-R100C002-01
FORMULA_NAME ResAllocation-PT-R100C002-02
FORMULA_NAME ResAllocation-PT-R100C002-03
FORMULA_NAME ResAllocation-PT-R100C002-04
FORMULA_NAME ResAllocation-PT-R100C002-05
FORMULA_NAME ResAllocation-PT-R100C002-06
FORMULA_NAME ResAllocation-PT-R100C002-07
FORMULA_NAME ResAllocation-PT-R100C002-08
FORMULA_NAME ResAllocation-PT-R100C002-09
FORMULA_NAME ResAllocation-PT-R100C002-10
FORMULA_NAME ResAllocation-PT-R100C002-11
FORMULA_NAME ResAllocation-PT-R100C002-12
FORMULA_NAME ResAllocation-PT-R100C002-13
FORMULA_NAME ResAllocation-PT-R100C002-14
FORMULA_NAME ResAllocation-PT-R100C002-15

=== Now, execution of the tool begins

BK_START 1621430450673

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:20:52] [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]
[2021-05-19 13:20:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:20:52] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2021-05-19 13:20:52] [INFO ] Transformed 400 places.
[2021-05-19 13:20:52] [INFO ] Transformed 202 transitions.
[2021-05-19 13:20:52] [INFO ] Parsed PT model containing 400 places and 202 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 38 resets, run finished after 509 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 202 rows 400 cols
[2021-05-19 13:20:53] [INFO ] Computed 200 place invariants in 17 ms
[2021-05-19 13:20:53] [INFO ] [Real]Absence check using 200 positive place invariants in 15 ms returned unsat
[2021-05-19 13:20:53] [INFO ] [Real]Absence check using 200 positive place invariants in 51 ms returned unsat
[2021-05-19 13:20:53] [INFO ] [Real]Absence check using 200 positive place invariants in 20 ms returned unsat
[2021-05-19 13:20:53] [INFO ] [Real]Absence check using 200 positive place invariants in 7 ms returned unsat
[2021-05-19 13:20:53] [INFO ] [Real]Absence check using 200 positive place invariants in 61 ms returned sat
[2021-05-19 13:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:54] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2021-05-19 13:20:54] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 27 ms.
[2021-05-19 13:20:55] [INFO ] Added : 192 causal constraints over 39 iterations in 823 ms. Result :sat
[2021-05-19 13:20:55] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned unsat
[2021-05-19 13:20:55] [INFO ] [Real]Absence check using 200 positive place invariants in 72 ms returned unsat
[2021-05-19 13:20:55] [INFO ] [Real]Absence check using 200 positive place invariants in 11 ms returned unsat
[2021-05-19 13:20:55] [INFO ] [Real]Absence check using 200 positive place invariants in 78 ms returned sat
[2021-05-19 13:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:55] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2021-05-19 13:20:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 75 ms returned sat
[2021-05-19 13:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:56] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2021-05-19 13:20:56] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 8 ms.
[2021-05-19 13:20:56] [INFO ] Added : 163 causal constraints over 33 iterations in 519 ms. Result :sat
[2021-05-19 13:20:57] [INFO ] [Real]Absence check using 200 positive place invariants in 13 ms returned unsat
[2021-05-19 13:20:57] [INFO ] [Real]Absence check using 200 positive place invariants in 64 ms returned unsat
[2021-05-19 13:20:57] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned unsat
[2021-05-19 13:20:57] [INFO ] [Real]Absence check using 200 positive place invariants in 81 ms returned sat
[2021-05-19 13:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:57] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2021-05-19 13:20:57] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 16 ms.
[2021-05-19 13:20:58] [INFO ] Added : 95 causal constraints over 19 iterations in 342 ms. Result :sat
[2021-05-19 13:20:58] [INFO ] [Real]Absence check using 200 positive place invariants in 64 ms returned unsat
[2021-05-19 13:20:58] [INFO ] [Real]Absence check using 200 positive place invariants in 98 ms returned sat
[2021-05-19 13:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:58] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2021-05-19 13:20:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:20:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 98 ms returned sat
[2021-05-19 13:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:20:59] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2021-05-19 13:20:59] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-19 13:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-19 13:20:59] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 16 ms.
[2021-05-19 13:20:59] [INFO ] Added : 97 causal constraints over 20 iterations in 302 ms. Result :sat
[2021-05-19 13:20:59] [INFO ] [Real]Absence check using 200 positive place invariants in 91 ms returned sat
[2021-05-19 13:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:00] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2021-05-19 13:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 148 ms returned sat
[2021-05-19 13:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:01] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2021-05-19 13:21:01] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-19 13:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-19 13:21:01] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 15 ms.
[2021-05-19 13:21:01] [INFO ] Added : 98 causal constraints over 20 iterations in 632 ms. Result :sat
[2021-05-19 13:21:01] [INFO ] [Real]Absence check using 200 positive place invariants in 4 ms returned unsat
[2021-05-19 13:21:02] [INFO ] [Real]Absence check using 200 positive place invariants in 57 ms returned sat
[2021-05-19 13:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:02] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2021-05-19 13:21:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:21:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 77 ms returned sat
[2021-05-19 13:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:21:03] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2021-05-19 13:21:03] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints in 17 ms.
[2021-05-19 13:21:03] [INFO ] Added : 169 causal constraints over 34 iterations in 573 ms. Result :sat
[2021-05-19 13:21:03] [INFO ] [Real]Absence check using 200 positive place invariants in 5 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 14 simplifications.
[2021-05-19 13:21:03] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-19 13:21:04] [INFO ] Flatten gal took : 73 ms
FORMULA ResAllocation-PT-R100C002-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:21:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 13:21:04] [INFO ] Flatten gal took : 30 ms
[2021-05-19 13:21:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R100C002-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:21:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 13:21:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ResAllocation-PT-R100C002 @ 3570 seconds

FORMULA ResAllocation-PT-R100C002-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ ResAllocation-PT-R100C002

{
"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": "Wed May 19 13:21:04 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((p188 <= 0)) R (F ((1 <= p362)) AND (p362 <= 0))))",
"processed_size": 57,
"rewrites": 30
},
"result":
{
"edges": 3657,
"markings": 3657,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 0,
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": "(p115 + 1 <= p206)",
"processed_size": 18,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p395 <= p331)))",
"processed_size": 22,
"rewrites": 30
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F ((1 <= p384))) AND (X (F ((p76 <= p46))) OR (1 <= p320))))",
"processed_size": 67,
"rewrites": 30
},
"result":
{
"edges": 4493,
"markings": 4493,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p369 <= 0)))",
"processed_size": 19,
"rewrites": 30
},
"result":
{
"edges": 3861,
"markings": 3861,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p399 + 1 <= p142)))",
"processed_size": 26,
"rewrites": 30
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G (((p20 + 1 <= p223) OR (p385 + 1 <= p47)))) AND F (G ((p385 + 1 <= p47)))))",
"processed_size": 85,
"rewrites": 30
},
"result":
{
"edges": 4019,
"markings": 4018,
"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": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G ((p338 + 1 <= p163))",
"processed_size": 22,
"rewrites": 30
},
"result":
{
"edges": 1819,
"markings": 1819,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20532,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : X((G(*) R (F(*) AND *))) : (G(**) AND F(G(**))) : F((F(G(*)) AND F(G(*)))) : (X(F(**)) AND F(**)) : F((X(F(**)) AND (X(F(**)) OR **))) : G(F(*))"
},
"net":
{
"arcs": 1000,
"conflict_clusters": 102,
"places": 400,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no no no no yes no no ",
"value": "no no no no yes 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: 602/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 400
lola: finding significant places
lola: 400 places, 202 transitions, 200 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: F (((1 <= 0) U G (NOT(G (((1 <= 0) U (1 <= p369))))))) : X (NOT((F ((1 <= p188)) U (G ((p362 <= 0)) OR (1 <= p362))))) : (G ((p338 + 1 <= p163)) AND ((1 <= 0) U F (G ((p38 <= p294))))) : NOT(G ((G (F (((p223 <= p20) AND (p47 <= p385)))) OR G (F ((p47 <= p385)))))) : (X (F ((p395 <= p331))) AND F ((p206 <= p115))) : F ((X (F ((1 <= p384))) AND (F (X ((p76 <= p46))) OR (1 <= p320)))) : NOT(((0 <= 0) U G ((p142 <= p399))))
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p188 <= 0)) R (F ((1 <= p362)) AND (p362 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p188 <= 0)) R (F ((1 <= p362)) AND (p362 <= 0))))
lola: processed formula length: 57
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 3657 markings, 3657 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p395 <= p331))) AND F ((p206 <= p115)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p206 <= p115))
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: (p115 + 1 <= p206)
lola: processed formula length: 18
lola: 32 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p395 <= p331)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p395 <= p331)))
lola: processed formula length: 22
lola: 30 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((1 <= p384))) AND (X (F ((p76 <= p46))) OR (1 <= p320))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((1 <= p384))) AND (X (F ((p76 <= p46))) OR (1 <= p320))))
lola: processed formula length: 67
lola: 30 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 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: 4493 markings, 4493 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p369 <= 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 ((p369 <= 0)))
lola: processed formula length: 19
lola: 30 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: 3861 markings, 3861 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p399 + 1 <= p142)))
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 ((p399 + 1 <= p142)))
lola: processed formula length: 26
lola: 30 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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((p20 + 1 <= p223) OR (p385 + 1 <= p47)))) AND F (G ((p385 + 1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((p20 + 1 <= p223) OR (p385 + 1 <= p47)))) AND F (G ((p385 + 1 <= p47)))))
lola: processed formula length: 85
lola: 30 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: 4018 markings, 4019 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p338 + 1 <= p163)) AND F (G ((p38 <= p294))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p338 + 1 <= p163))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p338 + 1 <= p163))
lola: processed formula length: 22
lola: 30 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: 1819 markings, 1819 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no
lola:
preliminary result: no no no no yes no no
lola: memory consumption: 20532 KB
lola: time consumption: 3 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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ResAllocation-PT-R100C002, 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 r189-tajo-162089433000409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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