Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428400225.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is JoinFreeModules-PT-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428400225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 24 11:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 24 11:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.9M May 5 16:51 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-0500-00
FORMULA_NAME JoinFreeModules-PT-0500-01
FORMULA_NAME JoinFreeModules-PT-0500-02
FORMULA_NAME JoinFreeModules-PT-0500-03
FORMULA_NAME JoinFreeModules-PT-0500-04
FORMULA_NAME JoinFreeModules-PT-0500-05
FORMULA_NAME JoinFreeModules-PT-0500-06
FORMULA_NAME JoinFreeModules-PT-0500-07
FORMULA_NAME JoinFreeModules-PT-0500-08
FORMULA_NAME JoinFreeModules-PT-0500-09
FORMULA_NAME JoinFreeModules-PT-0500-10
FORMULA_NAME JoinFreeModules-PT-0500-11
FORMULA_NAME JoinFreeModules-PT-0500-12
FORMULA_NAME JoinFreeModules-PT-0500-13
FORMULA_NAME JoinFreeModules-PT-0500-14
FORMULA_NAME JoinFreeModules-PT-0500-15

=== Now, execution of the tool begins

BK_START 1620920784037

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 15:46:25] [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]
[2021-05-13 15:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 15:46:25] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2021-05-13 15:46:25] [INFO ] Transformed 2501 places.
[2021-05-13 15:46:25] [INFO ] Transformed 4001 transitions.
[2021-05-13 15:46:25] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 305 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100313 steps, including 0 resets, run finished after 2566 ms. (steps per millisecond=39 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 4001 rows 2500 cols
[2021-05-13 15:46:28] [INFO ] Computed 500 place invariants in 69 ms
[2021-05-13 15:46:29] [INFO ] [Real]Absence check using 500 positive place invariants in 536 ms returned sat
[2021-05-13 15:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:46:48] [INFO ] [Real]Absence check using state equation in 19153 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 15:46:49] [INFO ] [Real]Absence check using 500 positive place invariants in 515 ms returned sat
[2021-05-13 15:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:47:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:47:08] [INFO ] [Real]Absence check using state equation in 19254 ms returned unknown
[2021-05-13 15:47:09] [INFO ] [Real]Absence check using 500 positive place invariants in 512 ms returned sat
[2021-05-13 15:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:47:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:47:28] [INFO ] [Real]Absence check using state equation in 19346 ms returned (error "Failed to check-sat")
[2021-05-13 15:47:29] [INFO ] [Real]Absence check using 500 positive place invariants in 516 ms returned sat
[2021-05-13 15:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:47:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:47:48] [INFO ] [Real]Absence check using state equation in 19249 ms returned (error "Failed to check-sat")
[2021-05-13 15:47:49] [INFO ] [Real]Absence check using 500 positive place invariants in 484 ms returned sat
[2021-05-13 15:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:48:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:48:08] [INFO ] [Real]Absence check using state equation in 19293 ms returned (error "Failed to check-sat")
[2021-05-13 15:48:08] [INFO ] [Real]Absence check using 500 positive place invariants in 14 ms returned unsat
[2021-05-13 15:48:09] [INFO ] [Real]Absence check using 500 positive place invariants in 514 ms returned sat
[2021-05-13 15:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:48:28] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:48:28] [INFO ] [Real]Absence check using state equation in 19298 ms returned (error "Failed to check-sat")
[2021-05-13 15:48:29] [INFO ] [Real]Absence check using 500 positive place invariants in 486 ms returned sat
[2021-05-13 15:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:48:48] [INFO ] [Real]Absence check using state equation in 19265 ms returned (error "Failed to check-sat")
[2021-05-13 15:48:49] [INFO ] [Real]Absence check using 500 positive place invariants in 515 ms returned sat
[2021-05-13 15:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:49:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:49:08] [INFO ] [Real]Absence check using state equation in 19294 ms returned (error "Failed to check-sat")
[2021-05-13 15:49:09] [INFO ] [Real]Absence check using 500 positive place invariants in 14 ms returned unsat
[2021-05-13 15:49:09] [INFO ] [Real]Absence check using 500 positive place invariants in 13 ms returned unsat
[2021-05-13 15:49:10] [INFO ] [Real]Absence check using 500 positive place invariants in 488 ms returned sat
[2021-05-13 15:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:49:29] [INFO ] [Real]Absence check using state equation in 19314 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 15:49:30] [INFO ] [Real]Absence check using 500 positive place invariants in 527 ms returned sat
[2021-05-13 15:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:49:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:49:49] [INFO ] [Real]Absence check using state equation in 19283 ms returned unknown
[2021-05-13 15:49:50] [INFO ] [Real]Absence check using 500 positive place invariants in 513 ms returned sat
[2021-05-13 15:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:50:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:50:09] [INFO ] [Real]Absence check using state equation in 19269 ms returned unknown
[2021-05-13 15:50:10] [INFO ] [Real]Absence check using 500 positive place invariants in 520 ms returned sat
[2021-05-13 15:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:50:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:50:29] [INFO ] [Real]Absence check using state equation in 19283 ms returned unknown
[2021-05-13 15:50:30] [INFO ] [Real]Absence check using 500 positive place invariants in 488 ms returned sat
[2021-05-13 15:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:50:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:50:49] [INFO ] [Real]Absence check using state equation in 19324 ms returned unknown
[2021-05-13 15:50:50] [INFO ] [Real]Absence check using 500 positive place invariants in 484 ms returned sat
[2021-05-13 15:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:51:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:51:09] [INFO ] [Real]Absence check using state equation in 19318 ms returned (error "Failed to check-sat")
[2021-05-13 15:51:10] [INFO ] [Real]Absence check using 500 positive place invariants in 487 ms returned sat
[2021-05-13 15:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:51:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:51:29] [INFO ] [Real]Absence check using state equation in 19307 ms returned unknown
[2021-05-13 15:51:29] [INFO ] [Real]Absence check using 500 positive place invariants in 13 ms returned unsat
[2021-05-13 15:51:29] [INFO ] [Real]Absence check using 500 positive place invariants in 14 ms returned unsat
[2021-05-13 15:51:30] [INFO ] [Real]Absence check using 500 positive place invariants in 523 ms returned sat
[2021-05-13 15:51:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:51:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:51:49] [INFO ] [Real]Absence check using state equation in 19285 ms returned (error "Failed to check-sat")
[2021-05-13 15:51:50] [INFO ] [Real]Absence check using 500 positive place invariants in 511 ms returned sat
[2021-05-13 15:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:52:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:52:09] [INFO ] [Real]Absence check using state equation in 19296 ms returned (error "Failed to check-sat")
[2021-05-13 15:52:10] [INFO ] [Real]Absence check using 500 positive place invariants in 511 ms returned sat
[2021-05-13 15:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:52:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:52:29] [INFO ] [Real]Absence check using state equation in 19297 ms returned (error "Failed to check-sat")
[2021-05-13 15:52:30] [INFO ] [Real]Absence check using 500 positive place invariants in 511 ms returned sat
[2021-05-13 15:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:52:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:52:49] [INFO ] [Real]Absence check using state equation in 19293 ms returned unknown
[2021-05-13 15:52:50] [INFO ] [Real]Absence check using 500 positive place invariants in 478 ms returned sat
[2021-05-13 15:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:53:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:53:09] [INFO ] [Real]Absence check using state equation in 19327 ms returned unknown
[2021-05-13 15:53:10] [INFO ] [Real]Absence check using 500 positive place invariants in 480 ms returned sat
[2021-05-13 15:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:53:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:53:29] [INFO ] [Real]Absence check using state equation in 19330 ms returned unknown
[2021-05-13 15:53:30] [INFO ] [Real]Absence check using 500 positive place invariants in 493 ms returned sat
[2021-05-13 15:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:53:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:53:49] [INFO ] [Real]Absence check using state equation in 19305 ms returned (error "Failed to check-sat")
[2021-05-13 15:53:50] [INFO ] [Real]Absence check using 500 positive place invariants in 483 ms returned sat
[2021-05-13 15:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:54:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:54:09] [INFO ] [Real]Absence check using state equation in 19326 ms returned (error "Failed to check-sat")
[2021-05-13 15:54:10] [INFO ] [Real]Absence check using 500 positive place invariants in 484 ms returned sat
[2021-05-13 15:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:54:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:54:29] [INFO ] [Real]Absence check using state equation in 19326 ms returned unknown
[2021-05-13 15:54:30] [INFO ] [Real]Absence check using 500 positive place invariants in 13 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-13 15:54:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 15:54:30] [INFO ] Flatten gal took : 442 ms
FORMULA JoinFreeModules-PT-0500-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0500-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 15:54:31] [INFO ] Flatten gal took : 202 ms
[2021-05-13 15:54:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 17 ms.
[2021-05-13 15:54:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 57 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0500 @ 3570 seconds

FORMULA JoinFreeModules-PT-0500-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0500-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0500-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA JoinFreeModules-PT-0500-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0500-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2376
rslt: Output for LTLCardinality @ JoinFreeModules-PT-0500

{
"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": "Thu May 13 15:54:38 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((X (TRUE) U (1 <= p873)))",
"processed_size": 28,
"rewrites": 63
},
"result":
{
"edges": 3003,
"markings": 3002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((G ((p2157 <= 0)) AND (p757 <= 1))) AND F ((p1011 + 1 <= p656))))))",
"processed_size": 80,
"rewrites": 63
},
"result":
{
"edges": 1509,
"markings": 1509,
"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": 359
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((((p2023 + 1 <= p446) OR (G ((p425 <= p1695)) AND F ((p2023 + 1 <= p446)))) AND X (((p425 <= p1695) U G ((p1695 + 1 <= p425)))))))",
"processed_size": 136,
"rewrites": 63
},
"result":
{
"edges": 1504,
"markings": 1503,
"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": 439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (X ((p2353 <= p1849))) AND (p2353 <= p1849))))",
"processed_size": 55,
"rewrites": 63
},
"result":
{
"edges": 2071,
"markings": 2071,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 968
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p415 <= 1)))",
"processed_size": 19,
"rewrites": 63
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 1452
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((3 <= p1391))) AND (1 <= p1710))))",
"processed_size": 47,
"rewrites": 63
},
"result":
{
"edges": 131,
"markings": 129,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2904
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G (F ((p1006 <= 0))) OR ((2 <= p1843) OR (3 <= p2384))))",
"processed_size": 60,
"rewrites": 63
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3960,
"runtime": 1193.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(G(**)) AND *))) : X((F(G((F(**) AND ((F(**) U **) OR **)))) OR **)) : X((X(TRUE) U **)) : X(X(G((F((G(*) AND *)) AND F(*))))) : X(G(((** OR (G(**) AND F(**))) AND X((** U G(**)))))) : X(G(*)) : X(F((X(X(**)) AND **))) : G((G(F(*)) OR (** OR **))) : F(**) : F(**) : (X((G(F(*)) OR G((** AND F(*))))) U (G(**) AND **)) : F(G(*))"
},
"net":
{
"arcs": 11500,
"conflict_clusters": 2001,
"places": 2500,
"places_significant": 2000,
"singleton_clusters": 0,
"transitions": 4001
},
"result":
{
"preliminary_value": "no unknown no no no unknown no no no no unknown no ",
"value": "no unknown no no no unknown no no no no unknown 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: 6501/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 4001 transitions, 2000 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 (F (NOT(F ((NOT(F (G ((3 <= p1391)))) OR (p1710 <= 0))))))) : X ((F (G (((F ((p1469 <= p762)) U (p2145 <= p134)) U (p1044 <= p118)))) OR (p762 + 1 <= p1469))) : X ((X ((((1 <= p873) U (0 <= 0)) OR NOT(((p377 <= p1153) U (p711 <= p2246))))) U (1 <= p873))) : X (NOT(F (X ((G ((F ((1 <= p2157)) OR (2 <= p757))) OR G ((p656 <= p1011))))))) : X (G (((G ((p425 <= p1695)) U (p2023 + 1 <= p446)) AND X (((p425 <= p1695) U G ((p1695 + 1 <= p425))))))) : NOT(((1 <= 0) U F (X ((1 <= p2169))))) : X (F ((F ((1 <= p671)) U (X (X ((p2353 <= p1849))) AND (p2353 <= p1849))))) : G (((NOT(F (((p957 <= p219) U G ((1 <= p1006))))) OR (2 <= p1843)) OR (3 <= p2384))) : (NOT(X ((NOT(G ((p1269 <= p101))) AND F (((p1297 <= p1848) OR (3 <= p780)))))) U ((p2122 <= p521) U F ((p2122 <= p521)))) : F ((2 <= p1311)) : (X ((G ((p623 <= 0)) U G (NOT(F (G ((p501 <= p1816))))))) U (G ((p501 <= p1816)) AND (p501 <= p1816))) : NOT(G (F ((2 <= p415))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((F ((p1044 <= p118)) AND ((F ((p1469 <= p762)) U (p2145 <= p134)) OR (p1044 <= p118))))) OR (p762 + 1 <= p1469)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((F ((p1044 <= p118)) AND ((F ((p1469 <= p762)) U (p2145 <= p134)) OR (p1044 <= p118))))) OR (p762 + 1 <= p1469)))
lola: processed formula length: 123
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 155849 markings, 222250 edges, 31170 markings/sec, 0 secs
lola: 310810 markings, 443262 edges, 30992 markings/sec, 5 secs
lola: 465512 markings, 664317 edges, 30940 markings/sec, 10 secs
lola: 619670 markings, 884573 edges, 30832 markings/sec, 15 secs
lola: 774123 markings, 1104545 edges, 30891 markings/sec, 20 secs
lola: 926194 markings, 1322062 edges, 30414 markings/sec, 25 secs
lola: 1078764 markings, 1540070 edges, 30514 markings/sec, 30 secs
lola: 1230568 markings, 1756362 edges, 30361 markings/sec, 35 secs
lola: 1381564 markings, 1972370 edges, 30199 markings/sec, 40 secs
lola: 1533904 markings, 2189605 edges, 30468 markings/sec, 45 secs
lola: 1696942 markings, 2422204 edges, 32608 markings/sec, 50 secs
lola: 1848342 markings, 2638585 edges, 30280 markings/sec, 55 secs
lola: 2018068 markings, 2880962 edges, 33945 markings/sec, 60 secs
lola: 2169975 markings, 3097443 edges, 30381 markings/sec, 65 secs
lola: 2321187 markings, 3313822 edges, 30242 markings/sec, 70 secs
lola: 2473444 markings, 3530909 edges, 30451 markings/sec, 75 secs
lola: 2625315 markings, 3747429 edges, 30374 markings/sec, 80 secs
lola: 2776414 markings, 3963504 edges, 30220 markings/sec, 85 secs
lola: 2927566 markings, 4179154 edges, 30230 markings/sec, 90 secs
lola: 3068721 markings, 4380842 edges, 28231 markings/sec, 95 secs
lola: 3116865 markings, 4449375 edges, 9629 markings/sec, 100 secs
lola: 3183961 markings, 4545469 edges, 13419 markings/sec, 105 secs
lola: 3267406 markings, 4664724 edges, 16689 markings/sec, 110 secs
lola: 3374959 markings, 4818358 edges, 21511 markings/sec, 115 secs
lola: 3479134 markings, 4966702 edges, 20835 markings/sec, 120 secs
lola: 3517446 markings, 5021364 edges, 7662 markings/sec, 125 secs
lola: 3591572 markings, 5127417 edges, 14825 markings/sec, 130 secs
lola: 3662710 markings, 5228461 edges, 14228 markings/sec, 135 secs
lola: 3770127 markings, 5381861 edges, 21483 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (TRUE) U (1 <= p873)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (TRUE) U (1 <= p873)))
lola: processed formula length: 28
lola: 63 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: 3002 markings, 3003 edges
lola: ========================================
lola: subprocess 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((G ((p2157 <= 0)) AND (p757 <= 1))) AND F ((p1011 + 1 <= p656))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((G ((p2157 <= 0)) AND (p757 <= 1))) AND F ((p1011 + 1 <= p656))))))
lola: processed formula length: 80
lola: 63 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: 1509 markings, 1509 edges
lola: ========================================
lola: subprocess 3 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p2023 + 1 <= p446) OR (G ((p425 <= p1695)) AND F ((p2023 + 1 <= p446)))) AND X (((p425 <= p1695) U G ((p1695 + 1 <= p425)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p2023 + 1 <= p446) OR (G ((p425 <= p1695)) AND F ((p2023 + 1 <= p446)))) AND X (((p425 <= p1695) U G ((p1695 + 1 <= p425)))))))
lola: processed formula length: 136
lola: 63 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: 1503 markings, 1504 edges
lola: ========================================
lola: subprocess 4 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p2169 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p2169 <= 0)))
lola: processed formula length: 20
lola: 63 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: 128907 markings, 183973 edges, 25781 markings/sec, 0 secs
lola: 283094 markings, 403641 edges, 30837 markings/sec, 5 secs
lola: 436600 markings, 622697 edges, 30701 markings/sec, 10 secs
lola: 589646 markings, 841170 edges, 30609 markings/sec, 15 secs
lola: 742148 markings, 1059137 edges, 30500 markings/sec, 20 secs
lola: 894711 markings, 1277184 edges, 30513 markings/sec, 25 secs
lola: 1047185 markings, 1494900 edges, 30495 markings/sec, 30 secs
lola: 1199811 markings, 1712636 edges, 30525 markings/sec, 35 secs
lola: 1352532 markings, 1930539 edges, 30544 markings/sec, 40 secs
lola: 1505037 markings, 2148060 edges, 30501 markings/sec, 45 secs
lola: 1657564 markings, 2365955 edges, 30505 markings/sec, 50 secs
lola: 1809767 markings, 2583636 edges, 30441 markings/sec, 55 secs
lola: 1962070 markings, 2800918 edges, 30461 markings/sec, 60 secs
lola: 2111265 markings, 3013768 edges, 29839 markings/sec, 65 secs
lola: 2263370 markings, 3230708 edges, 30421 markings/sec, 70 secs
lola: 2415437 markings, 3448259 edges, 30413 markings/sec, 75 secs
lola: 2567605 markings, 3665401 edges, 30434 markings/sec, 80 secs
lola: 2720022 markings, 3882771 edges, 30483 markings/sec, 85 secs
lola: 2872010 markings, 4099789 edges, 30398 markings/sec, 90 secs
lola: 3023640 markings, 4316500 edges, 30326 markings/sec, 95 secs
lola: 3113355 markings, 4444944 edges, 17943 markings/sec, 100 secs
lola: 3205798 markings, 4576994 edges, 18489 markings/sec, 105 secs
lola: 3289405 markings, 4695767 edges, 16721 markings/sec, 110 secs
lola: 3334612 markings, 4760321 edges, 9041 markings/sec, 115 secs
lola: 3413265 markings, 4872702 edges, 15731 markings/sec, 120 secs
lola: 3493676 markings, 4987627 edges, 16082 markings/sec, 125 secs
lola: 3513341 markings, 5015302 edges, 3933 markings/sec, 130 secs
lola: 3646861 markings, 5206341 edges, 26704 markings/sec, 135 secs
lola: 3646861 markings, 5206341 edges, 0 markings/sec, 140 secs
lola: 3746893 markings, 5348856 edges, 20006 markings/sec, 145 secs
lola: 3777378 markings, 5392108 edges, 6097 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X ((p2353 <= p1849))) AND (p2353 <= p1849))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X ((p2353 <= p1849))) AND (p2353 <= p1849))))
lola: processed formula length: 55
lola: 63 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: 2071 markings, 2071 edges
lola: ========================================
lola: subprocess 6 will run for 512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (F ((p1816 + 1 <= p501))) OR G (((p623 <= 0) AND F ((p1816 + 1 <= p501)))))) U (G ((p501 <= p1816)) AND (p501 <= p1816)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((G (F ((p1816 + 1 <= p501))) OR G (((p623 <= 0) AND F ((p1816 + 1 <= p501)))))) U (G ((p501 <= p1816)) AND (p501 <= p1816)))
lola: processed formula length: 128
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 148202 markings, 211112 edges, 29640 markings/sec, 0 secs
lola: 301042 markings, 429221 edges, 30568 markings/sec, 5 secs
lola: 453117 markings, 646584 edges, 30415 markings/sec, 10 secs
lola: 605018 markings, 863581 edges, 30380 markings/sec, 15 secs
lola: 756992 markings, 1080177 edges, 30395 markings/sec, 20 secs
lola: 908707 markings, 1297133 edges, 30343 markings/sec, 25 secs
lola: 1060592 markings, 1513877 edges, 30377 markings/sec, 30 secs
lola: 1212393 markings, 1730289 edges, 30360 markings/sec, 35 secs
lola: 1363786 markings, 1946875 edges, 30279 markings/sec, 40 secs
lola: 1515805 markings, 2163546 edges, 30404 markings/sec, 45 secs
lola: 1667258 markings, 2380116 edges, 30291 markings/sec, 50 secs
lola: 1818969 markings, 2596480 edges, 30342 markings/sec, 55 secs
lola: 1970478 markings, 2812807 edges, 30302 markings/sec, 60 secs
lola: 2122287 markings, 3029689 edges, 30362 markings/sec, 65 secs
lola: 2274154 markings, 3246093 edges, 30373 markings/sec, 70 secs
lola: 2425069 markings, 3461958 edges, 30183 markings/sec, 75 secs
lola: 2576899 markings, 3678297 edges, 30366 markings/sec, 80 secs
lola: 2727944 markings, 3894397 edges, 30209 markings/sec, 85 secs
lola: 2879471 markings, 4110228 edges, 30305 markings/sec, 90 secs
lola: 3030568 markings, 4326384 edges, 30219 markings/sec, 95 secs
lola: 3132118 markings, 4471606 edges, 20310 markings/sec, 100 secs
lola: 3206947 markings, 4577834 edges, 14966 markings/sec, 105 secs
lola: 3341620 markings, 4770340 edges, 26935 markings/sec, 110 secs
lola: 3345760 markings, 4775935 edges, 828 markings/sec, 115 secs
lola: 3403230 markings, 4858507 edges, 11494 markings/sec, 120 secs
lola: 3479467 markings, 4967247 edges, 15247 markings/sec, 125 secs
lola: 3534356 markings, 5045354 edges, 10978 markings/sec, 130 secs
lola: 3613406 markings, 5158173 edges, 15810 markings/sec, 135 secs
lola: 3656191 markings, 5219300 edges, 8557 markings/sec, 140 secs
lola: 3753373 markings, 5357954 edges, 19436 markings/sec, 145 secs
lola: 3781305 markings, 5397860 edges, 5586 markings/sec, 150 secs
lola: 3781840 markings, 5398796 edges, 107 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p1311))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1311 <= 1)
lola: processed formula length: 12
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 8 will run for 726 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p2122 <= p521))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p521 + 1 <= p2122)
lola: processed formula length: 19
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: subprocess 9 will run for 968 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p415 <= 1)))
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 ((p415 <= 1)))
lola: processed formula length: 19
lola: 63 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: 13 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 1452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((3 <= p1391))) AND (1 <= p1710))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((3 <= p1391))) AND (1 <= p1710))))
lola: processed formula length: 47
lola: 63 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: 129 markings, 131 edges
lola: ========================================
lola: subprocess 11 will run for 2904 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((p1006 <= 0))) OR ((2 <= p1843) OR (3 <= p2384))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((p1006 <= 0))) OR ((2 <= p1843) OR (3 <= p2384))))
lola: processed formula length: 60
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((F (G ((F ((p1044 <= p118)) AND ((F ((p1469 <= p762)) U (p2145 <= p134)) OR (p1044 <= p118))))) OR (p762 + 1 <= p1469)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((F ((p1044 <= p118)) AND ((F ((p1469 <= p762)) U (p2145 <= p134)) OR (p1044 <= p118))))) OR (p762 + 1 <= p1469)))
lola: processed formula length: 123
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 144704 markings, 206112 edges, 28941 markings/sec, 0 secs
lola: 293880 markings, 418931 edges, 29835 markings/sec, 5 secs
lola: 442272 markings, 631274 edges, 29678 markings/sec, 10 secs
lola: 590482 markings, 842631 edges, 29642 markings/sec, 15 secs
lola: 738298 markings, 1053798 edges, 29563 markings/sec, 20 secs
lola: 886096 markings, 1264602 edges, 29560 markings/sec, 25 secs
lola: 1034612 markings, 1476611 edges, 29703 markings/sec, 30 secs
lola: 1186140 markings, 1693199 edges, 30306 markings/sec, 35 secs
lola: 1337688 markings, 1909163 edges, 30310 markings/sec, 40 secs
lola: 1488591 markings, 2124895 edges, 30181 markings/sec, 45 secs
lola: 1640098 markings, 2341049 edges, 30301 markings/sec, 50 secs
lola: 1791340 markings, 2557104 edges, 30248 markings/sec, 55 secs
lola: 1942557 markings, 2772979 edges, 30243 markings/sec, 60 secs
lola: 2094004 markings, 2989169 edges, 30289 markings/sec, 65 secs
lola: 2245075 markings, 3204971 edges, 30214 markings/sec, 70 secs
lola: 2396513 markings, 3420959 edges, 30288 markings/sec, 75 secs
lola: 2547628 markings, 3636999 edges, 30223 markings/sec, 80 secs
lola: 2698567 markings, 3851962 edges, 30188 markings/sec, 85 secs
lola: 2849219 markings, 4067358 edges, 30130 markings/sec, 90 secs
lola: 2999963 markings, 4282802 edges, 30149 markings/sec, 95 secs
lola: 3096595 markings, 4420645 edges, 19326 markings/sec, 100 secs
lola: 3226729 markings, 4606325 edges, 26027 markings/sec, 105 secs
lola: 3237790 markings, 4621830 edges, 2212 markings/sec, 110 secs
lola: 3237790 markings, 4621830 edges, 0 markings/sec, 115 secs
lola: 3368323 markings, 4808647 edges, 26107 markings/sec, 120 secs
lola: 3373541 markings, 4815620 edges, 1044 markings/sec, 125 secs
lola: 3408565 markings, 4865606 edges, 7005 markings/sec, 130 secs
lola: 3522456 markings, 5028524 edges, 22778 markings/sec, 135 secs
lola: 3641605 markings, 5198280 edges, 23830 markings/sec, 140 secs
lola: 3646442 markings, 5205610 edges, 967 markings/sec, 145 secs
lola: 3691300 markings, 5269519 edges, 8972 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((p2169 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p2169 <= 0)))
lola: processed formula length: 20
lola: 63 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: 146344 markings, 208852 edges, 29269 markings/sec, 0 secs
lola: 299921 markings, 427909 edges, 30715 markings/sec, 5 secs
lola: 453022 markings, 646489 edges, 30620 markings/sec, 10 secs
lola: 605619 markings, 864571 edges, 30519 markings/sec, 15 secs
lola: 754855 markings, 1077555 edges, 29847 markings/sec, 20 secs
lola: 903187 markings, 1288906 edges, 29666 markings/sec, 25 secs
lola: 1054482 markings, 1505414 edges, 30259 markings/sec, 30 secs
lola: 1206832 markings, 1722680 edges, 30470 markings/sec, 35 secs
lola: 1359292 markings, 1940126 edges, 30492 markings/sec, 40 secs
lola: 1511294 markings, 2157179 edges, 30400 markings/sec, 45 secs
lola: 1663345 markings, 2374620 edges, 30410 markings/sec, 50 secs
lola: 1815238 markings, 2591074 edges, 30379 markings/sec, 55 secs
lola: 1967487 markings, 2808327 edges, 30450 markings/sec, 60 secs
lola: 2119463 markings, 3025787 edges, 30395 markings/sec, 65 secs
lola: 2271827 markings, 3243142 edges, 30473 markings/sec, 70 secs
lola: 2424000 markings, 3460086 edges, 30435 markings/sec, 75 secs
lola: 2576206 markings, 3677483 edges, 30441 markings/sec, 80 secs
lola: 2727834 markings, 3894205 edges, 30326 markings/sec, 85 secs
lola: 2880019 markings, 4111170 edges, 30437 markings/sec, 90 secs
lola: 3031249 markings, 4327482 edges, 30246 markings/sec, 95 secs
lola: 3111074 markings, 4441472 edges, 15965 markings/sec, 100 secs
lola: 3213164 markings, 4586812 edges, 20418 markings/sec, 105 secs
lola: 3245096 markings, 4632257 edges, 6386 markings/sec, 110 secs
lola: 3307235 markings, 4721038 edges, 12428 markings/sec, 115 secs
lola: 3373219 markings, 4815299 edges, 13197 markings/sec, 120 secs
lola: 3503177 markings, 5000882 edges, 25992 markings/sec, 125 secs
lola: 3505900 markings, 5004531 edges, 545 markings/sec, 130 secs
lola: 3559780 markings, 5081987 edges, 10776 markings/sec, 135 secs
lola: 3648683 markings, 5208401 edges, 17781 markings/sec, 140 secs
lola: 3648683 markings, 5208401 edges, 0 markings/sec, 145 secs
lola: 3683359 markings, 5257890 edges, 6935 markings/sec, 150 secs
lola: 3781374 markings, 5397981 edges, 19603 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X ((G (F ((p1816 + 1 <= p501))) OR G (((p623 <= 0) AND F ((p1816 + 1 <= p501)))))) U (G ((p501 <= p1816)) AND (p501 <= p1816)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((G (F ((p1816 + 1 <= p501))) OR G (((p623 <= 0) AND F ((p1816 + 1 <= p501)))))) U (G ((p501 <= p1816)) AND (p501 <= p1816)))
lola: processed formula length: 128
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 142424 markings, 203243 edges, 28485 markings/sec, 0 secs
lola: 376342 markings, 537068 edges, 46784 markings/sec, 5 secs
lola: 529024 markings, 755231 edges, 30536 markings/sec, 10 secs
lola: 681722 markings, 973138 edges, 30540 markings/sec, 15 secs
lola: 834169 markings, 1190564 edges, 30489 markings/sec, 20 secs
lola: 984261 markings, 1404979 edges, 30018 markings/sec, 25 secs
lola: 1136921 markings, 1622772 edges, 30532 markings/sec, 30 secs
lola: 1289422 markings, 1840291 edges, 30500 markings/sec, 35 secs
lola: 1439796 markings, 2055204 edges, 30075 markings/sec, 40 secs
lola: 1592276 markings, 2272686 edges, 30496 markings/sec, 45 secs
lola: 1744926 markings, 2490522 edges, 30530 markings/sec, 50 secs
lola: 1896978 markings, 2708054 edges, 30410 markings/sec, 55 secs
lola: 2049347 markings, 2925596 edges, 30474 markings/sec, 60 secs
lola: 2201804 markings, 3143039 edges, 30491 markings/sec, 65 secs
lola: 2354278 markings, 3360512 edges, 30495 markings/sec, 70 secs
lola: 2506259 markings, 3577773 edges, 30396 markings/sec, 75 secs
lola: 2658380 markings, 3795095 edges, 30424 markings/sec, 80 secs
lola: 2810410 markings, 4011787 edges, 30406 markings/sec, 85 secs
lola: 2962339 markings, 4228811 edges, 30386 markings/sec, 90 secs
lola: 3105527 markings, 4433033 edges, 28638 markings/sec, 95 secs
lola: 3172777 markings, 4529314 edges, 13450 markings/sec, 100 secs
lola: 3232680 markings, 4615014 edges, 11981 markings/sec, 105 secs
lola: 3295364 markings, 4704561 edges, 12537 markings/sec, 110 secs
lola: 3401821 markings, 4856041 edges, 21291 markings/sec, 115 secs
lola: 3429271 markings, 4895161 edges, 5490 markings/sec, 120 secs
lola: 3440128 markings, 4910738 edges, 2171 markings/sec, 125 secs
lola: 3578325 markings, 5108205 edges, 27639 markings/sec, 130 secs
lola: 3578325 markings, 5108205 edges, 0 markings/sec, 135 secs
lola: 3578325 markings, 5108205 edges, 0 markings/sec, 140 secs
lola: 3689463 markings, 5266969 edges, 22228 markings/sec, 145 secs
lola: 3737078 markings, 5335046 edges, 9523 markings/sec, 150 secs
lola: 3737078 markings, 5335046 edges, 0 markings/sec, 155 secs
lola: 3775252 markings, 5389507 edges, 7635 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no unknown no no no no unknown no
lola:
preliminary result: no unknown no no no unknown no no no no unknown no
lola: memory consumption: 3960 KB
lola: time consumption: 1193 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-0500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is JoinFreeModules-PT-0500, 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 r132-tall-162075428400225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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