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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.1K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 26 02:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Mar 25 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 237K Mar 25 20:59 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 7.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 25 17:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 25 17:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Mar 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 242K Mar 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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 1.1M 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-V20P20N20-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-15

=== Now, execution of the tool begins

BK_START 1591144437027

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:33:59] [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:33:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:33:59] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2020-06-03 00:33:59] [INFO ] Transformed 78 places.
[2020-06-03 00:33:59] [INFO ] Transformed 968 transitions.
[2020-06-03 00:33:59] [INFO ] Parsed PT model containing 78 places and 968 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 81 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 575 resets, run finished after 441 ms. (steps per millisecond=226 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1]
[2020-06-03 00:34:00] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2020-06-03 00:34:00] [INFO ] Computed 7 place invariants in 7 ms
[2020-06-03 00:34:00] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-03 00:34:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:34:00] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2020-06-03 00:34:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:34:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:00] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-03 00:34:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:34:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 00:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:00] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-03 00:34:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2020-06-03 00:34:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 40 ms returned sat
[2020-06-03 00:34:00] [INFO ] Deduced a trap composed of 24 places in 171 ms
[2020-06-03 00:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2020-06-03 00:34:00] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 74 ms.
[2020-06-03 00:34:01] [INFO ] Added : 104 causal constraints over 25 iterations in 959 ms. Result :sat
[2020-06-03 00:34:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:34:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-03 00:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:01] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-03 00:34:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:34:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:34:01] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2020-06-03 00:34:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2020-06-03 00:34:02] [INFO ] Deduced a trap composed of 26 places in 148 ms
[2020-06-03 00:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2020-06-03 00:34:02] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 54 ms.
[2020-06-03 00:34:05] [INFO ] Added : 165 causal constraints over 33 iterations in 3522 ms. Result :sat
[2020-06-03 00:34:06] [INFO ] Deduced a trap composed of 25 places in 402 ms
[2020-06-03 00:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2020-06-03 00:34:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 00:34:06] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 00:34:06] [INFO ] Flatten gal took : 91 ms
FORMULA BridgeAndVehicles-PT-V20P20N20-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:34:06] [INFO ] Flatten gal took : 62 ms
[2020-06-03 00:34:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 00:34:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N20 @ 3570 seconds

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

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

FORMULA BridgeAndVehicles-PT-V20P20N20-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA BridgeAndVehicles-PT-V20P20N20-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BridgeAndVehicles-PT-V20P20N20-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N20-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2518
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-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": "Wed Jun 3 00:34:07 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"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": "(p24 <= 2)",
"processed_size": 10,
"rewrites": 62
},
"result":
{
"edges": 2567011,
"markings": 885525,
"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": 350
},
"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 <= p26 + p27))",
"processed_size": 20,
"rewrites": 60
},
"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": 389
},
"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 ((p0 <= p24)) AND G (F ((p53 + p54 <= p56))))))",
"processed_size": 56,
"rewrites": 60
},
"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": 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 ((p46 <= p25))",
"processed_size": 16,
"rewrites": 60
},
"result":
{
"edges": 22610452,
"markings": 6430526,
"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": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((p46 <= p25)) U (1 <= p55))",
"processed_size": 31,
"rewrites": 60
},
"result":
{
"edges": 896186,
"markings": 398932,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 414
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p56 <= p52))",
"processed_size": 16,
"rewrites": 60
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"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 ((p46 <= p22)))",
"processed_size": 20,
"rewrites": 60
},
"result":
{
"edges": 39440307,
"markings": 9314327,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 403
},
"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 ((p23 <= p50))",
"processed_size": 16,
"rewrites": 60
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 461
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"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": 4,
"visible_transitions": 0
},
"processed": "G (((G ((p25 + 1 <= p27)) OR (p22 + 1 <= p25)) AND X (((p22 + 1 <= p25) AND (F ((p22 + 1 <= p24)) OR G ((p22 + 1 <= p25)))))))",
"processed_size": 126,
"rewrites": 60
},
"result":
{
"edges": 21927554,
"markings": 6278191,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 533
},
"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": "(p49 + 1 <= p25)",
"processed_size": 16,
"rewrites": 62
},
"result":
{
"edges": 168,
"markings": 169,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 639
},
"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 ((p25 <= p24)))",
"processed_size": 20,
"rewrites": 60
},
"result":
{
"edges": 134327977,
"markings": 19056445,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 699
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p0 + 1 <= p74)))",
"processed_size": 23,
"rewrites": 60
},
"result":
{
"edges": 171,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"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": 932
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p53 + p54 + 1 <= p50 + p51)))",
"processed_size": 36,
"rewrites": 60
},
"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": 1398
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F ((p0 <= p56)) OR (p0 <= p56))))",
"processed_size": 40,
"rewrites": 60
},
"result":
{
"edges": 76528909,
"markings": 14303298,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2685
},
"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 <= p50 + p51) R (F ((p56 <= 1)) OR (p50 + p51 <= 0)))))",
"processed_size": 65,
"rewrites": 60
},
"result":
{
"edges": 133783951,
"markings": 22865460,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 39984,
"runtime": 1052.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(**) : ((F(**) U **) AND (X(**) OR (G(**) AND X(F(**))))) : (X(G(**)) OR (F(G(**)) OR (** OR **))) : G(F((F(**) OR **))) : (X(F(**)) AND G(**)) : G(((G(*) OR *) AND X((* AND (F(*) OR G(*)))))) : F(G(*))"
},
"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 yes yes no no no ",
"value": "yes yes no yes no no yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 ((p0 <= p24)) AND G (F ((p53 + p54 <= p56))))))) OR (G ((1 <= p26 + p27)) AND F ((3 <= p24)))) : F (X (F (G (NOT(X (((p50 + p51 <= 0) U (G ((2 <= p56)) AND (1 <= p50 + p51))))))))) : F (NOT(((0 <= 0) U G ((p50 + p51 <= p53 + p54))))) : ((G (F (X (X (G ((p50 + p51 <= p53 + p54)))))) AND (p22 <= p50 + p51)) U G (F (G ((p25 <= p24))))) : ((0 <= 0) U (p25 <= p49)) : ((F ((p46 <= p25)) U (1 <= p55)) AND (G ((p46 <= p25)) U X ((p56 <= p52)))) : (((X (G ((p46 <= p22))) OR F (G ((p46 <= p22)))) OR (1 <= p53)) OR (p56 <= p51)) : F (((1 <= 0) U X (X (G (F ((F ((p0 <= p56)) OR (p0 <= p56)))))))) : (X (F ((p51 <= p23))) AND G ((p23 <= p50))) : NOT(F (((F ((p27 <= p25)) AND (p25 <= p22)) OR X ((G ((p24 <= p22)) U (p25 <= p22)))))) : ((1 <= 0) U G (NOT(G (F ((p74 <= p0))))))
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X ((p0 <= p24)) AND G (F ((p53 + p54 <= p56)))))) OR (G ((1 <= p26 + p27)) AND F ((3 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p24))
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: (p24 <= 2)
lola: processed formula length: 10
lola: 62 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: 198122 markings, 569916 edges, 39624 markings/sec, 0 secs
lola: 385337 markings, 1114740 edges, 37443 markings/sec, 5 secs
lola: 570133 markings, 1650897 edges, 36959 markings/sec, 10 secs
lola: 753856 markings, 2179568 edges, 36745 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 885525 markings, 2567011 edges
lola: ========================================
lola: subprocess 1 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p26 + p27))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p26 + p27))
lola: processed formula length: 20
lola: 60 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 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p0 <= p24)) AND G (F ((p53 + p54 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p0 <= p24)) AND G (F ((p53 + p54 <= p56))))))
lola: processed formula length: 56
lola: 60 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: 1138859 markings, 4673250 edges, 227772 markings/sec, 0 secs
lola: 2220972 markings, 9170763 edges, 216423 markings/sec, 5 secs
lola: 3263580 markings, 13550603 edges, 208522 markings/sec, 10 secs
lola: 4286689 markings, 18027025 edges, 204622 markings/sec, 15 secs
lola: 5288123 markings, 22368068 edges, 200287 markings/sec, 20 secs
lola: 6273395 markings, 26649988 edges, 197054 markings/sec, 25 secs
lola: 7248815 markings, 30906989 edges, 195084 markings/sec, 30 secs
lola: 8244402 markings, 35229832 edges, 199117 markings/sec, 35 secs
lola: 9243024 markings, 39501616 edges, 199724 markings/sec, 40 secs
lola: 10173048 markings, 43791626 edges, 186005 markings/sec, 45 secs
lola: 11130800 markings, 47999741 edges, 191550 markings/sec, 50 secs
lola: 12078082 markings, 52073638 edges, 189456 markings/sec, 55 secs
lola: 12985031 markings, 56283527 edges, 181390 markings/sec, 60 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p46 <= p25)) U (1 <= p55)) AND (X ((p56 <= p52)) OR (G ((p46 <= p25)) AND X (F ((p56 <= p52))))))
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: G ((p46 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p46 <= p25))
lola: processed formula length: 16
lola: 60 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: 275926 markings, 880208 edges, 55185 markings/sec, 0 secs
lola: 534348 markings, 1748017 edges, 51684 markings/sec, 5 secs
lola: 771062 markings, 2569162 edges, 47343 markings/sec, 10 secs
lola: 1022895 markings, 3441227 edges, 50367 markings/sec, 15 secs
lola: 1287551 markings, 4355878 edges, 52931 markings/sec, 20 secs
lola: 1524450 markings, 5184059 edges, 47380 markings/sec, 25 secs
lola: 1764941 markings, 6051407 edges, 48098 markings/sec, 30 secs
lola: 2063240 markings, 7081485 edges, 59660 markings/sec, 35 secs
lola: 2278430 markings, 7842228 edges, 43038 markings/sec, 40 secs
lola: 2576103 markings, 8900375 edges, 59535 markings/sec, 45 secs
lola: 2825672 markings, 9764947 edges, 49914 markings/sec, 50 secs
lola: 3114441 markings, 10806883 edges, 57754 markings/sec, 55 secs
lola: 3336614 markings, 11581255 edges, 44435 markings/sec, 60 secs
lola: 3683264 markings, 12819083 edges, 69330 markings/sec, 65 secs
lola: 3867338 markings, 13502925 edges, 36815 markings/sec, 70 secs
lola: 4212465 markings, 14711421 edges, 69025 markings/sec, 75 secs
lola: 4458828 markings, 15598027 edges, 49273 markings/sec, 80 secs
lola: 4666714 markings, 16336251 edges, 41577 markings/sec, 85 secs
lola: 5069364 markings, 17777560 edges, 80530 markings/sec, 90 secs
lola: 5288953 markings, 18573965 edges, 43918 markings/sec, 95 secs
lola: 5548343 markings, 19455197 edges, 51878 markings/sec, 100 secs
lola: 5937687 markings, 20892428 edges, 77869 markings/sec, 105 secs
lola: 6161964 markings, 21704943 edges, 44855 markings/sec, 110 secs
lola: 6376202 markings, 22461529 edges, 42848 markings/sec, 115 secs
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: 6430526 markings, 22610452 edges
lola: ========================================
lola: subprocess 2 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p46 <= p25)) U (1 <= p55))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p46 <= p25)) U (1 <= p55))
lola: processed formula length: 31
lola: 60 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 398932 markings, 896186 edges
lola: ========================================
lola: subprocess 3 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p56 <= p52))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p56 <= p52))
lola: processed formula length: 16
lola: 60 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p46 <= p22))) OR (F (G ((p46 <= p22))) OR ((1 <= p53) OR (p56 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p53) OR (p56 <= p51))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p53) OR (p56 <= p51))
lola: processed formula length: 28
lola: 61 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p46 <= 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 ((p46 <= p22)))
lola: processed formula length: 20
lola: 60 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: 605301 markings, 2395452 edges, 121060 markings/sec, 0 secs
lola: 1147341 markings, 4586881 edges, 108408 markings/sec, 5 secs
lola: 1702899 markings, 6900141 edges, 111112 markings/sec, 10 secs
lola: 2218674 markings, 9011896 edges, 103155 markings/sec, 15 secs
lola: 2736842 markings, 11187454 edges, 103634 markings/sec, 20 secs
lola: 3260641 markings, 13381817 edges, 104760 markings/sec, 25 secs
lola: 3784520 markings, 15589677 edges, 104776 markings/sec, 30 secs
lola: 4308504 markings, 17864415 edges, 104797 markings/sec, 35 secs
lola: 4792674 markings, 19901873 edges, 96834 markings/sec, 40 secs
lola: 5339006 markings, 22203017 edges, 109266 markings/sec, 45 secs
lola: 5860956 markings, 24501017 edges, 104390 markings/sec, 50 secs
lola: 6376876 markings, 26675121 edges, 103184 markings/sec, 55 secs
lola: 6899048 markings, 28970446 edges, 104434 markings/sec, 60 secs
lola: 7422362 markings, 31199531 edges, 104663 markings/sec, 65 secs
lola: 7948513 markings, 33524320 edges, 105230 markings/sec, 70 secs
lola: 8484939 markings, 35819091 edges, 107285 markings/sec, 75 secs
lola: 9000985 markings, 38114558 edges, 103209 markings/sec, 80 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: 9314327 markings, 39440307 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p51 <= p23))) AND G ((p23 <= p50)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p23 <= p50))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p23 <= p50))
lola: processed formula length: 16
lola: 60 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((p25 + 1 <= p27)) OR (p22 + 1 <= p25)) AND X (((p22 + 1 <= p25) AND (F ((p22 + 1 <= p24)) OR G ((p22 + 1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p25 + 1 <= p27)) OR (p22 + 1 <= p25)) AND X (((p22 + 1 <= p25) AND (F ((p22 + 1 <= p24)) OR G ((p22 + 1 <= p25)))))))
lola: processed formula length: 126
lola: 60 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: 1242445 markings, 3952249 edges, 248489 markings/sec, 0 secs
lola: 2362028 markings, 7744686 edges, 223917 markings/sec, 5 secs
lola: 3438592 markings, 11473568 edges, 215313 markings/sec, 10 secs
lola: 4462451 markings, 15284658 edges, 204772 markings/sec, 15 secs
lola: 5476166 markings, 18899675 edges, 202743 markings/sec, 20 secs
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: 6278191 markings, 21927554 edges
lola: ========================================
lola: subprocess 5 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p25 <= p49))
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: (p49 + 1 <= p25)
lola: processed formula length: 16
lola: 62 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 6 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p25 <= p24)))
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 ((p25 <= p24)))
lola: processed formula length: 20
lola: 60 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: 281038 markings, 1740625 edges, 56208 markings/sec, 0 secs
lola: 505530 markings, 3248555 edges, 44898 markings/sec, 5 secs
lola: 727463 markings, 4747756 edges, 44387 markings/sec, 10 secs
lola: 915865 markings, 6082708 edges, 37680 markings/sec, 15 secs
lola: 1151150 markings, 7682685 edges, 47057 markings/sec, 20 secs
lola: 1361248 markings, 9114543 edges, 42020 markings/sec, 25 secs
lola: 1583276 markings, 10683118 edges, 44406 markings/sec, 30 secs
lola: 1768273 markings, 12010207 edges, 36999 markings/sec, 35 secs
lola: 2031953 markings, 13792141 edges, 52736 markings/sec, 40 secs
lola: 2210997 markings, 15099791 edges, 35809 markings/sec, 45 secs
lola: 2462745 markings, 16791747 edges, 50350 markings/sec, 50 secs
lola: 2679590 markings, 18338576 edges, 43369 markings/sec, 55 secs
lola: 2856937 markings, 19636312 edges, 35469 markings/sec, 60 secs
lola: 3130025 markings, 21469871 edges, 54618 markings/sec, 65 secs
lola: 3357694 markings, 23080805 edges, 45534 markings/sec, 70 secs
lola: 3531989 markings, 24370842 edges, 34859 markings/sec, 75 secs
lola: 3765772 markings, 25908617 edges, 46757 markings/sec, 80 secs
lola: 4050048 markings, 27938432 edges, 56855 markings/sec, 85 secs
lola: 4235928 markings, 29285353 edges, 37176 markings/sec, 90 secs
lola: 4404297 markings, 30530276 edges, 33674 markings/sec, 95 secs
lola: 4670180 markings, 32275923 edges, 53177 markings/sec, 100 secs
lola: 4956947 markings, 34332832 edges, 57353 markings/sec, 105 secs
lola: 5152987 markings, 35748632 edges, 39208 markings/sec, 110 secs
lola: 5327167 markings, 37035986 edges, 34836 markings/sec, 115 secs
lola: 5544524 markings, 38495630 edges, 43471 markings/sec, 120 secs
lola: 5863422 markings, 40725130 edges, 63780 markings/sec, 125 secs
lola: 6121743 markings, 42541497 edges, 51664 markings/sec, 130 secs
lola: 6290799 markings, 43809164 edges, 33811 markings/sec, 135 secs
lola: 6464203 markings, 45088650 edges, 34681 markings/sec, 140 secs
lola: 6730681 markings, 46807321 edges, 53296 markings/sec, 145 secs
lola: 7045784 markings, 49087383 edges, 63021 markings/sec, 150 secs
lola: 7315693 markings, 50969506 edges, 53982 markings/sec, 155 secs
lola: 7484717 markings, 52238174 edges, 33805 markings/sec, 160 secs
lola: 7655262 markings, 53507354 edges, 34109 markings/sec, 165 secs
lola: 7845994 markings, 54848338 edges, 38146 markings/sec, 170 secs
lola: 8197549 markings, 57210914 edges, 70311 markings/sec, 175 secs
lola: 8501193 markings, 59389933 edges, 60729 markings/sec, 180 secs
lola: 8733212 markings, 61026407 edges, 46404 markings/sec, 185 secs
lola: 8901871 markings, 62290647 edges, 33732 markings/sec, 190 secs
lola: 9073738 markings, 63561204 edges, 34373 markings/sec, 195 secs
lola: 9288968 markings, 65013430 edges, 43046 markings/sec, 200 secs
lola: 9644030 markings, 67443472 edges, 71012 markings/sec, 205 secs
lola: 9955617 markings, 69686332 edges, 62317 markings/sec, 210 secs
lola: 10223539 markings, 71548939 edges, 53584 markings/sec, 215 secs
lola: 10390417 markings, 72812129 edges, 33376 markings/sec, 220 secs
lola: 10562341 markings, 74090671 edges, 34385 markings/sec, 225 secs
lola: 10737582 markings, 75374017 edges, 35048 markings/sec, 230 secs
lola: 11069000 markings, 77474460 edges, 66284 markings/sec, 235 secs
lola: 11394563 markings, 79833536 edges, 65113 markings/sec, 240 secs
lola: 11692847 markings, 81988089 edges, 59657 markings/sec, 245 secs
lola: 11955791 markings, 83821208 edges, 52589 markings/sec, 250 secs
lola: 12121648 markings, 85076627 edges, 33171 markings/sec, 255 secs
lola: 12292354 markings, 86346138 edges, 34141 markings/sec, 260 secs
lola: 12464730 markings, 87618112 edges, 34475 markings/sec, 265 secs
lola: 12769944 markings, 89519513 edges, 61043 markings/sec, 270 secs
lola: 13108434 markings, 91941701 edges, 67698 markings/sec, 275 secs
lola: 13428171 markings, 94264355 edges, 63947 markings/sec, 280 secs
lola: 13727768 markings, 96395691 edges, 59919 markings/sec, 285 secs
lola: 13937007 markings, 97886177 edges, 41848 markings/sec, 290 secs
lola: 14101584 markings, 99118785 edges, 32915 markings/sec, 295 secs
lola: 14271511 markings, 100383808 edges, 33985 markings/sec, 300 secs
lola: 14444290 markings, 101652759 edges, 34556 markings/sec, 305 secs
lola: 14769844 markings, 103682472 edges, 65111 markings/sec, 310 secs
lola: 15108466 markings, 106086086 edges, 67724 markings/sec, 315 secs
lola: 15431659 markings, 108424378 edges, 64639 markings/sec, 320 secs
lola: 15737498 markings, 110628610 edges, 61168 markings/sec, 325 secs
lola: 16001471 markings, 112461315 edges, 52795 markings/sec, 330 secs
lola: 16165478 markings, 113703409 edges, 32801 markings/sec, 335 secs
lola: 16332865 markings, 114956893 edges, 33477 markings/sec, 340 secs
lola: 16502504 markings, 116216535 edges, 33928 markings/sec, 345 secs
lola: 16686637 markings, 117517428 edges, 36827 markings/sec, 350 secs
lola: 17047570 markings, 119785688 edges, 72187 markings/sec, 355 secs
lola: 17392287 markings, 122278630 edges, 68943 markings/sec, 360 secs
lola: 17717948 markings, 124616838 edges, 65132 markings/sec, 365 secs
lola: 18027928 markings, 126844367 edges, 61996 markings/sec, 370 secs
lola: 18313684 markings, 128825887 edges, 57151 markings/sec, 375 secs
lola: 18482029 markings, 130085916 edges, 33669 markings/sec, 380 secs
lola: 18650494 markings, 131350414 edges, 33693 markings/sec, 385 secs
lola: 18818989 markings, 132610578 edges, 33699 markings/sec, 390 secs
lola: 18992810 markings, 133883849 edges, 34764 markings/sec, 395 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, 134327977 edges
lola: ========================================
lola: subprocess 7 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 + 1 <= p74)))
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 + 1 <= p74)))
lola: processed formula length: 23
lola: 60 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: 170 markings, 171 edges
lola: ========================================
lola: subprocess 8 will run for 932 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p53 + p54 + 1 <= p50 + p51)))
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 + 1 <= p50 + p51)))
lola: processed formula length: 36
lola: 60 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: subprocess 9 will run for 1398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p0 <= p56)) OR (p0 <= p56))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p0 <= p56)) OR (p0 <= p56))))
lola: processed formula length: 40
lola: 60 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: 774841 markings, 2737319 edges, 154968 markings/sec, 0 secs
lola: 1549090 markings, 5569886 edges, 154850 markings/sec, 5 secs
lola: 2317763 markings, 8447379 edges, 153735 markings/sec, 10 secs
lola: 3108695 markings, 11501205 edges, 158186 markings/sec, 15 secs
lola: 3792377 markings, 14826250 edges, 136736 markings/sec, 20 secs
lola: 4357566 markings, 18569382 edges, 113038 markings/sec, 25 secs
lola: 4935209 markings, 22230896 edges, 115529 markings/sec, 30 secs
lola: 5507324 markings, 25813119 edges, 114423 markings/sec, 35 secs
lola: 6108943 markings, 29501452 edges, 120324 markings/sec, 40 secs
lola: 6689899 markings, 33057335 edges, 116191 markings/sec, 45 secs
lola: 7276251 markings, 36642417 edges, 117270 markings/sec, 50 secs
lola: 7859862 markings, 40264180 edges, 116722 markings/sec, 55 secs
lola: 8436606 markings, 43717855 edges, 115349 markings/sec, 60 secs
lola: 9066458 markings, 47125594 edges, 125970 markings/sec, 65 secs
lola: 9667420 markings, 51086277 edges, 120192 markings/sec, 70 secs
lola: 10252269 markings, 54677545 edges, 116970 markings/sec, 75 secs
lola: 10916434 markings, 58306795 edges, 132833 markings/sec, 80 secs
lola: 11583913 markings, 61574199 edges, 133496 markings/sec, 85 secs
lola: 12221363 markings, 65491114 edges, 127490 markings/sec, 90 secs
lola: 12906785 markings, 68497099 edges, 137084 markings/sec, 95 secs
lola: 13483402 markings, 72389814 edges, 115323 markings/sec, 100 secs
lola: 14162602 markings, 75916128 edges, 135840 markings/sec, 105 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: 14303298 markings, 76528909 edges
lola: ========================================
lola: subprocess 10 will run for 2685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p50 + p51) R (F ((p56 <= 1)) OR (p50 + p51 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p50 + p51) R (F ((p56 <= 1)) OR (p50 + p51 <= 0)))))
lola: processed formula length: 65
lola: 60 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: 847392 markings, 3972289 edges, 169478 markings/sec, 0 secs
lola: 1628995 markings, 8110899 edges, 156321 markings/sec, 5 secs
lola: 2379545 markings, 12306624 edges, 150110 markings/sec, 10 secs
lola: 3116699 markings, 16441975 edges, 147431 markings/sec, 15 secs
lola: 3831422 markings, 20448990 edges, 142945 markings/sec, 20 secs
lola: 4563256 markings, 24552802 edges, 146367 markings/sec, 25 secs
lola: 5266524 markings, 28711048 edges, 140654 markings/sec, 30 secs
lola: 5985459 markings, 32852069 edges, 143787 markings/sec, 35 secs
lola: 6712612 markings, 36838750 edges, 145431 markings/sec, 40 secs
lola: 7386219 markings, 41027672 edges, 134721 markings/sec, 45 secs
lola: 8106137 markings, 44946121 edges, 143984 markings/sec, 50 secs
lola: 8764734 markings, 49085255 edges, 131719 markings/sec, 55 secs
lola: 9468231 markings, 52993535 edges, 140699 markings/sec, 60 secs
lola: 10119702 markings, 56998677 edges, 130294 markings/sec, 65 secs
lola: 10775161 markings, 61047427 edges, 131092 markings/sec, 70 secs
lola: 11489462 markings, 64893621 edges, 142860 markings/sec, 75 secs
lola: 12145273 markings, 69019569 edges, 131162 markings/sec, 80 secs
lola: 12806908 markings, 73136232 edges, 132327 markings/sec, 85 secs
lola: 13502021 markings, 76863153 edges, 139023 markings/sec, 90 secs
lola: 14141696 markings, 80923652 edges, 127935 markings/sec, 95 secs
lola: 14787192 markings, 84979057 edges, 129099 markings/sec, 100 secs
lola: 15509546 markings, 88727825 edges, 144471 markings/sec, 105 secs
lola: 16105000 markings, 92662382 edges, 119091 markings/sec, 110 secs
lola: 16766047 markings, 96767664 edges, 132209 markings/sec, 115 secs
lola: 17427454 markings, 100729571 edges, 132281 markings/sec, 120 secs
lola: 18130493 markings, 104584054 edges, 140608 markings/sec, 125 secs
lola: 18744865 markings, 108629059 edges, 122874 markings/sec, 130 secs
lola: 19392414 markings, 112658187 edges, 129510 markings/sec, 135 secs
lola: 20032410 markings, 116484819 edges, 127999 markings/sec, 140 secs
lola: 20737073 markings, 120282113 edges, 140933 markings/sec, 145 secs
lola: 21331387 markings, 124236687 edges, 118863 markings/sec, 150 secs
lola: 21985487 markings, 128338642 edges, 130820 markings/sec, 155 secs
lola: 22614676 markings, 132312765 edges, 125838 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: RESULT
lola:
SUMMARY: yes yes no yes no no yes yes no no no
lola:
preliminary result: yes yes no yes no no yes yes no no no
lola: memory consumption: 39984 KB
lola: time consumption: 1052 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-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-PT-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-158987913700337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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