About the Execution of ITS-LoLa for DrinkVendingMachine-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.810 | 3600000.00 | 10856.00 | 60.40 | FTFFFFTTTTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900809.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 DrinkVendingMachine-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900809
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K 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 DrinkVendingMachine-COL-02-00
FORMULA_NAME DrinkVendingMachine-COL-02-01
FORMULA_NAME DrinkVendingMachine-COL-02-02
FORMULA_NAME DrinkVendingMachine-COL-02-03
FORMULA_NAME DrinkVendingMachine-COL-02-04
FORMULA_NAME DrinkVendingMachine-COL-02-05
FORMULA_NAME DrinkVendingMachine-COL-02-06
FORMULA_NAME DrinkVendingMachine-COL-02-07
FORMULA_NAME DrinkVendingMachine-COL-02-08
FORMULA_NAME DrinkVendingMachine-COL-02-09
FORMULA_NAME DrinkVendingMachine-COL-02-10
FORMULA_NAME DrinkVendingMachine-COL-02-11
FORMULA_NAME DrinkVendingMachine-COL-02-12
FORMULA_NAME DrinkVendingMachine-COL-02-13
FORMULA_NAME DrinkVendingMachine-COL-02-14
FORMULA_NAME DrinkVendingMachine-COL-02-15
=== Now, execution of the tool begins
BK_START 1591243782219
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 04:09:43] [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-04 04:09:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 04:09:43] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-04 04:09:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 471 ms
[2020-06-04 04:09:44] [INFO ] sort/places :
Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,
[2020-06-04 04:09:44] [INFO ] o3 symmetric to o1 in transition elaborate3
[2020-06-04 04:09:44] [INFO ] o1 symmetric to o2 in transition elaborate3
[2020-06-04 04:09:44] [INFO ] o1 symmetric to o2 in transition elaborate2
[2020-06-04 04:09:44] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 13 ms.
[2020-06-04 04:09:44] [INFO ] Computed order based on color domains.
[2020-06-04 04:09:44] [INFO ] Unfolded HLPN to a Petri net with 24 places and 52 transitions in 6 ms.
[2020-06-04 04:09:44] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 258 ms. (steps per millisecond=387 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2020-06-04 04:09:44] [INFO ] Computed 12 place invariants in 3 ms
[2020-06-04 04:09:44] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned unsat
[2020-06-04 04:09:44] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2020-06-04 04:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-04 04:09:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:09:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-06-04 04:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:44] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-04 04:09:44] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-06-04 04:09:44] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
[2020-06-04 04:09:44] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 04:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 04:09:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-04 04:09:45] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 10 ms.
[2020-06-04 04:09:45] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 04:09:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-04 04:09:45] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2020-06-04 04:09:45] [INFO ] Added : 36 causal constraints over 8 iterations in 35 ms. Result :sat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-04 04:09:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-04 04:09:45] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 6 ms.
[2020-06-04 04:09:45] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 04:09:45] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2020-06-04 04:09:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 04:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:09:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-04 04:09:45] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2020-06-04 04:09:45] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2020-06-04 04:09:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 04:09:45] [INFO ] Flatten gal took : 26 ms
FORMULA DrinkVendingMachine-COL-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 04:09:45] [INFO ] Applying decomposition
[2020-06-04 04:09:45] [INFO ] Flatten gal took : 9 ms
[2020-06-04 04:09:45] [INFO ] Decomposing Gal with order
[2020-06-04 04:09:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 04:09:45] [INFO ] Removed a total of 112 redundant transitions.
[2020-06-04 04:09:45] [INFO ] Flatten gal took : 32 ms
[2020-06-04 04:09:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2020-06-04 04:09:45] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 04:09:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DrinkVendingMachine-COL-02 @ 3570 seconds
FORMULA DrinkVendingMachine-COL-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DrinkVendingMachine-COL-02
{
"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": "Thu Jun 4 04:09:45 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) U X (F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))",
"processed_size": 189,
"rewrites": 107
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "X (((G ((p21 + p20 <= 1)) OR (p17 + p16 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U X (((p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p17 + p16)))))",
"processed_size": 212,
"rewrites": 107
},
"result":
{
"edges": 268,
"markings": 118,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((2 <= p18 + p19) U (p18 + p19 <= p21 + p20)))",
"processed_size": 49,
"rewrites": 107
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((2 <= p18 + p19))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))",
"processed_size": 124,
"rewrites": 107
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (G ((X ((p18 + p19 <= p22 + p23)) AND ((p17 + p16 <= p22 + p23) AND (p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)))))",
"processed_size": 132,
"rewrites": 107
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p18 + p19 + 1 <= p17 + p16) R (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)) AND (p22 + p23 <= 1))) OR X (X (F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)))))))",
"processed_size": 210,
"rewrites": 107
},
"result":
{
"edges": 11,
"markings": 10,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"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 (X (X (X (F ((1 <= p18 + p19))))))",
"processed_size": 36,
"rewrites": 107
},
"result":
{
"edges": 1502,
"markings": 486,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"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": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X (G ((p17 + p16 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8))))",
"processed_size": 70,
"rewrites": 107
},
"result":
{
"edges": 7548,
"markings": 1041,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "F ((G ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR ((p22 + p23 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) AND (X (F ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) R (p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))",
"processed_size": 252,
"rewrites": 107
},
"result":
{
"edges": 99,
"markings": 99,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"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": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)) AND (X (X ((1 <= p17 + p16))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16))))",
"processed_size": 169,
"rewrites": 107
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 1))",
"processed_size": 48,
"rewrites": 107
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p22 + p23)) OR (1 <= p18 + p19))))",
"processed_size": 86,
"rewrites": 107
},
"result":
{
"edges": 17620,
"markings": 2451,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 6,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 7,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 46,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "G (F ((G ((G ((p17 + p16 <= p21 + p20)) AND (F ((p17 + p16 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR G ((p17 + p16 <= p21 + p20))))) OR ((p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (G ((p17 + p16 <= p21 + p20)) AND (F ((p17 + p16 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR G ((p17 + p16 <= p21 + p20))))))))",
"processed_size": 351,
"rewrites": 107
},
"result":
{
"edges": 384,
"markings": 183,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 112
},
"compoundnumber": 12,
"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": 22660,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** U X(F(**))) : X(((G(*) OR *) U X(**))) : X((** U **)) : X(F((X(F(*)) OR **))) : X(G((X(**) AND (** AND **)))) : F(G((F(((* R *) AND *)) OR X(X(F(*)))))) : G(F((G(**) OR **))) : X(X(X(X(F(*))))) : X(X(G(**))) : F((G(*) OR (* AND (X(F(**)) R *)))) : G(F((G((G(*) AND (F(*) OR G(*)))) OR (* AND (G(*) AND (F(*) OR G(*))))))) : G(**) : G((F(**) AND (X(X(**)) OR **)))"
},
"net":
{
"arcs": 280,
"conflict_clusters": 13,
"places": 24,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no yes no no no no yes yes yes no no no no ",
"value": "no yes no no no no yes yes 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: 76/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 52 transitions, 12 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: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) U X (F (((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) U (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : X ((NOT(((1 <= 0) U (F ((2 <= p21 + p20)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p17 + p16)))) U X (((p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p17 + p16))))) : X (((2 <= p18 + p19) U (p18 + p19 <= p21 + p20))) : X (F ((F (NOT(X ((p18 + p19 <= 1)))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))) : G (X (G (((X ((p18 + p19 <= p22 + p23)) AND (p17 + p16 <= p22 + p23)) AND (p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8))))) : F (NOT(F ((G ((((p17 + p16 <= p18 + p19) U (p17 + p16 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR (2 <= p22 + p23))) AND G (X (X ((p17 + p16 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)))))))) : X (G (NOT(X (F (X (F (NOT(F (X ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p22 + p23)) OR (1 <= p18 + p19)))))))))))) : X (X (X (F (X (NOT(((1 <= 0) U (p18 + p19 <= 0)))))))) : NOT(X (F (NOT(X (G ((p17 + p16 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8))))))) : (((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U NOT(G (((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p22 + p23) U (NOT(X (F ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p22 + p23)))))) : G (NOT(G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p18 + p19) U (G ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p17 + p16)) U F ((p21 + p20 + 1 <= p17 + p16))))))) : G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 1)) : G ((X (X ((1 <= p17 + p16))) U ((1 <= 0) U (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) U X (F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) U X (F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: processed formula length: 189
lola: 107 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((p21 + p20 <= 1)) OR (p17 + p16 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U X (((p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p17 + p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((p21 + p20 <= 1)) OR (p17 + p16 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U X (((p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p17 + p16)))))
lola: processed formula length: 212
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 118 markings, 268 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((2 <= p18 + p19) U (p18 + p19 <= p21 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((2 <= p18 + p19) U (p18 + p19 <= p21 + p20)))
lola: processed formula length: 49
lola: 107 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((2 <= p18 + p19))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((2 <= p18 + p19))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: processed formula length: 124
lola: 107 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p18 + p19 <= p22 + p23)) AND ((p17 + p16 <= p22 + p23) AND (p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p18 + p19 <= p22 + p23)) AND ((p17 + p16 <= p22 + p23) AND (p22 + p23 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)))))
lola: processed formula length: 132
lola: 107 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p18 + p19 + 1 <= p17 + p16) R (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)) AND (p22 + p23 <= 1))) OR X (X (F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p18 + p19 + 1 <= p17 + p16) R (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)) AND (p22 + p23 <= 1))) OR X (X (F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)))))))
lola: processed formula length: 210
lola: 107 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((1 <= p18 + p19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((1 <= p18 + p19))))))
lola: processed formula length: 36
lola: 107 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: 486 markings, 1502 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p17 + p16 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p17 + p16 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8))))
lola: processed formula length: 70
lola: 107 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: 1041 markings, 7548 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR ((p22 + p23 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) AND (X (F ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) R (p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR ((p22 + p23 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8) AND (X (F ((p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) R (p22 + p23 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: processed formula length: 252
lola: 107 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: 99 markings, 99 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)) AND (X (X ((1 <= p17 + p16))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16)) AND (X (X ((1 <= p17 + p16))) OR (p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8 + 1 <= p17 + p16))))
lola: processed formula length: 169
lola: 107 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= 1))
lola: processed formula length: 48
lola: 107 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p22 + p23)) OR (1 <= p18 + p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p22 + p23)) OR (1 <= p18 + p19))))
lola: processed formula length: 86
lola: 107 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2451 markings, 17620 edges
lola: ========================================
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((G ((p17 + p16 <= p21 + p20)) AND (F ((p17 + p16 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR G ((p17 + p16 <= p21 + p20))))) OR ((p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (G ((p17 + p16 <= p21 + p20)) AND (F ((p17 + p16 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR G ((p17 + p16 <= p21 + p20))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((G ((p17 + p16 <= p21 + p20)) AND (F ((p17 + p16 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR G ((p17 + p16 <= p21 + p20))))) OR ((p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (G ((p17 + p16 <= p21 + p20)) AND (F ((p17 + p16 + 1 <= p12 + p13 + p14 + p15 + p11 + p10 + p9 + p8)) OR G ((p17 + p16 <= p21 + p20))))))))
lola: processed formula length: 351
lola: 107 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 112 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: add low 49
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: 183 markings, 384 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no yes yes yes no no no no
lola:
preliminary result: no yes no no no no yes yes yes no no no no
lola: memory consumption: 22660 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="DrinkVendingMachine-COL-02"
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 DrinkVendingMachine-COL-02, 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 r178-tajo-158987882900809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 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 '
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 ;