fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913500161
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V20P10N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.580 3600000.00 488457.00 200.50 TTTTTTFTTTTTFFTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 4.1K Mar 26 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 20:54 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.1K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 12:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 12:22 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 41K 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-V20P10N50-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N50-15

=== Now, execution of the tool begins

BK_START 1591129011698

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:16:54] [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 20:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:16:54] [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 20:16:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 526 ms
[2020-06-02 20:16:54] [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 20:16:54] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 86 ms.
[2020-06-02 20:16:55] [INFO ] Computed order based on color domains.
[2020-06-02 20:16:55] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions in 36 ms.
[2020-06-02 20:16:55] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 89 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 578 resets, run finished after 830 ms. (steps per millisecond=120 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1]
[2020-06-02 20:16:55] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-02 20:16:55] [INFO ] Computed 7 place invariants in 10 ms
[2020-06-02 20:16:56] [INFO ] [Real]Absence check using 7 positive place invariants in 63 ms returned unsat
[2020-06-02 20:16:56] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:16:56] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-02 20:16:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:16:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 20:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:16:56] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2020-06-02 20:16:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-02 20:16:56] [INFO ] [Nat]Added 102 Read/Feed constraints in 27 ms returned sat
[2020-06-02 20:16:57] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 307 ms.
[2020-06-02 20:17:14] [INFO ] Added : 268 causal constraints over 56 iterations in 18122 ms. Result :sat
[2020-06-02 20:17:16] [INFO ] Deduced a trap composed of 56 places in 1577 ms
[2020-06-02 20:17:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s48 s49 s53 s54 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107) 0)") while checking expression at index 1
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-02 20:17:16] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2020-06-02 20:17:17] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-02 20:17:17] [INFO ] Flatten gal took : 283 ms
FORMULA BridgeAndVehicles-COL-V20P10N50-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:17:17] [INFO ] Applying decomposition
[2020-06-02 20:17:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 20:17:17] [INFO ] Flatten gal took : 112 ms
[2020-06-02 20:17:17] [INFO ] Decomposing Gal with order
[2020-06-02 20:17:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 20:17:18] [INFO ] Removed a total of 12670 redundant transitions.
[2020-06-02 20:17:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 20:17:18] [INFO ] Flatten gal took : 568 ms
[2020-06-02 20:17:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 47 ms.
[2020-06-02 20:17:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N50-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N50-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:17:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-02 20:17:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P10N50 @ 3570 seconds

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

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

FORMULA BridgeAndVehicles-COL-V20P10N50-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P10N50-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3135
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P10N50

{
"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 20:17:18 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1729
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (G ((G (((p106 + p107 + 1 <= p23) OR (p23 + 1 <= p48))) AND X ((p23 <= p106 + p107))))))",
"processed_size": 94,
"rewrites": 17
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 3458
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p23 <= p22)",
"processed_size": 12,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p23 <= p22)",
"processed_size": 12,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "G (F ((p23 <= p22)))",
"processed_size": 20,
"rewrites": 17
},
"result":
{
"edges": 58745234,
"markings": 12242052,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 74972,
"runtime": 435.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(F(**)) OR **) : F(G((F(**) AND (X(**) OR (** OR **))))) : X(X(X(G(*)))) : X(X(G((G(*) AND X(*)))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "yes yes no no ",
"value": "yes 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: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 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: (X (G (F ((p23 <= p22)))) OR (p23 <= p22)) : X (F (G (((X ((p22 <= p47)) OR (p22 <= p47)) U (p25 <= p48))))) : NOT(X (F (X (X (F ((p23 <= p0))))))) : X (X (G ((NOT(F (((p23 <= p106 + p107) AND (p48 <= p23)))) AND NOT(X ((p106 + p107 + 1 <= p23)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p25 <= p48)) AND (X ((p22 <= p47)) OR ((p22 <= p47) OR (p25 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p25 <= p48)) AND (X ((p22 <= p47)) OR ((p22 <= p47) OR (p25 <= p48))))))
lola: processed formula length: 83
lola: 17 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: 627290 markings, 3857065 edges, 125458 markings/sec, 0 secs
lola: 1239679 markings, 7616095 edges, 122478 markings/sec, 5 secs
lola: 1876537 markings, 11202937 edges, 127372 markings/sec, 10 secs
lola: 2502260 markings, 14788173 edges, 125145 markings/sec, 15 secs
lola: 3159985 markings, 18211992 edges, 131545 markings/sec, 20 secs
lola: 3827216 markings, 21536457 edges, 133446 markings/sec, 25 secs
lola: 4477843 markings, 24795545 edges, 130125 markings/sec, 30 secs
lola: 5125493 markings, 28034570 edges, 129530 markings/sec, 35 secs
lola: 5786742 markings, 31263777 edges, 132250 markings/sec, 40 secs
lola: 6461713 markings, 34277789 edges, 134994 markings/sec, 45 secs
lola: 7163792 markings, 37269276 edges, 140416 markings/sec, 50 secs
lola: 7817314 markings, 40495314 edges, 130704 markings/sec, 55 secs
lola: 8492617 markings, 43610839 edges, 135061 markings/sec, 60 secs
lola: 9193610 markings, 46405567 edges, 140199 markings/sec, 65 secs
lola: 9824796 markings, 49574765 edges, 126237 markings/sec, 70 secs
lola: 10530176 markings, 52305073 edges, 141076 markings/sec, 75 secs
lola: 11152903 markings, 55287794 edges, 124545 markings/sec, 80 secs
lola: 11843411 markings, 58071072 edges, 138102 markings/sec, 85 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: 12260581 markings, 60268953 edges
lola: ========================================
lola: subprocess 1 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((p0 + 1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((p0 + 1 <= p23)))))
lola: processed formula length: 31
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168 markings, 168 edges
lola: ========================================
lola: subprocess 2 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G (((p106 + p107 + 1 <= p23) OR (p23 + 1 <= p48))) AND X ((p23 <= p106 + p107))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G (((p106 + p107 + 1 <= p23) OR (p23 + 1 <= p48))) AND X ((p23 <= p106 + p107))))))
lola: processed formula length: 94
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168 markings, 168 edges
lola: ========================================
lola: subprocess 3 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p23 <= p22))) OR (p23 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p23 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p23 <= p22)
lola: processed formula length: 12
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((p23 <= p22))) OR (p23 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p23 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p23 <= p22)
lola: processed formula length: 12
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: G (F ((p23 <= p22)))
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 ((p23 <= p22)))
lola: processed formula length: 20
lola: 17 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: 183717 markings, 562325 edges, 36743 markings/sec, 0 secs
lola: 371201 markings, 1176329 edges, 37497 markings/sec, 5 secs
lola: 574699 markings, 1878144 edges, 40700 markings/sec, 10 secs
lola: 778003 markings, 2567507 edges, 40661 markings/sec, 15 secs
lola: 996909 markings, 3356390 edges, 43781 markings/sec, 20 secs
lola: 1212426 markings, 4127337 edges, 43103 markings/sec, 25 secs
lola: 1425044 markings, 4879806 edges, 42524 markings/sec, 30 secs
lola: 1644427 markings, 5671776 edges, 43877 markings/sec, 35 secs
lola: 1873967 markings, 6539125 edges, 45908 markings/sec, 40 secs
lola: 2097944 markings, 7373176 edges, 44795 markings/sec, 45 secs
lola: 2297695 markings, 8063728 edges, 39950 markings/sec, 50 secs
lola: 2537628 markings, 9003772 edges, 47987 markings/sec, 55 secs
lola: 2750443 markings, 9772856 edges, 42563 markings/sec, 60 secs
lola: 2985063 markings, 10655022 edges, 46924 markings/sec, 65 secs
lola: 3195028 markings, 11443645 edges, 41993 markings/sec, 70 secs
lola: 3428398 markings, 12320313 edges, 46674 markings/sec, 75 secs
lola: 3602708 markings, 13001477 edges, 34862 markings/sec, 80 secs
lola: 3761942 markings, 13726343 edges, 31847 markings/sec, 85 secs
lola: 3937034 markings, 14553058 edges, 35018 markings/sec, 90 secs
lola: 4101410 markings, 15332625 edges, 32875 markings/sec, 95 secs
lola: 4283009 markings, 16176208 edges, 36320 markings/sec, 100 secs
lola: 4474177 markings, 17083959 edges, 38234 markings/sec, 105 secs
lola: 4629871 markings, 17924458 edges, 31139 markings/sec, 110 secs
lola: 4805902 markings, 18715549 edges, 35206 markings/sec, 115 secs
lola: 4990996 markings, 19741801 edges, 37019 markings/sec, 120 secs
lola: 5157960 markings, 20493354 edges, 33393 markings/sec, 125 secs
lola: 5336530 markings, 21502610 edges, 35714 markings/sec, 130 secs
lola: 5532614 markings, 22387676 edges, 39217 markings/sec, 135 secs
lola: 5703875 markings, 23383010 edges, 34252 markings/sec, 140 secs
lola: 5896381 markings, 24356059 edges, 38501 markings/sec, 145 secs
lola: 6064180 markings, 25145999 edges, 33560 markings/sec, 150 secs
lola: 6243240 markings, 26227736 edges, 35812 markings/sec, 155 secs
lola: 6450169 markings, 27204397 edges, 41386 markings/sec, 160 secs
lola: 6619226 markings, 28059720 edges, 33811 markings/sec, 165 secs
lola: 6802537 markings, 29186233 edges, 36662 markings/sec, 170 secs
lola: 7003675 markings, 30173539 edges, 40228 markings/sec, 175 secs
lola: 7164032 markings, 30880041 edges, 32071 markings/sec, 180 secs
lola: 7367137 markings, 32183013 edges, 40621 markings/sec, 185 secs
lola: 7551409 markings, 33197699 edges, 36854 markings/sec, 190 secs
lola: 7731707 markings, 33950026 edges, 36060 markings/sec, 195 secs
lola: 7907125 markings, 34939312 edges, 35084 markings/sec, 200 secs
lola: 8106693 markings, 36189123 edges, 39914 markings/sec, 205 secs
lola: 8292274 markings, 37194773 edges, 37116 markings/sec, 210 secs
lola: 8464754 markings, 37904716 edges, 34496 markings/sec, 215 secs
lola: 8638744 markings, 38911192 edges, 34798 markings/sec, 220 secs
lola: 8845538 markings, 40208396 edges, 41359 markings/sec, 225 secs
lola: 9028450 markings, 41251697 edges, 36582 markings/sec, 230 secs
lola: 9213638 markings, 42096266 edges, 37038 markings/sec, 235 secs
lola: 9355095 markings, 42705775 edges, 28291 markings/sec, 240 secs
lola: 9569979 markings, 44054856 edges, 42977 markings/sec, 245 secs
lola: 9774924 markings, 45348891 edges, 40989 markings/sec, 250 secs
lola: 9957351 markings, 46348320 edges, 36485 markings/sec, 255 secs
lola: 10135851 markings, 47117865 edges, 35700 markings/sec, 260 secs
lola: 10280136 markings, 47781911 edges, 28857 markings/sec, 265 secs
lola: 10485993 markings, 49101526 edges, 41171 markings/sec, 270 secs
lola: 10690866 markings, 50414984 edges, 40975 markings/sec, 275 secs
lola: 10875749 markings, 51480450 edges, 36977 markings/sec, 280 secs
lola: 11055262 markings, 52314148 edges, 35903 markings/sec, 285 secs
lola: 11197118 markings, 52895062 edges, 28371 markings/sec, 290 secs
lola: 11385282 markings, 54005327 edges, 37633 markings/sec, 295 secs
lola: 11596629 markings, 55360434 edges, 42269 markings/sec, 300 secs
lola: 11797259 markings, 56632834 edges, 40126 markings/sec, 305 secs
lola: 11984898 markings, 57657874 edges, 37528 markings/sec, 310 secs
lola: 12157798 markings, 58424173 edges, 34580 markings/sec, 315 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: 12242052 markings, 58745234 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no
lola:
preliminary result: yes yes no no
lola: memory consumption: 74972 KB
lola: time consumption: 435 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-V20P10N50"
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-V20P10N50, 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-158987913500161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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