Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800700341.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Sudoku-PT-BN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 14K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 2.2K May 5 16:52 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 Sudoku-PT-BN01-00
FORMULA_NAME Sudoku-PT-BN01-01
FORMULA_NAME Sudoku-PT-BN01-02
FORMULA_NAME Sudoku-PT-BN01-03
FORMULA_NAME Sudoku-PT-BN01-04
FORMULA_NAME Sudoku-PT-BN01-05
FORMULA_NAME Sudoku-PT-BN01-06
FORMULA_NAME Sudoku-PT-BN01-07
FORMULA_NAME Sudoku-PT-BN01-08
FORMULA_NAME Sudoku-PT-BN01-09
FORMULA_NAME Sudoku-PT-BN01-10
FORMULA_NAME Sudoku-PT-BN01-11
FORMULA_NAME Sudoku-PT-BN01-12
FORMULA_NAME Sudoku-PT-BN01-13
FORMULA_NAME Sudoku-PT-BN01-14
FORMULA_NAME Sudoku-PT-BN01-15

=== Now, execution of the tool begins

BK_START 1621221184023

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 03:13:06] [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-17 03:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 03:13:06] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-17 03:13:06] [INFO ] Transformed 5 places.
[2021-05-17 03:13:06] [INFO ] Transformed 1 transitions.
[2021-05-17 03:13:06] [INFO ] Found NUPN structural information;
[2021-05-17 03:13:06] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2021-05-17 03:13:06] [INFO ] Parsed PT model containing 5 places and 1 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 293 ms. (steps per millisecond=341 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0]
// Phase 1: matrix 1 rows 5 cols
[2021-05-17 03:13:06] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-17 03:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:13:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-17 03:13:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
[2021-05-17 03:13:07] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-17 03:13:07] [INFO ] Flatten gal took : 18 ms
FORMULA Sudoku-PT-BN01-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 03:13:07] [INFO ] Applying decomposition
[2021-05-17 03:13:07] [INFO ] Flatten gal took : 2 ms
[2021-05-17 03:13:07] [INFO ] Decomposing Gal with order
[2021-05-17 03:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 03:13:07] [INFO ] Flatten gal took : 21 ms
[2021-05-17 03:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 03:13:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-17 03:13:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Sudoku-PT-BN01 @ 3570 seconds

FORMULA Sudoku-PT-BN01-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-BN01-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-BN01-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-BN01-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-BN01-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-BN01-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ Sudoku-PT-BN01

{
"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": "Mon May 17 03:13:08 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p1 <= 0)) OR ((1 <= p2)))) OR (((p0 <= 0)) U (X ((((p1 <= 0)) OR ((1 <= p2)))) AND (((p1 <= 0)) OR ((1 <= p2))))))))",
"processed_size": 132,
"rewrites": 43
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"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": 2,
"visible_transitions": 0
},
"processed": "G ((((1 <= p2)) AND ((p1 <= 0)) AND (p1 <= 0) AND (1 <= p2)))",
"processed_size": 61,
"rewrites": 43
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 892
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((((p3 <= 0)) OR ((1 <= p1))))",
"processed_size": 33,
"rewrites": 43
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p4))) AND X (X (((p3 <= 0)))))))",
"processed_size": 49,
"rewrites": 43
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((X (F (((((p1 <= 0)) OR ((1 <= p0))) OR (G ((((p1 <= 0)) OR ((1 <= p0)))) AND F ((((p1 <= 0)) OR ((1 <= p0)))))))) AND (((p1 <= 0)) OR ((1 <= p0)))))))",
"processed_size": 164,
"rewrites": 43
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"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": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((((p4 <= 0)) OR ((1 <= p1)))))",
"processed_size": 37,
"rewrites": 43
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3568
},
"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 <= p3))))",
"processed_size": 19,
"rewrites": 43
},
"result":
{
"edges": 3,
"markings": 3,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 25712,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) OR (** U (X(**) AND **))))) : G(F(**)) : (X(**) OR (G(**) AND X(F(**)))) : G(F((G(**) AND X(X(**))))) : X(X(F((X(F((** OR (G(**) AND F(**))))) AND **)))) : X(F(**))"
},
"net":
{
"arcs": 5,
"conflict_clusters": 2,
"places": 5,
"places_significant": 1,
"singleton_clusters": 0,
"transitions": 1
},
"result":
{
"preliminary_value": "no no yes no no yes ",
"value": "no no yes no 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: 6/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5
lola: finding significant places
lola: 5 places, 1 transitions, 1 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: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: F (G ((((0 <= 0) U (((p1 <= 0)) OR ((1 <= p2)))) OR (((p0 <= 0)) U (X ((((p1 <= 0)) OR ((1 <= p2)))) AND (((p1 <= 0)) OR ((1 <= p2)))))))) : (NOT((((1 <= p3)) U (0 <= 0))) OR F (G (F (X (((((p1 <= 0)) OR ((1 <= p3))) U ((1 <= p3)))))))) : (G ((((1 <= p2)) AND ((p1 <= 0)) AND (p1 <= 0) AND (1 <= p2))) U (X (((((p2 <= 0)) OR ((1 <= p1))) U (0 <= 0))) AND X ((((p3 <= 0)) OR ((1 <= p1)))))) : NOT(F (G (NOT(G (F ((G (((1 <= p4))) AND X (X (((p3 <= 0))))))))))) : F (X (X ((X (((0 <= 0) U (G ((((p1 <= 0)) OR ((1 <= p0)))) U (((p1 <= 0)) OR ((1 <= p0)))))) AND (((p1 <= 0)) OR ((1 <= p0))))))) : X (((0 <= 0) U F ((((p4 <= 0)) OR ((1 <= p1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p1 <= 0)) OR ((1 <= p2)))) OR (((p0 <= 0)) U (X ((((p1 <= 0)) OR ((1 <= p2)))) AND (((p1 <= 0)) OR ((1 <= p2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p1 <= 0)) OR ((1 <= p2)))) OR (((p0 <= 0)) U (X ((((p1 <= 0)) OR ((1 <= p2)))) AND (((p1 <= 0)) OR ((1 <= p2))))))))
lola: processed formula length: 132
lola: 43 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, 5 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p3 <= 0)) OR ((1 <= p1)))) OR (G ((((1 <= p2)) AND ((p1 <= 0)) AND (p1 <= 0) AND (1 <= p2))) AND X (F ((((p3 <= 0)) OR ((1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p2)) AND ((p1 <= 0)) AND (p1 <= 0) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p2)) AND ((p1 <= 0)) AND (p1 <= 0) AND (1 <= p2)))
lola: processed formula length: 61
lola: 43 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p3 <= 0)) OR ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p3 <= 0)) OR ((1 <= p1))))
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p4))) AND X (X (((p3 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p4))) AND X (X (((p3 <= 0)))))))
lola: processed formula length: 49
lola: 43 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (F (((((p1 <= 0)) OR ((1 <= p0))) OR (G ((((p1 <= 0)) OR ((1 <= p0)))) AND F ((((p1 <= 0)) OR ((1 <= p0)))))))) AND (((p1 <= 0)) OR ((1 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (F (((((p1 <= 0)) OR ((1 <= p0))) OR (G ((((p1 <= 0)) OR ((1 <= p0)))) AND F ((((p1 <= 0)) OR ((1 <= p0)))))))) AND (((p1 <= 0)) OR ((1 <= p0)))))))
lola: processed formula length: 164
lola: 43 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p4 <= 0)) OR ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p4 <= 0)) OR ((1 <= p1)))))
lola: processed formula length: 37
lola: 43 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p3))))
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 <= p3))))
lola: processed formula length: 19
lola: 43 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: 3 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes
lola:
preliminary result: no no yes no no yes
lola: memory consumption: 25712 KB
lola: time consumption: 2 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="Sudoku-PT-BN01"
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 Sudoku-PT-BN01, 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 r265-tall-162106800700341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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