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-162106800600285.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-AN03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800600285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 50K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K 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 11K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 21K 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-AN03-00
FORMULA_NAME Sudoku-PT-AN03-01
FORMULA_NAME Sudoku-PT-AN03-02
FORMULA_NAME Sudoku-PT-AN03-03
FORMULA_NAME Sudoku-PT-AN03-04
FORMULA_NAME Sudoku-PT-AN03-05
FORMULA_NAME Sudoku-PT-AN03-06
FORMULA_NAME Sudoku-PT-AN03-07
FORMULA_NAME Sudoku-PT-AN03-08
FORMULA_NAME Sudoku-PT-AN03-09
FORMULA_NAME Sudoku-PT-AN03-10
FORMULA_NAME Sudoku-PT-AN03-11
FORMULA_NAME Sudoku-PT-AN03-12
FORMULA_NAME Sudoku-PT-AN03-13
FORMULA_NAME Sudoku-PT-AN03-14
FORMULA_NAME Sudoku-PT-AN03-15

=== Now, execution of the tool begins

BK_START 1621208833118

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 23:47:14] [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-16 23:47:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 23:47:14] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2021-05-16 23:47:14] [INFO ] Transformed 54 places.
[2021-05-16 23:47:15] [INFO ] Transformed 27 transitions.
[2021-05-16 23:47:15] [INFO ] Parsed PT model containing 54 places and 27 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11744 resets, run finished after 606 ms. (steps per millisecond=165 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1]
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 23:47:15] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-16 23:47:15] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned unsat
[2021-05-16 23:47:15] [INFO ] [Real]Absence check using 27 positive place invariants in 33 ms returned unsat
[2021-05-16 23:47:15] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned unsat
[2021-05-16 23:47:15] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned unsat
[2021-05-16 23:47:15] [INFO ] [Real]Absence check using 27 positive place invariants in 24 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 27 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 3 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned unsat
[2021-05-16 23:47:16] [INFO ] [Real]Absence check using 27 positive place invariants in 2 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 21 simplifications.
[2021-05-16 23:47:16] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-16 23:47:16] [INFO ] Flatten gal took : 60 ms
FORMULA Sudoku-PT-AN03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:47:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 23:47:16] [INFO ] Flatten gal took : 7 ms
[2021-05-16 23:47:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-PT-AN03-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 23:47:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 15 ms.
[2021-05-16 23:47:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Sudoku-PT-AN03 @ 3570 seconds

FORMULA Sudoku-PT-AN03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Sudoku-PT-AN03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN03-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Sudoku-PT-AN03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ Sudoku-PT-AN03

{
"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": "Sun May 16 23:47:17 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (G ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))",
"processed_size": 57,
"rewrites": 48
},
"result":
{
"edges": 27,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= 0)) AND F ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= 1))))",
"processed_size": 126,
"rewrites": 48
},
"result":
{
"edges": 8,
"markings": 8,
"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": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "X (G (((X (F ((p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= 0))) R (p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= 0)) OR G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= 2)))))",
"processed_size": 419,
"rewrites": 48
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p31 + 1 <= p8))",
"processed_size": 19,
"rewrites": 48
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (G ((X (G ((p17 <= p39))) AND (p7 <= p38)))))",
"processed_size": 50,
"rewrites": 48
},
"result":
{
"edges": 1155,
"markings": 309,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "((G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35)) OR (3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)) U (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35))",
"processed_size": 503,
"rewrites": 48
},
"result":
{
"edges": 35883,
"markings": 8488,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 18776,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(*) AND F(*))) : X(G(**)) : FALSE : X(G(((X(F(*)) R *) OR G(*)))) : ((G(**) OR **) U **) : X(**) : X(X(G((X(G(**)) AND **))))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 28,
"places": 54,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 27
},
"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: 81/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 54
lola: finding significant places
lola: 54 places, 27 transitions, 27 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: NOT(X ((F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)) OR G ((2 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44))))) : G (X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))) : F (NOT(X ((F (G ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= 0))) U NOT(X (NOT((G ((p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)) U (0 <= 0))))))))) : NOT(F (((X (X (G ((1 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35)))) U X ((1 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35))) AND F (X ((3 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)))))) : ((G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35)) OR (3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)) U (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35)) : (X ((p31 + 1 <= p8)) OR (X (G (((p45 <= p0) U (1 <= 0)))) AND G (((1 <= 0) U (1 <= 0))))) : X (X (G ((G (X ((p17 <= p39))) AND (p7 <= p38)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))
lola: processed formula length: 57
lola: 48 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 27 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= 0)) AND F ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= 0)) AND F ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= 1))))
lola: processed formula length: 126
lola: 48 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X (F ((p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= 0))) R (p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= 0)) OR G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X (F ((p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= 0))) R (p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35 <= 0)) OR G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + ... (shortened)
lola: processed formula length: 419
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p31 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p31 + 1 <= p8))
lola: processed formula length: 19
lola: 48 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (G ((p17 <= p39))) AND (p7 <= p38)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (G ((p17 <= p39))) AND (p7 <= p38)))))
lola: processed formula length: 50
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 309 markings, 1155 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35)) OR (3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)) U (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 + p19 + p20 + p21 + p22 + p23 + p29 + p28 + p27 + p26 + p25 + p24 + p17 + p16 + p15 + p33 + p34 + p35)) OR (3 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)) U (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= p9 + p10 + p11 + p12 + p13 + p14 + p32 + p31 + p30 + p18 ... (shortened)
lola: processed formula length: 503
lola: 48 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8488 markings, 35883 edges
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: 18776 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="Sudoku-PT-AN03"
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-AN03, 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-162106800600285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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