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-158987815300081.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 FMS-PT-05000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815300081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.3K Apr 1 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 1 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 1 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-05000-00
FORMULA_NAME FMS-PT-05000-01
FORMULA_NAME FMS-PT-05000-02
FORMULA_NAME FMS-PT-05000-03
FORMULA_NAME FMS-PT-05000-04
FORMULA_NAME FMS-PT-05000-05
FORMULA_NAME FMS-PT-05000-06
FORMULA_NAME FMS-PT-05000-07
FORMULA_NAME FMS-PT-05000-08
FORMULA_NAME FMS-PT-05000-09
FORMULA_NAME FMS-PT-05000-10
FORMULA_NAME FMS-PT-05000-11
FORMULA_NAME FMS-PT-05000-12
FORMULA_NAME FMS-PT-05000-13
FORMULA_NAME FMS-PT-05000-14
FORMULA_NAME FMS-PT-05000-15

=== Now, execution of the tool begins

BK_START 1591148939837

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:49:02] [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-03 01:49:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:49:02] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-06-03 01:49:02] [INFO ] Transformed 22 places.
[2020-06-03 01:49:02] [INFO ] Transformed 20 transitions.
[2020-06-03 01:49:02] [INFO ] Parsed PT model containing 22 places and 20 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100225 steps, including 0 resets, run finished after 79 ms. (steps per millisecond=1268 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 20 rows 22 cols
[2020-06-03 01:49:03] [INFO ] Computed 6 place invariants in 4 ms
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2020-06-03 01:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-03 01:49:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:49:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-03 01:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:49:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-03 01:49:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 6 ms.
[2020-06-03 01:49:03] [INFO ] Added : 7 causal constraints over 2 iterations in 37 ms. Result :sat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 01:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 01:49:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 01:49:03] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 01:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-03 01:49:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 01:49:03] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-03 01:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-03 01:49:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 01:49:03] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-03 01:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:49:03] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-03 01:49:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 01:49:03] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 01:49:03] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 01:49:03] [INFO ] Flatten gal took : 48 ms
FORMULA FMS-PT-05000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-05000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-05000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-05000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-05000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-05000-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:49:04] [INFO ] Flatten gal took : 11 ms
[2020-06-03 01:49:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 01:49:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FMS-PT-05000 @ 3570 seconds

FORMULA FMS-PT-05000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-05000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3162
rslt: Output for LTLCardinality @ FMS-PT-05000

{
"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": "Wed Jun 3 01:49:05 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p17 <= 2))",
"processed_size": 14,
"rewrites": 64
},
"result":
{
"edges": 30066,
"markings": 30056,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F ((F ((p14 <= p4)) AND G (((p4 + 1 <= p14) OR (p21 <= 2))))) OR (p4 + 1 <= p14))))",
"processed_size": 91,
"rewrites": 64
},
"result":
{
"edges": 20003,
"markings": 20003,
"produced_by": "LTL model checker",
"value": false
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "X (G ((X ((3 <= p18)) OR (G ((3 <= p18)) AND X (F ((3 <= p18)))))))",
"processed_size": 67,
"rewrites": 64
},
"result":
{
"edges": 20003,
"markings": 20003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 560
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((3 <= p16) U (p21 <= p11)) AND (p11 + 1 <= p21)))",
"processed_size": 54,
"rewrites": 64
},
"result":
{
"edges": 20003,
"markings": 20003,
"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": 672
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((2 <= p14) U X ((p6 <= p11)))",
"processed_size": 30,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 672
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((p19 <= p13)))",
"processed_size": 18,
"rewrites": 64
},
"result":
{
"edges": 30008,
"markings": 30007,
"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": 840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F ((1 <= p8)) AND ((2 <= p8) OR (G ((p21 <= p8)) AND F ((2 <= p8)))))))",
"processed_size": 78,
"rewrites": 64
},
"result":
{
"edges": 100024,
"markings": 70018,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1120
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((p12 <= p4) U (p13 + 1 <= p20)) OR G (F ((3 <= p16)))))",
"processed_size": 60,
"rewrites": 64
},
"result":
{
"edges": 60003,
"markings": 45008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 1681
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p5 <= p15)",
"processed_size": 11,
"rewrites": 66
},
"result":
{
"edges": 10002,
"markings": 10002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3362
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((p1 <= 1))",
"processed_size": 13,
"rewrites": 64
},
"result":
{
"edges": 55031,
"markings": 50029,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((p1 <= 1))",
"processed_size": 13,
"rewrites": 64
},
"result":
{
"edges": 55031,
"markings": 50029,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "F (G ((F ((p16 <= p3)) AND (F ((2 <= p1)) OR (p16 <= p3)))))",
"processed_size": 60,
"rewrites": 64
},
"result":
{
"edges": 30009,
"markings": 30007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3884,
"runtime": 408.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(((** U **) OR G(F(**)))) : (F(G((F(**) AND (F(**) OR **)))) OR G(*)) : G(F((F(**) AND (** OR (G(**) AND F(**)))))) : (X(*) AND G(**)) : X(X((F((F(*) AND G(*))) OR **))) : G(**) : X(G((X(**) OR (G(**) AND X(F(**)))))) : F(G((X((* R F(**))) OR *))) : ((** U X(**)) OR X(((** U **) AND **))) : (G(*) AND F(*))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no no no no no no no unknown yes no ",
"value": "no no no no no no no unknown yes 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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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: G ((((p12 <= p4) U (p13 + 1 <= p20)) OR F (G ((F ((p16 <= 2)) U F ((3 <= p16))))))) : (F (X (X (G ((F ((2 <= p1)) U (p16 <= p3)))))) OR NOT(F ((2 <= p1)))) : X (F (G (X (NOT(F (G ((NOT(F ((1 <= p8))) OR NOT((G ((p21 <= p8)) U (2 <= p8))))))))))) : (NOT(X ((3 <= p17))) AND G ((p17 <= 2))) : X (X ((NOT(G ((G ((p4 + 1 <= p14)) OR F (((p14 <= p4) AND (3 <= p21)))))) OR (p4 + 1 <= p14)))) : (G (((p19 <= p13))) AND (((2 <= p4) AND (1 <= p18)) U (0 <= 0))) : X (G ((G ((3 <= p18)) U X ((3 <= p18))))) : F (NOT(F ((X (((3 <= p8) U NOT(F ((p3 <= p21))))) AND (1 <= p14))))) : (((2 <= p14) U X ((p6 <= p11))) OR X ((((3 <= p16) U (p21 <= p11)) AND (p11 + 1 <= p21)))) : (NOT(F (((p5 <= p15) U (p4 <= p17)))) AND NOT(G ((p5 <= p15))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p17 <= 2)) AND G ((p17 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p17 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p17 <= 2))
lola: processed formula length: 14
lola: 64 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: 30056 markings, 30066 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((F ((p14 <= p4)) AND G (((p4 + 1 <= p14) OR (p21 <= 2))))) OR (p4 + 1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((F ((p14 <= p4)) AND G (((p4 + 1 <= p14) OR (p21 <= 2))))) OR (p4 + 1 <= p14))))
lola: processed formula length: 91
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20003 markings, 20003 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((3 <= p18)) OR (G ((3 <= p18)) AND X (F ((3 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((3 <= p18)) OR (G ((3 <= p18)) AND X (F ((3 <= p18)))))))
lola: processed formula length: 67
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20003 markings, 20003 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p8 <= 2) R F ((p3 <= p21)))) OR (p14 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p8 <= 2) R F ((p3 <= p21)))) OR (p14 <= 0))))
lola: processed formula length: 57
lola: 64 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: 3420291 markings, 4555099 edges, 684058 markings/sec, 0 secs
lola: 7170032 markings, 9554335 edges, 749948 markings/sec, 5 secs
lola: 10835038 markings, 14440763 edges, 733001 markings/sec, 10 secs
lola: 14430495 markings, 19234302 edges, 719091 markings/sec, 15 secs
lola: 18065986 markings, 24082178 edges, 727098 markings/sec, 20 secs
lola: 21676484 markings, 28895064 edges, 722100 markings/sec, 25 secs
lola: 25249135 markings, 33658683 edges, 714530 markings/sec, 30 secs
lola: 28611911 markings, 38142510 edges, 672555 markings/sec, 35 secs
lola: 32102194 markings, 42795084 edges, 698057 markings/sec, 40 secs
lola: 35609250 markings, 47471625 edges, 701411 markings/sec, 45 secs
lola: 39076636 markings, 52094239 edges, 693477 markings/sec, 50 secs
lola: 42405233 markings, 56533059 edges, 665719 markings/sec, 55 secs
lola: 45774711 markings, 61024992 edges, 673896 markings/sec, 60 secs
lola: 49108553 markings, 65470424 edges, 666768 markings/sec, 65 secs
lola: 52533221 markings, 70036722 edges, 684934 markings/sec, 70 secs
lola: 55944706 markings, 74583967 edges, 682297 markings/sec, 75 secs
lola: 59309008 markings, 79070086 edges, 672860 markings/sec, 80 secs
lola: 62728843 markings, 83629495 edges, 683967 markings/sec, 85 secs
lola: 66192208 markings, 88246698 edges, 692673 markings/sec, 90 secs
lola: 69633589 markings, 92835925 edges, 688276 markings/sec, 95 secs
lola: 73034438 markings, 97369360 edges, 680170 markings/sec, 100 secs
lola: 76662244 markings, 102742086 edges, 725561 markings/sec, 105 secs
lola: 80463538 markings, 109076440 edges, 760259 markings/sec, 110 secs
lola: 84224967 markings, 115344053 edges, 752286 markings/sec, 115 secs
lola: 87899948 markings, 121468669 edges, 734996 markings/sec, 120 secs
lola: 91444477 markings, 127379945 edges, 708906 markings/sec, 125 secs
lola: 92881113 markings, 129771432 edges, 287327 markings/sec, 130 secs
lola: 94679445 markings, 132771278 edges, 359666 markings/sec, 135 secs
lola: 96354934 markings, 135565960 edges, 335098 markings/sec, 140 secs
lola: 97980417 markings, 138268155 edges, 325097 markings/sec, 145 secs
lola: 100746480 markings, 142879961 edges, 553213 markings/sec, 150 secs
lola: 102498260 markings, 145798318 edges, 350356 markings/sec, 155 secs
lola: 104808326 markings, 149648179 edges, 462013 markings/sec, 160 secs
lola: 105815174 markings, 151326758 edges, 201370 markings/sec, 165 secs
lola: 107974224 markings, 154924606 edges, 431810 markings/sec, 170 secs
lola: 109462800 markings, 157406583 edges, 297715 markings/sec, 175 secs
lola: 111490765 markings, 160787123 edges, 405593 markings/sec, 180 secs
lola: 112504154 markings, 162473936 edges, 202678 markings/sec, 185 secs
lola: 113328142 markings, 163846816 edges, 164798 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p14) U X ((p6 <= p11))) OR X ((((3 <= p16) U (p21 <= p11)) AND (p11 + 1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((3 <= p16) U (p21 <= p11)) AND (p11 + 1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((3 <= p16) U (p21 <= p11)) AND (p11 + 1 <= p21)))
lola: processed formula length: 54
lola: 64 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: 20003 markings, 20003 edges
lola: ========================================
lola: subprocess 5 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p14) U X ((p6 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((2 <= p14) U X ((p6 <= p11)))
lola: processed formula length: 30
lola: 64 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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p19 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p19 <= p13)))
lola: processed formula length: 18
lola: 64 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: 30007 markings, 30008 edges
lola: ========================================
lola: subprocess 6 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((1 <= p8)) AND ((2 <= p8) OR (G ((p21 <= p8)) AND F ((2 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((1 <= p8)) AND ((2 <= p8) OR (G ((p21 <= p8)) AND F ((2 <= p8)))))))
lola: processed formula length: 78
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 70018 markings, 100024 edges
lola: ========================================
lola: subprocess 7 will run for 1120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p12 <= p4) U (p13 + 1 <= p20)) OR G (F ((3 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p12 <= p4) U (p13 + 1 <= p20)) OR G (F ((3 <= p16)))))
lola: processed formula length: 60
lola: 64 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: 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: 45008 markings, 60003 edges
lola: ========================================
lola: subprocess 8 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p17 + 1 <= p4)) AND F ((p15 + 1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p15 + 1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p5 <= p15)
lola: processed formula length: 11
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10002 markings, 10002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((p16 <= p3)) AND (F ((2 <= p1)) OR (p16 <= p3))))) OR G ((p1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= 1))
lola: processed formula length: 13
lola: 64 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: 50029 markings, 55031 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p8 <= 2) R F ((p3 <= p21)))) OR (p14 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p8 <= 2) R F ((p3 <= p21)))) OR (p14 <= 0))))
lola: processed formula length: 57
lola: 64 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: 3749262 markings, 4993520 edges, 749852 markings/sec, 0 secs
lola: 7370798 markings, 9821292 edges, 724307 markings/sec, 5 secs
lola: 11013121 markings, 14678584 edges, 728465 markings/sec, 10 secs
lola: 14423198 markings, 19224162 edges, 682015 markings/sec, 15 secs
lola: 18034810 markings, 24040417 edges, 722322 markings/sec, 20 secs
lola: 21616187 markings, 28814624 edges, 716275 markings/sec, 25 secs
lola: 25177296 markings, 33563431 edges, 712222 markings/sec, 30 secs
lola: 28682844 markings, 38236403 edges, 701110 markings/sec, 35 secs
lola: 32200502 markings, 42927539 edges, 703532 markings/sec, 40 secs
lola: 35583953 markings, 47437376 edges, 676690 markings/sec, 45 secs
lola: 39056120 markings, 52067781 edges, 694433 markings/sec, 50 secs
lola: 42338000 markings, 56442771 edges, 656376 markings/sec, 55 secs
lola: 45766191 markings, 61014244 edges, 685638 markings/sec, 60 secs
lola: 49238296 markings, 65642525 edges, 694421 markings/sec, 65 secs
lola: 52669861 markings, 70218371 edges, 686313 markings/sec, 70 secs
lola: 55962101 markings, 74607559 edges, 658448 markings/sec, 75 secs
lola: 59360990 markings, 79139948 edges, 679778 markings/sec, 80 secs
lola: 62778827 markings, 83696969 edges, 683567 markings/sec, 85 secs
lola: 66254034 markings, 88329431 edges, 695041 markings/sec, 90 secs
lola: 69702140 markings, 92926788 edges, 689621 markings/sec, 95 secs
lola: 73114462 markings, 97476889 edges, 682464 markings/sec, 100 secs
lola: 76767438 markings, 102917272 edges, 730595 markings/sec, 105 secs
lola: 80580301 markings, 109269956 edges, 762573 markings/sec, 110 secs
lola: 84351724 markings, 115557364 edges, 754285 markings/sec, 115 secs
lola: 88041221 markings, 121705927 edges, 737899 markings/sec, 120 secs
lola: 91739000 markings, 127868615 edges, 739556 markings/sec, 125 secs
lola: 93921686 markings, 131508315 edges, 436537 markings/sec, 130 secs
lola: 94751202 markings, 132889237 edges, 165903 markings/sec, 135 secs
lola: 97619969 markings, 137667714 edges, 573753 markings/sec, 140 secs
lola: 99904103 markings, 141475307 edges, 456827 markings/sec, 145 secs
lola: 101391171 markings, 143954268 edges, 297414 markings/sec, 150 secs
lola: 103155394 markings, 146892587 edges, 352845 markings/sec, 155 secs
lola: 105273037 markings, 150422543 edges, 423529 markings/sec, 160 secs
lola: 106603112 markings, 152639963 edges, 266015 markings/sec, 165 secs
lola: 108599593 markings, 155966241 edges, 399296 markings/sec, 170 secs
lola: 109958397 markings, 158232720 edges, 271761 markings/sec, 175 secs
lola: 111900040 markings, 161466358 edges, 388329 markings/sec, 180 secs
lola: 113253647 markings, 163722833 edges, 270721 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((p16 <= p3)) AND (F ((2 <= p1)) OR (p16 <= p3))))) OR G ((p1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= 1))
lola: processed formula length: 13
lola: 64 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: 50029 markings, 55031 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p16 <= p3)) AND (F ((2 <= p1)) OR (p16 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p16 <= p3)) AND (F ((2 <= p1)) OR (p16 <= p3)))))
lola: processed formula length: 60
lola: 64 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: 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: 30007 markings, 30009 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown yes no
lola:
preliminary result: no no no no no no no unknown yes no
lola: memory consumption: 3884 KB
lola: time consumption: 408 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="FMS-PT-05000"
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 FMS-PT-05000, 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-158987815300081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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