Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700329.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.4K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 26 02:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Mar 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 25 20:56 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 6.1K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Mar 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 150K Mar 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 598K 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 BridgeAndVehicles-PT-V20P20N10-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-15

=== Now, execution of the tool begins

BK_START 1591144048997

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:27:32] [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 00:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:27:32] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2020-06-03 00:27:32] [INFO ] Transformed 68 places.
[2020-06-03 00:27:32] [INFO ] Transformed 548 transitions.
[2020-06-03 00:27:32] [INFO ] Parsed PT model containing 68 places and 548 transitions in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 563 resets, run finished after 414 ms. (steps per millisecond=241 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1]
[2020-06-03 00:27:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-03 00:27:32] [INFO ] Computed 7 place invariants in 14 ms
[2020-06-03 00:27:33] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-03 00:27:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:27:33] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-06-03 00:27:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:27:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 00:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:27:33] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-03 00:27:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 00:27:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 20 ms returned sat
[2020-06-03 00:27:33] [INFO ] Deduced a trap composed of 36 places in 278 ms
[2020-06-03 00:27:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2020-06-03 00:27:33] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 47 ms.
[2020-06-03 00:27:35] [INFO ] Added : 117 causal constraints over 24 iterations in 1445 ms. Result :sat
[2020-06-03 00:27:35] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2020-06-03 00:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2020-06-03 00:27:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 00:27:35] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-03 00:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:27:35] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-06-03 00:27:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:27:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2020-06-03 00:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:27:35] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2020-06-03 00:27:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2020-06-03 00:27:35] [INFO ] Deduced a trap composed of 5 places in 158 ms
[2020-06-03 00:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2020-06-03 00:27:35] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 20 ms.
[2020-06-03 00:27:36] [INFO ] Added : 106 causal constraints over 22 iterations in 785 ms. Result :sat
[2020-06-03 00:27:36] [INFO ] Deduced a trap composed of 14 places in 184 ms
[2020-06-03 00:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2020-06-03 00:27:36] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 00:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:27:36] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-03 00:27:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:27:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:27:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-06-03 00:27:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 10 ms returned sat
[2020-06-03 00:27:37] [INFO ] Deduced a trap composed of 14 places in 124 ms
[2020-06-03 00:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2020-06-03 00:27:37] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 15 ms.
[2020-06-03 00:27:37] [INFO ] Added : 71 causal constraints over 15 iterations in 184 ms. Result :sat
[2020-06-03 00:27:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:27:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2020-06-03 00:27:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 00:27:37] [INFO ] Flatten gal took : 145 ms
FORMULA BridgeAndVehicles-PT-V20P20N10-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:27:37] [INFO ] Flatten gal took : 57 ms
[2020-06-03 00:27:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 14 ms.
[2020-06-03 00:27:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N10 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P20N10-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3370
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P20N10

{
"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 00:27:38 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"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": "X (G ((X (F ((p23 <= p49))) OR ((p24 <= p52) U G ((2 <= p56))))))",
"processed_size": 65,
"rewrites": 72
},
"result":
{
"edges": 86502043,
"markings": 21582323,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 286
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((1 <= p25)))",
"processed_size": 18,
"rewrites": 72
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p49 + 1 <= p25) U (G ((p25 <= p49)) AND (X ((1 <= p0)) OR G ((1 <= p0))))))",
"processed_size": 80,
"rewrites": 72
},
"result":
{
"edges": 179,
"markings": 179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 343
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((2 <= p52))))",
"processed_size": 22,
"rewrites": 72
},
"result":
{
"edges": 179,
"markings": 179,
"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": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X ((((p46 <= p25) OR (p56 <= p52)) U (1 <= p55))) OR (G ((1 <= p56)) AND X (F ((1 <= p55))))) AND (G ((1 <= p55)) OR (p46 <= p25))))",
"processed_size": 138,
"rewrites": 72
},
"result":
{
"edges": 1319716,
"markings": 590175,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 429
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G ((p54 + 1 <= p27)) OR (((X (X (G ((p53 <= 0)))) OR (p54 + 1 <= p27)) R X (X ((p22 + 1 <= p46)))) AND (p54 + 1 <= p27))))",
"processed_size": 126,
"rewrites": 72
},
"result":
{
"edges": 178,
"markings": 178,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 25
},
"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": 491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F ((p49 <= p26)) AND ((p56 + 1 <= p0) OR (p49 <= p26)))))",
"processed_size": 64,
"rewrites": 72
},
"result":
{
"edges": 489349,
"markings": 152297,
"produced_by": "LTL model checker",
"value": false
},
"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": 573
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (((p51 <= p23) U G ((p23 <= p50)))) OR F ((p51 <= p23))))",
"processed_size": 63,
"rewrites": 72
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 687
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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 (G ((p22 + 1 <= p25))))",
"processed_size": 28,
"rewrites": 72
},
"result":
{
"edges": 5661,
"markings": 2303,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 859
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G (F ((p53 + p54 <= p49)))",
"processed_size": 26,
"rewrites": 72
},
"result":
{
"edges": 27635295,
"markings": 6580645,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1134
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G (F ((p53 + p54 <= p56)))",
"processed_size": 26,
"rewrites": 72
},
"result":
{
"edges": 27655194,
"markings": 6562208,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1685
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "F (G (((p24 + 1 <= p25) AND (p53 + p54 + 1 <= p50 + p51))))",
"processed_size": 59,
"rewrites": 72
},
"result":
{
"edges": 179,
"markings": 178,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((p51 <= p22) OR (p52 <= p56)) OR (((p51 <= p22) U (2 <= p22)) AND (p63 <= p22))))",
"processed_size": 87,
"rewrites": 72
},
"result":
{
"edges": 179,
"markings": 179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 32512,
"runtime": 200.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : X((F(*) AND *)) : X(G((X(F(**)) OR (** U G(**))))) : X(X(**)) : G(F(**)) : F(G(*)) : X((** U (G(**) AND (X(**) OR G(**))))) : X(X(G(*))) : X(((X((** U **)) OR (G(**) AND X(F(**)))) AND (G(**) OR **))) : F((G(*) OR (((X(X(G(*))) OR *) R X(X(*))) AND *))) : X(G((F(**) AND (** OR **)))) : X((X((** U G(**))) OR F(**))) : G((** OR ((** U **) AND **))) : X(X(G(*)))"
},
"net":
{
"arcs": 4070,
"conflict_clusters": 5,
"places": 68,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 548
},
"result":
{
"preliminary_value": "yes yes yes yes yes no no no yes no no yes no no ",
"value": "yes yes yes yes yes no no no yes no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 616/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 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 (X (G (F ((p53 + p54 <= p56))))) : NOT(X ((G (((p24 <= p52) AND (2 <= p0))) OR (p0 <= 1)))) : G (X ((F (X (((p52 + 1 <= p24) U F ((p23 <= p49))))) OR ((p24 <= p52) U G ((2 <= p56)))))) : X (X (((1 <= 0) U (1 <= p25)))) : G ((((1 <= p56) U (0 <= 0)) U F (X ((p53 + p54 <= p49))))) : NOT(G (F (((p25 <= p24) OR (p50 + p51 <= p53 + p54))))) : X (((p49 + 1 <= p25) U (G ((p25 <= p49)) AND (X ((1 <= p0)) OR G ((1 <= p0)))))) : X (NOT(F (X ((p52 <= 1))))) : X (((G ((1 <= p56)) U X ((((p46 <= p25) OR (p56 <= p52)) U (1 <= p55)))) AND (G ((1 <= p55)) OR (p46 <= p25)))) : F (NOT(G ((((F (X (X ((1 <= p53)))) AND (p27 <= p54)) U X (X ((p46 <= p22)))) U (p27 <= p54))))) : G (X (G (((p56 + 1 <= p0) U (p49 <= p26))))) : X (((X ((p51 <= p23)) U NOT(X (F (NOT(G ((p23 <= p50))))))) OR F ((p51 <= p23)))) : G ((((p51 <= p22) OR (p52 <= p56)) OR (((p51 <= p22) U (2 <= p22)) AND (p63 <= p22)))) : X (G (X (NOT((((0 <= 0) U (0 <= 0)) U (p25 <= p22))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p52 + 1 <= p24) OR (p0 <= 1))) AND (2 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p52 + 1 <= p24) OR (p0 <= 1))) AND (2 <= p0)))
lola: processed formula length: 56
lola: 72 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: 263109 markings, 570622 edges
lola: subprocess 1 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((p23 <= p49))) OR ((p24 <= p52) U G ((2 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((p23 <= p49))) OR ((p24 <= p52) U G ((2 <= p56))))))
lola: processed formula length: 65
lola: 72 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: ========================================
lola: 1219503 markings, 6483728 edges, 243901 markings/sec, 0 secs
lola: 2477604 markings, 12404886 edges, 251620 markings/sec, 5 secs
lola: 3815611 markings, 18049064 edges, 267601 markings/sec, 10 secs
lola: 5186451 markings, 23533113 edges, 274168 markings/sec, 15 secs
lola: 6554699 markings, 28849248 edges, 273650 markings/sec, 20 secs
lola: 7922869 markings, 34170937 edges, 273634 markings/sec, 25 secs
lola: 9262587 markings, 39370832 edges, 267944 markings/sec, 30 secs
lola: 10596133 markings, 44567001 edges, 266709 markings/sec, 35 secs
lola: 11919321 markings, 49710501 edges, 264638 markings/sec, 40 secs
lola: 13245393 markings, 54935669 edges, 265214 markings/sec, 45 secs
lola: 14600177 markings, 59958926 edges, 270957 markings/sec, 50 secs
lola: 15916503 markings, 64884171 edges, 263265 markings/sec, 55 secs
lola: 17190899 markings, 69909164 edges, 254879 markings/sec, 60 secs
lola: 18523214 markings, 74815207 edges, 266463 markings/sec, 65 secs
lola: 19792284 markings, 79605484 edges, 253814 markings/sec, 70 secs
lola: 21073578 markings, 84626938 edges, 256259 markings/sec, 75 secs
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: 21582323 markings, 86502043 edges
lola: ========================================
lola: subprocess 2 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((1 <= p25)))
lola: processed formula length: 18
lola: 72 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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p49 + 1 <= p25) U (G ((p25 <= p49)) AND (X ((1 <= p0)) OR G ((1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p49 + 1 <= p25) U (G ((p25 <= p49)) AND (X ((1 <= p0)) OR G ((1 <= p0))))))
lola: processed formula length: 80
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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: 179 markings, 179 edges
lola: ========================================
lola: subprocess 4 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((2 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((2 <= p52))))
lola: processed formula length: 22
lola: 72 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: 179 markings, 179 edges
lola: ========================================
lola: subprocess 5 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X ((((p46 <= p25) OR (p56 <= p52)) U (1 <= p55))) OR (G ((1 <= p56)) AND X (F ((1 <= p55))))) AND (G ((1 <= p55)) OR (p46 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X ((((p46 <= p25) OR (p56 <= p52)) U (1 <= p55))) OR (G ((1 <= p56)) AND X (F ((1 <= p55))))) AND (G ((1 <= p55)) OR (p46 <= p25))))
lola: processed formula length: 138
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 590175 markings, 1319716 edges
lola: subprocess 6 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ========================================
...considering subproblem: F ((G ((p54 + 1 <= p27)) OR (((X (X (G ((p53 <= 0)))) OR (p54 + 1 <= p27)) R X (X ((p22 + 1 <= p46)))) AND (p54 + 1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p54 + 1 <= p27)) OR (((X (X (G ((p53 <= 0)))) OR (p54 + 1 <= p27)) R X (X ((p22 + 1 <= p46)))) AND (p54 + 1 <= p27))))
lola: processed formula length: 126
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 25 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: 178 markings, 178 edges
lola: ========================================
lola: subprocess 7 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p49 <= p26)) AND ((p56 + 1 <= p0) OR (p49 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p49 <= p26)) AND ((p56 + 1 <= p0) OR (p49 <= p26)))))
lola: processed formula length: 64
lola: 72 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: 152297 markings, 489349 edges
lola: subprocess 8 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((p51 <= p23) U G ((p23 <= p50)))) OR F ((p51 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((p51 <= p23) U G ((p23 <= p50)))) OR F ((p51 <= p23))))
lola: processed formula length: 63
lola: 72 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p22 + 1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p22 + 1 <= p25))))
lola: processed formula length: 28
lola: 72 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: ========================================
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: 2303 markings, 5661 edges
lola: ========================================
lola: subprocess 10 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p53 + p54 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p53 + p54 <= p49)))
lola: processed formula length: 26
lola: 72 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: 992188 markings, 3964575 edges, 198438 markings/sec, 0 secs
lola: 2005201 markings, 8187081 edges, 202603 markings/sec, 5 secs
lola: 3008328 markings, 12391983 edges, 200625 markings/sec, 10 secs
lola: 4001667 markings, 16625648 edges, 198668 markings/sec, 15 secs
lola: 4984941 markings, 20833100 edges, 196655 markings/sec, 20 secs
lola: 5945241 markings, 24908089 edges, 192060 markings/sec, 25 secs
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: 6580645 markings, 27635295 edges
lola: ========================================
lola: subprocess 11 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p53 + p54 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p53 + p54 <= p56)))
lola: processed formula length: 26
lola: 72 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: 951967 markings, 3837870 edges, 190393 markings/sec, 0 secs
lola: 1930050 markings, 7915069 edges, 195617 markings/sec, 5 secs
lola: 2909402 markings, 12056854 edges, 195870 markings/sec, 10 secs
lola: 3877477 markings, 16182240 edges, 193615 markings/sec, 15 secs
lola: 4838313 markings, 20294013 edges, 192167 markings/sec, 20 secs
lola: 5779162 markings, 24304552 edges, 188170 markings/sec, 25 secs
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: 6562208 markings, 27655194 edges
lola: ========================================
lola: subprocess 12 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p24 + 1 <= p25) AND (p53 + p54 + 1 <= p50 + p51))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p24 + 1 <= p25) AND (p53 + p54 + 1 <= p50 + p51))))
lola: processed formula length: 59
lola: 72 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: 178 markings, 179 edges
lola: ========================================
lola: subprocess 13 will run for 3370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p51 <= p22) OR (p52 <= p56)) OR (((p51 <= p22) U (2 <= p22)) AND (p63 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p51 <= p22) OR (p52 <= p56)) OR (((p51 <= p22) U (2 <= p22)) AND (p63 <= p22))))
lola: processed formula length: 87
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 179 markings, 179 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no yes no no yes no no
lola:
preliminary result: yes yes yes yes yes no no no yes no no yes no no
lola: ========================================
lola: memory consumption: 32512 KB
lola: time consumption: 200 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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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 r182-oct2-158987913700329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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