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.r094-tall-162048902600269.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 EGFr-PT-10420, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902600269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 126K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 28 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 22 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 681K 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 EGFr-PT-10420-00
FORMULA_NAME EGFr-PT-10420-01
FORMULA_NAME EGFr-PT-10420-02
FORMULA_NAME EGFr-PT-10420-03
FORMULA_NAME EGFr-PT-10420-04
FORMULA_NAME EGFr-PT-10420-05
FORMULA_NAME EGFr-PT-10420-06
FORMULA_NAME EGFr-PT-10420-07
FORMULA_NAME EGFr-PT-10420-08
FORMULA_NAME EGFr-PT-10420-09
FORMULA_NAME EGFr-PT-10420-10
FORMULA_NAME EGFr-PT-10420-11
FORMULA_NAME EGFr-PT-10420-12
FORMULA_NAME EGFr-PT-10420-13
FORMULA_NAME EGFr-PT-10420-14
FORMULA_NAME EGFr-PT-10420-15

=== Now, execution of the tool begins

BK_START 1620765528934

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 20:38:51] [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-11 20:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:38:51] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-11 20:38:51] [INFO ] Transformed 208 places.
[2021-05-11 20:38:51] [INFO ] Transformed 378 transitions.
[2021-05-11 20:38:51] [INFO ] Found NUPN structural information;
[2021-05-11 20:38:51] [INFO ] Parsed PT model containing 208 places and 378 transitions in 139 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 77 places and 239 transitions.
Reduce places removed 21 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 467 ms. (steps per millisecond=214 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
[2021-05-11 20:38:52] [INFO ] Flow matrix only has 106 transitions (discarded 33 similar events)
// Phase 1: matrix 106 rows 110 cols
[2021-05-11 20:38:52] [INFO ] Computed 55 place invariants in 4 ms
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2021-05-11 20:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-11 20:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 8 ms returned unsat
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 20:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-11 20:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 20:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:52] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-11 20:38:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2021-05-11 20:38:52] [INFO ] [Nat]Added 54 Read/Feed constraints in 6 ms returned sat
[2021-05-11 20:38:52] [INFO ] Computed and/alt/rep : 129/147/96 causal constraints in 12 ms.
[2021-05-11 20:38:52] [INFO ] Added : 71 causal constraints over 15 iterations in 146 ms. Result :sat
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 20:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-11 20:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 6 ms returned unsat
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 20:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-11 20:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 5 ms returned unsat
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 20:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:52] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-11 20:38:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 5 ms returned unsat
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-11 20:38:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 5 ms returned unsat
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-11 20:38:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Nat]Added 54 Read/Feed constraints in 6 ms returned sat
[2021-05-11 20:38:53] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-11 20:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-11 20:38:53] [INFO ] Computed and/alt/rep : 129/147/96 causal constraints in 7 ms.
[2021-05-11 20:38:53] [INFO ] Added : 72 causal constraints over 15 iterations in 105 ms. Result :sat
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-11 20:38:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 5 ms returned unsat
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-11 20:38:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 4 ms returned unsat
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 20:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:38:53] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-11 20:38:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:38:53] [INFO ] [Nat]Absence check using 55 positive place invariants in 5 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2021-05-11 20:38:53] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-11 20:38:53] [INFO ] Flatten gal took : 67 ms
FORMULA EGFr-PT-10420-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-10420-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 20:38:53] [INFO ] Applying decomposition
[2021-05-11 20:38:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 20:38:54] [INFO ] Flatten gal took : 14 ms
[2021-05-11 20:38:54] [INFO ] Decomposing Gal with order
[2021-05-11 20:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:38:54] [INFO ] Removed a total of 126 redundant transitions.
[2021-05-11 20:38:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-11 20:38:54] [INFO ] Flatten gal took : 46 ms
[2021-05-11 20:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-11 20:38:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EGFr-PT-10420-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 20:38:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 20:38:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ EGFr-PT-10420 @ 3570 seconds

FORMULA EGFr-PT-10420-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-10420-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-10420-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-10420-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EGFr-PT-10420-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3539
rslt: Output for LTLCardinality @ EGFr-PT-10420

{
"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": "Tue May 11 20:38:56 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"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": "(F ((((p80 <= 0)) OR ((1 <= p86)))) U X ((((p80 <= 0)) OR ((1 <= p86)))))",
"processed_size": 75,
"rewrites": 28
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p18))))",
"processed_size": 20,
"rewrites": 28
},
"result":
{
"edges": 2207388,
"markings": 1777713,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p7)) AND ((p98 <= 0)))))",
"processed_size": 38,
"rewrites": 28
},
"result":
{
"edges": 48,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p84 <= 0)) OR ((1 <= p14)))) AND ((p49 <= 0)))))",
"processed_size": 62,
"rewrites": 28
},
"result":
{
"edges": 9877181,
"markings": 7460433,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"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": 3542
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3542
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p105 <= 0)) OR ((1 <= p100))))",
"processed_size": 37,
"rewrites": 28
},
"result":
{
"edges": 58,
"markings": 58,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23212,
"runtime": 29.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) U X(**)) : (F(G(**)) AND G(**)) : G(F(*)) : F(G((F(**) AND **))) : G(F(**))"
},
"net":
{
"arcs": 632,
"conflict_clusters": 3,
"places": 110,
"places_significant": 55,
"singleton_clusters": 0,
"transitions": 139
},
"result":
{
"preliminary_value": "yes no no no no ",
"value": "yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 249/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 110
lola: finding significant places
lola: 110 places, 139 transitions, 55 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: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: (((0 <= 0) U (((p80 <= 0)) OR ((1 <= p86)))) U X ((((p80 <= 0)) OR ((1 <= p86))))) : (NOT(G ((X (X ((((p105 <= 0)) OR ((1 <= p100))))) U NOT(F (G ((((p105 <= 0)) OR ((1 <= p100))))))))) AND G ((((p105 <= 0)) OR ((1 <= p100))))) : F (G (NOT(X (X (G ((((p7 <= 0)) OR ((1 <= p98))))))))) : F (((1 <= 0) U G ((F ((((p84 <= 0)) OR ((1 <= p14)))) AND ((p49 <= 0)))))) : ((((1 <= p18)) U (1 <= 0)) U F (X (F (X (G (F (((1 <= p18)))))))))
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: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p80 <= 0)) OR ((1 <= p86)))) U X ((((p80 <= 0)) OR ((1 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((p80 <= 0)) OR ((1 <= p86)))) U X ((((p80 <= 0)) OR ((1 <= p86)))))
lola: processed formula length: 75
lola: 28 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p18))))
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 <= p18))))
lola: processed formula length: 20
lola: 28 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: 1777713 markings, 2207388 edges
lola: ========================================
lola: subprocess 2 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p7)) AND ((p98 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p7)) AND ((p98 <= 0)))))
lola: processed formula length: 38
lola: 28 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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 3 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p84 <= 0)) OR ((1 <= p14)))) AND ((p49 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p84 <= 0)) OR ((1 <= p14)))) AND ((p49 <= 0)))))
lola: processed formula length: 62
lola: 28 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: 2033120 markings, 2660471 edges, 406624 markings/sec, 0 secs
lola: 3900337 markings, 5129165 edges, 373443 markings/sec, 5 secs
lola: 5703738 markings, 7522684 edges, 360680 markings/sec, 10 secs
lola: 7444628 markings, 9855013 edges, 348178 markings/sec, 15 secs
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: 7460433 markings, 9877181 edges
lola: subprocess 4 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p105 <= 0)) OR ((1 <= p100))))) AND G ((((p105 <= 0)) OR ((1 <= p100)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p105 <= 0)) OR ((1 <= p100))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p105 <= 0)) OR ((1 <= p100))))
lola: processed formula length: 37
lola: 28 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: 58 markings, 58 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no
lola:
preliminary result: yes no no no no
lola: ========================================
lola: memory consumption: 23212 KB
lola: time consumption: 29 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="EGFr-PT-10420"
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 EGFr-PT-10420, 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 r094-tall-162048902600269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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