Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815900433.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is GPPP-PT-C0001N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0001N0000000100-00
FORMULA_NAME GPPP-PT-C0001N0000000100-01
FORMULA_NAME GPPP-PT-C0001N0000000100-02
FORMULA_NAME GPPP-PT-C0001N0000000100-03
FORMULA_NAME GPPP-PT-C0001N0000000100-04
FORMULA_NAME GPPP-PT-C0001N0000000100-05
FORMULA_NAME GPPP-PT-C0001N0000000100-06
FORMULA_NAME GPPP-PT-C0001N0000000100-07
FORMULA_NAME GPPP-PT-C0001N0000000100-08
FORMULA_NAME GPPP-PT-C0001N0000000100-09
FORMULA_NAME GPPP-PT-C0001N0000000100-10
FORMULA_NAME GPPP-PT-C0001N0000000100-11
FORMULA_NAME GPPP-PT-C0001N0000000100-12
FORMULA_NAME GPPP-PT-C0001N0000000100-13
FORMULA_NAME GPPP-PT-C0001N0000000100-14
FORMULA_NAME GPPP-PT-C0001N0000000100-15

=== Now, execution of the tool begins

BK_START 1591430060445

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 07:54:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 07:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 07:54:23] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-06-06 07:54:23] [INFO ] Transformed 33 places.
[2020-06-06 07:54:23] [INFO ] Transformed 22 transitions.
[2020-06-06 07:54:23] [INFO ] Parsed PT model containing 33 places and 22 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 332 ms. (steps per millisecond=301 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 07:54:24] [INFO ] Computed 13 place invariants in 6 ms
[2020-06-06 07:54:24] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned unsat
[2020-06-06 07:54:24] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-06-06 07:54:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned unsat
[2020-06-06 07:54:24] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 07:54:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2020-06-06 07:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:54:24] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-06 07:54:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:54:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 411 ms returned unsat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-06 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-06-06 07:54:25] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2020-06-06 07:54:25] [INFO ] Added : 20 causal constraints over 4 iterations in 112 ms. Result :sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 14 ms returned unsat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-06 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:54:25] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-06-06 07:54:25] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 6 ms.
[2020-06-06 07:54:25] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 07:54:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2020-06-06 07:54:26] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-06 07:54:26] [INFO ] Flatten gal took : 56 ms
FORMULA GPPP-PT-C0001N0000000100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 07:54:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-06 07:54:26] [INFO ] Flatten gal took : 16 ms
[2020-06-06 07:54:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 07:54:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-06 07:54:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ GPPP-PT-C0001N0000000100 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000000100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ GPPP-PT-C0001N0000000100

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 07:54:27 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p26 + 1 <= p17))",
"processed_size": 20,
"rewrites": 54
},
"result":
{
"edges": 38,
"markings": 38,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F ((p17 <= p32)) OR (G ((p17 <= p32)) AND F ((p17 <= p32))))))",
"processed_size": 69,
"rewrites": 54
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((X (G ((p6 <= 2))) OR (F (G ((p6 <= 2))) AND F (G ((p6 <= 2)))))))",
"processed_size": 72,
"rewrites": 54
},
"result":
{
"edges": 40,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"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 (X (X ((p18 <= p0))))",
"processed_size": 23,
"rewrites": 54
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p11 <= p6))",
"processed_size": 15,
"rewrites": 54
},
"result":
{
"edges": 8564,
"markings": 7583,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p27 <= 2) R (p9 <= p24)) OR F ((3 <= p27)))))",
"processed_size": 54,
"rewrites": 54
},
"result":
{
"edges": 647,
"markings": 505,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((G (F ((p3 <= 0))) OR G ((p10 + 1 <= p25))) AND (F ((1 <= p3)) OR (2 <= p17))))",
"processed_size": 83,
"rewrites": 54
},
"result":
{
"edges": 404,
"markings": 139,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 7,
"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": 19572,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(((* R *) OR F(**)))) : (* AND ((F(*) OR G(*)) AND X(*))) : G(**) : G(F((F(*) AND (X(G(*)) OR **)))) : X(F((F(**) OR (G(**) AND F(**))))) : F(((G(F(*)) OR G(**)) AND (F(**) OR **))) : G(F((X(G(*)) OR (F(G(*)) AND F(G(*)))))) : X(X(X(**)))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no no no no yes no no yes ",
"value": "no no 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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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 (G ((((3 <= p27) U (p24 + 1 <= p9)) AND G (NOT(F (((p30 <= p31) U (3 <= p27)))))))))) : (NOT((G ((1 <= p16)) U (1 <= p0))) AND NOT(((1 <= 0) U X ((p17 <= p26))))) : G ((p11 <= p6)) : G (F ((NOT(G ((p9 <= p21))) AND (NOT(X (F ((p9 <= p21)))) OR (p10 <= 0))))) : F (X ((G ((p17 <= p32)) U F (((0 <= 0) U (p17 <= p32)))))) : F (((F (NOT(F (G ((1 <= p3))))) OR G ((p10 + 1 <= p25))) AND (F ((1 <= p3)) OR (2 <= p17)))) : G (F ((NOT(G (F ((3 <= p6)))) U NOT(F (X ((3 <= p6))))))) : X (X (X (((((p18 <= p0)) U (0 <= 0)) AND (p18 <= p0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) AND ((F ((p16 <= 0)) OR G ((p0 <= 0))) AND X ((p26 + 1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= 0)
lola: processed formula length: 9
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p26 + 1 <= p17))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p26 + 1 <= p17))
lola: processed formula length: 20
lola: 54 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: 38 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p21 + 1 <= p9)) AND (X (G ((p21 + 1 <= p9))) OR (p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p21 + 1 <= p9)) AND (X (G ((p21 + 1 <= p9))) OR (p10 <= 0)))))
lola: processed formula length: 73
lola: 54 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: 60 markings, 60 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p17 <= p32)) OR (G ((p17 <= p32)) AND F ((p17 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p17 <= p32)) OR (G ((p17 <= p32)) AND F ((p17 <= p32))))))
lola: processed formula length: 69
lola: 54 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: 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 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p6 <= 2))) OR (F (G ((p6 <= 2))) AND F (G ((p6 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p6 <= 2))) OR (F (G ((p6 <= 2))) AND F (G ((p6 <= 2)))))))
lola: processed formula length: 72
lola: 54 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: add low 1
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: 39 markings, 40 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((p18 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((p18 <= p0))))
lola: processed formula length: 23
lola: 54 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p11 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p11 <= p6))
lola: processed formula length: 15
lola: 54 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: 7583 markings, 8564 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p27 <= 2) R (p9 <= p24)) OR F ((3 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p27 <= 2) R (p9 <= p24)) OR F ((3 <= p27)))))
lola: processed formula length: 54
lola: 54 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: 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: 505 markings, 647 edges
lola: ========================================
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((G (F ((p3 <= 0))) OR G ((p10 + 1 <= p25))) AND (F ((1 <= p3)) OR (2 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((G (F ((p3 <= 0))) OR G ((p10 + 1 <= p25))) AND (F ((1 <= p3)) OR (2 <= p17))))
lola: processed formula length: 83
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 139 markings, 404 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes
lola:
preliminary result: no no no no yes no no yes
lola: memory consumption: 19572 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="GPPP-PT-C0001N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is GPPP-PT-C0001N0000000100, 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 r170-smll-158987815900433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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