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.r184-oct2-158987928500441.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 JoinFreeModules-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928500441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.5K Apr 7 19:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 7 19:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 21:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 21:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 04:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 5 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 JoinFreeModules-PT-0200-00
FORMULA_NAME JoinFreeModules-PT-0200-01
FORMULA_NAME JoinFreeModules-PT-0200-02
FORMULA_NAME JoinFreeModules-PT-0200-03
FORMULA_NAME JoinFreeModules-PT-0200-04
FORMULA_NAME JoinFreeModules-PT-0200-05
FORMULA_NAME JoinFreeModules-PT-0200-06
FORMULA_NAME JoinFreeModules-PT-0200-07
FORMULA_NAME JoinFreeModules-PT-0200-08
FORMULA_NAME JoinFreeModules-PT-0200-09
FORMULA_NAME JoinFreeModules-PT-0200-10
FORMULA_NAME JoinFreeModules-PT-0200-11
FORMULA_NAME JoinFreeModules-PT-0200-12
FORMULA_NAME JoinFreeModules-PT-0200-13
FORMULA_NAME JoinFreeModules-PT-0200-14
FORMULA_NAME JoinFreeModules-PT-0200-15

=== Now, execution of the tool begins

BK_START 1591207906606

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:11:48] [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 18:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:11:49] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2020-06-03 18:11:49] [INFO ] Transformed 1001 places.
[2020-06-03 18:11:49] [INFO ] Transformed 1601 transitions.
[2020-06-03 18:11:49] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 260 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100013 steps, including 0 resets, run finished after 1330 ms. (steps per millisecond=75 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 1601 rows 1000 cols
[2020-06-03 18:11:50] [INFO ] Computed 200 place invariants in 38 ms
[2020-06-03 18:11:51] [INFO ] [Real]Absence check using 200 positive place invariants in 139 ms returned sat
[2020-06-03 18:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:11:56] [INFO ] [Real]Absence check using state equation in 5626 ms returned sat
[2020-06-03 18:11:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:11:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 209 ms returned sat
[2020-06-03 18:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:12:07] [INFO ] [Nat]Absence check using state equation in 10393 ms returned unknown
[2020-06-03 18:12:07] [INFO ] [Real]Absence check using 200 positive place invariants in 6 ms returned unsat
[2020-06-03 18:12:08] [INFO ] [Real]Absence check using 200 positive place invariants in 7 ms returned unsat
[2020-06-03 18:12:08] [INFO ] [Real]Absence check using 200 positive place invariants in 405 ms returned sat
[2020-06-03 18:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:22] [INFO ] [Real]Absence check using state equation in 14078 ms returned sat
[2020-06-03 18:12:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:12:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 894 ms returned sat
[2020-06-03 18:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:42] [INFO ] [Nat]Absence check using state equation in 18883 ms returned sat
[2020-06-03 18:12:47] [INFO ] Deduced a trap composed of 3 places in 4395 ms
[2020-06-03 18:12:47] [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 (> (+ s715 s718 s719) 0)") while checking expression at index 3
[2020-06-03 18:12:48] [INFO ] [Real]Absence check using 200 positive place invariants in 806 ms returned sat
[2020-06-03 18:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:12:52] [INFO ] [Real]Absence check using state equation in 3805 ms returned sat
[2020-06-03 18:12:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:12:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 97 ms returned sat
[2020-06-03 18:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:13:00] [INFO ] [Nat]Absence check using state equation in 8559 ms returned sat
[2020-06-03 18:13:01] [INFO ] Deduced a trap composed of 3 places in 321 ms
[2020-06-03 18:13:01] [INFO ] Deduced a trap composed of 3 places in 429 ms
[2020-06-03 18:13:02] [INFO ] Deduced a trap composed of 3 places in 249 ms
[2020-06-03 18:13:02] [INFO ] Deduced a trap composed of 3 places in 500 ms
[2020-06-03 18:13:02] [INFO ] Deduced a trap composed of 3 places in 199 ms
[2020-06-03 18:13:03] [INFO ] Deduced a trap composed of 3 places in 300 ms
[2020-06-03 18:13:03] [INFO ] Deduced a trap composed of 3 places in 267 ms
[2020-06-03 18:13:04] [INFO ] Deduced a trap composed of 3 places in 410 ms
[2020-06-03 18:13:04] [INFO ] Deduced a trap composed of 3 places in 179 ms
[2020-06-03 18:13:04] [INFO ] Deduced a trap composed of 3 places in 209 ms
[2020-06-03 18:13:04] [INFO ] Deduced a trap composed of 3 places in 190 ms
[2020-06-03 18:13:05] [INFO ] Deduced a trap composed of 3 places in 169 ms
[2020-06-03 18:13:05] [INFO ] Deduced a trap composed of 3 places in 184 ms
[2020-06-03 18:13:05] [INFO ] Deduced a trap composed of 3 places in 155 ms
[2020-06-03 18:13:05] [INFO ] Deduced a trap composed of 3 places in 175 ms
[2020-06-03 18:13:05] [INFO ] Deduced a trap composed of 3 places in 178 ms
[2020-06-03 18:13:06] [INFO ] Deduced a trap composed of 3 places in 179 ms
[2020-06-03 18:13:06] [INFO ] Deduced a trap composed of 3 places in 290 ms
[2020-06-03 18:13:06] [INFO ] Deduced a trap composed of 3 places in 300 ms
[2020-06-03 18:13:07] [INFO ] Deduced a trap composed of 3 places in 231 ms
[2020-06-03 18:13:07] [INFO ] Deduced a trap composed of 3 places in 163 ms
[2020-06-03 18:13:07] [INFO ] Deduced a trap composed of 3 places in 485 ms
[2020-06-03 18:13:08] [INFO ] Deduced a trap composed of 3 places in 132 ms
[2020-06-03 18:13:08] [INFO ] Deduced a trap composed of 3 places in 138 ms
[2020-06-03 18:13:08] [INFO ] Deduced a trap composed of 3 places in 311 ms
[2020-06-03 18:13:08] [INFO ] Deduced a trap composed of 3 places in 131 ms
[2020-06-03 18:13:09] [INFO ] Deduced a trap composed of 3 places in 134 ms
[2020-06-03 18:13:09] [INFO ] Deduced a trap composed of 3 places in 130 ms
[2020-06-03 18:13:09] [INFO ] Deduced a trap composed of 3 places in 129 ms
[2020-06-03 18:13:09] [INFO ] Deduced a trap composed of 3 places in 146 ms
[2020-06-03 18:13:09] [INFO ] Deduced a trap composed of 3 places in 150 ms
[2020-06-03 18:13:09] [INFO ] Deduced a trap composed of 3 places in 132 ms
[2020-06-03 18:13:10] [INFO ] Deduced a trap composed of 3 places in 190 ms
[2020-06-03 18:13:10] [INFO ] Deduced a trap composed of 3 places in 125 ms
[2020-06-03 18:13:10] [INFO ] Deduced a trap composed of 3 places in 218 ms
[2020-06-03 18:13:11] [INFO ] Deduced a trap composed of 3 places in 506 ms
[2020-06-03 18:13:11] [INFO ] Deduced a trap composed of 3 places in 236 ms
[2020-06-03 18:13:14] [INFO ] Deduced a trap composed of 3 places in 2620 ms
[2020-06-03 18:13:14] [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 (> (+ s921 s922 s924) 0)") while checking expression at index 4
[2020-06-03 18:13:14] [INFO ] [Real]Absence check using 200 positive place invariants in 210 ms returned sat
[2020-06-03 18:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:22] [INFO ] [Real]Absence check using state equation in 7927 ms returned sat
[2020-06-03 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 827 ms returned sat
[2020-06-03 18:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:13:42] [INFO ] [Nat]Absence check using state equation in 19143 ms returned (error "Failed to check-sat")
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2020-06-03 18:13:43] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 18:13:43] [INFO ] Flatten gal took : 237 ms
FORMULA JoinFreeModules-PT-0200-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 18:13:43] [INFO ] Flatten gal took : 82 ms
[2020-06-03 18:13:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-03 18:13:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0200 @ 3570 seconds

FORMULA JoinFreeModules-PT-0200-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0200-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3162
rslt: Output for LTLCardinality @ JoinFreeModules-PT-0200

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"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": "X (X (G (((p605 + 1 <= p328) AND (3 <= p926)))))",
"processed_size": 48,
"rewrites": 60
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((2 <= p368)) AND F ((p490 <= p524)))))",
"processed_size": 48,
"rewrites": 60
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((F ((p792 + 1 <= p417)) AND ((p254 <= p56) AND (G ((p416 <= p511)) OR X ((p417 <= p792)))))))",
"processed_size": 99,
"rewrites": 60
},
"result":
{
"edges": 1203,
"markings": 1202,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 552
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p242 <= 2)",
"processed_size": 11,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 662
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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 (X (G ((p822 <= p786))))",
"processed_size": 26,
"rewrites": 60
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 662
},
"exit":
{
"localtimelimitreached": false
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((1 <= p292))",
"processed_size": 15,
"rewrites": 60
},
"result":
{
"edges": 401,
"markings": 402,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1104
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((2 <= p251)))",
"processed_size": 19,
"rewrites": 60
},
"result":
{
"edges": 67,
"markings": 66,
"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": 1656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X ((X ((p638 + 1 <= p808)) AND (p340 + 1 <= p922)))))",
"processed_size": 59,
"rewrites": 60
},
"result":
{
"edges": 603,
"markings": 603,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((F ((2 <= p204)) AND (X (X (G ((p689 <= p552)))) OR (F ((p686 <= p424)) U X ((2 <= p204)))))))",
"processed_size": 100,
"rewrites": 60
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3313
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p801)",
"processed_size": 11,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p801)",
"processed_size": 11,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "G (F ((G ((p581 + 1 <= p723)) OR F ((p801 <= 0)))))",
"processed_size": 51,
"rewrites": 60
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4204,
"runtime": 408.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(**))) : (G(F((G(*) OR F(*)))) AND **) : X(X(G(((G(F(**)) AND *) OR *)))) : (X(F(*)) AND G(F((G(**) AND F(**))))) : X(F((F(**) AND (** AND (G(**) OR X(**)))))) : (X(X(G(**))) OR (** AND F(**))) : (G((G((X(**) OR **)) OR G(**))) OR X(**)) : X(X((F(**) OR (G((F(**) OR *)) AND F(**))))) : (X(X(X((X(*) AND *)))) OR F(G(**))) : X(G((F(**) AND (X(X(G(**))) OR (F(**) U X(**))))))"
},
"net":
{
"arcs": 4600,
"conflict_clusters": 801,
"places": 1000,
"places_significant": 800,
"singleton_clusters": 0,
"transitions": 1601
},
"result":
{
"preliminary_value": "no no unknown no no no yes no no no ",
"value": "no no unknown no no no 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: 2601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32000
lola: finding significant places
lola: 1000 places, 1601 transitions, 800 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (X (G (X (((p605 + 1 <= p328) AND (3 <= p926)))))) : (F (G (F ((NOT(F ((p723 <= p581))) OR NOT(G ((1 <= p801))))))) AND (1 <= p801)) : NOT(X (X (F (((F (X (NOT(F ((p112 <= p259))))) OR (p536 <= p216)) AND (3 <= p899)))))) : (X (NOT(G ((p490 <= p524)))) AND G (X (X (F ((G ((2 <= p368)) AND F ((p490 <= p524)))))))) : F (X (((F ((p792 + 1 <= p417)) AND (p254 <= p56)) AND (G ((p416 <= p511)) OR X ((p417 <= p792)))))) : (X (G (X ((p822 <= p786)))) OR ((p242 <= 2) AND F ((p822 <= p786)))) : (G ((G ((X ((p781 <= p399)) OR (p562 + 1 <= p271))) OR G ((p271 <= p562)))) OR X ((1 <= p292))) : X ((NOT(X (F ((G (NOT(F ((p306 <= p593)))) AND (p593 + 1 <= p306))))) U F (X ((2 <= p524))))) : (X (NOT(X (X ((X ((p808 <= p638)) OR (p922 <= p340)))))) OR F (X (G ((2 <= p251))))) : X (G ((X (G (X ((p689 <= p552)))) U (F ((p686 <= p424)) U X ((2 <= p204))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p605 + 1 <= p328) AND (3 <= p926)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p605 + 1 <= p328) AND (3 <= p926)))))
lola: processed formula length: 48
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 1 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((G (F ((p112 <= p259))) AND (p216 + 1 <= p536)) OR (p899 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((G (F ((p112 <= p259))) AND (p216 + 1 <= p536)) OR (p899 <= 2)))))
lola: processed formula length: 76
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: 528986 markings, 754276 edges, 105797 markings/sec, 0 secs
lola: 1052796 markings, 1501463 edges, 104762 markings/sec, 5 secs
lola: 1576342 markings, 2248084 edges, 104709 markings/sec, 10 secs
lola: 2109508 markings, 3008488 edges, 106633 markings/sec, 15 secs
lola: 2654763 markings, 3786232 edges, 109051 markings/sec, 20 secs
lola: 3204503 markings, 4570467 edges, 109948 markings/sec, 25 secs
lola: 3752686 markings, 5352379 edges, 109637 markings/sec, 30 secs
lola: 4304142 markings, 6138917 edges, 110291 markings/sec, 35 secs
lola: 4810828 markings, 6861749 edges, 101337 markings/sec, 40 secs
lola: 5356161 markings, 7639611 edges, 109067 markings/sec, 45 secs
lola: 5902400 markings, 8418624 edges, 109248 markings/sec, 50 secs
lola: 6446192 markings, 9194298 edges, 108758 markings/sec, 55 secs
lola: 6937671 markings, 9895403 edges, 98296 markings/sec, 60 secs
lola: 7397924 markings, 10551670 edges, 92051 markings/sec, 65 secs
lola: 7857634 markings, 11207479 edges, 91942 markings/sec, 70 secs
lola: 8211273 markings, 11712127 edges, 70728 markings/sec, 75 secs
lola: 8668564 markings, 12364504 edges, 91458 markings/sec, 80 secs
lola: 9022055 markings, 12868445 edges, 70698 markings/sec, 85 secs
lola: 9406456 markings, 13418226 edges, 76880 markings/sec, 90 secs
lola: 9765138 markings, 13928616 edges, 71736 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p524 + 1 <= p490))) AND G (F ((G ((2 <= p368)) AND F ((p490 <= p524))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((2 <= p368)) AND F ((p490 <= p524)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((2 <= p368)) AND F ((p490 <= p524)))))
lola: processed formula length: 48
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: 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: 65 markings, 65 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p792 + 1 <= p417)) AND ((p254 <= p56) AND (G ((p416 <= p511)) OR X ((p417 <= p792)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p792 + 1 <= p417)) AND ((p254 <= p56) AND (G ((p416 <= p511)) OR X ((p417 <= p792)))))))
lola: processed formula length: 99
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1202 markings, 1203 edges
lola: ========================================
lola: subprocess 4 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p822 <= p786)))) OR ((p242 <= 2) AND F ((p822 <= p786))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p242 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p242 <= 2)
lola: processed formula length: 11
lola: 60 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: subprocess 5 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p822 <= p786))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p822 <= p786))))
lola: processed formula length: 26
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G ((X ((p781 <= p399)) OR (p562 + 1 <= p271))) OR G ((p271 <= p562)))) OR X ((1 <= p292)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p292))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p292))
lola: processed formula length: 15
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 402 markings, 401 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((2 <= p524)) OR (G ((F ((p306 <= p593)) OR (p306 <= p593))) AND F ((2 <= p524))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((2 <= p524)) OR (G ((F ((p306 <= p593)) OR (p306 <= p593))) AND F ((2 <= p524))))))
lola: processed formula length: 93
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: 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: 602 markings, 602 edges
lola: ========================================
lola: subprocess 7 will run for 1104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X ((X ((p638 + 1 <= p808)) AND (p340 + 1 <= p922))))) OR F (G ((2 <= p251))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p251)))
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 ((2 <= p251)))
lola: processed formula length: 19
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: 66 markings, 67 edges
lola: ========================================
lola: subprocess 8 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((X ((p638 + 1 <= p808)) AND (p340 + 1 <= p922)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((X ((p638 + 1 <= p808)) AND (p340 + 1 <= p922)))))
lola: processed formula length: 59
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 603 markings, 603 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((2 <= p204)) AND (X (X (G ((p689 <= p552)))) OR (F ((p686 <= p424)) U X ((2 <= p204)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((2 <= p204)) AND (X (X (G ((p689 <= p552)))) OR (F ((p686 <= p424)) U X ((2 <= p204)))))))
lola: processed formula length: 100
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 602 markings, 602 edges
lola: ========================================
lola: subprocess 9 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((p581 + 1 <= p723)) OR F ((p801 <= 0))))) AND (1 <= p801))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p801)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p801)
lola: processed formula length: 11
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the 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: X (X (G (((G (F ((p112 <= p259))) AND (p216 + 1 <= p536)) OR (p899 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((G (F ((p112 <= p259))) AND (p216 + 1 <= p536)) OR (p899 <= 2)))))
lola: processed formula length: 76
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: 490933 markings, 700072 edges, 98187 markings/sec, 0 secs
lola: 1015568 markings, 1448386 edges, 104927 markings/sec, 5 secs
lola: 1537102 markings, 2192158 edges, 104307 markings/sec, 10 secs
lola: 2077384 markings, 2962697 edges, 108056 markings/sec, 15 secs
lola: 2462793 markings, 3512371 edges, 77082 markings/sec, 20 secs
lola: 2951357 markings, 4209195 edges, 97713 markings/sec, 25 secs
lola: 3467452 markings, 4945351 edges, 103219 markings/sec, 30 secs
lola: 3748159 markings, 5345975 edges, 56141 markings/sec, 35 secs
lola: 4162928 markings, 5937344 edges, 82954 markings/sec, 40 secs
lola: 4656135 markings, 6641037 edges, 98641 markings/sec, 45 secs
lola: 5191188 markings, 7404080 edges, 107011 markings/sec, 50 secs
lola: 5724212 markings, 8164436 edges, 106605 markings/sec, 55 secs
lola: 6255983 markings, 8923033 edges, 106354 markings/sec, 60 secs
lola: 6791799 markings, 9687246 edges, 107163 markings/sec, 65 secs
lola: 7334362 markings, 10461032 edges, 108513 markings/sec, 70 secs
lola: 7870786 markings, 11226554 edges, 107285 markings/sec, 75 secs
lola: 8123343 markings, 11588898 edges, 50511 markings/sec, 80 secs
lola: 8486119 markings, 12105027 edges, 72555 markings/sec, 85 secs
lola: 8590399 markings, 12252592 edges, 20856 markings/sec, 90 secs
lola: 8781866 markings, 12525779 edges, 38293 markings/sec, 95 secs
lola: 8856134 markings, 12631818 edges, 14854 markings/sec, 100 secs
lola: 8888020 markings, 12677240 edges, 6377 markings/sec, 105 secs
lola: 9108460 markings, 12991671 edges, 44088 markings/sec, 110 secs
lola: 9274589 markings, 13228588 edges, 33226 markings/sec, 115 secs
lola: 9274589 markings, 13228588 edges, 0 markings/sec, 120 secs
lola: 9274589 markings, 13228588 edges, 0 markings/sec, 125 secs
lola: 9393101 markings, 13397725 edges, 23702 markings/sec, 130 secs
lola: 9553738 markings, 13626724 edges, 32127 markings/sec, 135 secs
lola: 9680304 markings, 13807363 edges, 25313 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((p581 + 1 <= p723)) OR F ((p801 <= 0))))) AND (1 <= p801))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p801)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p801)
lola: processed formula length: 11
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p581 + 1 <= p723)) OR F ((p801 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p581 + 1 <= p723)) OR F ((p801 <= 0)))))
lola: processed formula length: 51
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no no yes no no no
lola:
preliminary result: no no unknown no no no yes no no no
lola: memory consumption: 4204 KB
lola: time consumption: 408 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r184-oct2-158987928500441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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