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-158987913500177.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-COL-V20P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913500177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 20:58 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 4.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 12:26 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_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 40K 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-COL-V20P20N20-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-15

=== Now, execution of the tool begins

BK_START 1591131719353

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:02:01] [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-02 21:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:02:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 21:02:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 509 ms
[2020-06-02 21:02:02] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-06-02 21:02:02] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 54 ms.
[2020-06-02 21:02:02] [INFO ] Computed order based on color domains.
[2020-06-02 21:02:02] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions in 49 ms.
[2020-06-02 21:02:02] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 87 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 575 resets, run finished after 433 ms. (steps per millisecond=230 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
[2020-06-02 21:02:02] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2020-06-02 21:02:02] [INFO ] Computed 7 place invariants in 8 ms
[2020-06-02 21:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 59 ms returned unsat
[2020-06-02 21:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-02 21:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-02 21:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 21:02:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 21:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:03] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2020-06-02 21:02:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:02:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2020-06-02 21:02:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:02:03] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-02 21:02:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-02 21:02:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 39 ms returned sat
[2020-06-02 21:02:03] [INFO ] Deduced a trap composed of 24 places in 172 ms
[2020-06-02 21:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2020-06-02 21:02:03] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 72 ms.
[2020-06-02 21:02:06] [INFO ] Added : 165 causal constraints over 34 iterations in 3102 ms. Result :sat
[2020-06-02 21:02:06] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2020-06-02 21:02:07] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 21:02:07] [INFO ] [Real]Absence check using 7 positive place invariants in 54 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-06-02 21:02:07] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 21:02:07] [INFO ] Flatten gal took : 273 ms
FORMULA BridgeAndVehicles-COL-V20P20N20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 21:02:07] [INFO ] Applying decomposition
[2020-06-02 21:02:07] [INFO ] Flatten gal took : 109 ms
[2020-06-02 21:02:07] [INFO ] Decomposing Gal with order
[2020-06-02 21:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 21:02:08] [INFO ] Removed a total of 5350 redundant transitions.
[2020-06-02 21:02:08] [INFO ] Flatten gal took : 856 ms
[2020-06-02 21:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-06-02 21:02:08] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-02 21:02:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V20P20N20-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N20-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2951
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P20N20

{
"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": "Tue Jun 2 21:02:09 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p22 <= 2)",
"processed_size": 10,
"rewrites": 57
},
"result":
{
"edges": 2511503,
"markings": 864248,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 5,
"visible_transitions": 0
},
"processed": "X (F ((X ((p23 <= p22)) AND G (F ((p76 + p77 <= p49))))))",
"processed_size": 57,
"rewrites": 55
},
"result":
{
"edges": 59704669,
"markings": 13786015,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p53 + p54 <= 0)",
"processed_size": 16,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 84
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 382
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((p53 + p54 + 1 <= p22))",
"processed_size": 26,
"rewrites": 55
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((p0 <= 2))))",
"processed_size": 21,
"rewrites": 55
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((((p48 <= 1)) R X (G ((p48 <= 1)))))",
"processed_size": 39,
"rewrites": 55
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p22) AND (p53 + p54 + 1 <= p47)))) OR ((G ((p48 <= p23)) AND F (G (((1 <= p22) AND (p53 + p54 + 1 <= p47))))) OR (p48 <= p23))))",
"processed_size": 145,
"rewrites": 55
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F ((p47 <= p49)) AND (F ((1 <= p22)) AND X ((1 <= p22))))))",
"processed_size": 66,
"rewrites": 55
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 687
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p48 + 1 <= p0)",
"processed_size": 15,
"rewrites": 57
},
"result":
{
"edges": 168,
"markings": 169,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p0 <= p22)))",
"processed_size": 19,
"rewrites": 55
},
"result":
{
"edges": 134219423,
"markings": 19056445,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1039
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((p76 + p77 + 1 <= p53 + p54)))",
"processed_size": 36,
"rewrites": 55
},
"result":
{
"edges": 1452,
"markings": 1052,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p53 + p54) R (F ((p49 <= 1)) OR (p53 + p54 <= 0)))))",
"processed_size": 65,
"rewrites": 55
},
"result":
{
"edges": 133783951,
"markings": 22865460,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 2951
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G ((((1 <= p76 + p77) AND (1 <= p49)) OR (1 <= p49))) AND (F ((p24 + 1 <= p0)) AND (1 <= p49))))",
"processed_size": 101,
"rewrites": 55
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 40720,
"runtime": 619.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((X(**) AND G(F(**))))) OR (G(**) AND F(**))) : F(G((* R (F(*) OR *)))) : G(F(*)) : F(G(**)) : F(**) : (X(X(G(*))) OR (F(**) AND X(**))) : X(G(*)) : X((* R X(G(*)))) : X((X(G(**)) OR ((G(**) AND F(G(**))) OR **))) : F((G(**) AND (F(*) AND **))) : X(X((F(**) AND (F(**) AND X(**)))))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "yes yes no yes no no no no yes no no ",
"value": "yes yes no yes no no 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: 1046/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 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: (F (X (F ((X ((p23 <= p22)) AND G (F ((p76 + p77 <= p49))))))) OR (G ((1 <= p51 + p52)) AND F ((3 <= p22)))) : F (X (F (G (NOT(X (((p53 + p54 <= 0) U (G ((2 <= p49)) AND (1 <= p53 + p54))))))))) : F (NOT(((0 <= 0) U G ((p53 + p54 <= p76 + p77))))) : ((G (F (X (X (G ((p53 + p54 <= p76 + p77)))))) AND (p24 <= p53 + p54)) U G (F (G ((p0 <= p22))))) : ((0 <= 0) U (p0 <= p48)) : (G (NOT(X (X ((3 <= p0))))) OR (((0 <= 0) U (1 <= p53 + p54)) AND X ((p53 + p54 + 1 <= p22)))) : NOT(X (((0 <= 0) U (p22 <= p24)))) : X (NOT((((2 <= p48)) U F (X ((2 <= p48)))))) : X (((G ((p48 <= p23)) U X (G (((1 <= p22) AND (p53 + p54 + 1 <= p47))))) OR (p48 <= p23))) : F (((G ((((1 <= p76 + p77) AND (1 <= p49)) OR (1 <= p49))) AND NOT(G ((p0 <= p24)))) AND (1 <= p49))) : X (X (((F ((p47 <= p49)) AND F ((1 <= p22))) AND X ((1 <= p22)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X ((p23 <= p22)) AND G (F ((p76 + p77 <= p49)))))) OR (G ((1 <= p51 + p52)) AND F ((3 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p22 <= 2)
lola: processed formula length: 10
lola: 57 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: 293906 markings, 854851 edges, 58781 markings/sec, 0 secs
lola: 560214 markings, 1625281 edges, 53262 markings/sec, 5 secs
lola: 817320 markings, 2366807 edges, 51421 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 864248 markings, 2511503 edges
lola: ========================================
lola: subprocess 1 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p51 + p52))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p51 + p52))
lola: processed formula length: 20
lola: 55 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 2 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p23 <= p22)) AND G (F ((p76 + p77 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p23 <= p22)) AND G (F ((p76 + p77 <= p49))))))
lola: processed formula length: 57
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1105242 markings, 4524565 edges, 221048 markings/sec, 0 secs
lola: 2148757 markings, 8839260 edges, 208703 markings/sec, 5 secs
lola: 3150125 markings, 13130294 edges, 200274 markings/sec, 10 secs
lola: 4137900 markings, 17342188 edges, 197555 markings/sec, 15 secs
lola: 5094644 markings, 21509785 edges, 191349 markings/sec, 20 secs
lola: 6037192 markings, 25594761 edges, 188510 markings/sec, 25 secs
lola: 6949487 markings, 29533264 edges, 182459 markings/sec, 30 secs
lola: 7912555 markings, 33667794 edges, 192614 markings/sec, 35 secs
lola: 8815041 markings, 37783452 edges, 180497 markings/sec, 40 secs
lola: 9728254 markings, 41807767 edges, 182643 markings/sec, 45 secs
lola: 10668258 markings, 45787994 edges, 188001 markings/sec, 50 secs
lola: 11537995 markings, 49850159 edges, 173947 markings/sec, 55 secs
lola: 12437297 markings, 53670911 edges, 179860 markings/sec, 60 secs
lola: 13320203 markings, 57781909 edges, 176581 markings/sec, 65 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: 13786015 markings, 59704669 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p0 <= 2)))) OR (F ((1 <= p53 + p54)) AND X ((p53 + p54 + 1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p53 + p54))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p53 + p54 <= 0)
lola: processed formula length: 16
lola: 57 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p53 + p54 + 1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p53 + p54 + 1 <= p22))
lola: processed formula length: 26
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: ========================================
lola: subprocess 3 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p0 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p0 <= 2))))
lola: processed formula length: 21
lola: 55 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: 169 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p24 + 1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p24 + 1 <= p22)))
lola: processed formula length: 24
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: ========================================
lola: subprocess 3 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p48 <= 1)) R X (G ((p48 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p48 <= 1)) R X (G ((p48 <= 1)))))
lola: processed formula length: 39
lola: 55 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 4 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p22) AND (p53 + p54 + 1 <= p47)))) OR ((G ((p48 <= p23)) AND F (G (((1 <= p22) AND (p53 + p54 + 1 <= p47))))) OR (p48 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p22) AND (p53 + p54 + 1 <= p47)))) OR ((G ((p48 <= p23)) AND F (G (((1 <= p22) AND (p53 + p54 + 1 <= p47))))) OR (p48 <= p23))))
lola: processed formula length: 145
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: subprocess 5 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p47 <= p49)) AND (F ((1 <= p22)) AND X ((1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p47 <= p49)) AND (F ((1 <= p22)) AND X ((1 <= p22))))))
lola: processed formula length: 66
lola: 55 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 6 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p0 <= p48))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p48 + 1 <= p0)
lola: processed formula length: 15
lola: 57 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: 169 markings, 168 edges
lola: ========================================
lola: subprocess 7 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 <= p22)))
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 ((p0 <= p22)))
lola: processed formula length: 19
lola: 55 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: 320850 markings, 2014922 edges, 64170 markings/sec, 0 secs
lola: 608394 markings, 3971164 edges, 57509 markings/sec, 5 secs
lola: 902386 markings, 5994883 edges, 58798 markings/sec, 10 secs
lola: 1198160 markings, 8032009 edges, 59155 markings/sec, 15 secs
lola: 1493468 markings, 10032950 edges, 59062 markings/sec, 20 secs
lola: 1774702 markings, 12054579 edges, 56247 markings/sec, 25 secs
lola: 2080567 markings, 14148262 edges, 61173 markings/sec, 30 secs
lola: 2372903 markings, 16140644 edges, 58467 markings/sec, 35 secs
lola: 2665923 markings, 18228616 edges, 58604 markings/sec, 40 secs
lola: 2936764 markings, 20188893 edges, 54168 markings/sec, 45 secs
lola: 3253591 markings, 22327609 edges, 63365 markings/sec, 50 secs
lola: 3536479 markings, 24393209 edges, 56578 markings/sec, 55 secs
lola: 3838028 markings, 26420869 edges, 60310 markings/sec, 60 secs
lola: 4132943 markings, 28507079 edges, 58983 markings/sec, 65 secs
lola: 4410137 markings, 30556770 edges, 55439 markings/sec, 70 secs
lola: 4721697 markings, 32639765 edges, 62312 markings/sec, 75 secs
lola: 5022753 markings, 34759911 edges, 60211 markings/sec, 80 secs
lola: 5301630 markings, 36827411 edges, 55775 markings/sec, 85 secs
lola: 5601462 markings, 38805297 edges, 59966 markings/sec, 90 secs
lola: 5912433 markings, 41050208 edges, 62194 markings/sec, 95 secs
lola: 6205984 markings, 43144963 edges, 58710 markings/sec, 100 secs
lola: 6470160 markings, 45099010 edges, 52835 markings/sec, 105 secs
lola: 6784393 markings, 47151959 edges, 62847 markings/sec, 110 secs
lola: 7095646 markings, 49409322 edges, 62251 markings/sec, 115 secs
lola: 7392069 markings, 51512364 edges, 59285 markings/sec, 120 secs
lola: 7665080 markings, 53542867 edges, 54602 markings/sec, 125 secs
lola: 7971971 markings, 55525788 edges, 61378 markings/sec, 130 secs
lola: 8293517 markings, 57861787 edges, 64309 markings/sec, 135 secs
lola: 8599870 markings, 60037885 edges, 61271 markings/sec, 140 secs
lola: 8884125 markings, 62110459 edges, 56851 markings/sec, 145 secs
lola: 9149195 markings, 64064180 edges, 53014 markings/sec, 150 secs
lola: 9483325 markings, 66209969 edges, 66826 markings/sec, 155 secs
lola: 9806563 markings, 68564016 edges, 64648 markings/sec, 160 secs
lola: 10114748 markings, 70756861 edges, 61637 markings/sec, 165 secs
lola: 10401404 markings, 72831437 edges, 57331 markings/sec, 170 secs
lola: 10667729 markings, 74808758 edges, 53265 markings/sec, 175 secs
lola: 10988282 markings, 76846779 edges, 64111 markings/sec, 180 secs
lola: 11315922 markings, 79206018 edges, 65528 markings/sec, 185 secs
lola: 11632863 markings, 81496012 edges, 63388 markings/sec, 190 secs
lola: 11939810 markings, 83635938 edges, 61389 markings/sec, 195 secs
lola: 12212855 markings, 85686025 edges, 54609 markings/sec, 200 secs
lola: 12473567 markings, 87611129 edges, 52142 markings/sec, 205 secs
lola: 12816075 markings, 89790072 edges, 68502 markings/sec, 210 secs
lola: 13143643 markings, 92136940 edges, 65514 markings/sec, 215 secs
lola: 13461807 markings, 94435773 edges, 63633 markings/sec, 220 secs
lola: 13768746 markings, 96608339 edges, 61388 markings/sec, 225 secs
lola: 14051147 markings, 98669867 edges, 56480 markings/sec, 230 secs
lola: 14315888 markings, 100639349 edges, 52948 markings/sec, 235 secs
lola: 14594998 markings, 102508005 edges, 55822 markings/sec, 240 secs
lola: 14949968 markings, 104889013 edges, 70994 markings/sec, 245 secs
lola: 15275457 markings, 107225042 edges, 65098 markings/sec, 250 secs
lola: 15591292 markings, 109493772 edges, 63167 markings/sec, 255 secs
lola: 15898441 markings, 111671381 edges, 61430 markings/sec, 260 secs
lola: 16178167 markings, 113712504 edges, 55945 markings/sec, 265 secs
lola: 16440976 markings, 115670082 edges, 52562 markings/sec, 270 secs
lola: 16694537 markings, 117466542 edges, 50712 markings/sec, 275 secs
lola: 17039351 markings, 119627716 edges, 68963 markings/sec, 280 secs
lola: 17374265 markings, 122047516 edges, 66983 markings/sec, 285 secs
lola: 17697705 markings, 124368912 edges, 64688 markings/sec, 290 secs
lola: 18013922 markings, 126645266 edges, 63243 markings/sec, 295 secs
lola: 18324183 markings, 128794956 edges, 62052 markings/sec, 300 secs
lola: 18591477 markings, 130811336 edges, 53459 markings/sec, 305 secs
lola: 18853632 markings, 132763282 edges, 52431 markings/sec, 310 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: 19056445 markings, 134219423 edges
lola: ========================================
lola: subprocess 8 will run for 1039 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p76 + p77 + 1 <= p53 + p54)))
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 ((p76 + p77 + 1 <= p53 + p54)))
lola: processed formula length: 36
lola: 55 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: 1052 markings, 1452 edges
lola: ========================================
lola: subprocess 9 will run for 1559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p53 + p54) R (F ((p49 <= 1)) OR (p53 + p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p53 + p54) R (F ((p49 <= 1)) OR (p53 + p54 <= 0)))))
lola: processed formula length: 65
lola: 55 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: 855881 markings, 4009619 edges, 171176 markings/sec, 0 secs
lola: 1638645 markings, 8170172 edges, 156553 markings/sec, 5 secs
lola: 2390839 markings, 12380864 edges, 150439 markings/sec, 10 secs
lola: 3125550 markings, 16500021 edges, 146942 markings/sec, 15 secs
lola: 3846173 markings, 20547828 edges, 144125 markings/sec, 20 secs
lola: 4561838 markings, 24543908 edges, 143133 markings/sec, 25 secs
lola: 5254659 markings, 28668164 edges, 138564 markings/sec, 30 secs
lola: 5964829 markings, 32714448 edges, 142034 markings/sec, 35 secs
lola: 6678143 markings, 36610822 edges, 142663 markings/sec, 40 secs
lola: 7338891 markings, 40732268 edges, 132150 markings/sec, 45 secs
lola: 8060043 markings, 44648487 edges, 144230 markings/sec, 50 secs
lola: 8717024 markings, 48765357 edges, 131396 markings/sec, 55 secs
lola: 9413769 markings, 52744635 edges, 139349 markings/sec, 60 secs
lola: 10078143 markings, 56744441 edges, 132875 markings/sec, 65 secs
lola: 10723569 markings, 60731589 edges, 129085 markings/sec, 70 secs
lola: 11438559 markings, 64549557 edges, 142998 markings/sec, 75 secs
lola: 12086360 markings, 68627486 edges, 129560 markings/sec, 80 secs
lola: 12725163 markings, 72653775 edges, 127761 markings/sec, 85 secs
lola: 13437668 markings, 76442508 edges, 142501 markings/sec, 90 secs
lola: 14070213 markings, 80515380 edges, 126509 markings/sec, 95 secs
lola: 14716682 markings, 84540282 edges, 129294 markings/sec, 100 secs
lola: 15447221 markings, 88302118 edges, 146108 markings/sec, 105 secs
lola: 16047688 markings, 92293359 edges, 120093 markings/sec, 110 secs
lola: 16696627 markings, 96342025 edges, 129788 markings/sec, 115 secs
lola: 17338689 markings, 100308743 edges, 128412 markings/sec, 120 secs
lola: 18048376 markings, 104041652 edges, 141937 markings/sec, 125 secs
lola: 18649704 markings, 108015266 edges, 120266 markings/sec, 130 secs
lola: 19292977 markings, 112033108 edges, 128655 markings/sec, 135 secs
lola: 19931629 markings, 115988913 edges, 127730 markings/sec, 140 secs
lola: 20650009 markings, 119685230 edges, 143676 markings/sec, 145 secs
lola: 21237026 markings, 123616488 edges, 117403 markings/sec, 150 secs
lola: 21879195 markings, 127621290 edges, 128434 markings/sec, 155 secs
lola: 22499931 markings, 131587819 edges, 124147 markings/sec, 160 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: 22865460 markings, 133783951 edges
lola: ========================================
lola: subprocess 10 will run for 2951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((1 <= p76 + p77) AND (1 <= p49)) OR (1 <= p49))) AND (F ((p24 + 1 <= p0)) AND (1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((1 <= p76 + p77) AND (1 <= p49)) OR (1 <= p49))) AND (F ((p24 + 1 <= p0)) AND (1 <= p49))))
lola: processed formula length: 101
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no no no no yes no no
lola:
preliminary result: yes yes no yes no no no no yes no no
lola: memory consumption: 40720 KB
lola: time consumption: 619 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-COL-V20P20N20"
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-COL-V20P20N20, 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-158987913500177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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