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-158987928600468.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-2000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 3.3K Apr 8 03:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 03:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 06:51 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.3K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 5 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 5 17:56 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 12M 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-2000-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-2000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591210425679

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:53:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 18:53:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:53:48] [INFO ] Load time of PNML (sax parser for PT used): 494 ms
[2020-06-03 18:53:48] [INFO ] Transformed 10001 places.
[2020-06-03 18:53:48] [INFO ] Transformed 16001 transitions.
[2020-06-03 18:53:48] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 633 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 272 ms.
Incomplete random walk after 100067 steps, including 0 resets, run finished after 6202 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 16001 rows 10000 cols
[2020-06-03 18:53:55] [INFO ] Computed 2000 place invariants in 301 ms
[2020-06-03 18:54:03] [INFO ] [Real]Absence check using 2000 positive place invariants in 7364 ms returned sat
[2020-06-03 18:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:54:15] [INFO ] [Real]Absence check using state equation in 11709 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:54:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 8409 ms returned sat
[2020-06-03 18:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:54:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:54:35] [INFO ] [Real]Absence check using state equation in 11093 ms returned (error "Failed to check-sat")
[2020-06-03 18:54:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 8667 ms returned sat
[2020-06-03 18:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:54:55] [INFO ] [Real]Absence check using state equation in 10659 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:55:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 10566 ms returned sat
[2020-06-03 18:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:55:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:55:15] [INFO ] [Real]Absence check using state equation in 8089 ms returned (error "Failed to check-sat")
[2020-06-03 18:55:27] [INFO ] [Real]Absence check using 2000 positive place invariants in 10675 ms returned sat
[2020-06-03 18:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:55:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:55:35] [INFO ] [Real]Absence check using state equation in 7950 ms returned (error "Failed to check-sat")
[2020-06-03 18:55:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 8256 ms returned sat
[2020-06-03 18:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:55:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:55:55] [INFO ] [Real]Absence check using state equation in 11102 ms returned (error "Failed to check-sat")
[2020-06-03 18:56:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 7278 ms returned sat
[2020-06-03 18:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:56:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:56:15] [INFO ] [Real]Absence check using state equation in 11277 ms returned (error "Failed to check-sat")
[2020-06-03 18:56:35] [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: Broken pipe (= 2003 (+ s5460 s5461 s5462 s5463 s5464))") while checking expression at index 7
[2020-06-03 18:56:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 18572 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:56:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2020-06-03 18:57:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:57:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 18568 ms returned (error "Failed to check-sat")
[2020-06-03 18:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:57:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
[2020-06-03 18:57:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:57:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 18545 ms returned (error "Failed to check-sat")
[2020-06-03 18:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:57:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 10
[2020-06-03 18:57:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 18518 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:57:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 11
[2020-06-03 18:58:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 18619 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:58:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 12
[2020-06-03 18:58:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 18529 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:58:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 13
[2020-06-03 18:58:56] [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: Broken pipe (= 2003 (+ s9875 s9876 s9877 s9878 s9879))") while checking expression at index 14
[2020-06-03 18:59:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 8294 ms returned sat
[2020-06-03 18:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:59:16] [INFO ] [Real]Absence check using state equation in 10744 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:59:32] [INFO ] [Real]Absence check using 2000 positive place invariants in 15378 ms returned sat
[2020-06-03 18:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:59:36] [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: Broken pipe (= s44 (- (+ t68 (* 4 t72)) (* 5 t71)))") while checking expression at index 16
[2020-06-03 18:59:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 8843 ms returned sat
[2020-06-03 18:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:59:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:59:56] [INFO ] [Real]Absence check using state equation in 9782 ms returned (error "Failed to check-sat")
[2020-06-03 19:00:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:00:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 18543 ms returned (error "Failed to check-sat")
[2020-06-03 19:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:00:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 18
[2020-06-03 19:00:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 18557 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 19:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:00:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 19
[2020-06-03 19:00:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:00:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 18586 ms returned (error "Failed to check-sat")
[2020-06-03 19:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:00:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 20
[2020-06-03 19:01:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:01:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 18569 ms returned (error "Failed to check-sat")
[2020-06-03 19:01:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:01:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 21
[2020-06-03 19:01:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:01:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 18567 ms returned (error "Failed to check-sat")
[2020-06-03 19:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:01:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 22
[2020-06-03 19:01:51] [INFO ] [Real]Absence check using 2000 positive place invariants in 13639 ms returned sat
[2020-06-03 19:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:01:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:01:56] [INFO ] [Real]Absence check using state equation in 4975 ms returned (error "Failed to check-sat")
[2020-06-03 19:02:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:02:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 19409 ms returned (error "Failed to check-sat")
[2020-06-03 19:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:02:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 24
[2020-06-03 19:02:27] [INFO ] [Real]Absence check using 2000 positive place invariants in 9364 ms returned sat
[2020-06-03 19:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:02:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:02:36] [INFO ] [Real]Absence check using state equation in 9316 ms returned (error "Failed to check-sat")
[2020-06-03 19:02:48] [INFO ] [Real]Absence check using 2000 positive place invariants in 11123 ms returned sat
[2020-06-03 19:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:02:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:02:56] [INFO ] [Real]Absence check using state equation in 8254 ms returned (error "Failed to check-sat")
[2020-06-03 19:03:06] [INFO ] [Real]Absence check using 2000 positive place invariants in 8747 ms returned sat
[2020-06-03 19:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:03:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:03:16] [INFO ] [Real]Absence check using state equation in 9876 ms returned (error "Failed to check-sat")
[2020-06-03 19:03:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 8083 ms returned sat
[2020-06-03 19:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:03:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:03:36] [INFO ] [Real]Absence check using state equation in 10604 ms returned (error "Failed to check-sat")
[2020-06-03 19:03:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 6950 ms returned sat
[2020-06-03 19:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:03:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:03:56] [INFO ] [Real]Absence check using state equation in 12359 ms returned (error "Failed to check-sat")
[2020-06-03 19:04:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 7793 ms returned sat
[2020-06-03 19:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:04:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:04:16] [INFO ] [Real]Absence check using state equation in 11619 ms returned (error "Failed to check-sat")
[2020-06-03 19:04:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 17885 ms returned sat
[2020-06-03 19:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:04:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 31
[2020-06-03 19:04:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 7373 ms returned sat
[2020-06-03 19:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:04:56] [INFO ] [Real]Absence check using state equation in 11990 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 19:05:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 6959 ms returned sat
[2020-06-03 19:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:05:16] [INFO ] [Real]Absence check using state equation in 11666 ms returned (error "Failed to check-sat")
[2020-06-03 19:05:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 7055 ms returned sat
[2020-06-03 19:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:05:36] [INFO ] [Real]Absence check using state equation in 12356 ms returned (error "Failed to check-sat")
[2020-06-03 19:05:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 9699 ms returned sat
[2020-06-03 19:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:05:56] [INFO ] [Real]Absence check using state equation in 9684 ms returned unknown
[2020-06-03 19:06:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 6945 ms returned sat
[2020-06-03 19:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:06:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:06:16] [INFO ] [Real]Absence check using state equation in 12426 ms returned (error "Failed to check-sat")
[2020-06-03 19:06:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 7121 ms returned sat
[2020-06-03 19:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:06:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:06:36] [INFO ] [Real]Absence check using state equation in 12256 ms returned (error "Failed to check-sat")
[2020-06-03 19:06:37] [INFO ] Flatten gal took : 558 ms
[2020-06-03 19:06:38] [INFO ] Flatten gal took : 452 ms
[2020-06-03 19:06:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-03 19:06:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 101 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-2000 @ 3570 seconds

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

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

FORMULA JoinFreeModules-PT-2000-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-2000-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA JoinFreeModules-PT-2000-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-2000-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1881
rslt: Output for CTLFireability @ JoinFreeModules-PT-2000

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 19:06:38 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"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": "EX(AG((3 <= p515)))",
"processed_size": 19,
"rewrites": 18
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 4000,
"markings": 4001,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 190
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(((3 <= p2633) OR (1 <= p5667)))",
"processed_size": 35,
"rewrites": 17
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 204
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(EX(((5 <= p8434) OR (3 <= p5273))))",
"processed_size": 39,
"rewrites": 18
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 211
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "((4 <= p2523) AND (5 <= p8165) AND (p5130 <= 4))",
"processed_size": 48,
"rewrites": 18
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 228
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "EX((3 <= p3478))",
"processed_size": 16,
"rewrites": 17
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"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": "(3 <= p4770)",
"processed_size": 12,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AX((((p7173 <= 2) AND (p1530 <= 4)) OR (5 <= p5870) OR (3 <= p6723) OR ((3 <= p3815) AND (5 <= p9689))))",
"processed_size": 107,
"rewrites": 17
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "(3 <= p7265)",
"processed_size": 12,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EX(((4 <= p6678) OR (5 <= p4590))))",
"processed_size": 39,
"rewrites": 18
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 6002,
"markings": 6002,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF((EX((3 <= p7220)) AND ((3 <= p1515) AND EG((p6147 <= 0)))))",
"processed_size": 62,
"rewrites": 19
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 6002,
"markings": 6002,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 341
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(AF(((p9585 <= 2) AND (p1249 <= 4))))",
"processed_size": 39,
"rewrites": 18
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 12004,
"markings": 6002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A((2 <= p3641) U EG((p9470 <= 4)))",
"processed_size": 34,
"rewrites": 18
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 6003,
"markings": 6002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 526
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))",
"processed_size": 47,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"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": "((p3785 <= 4) R F (((p4571 <= 1) AND (p5227 <= 1))))",
"processed_size": 52,
"rewrites": 25
},
"result":
{
"edges": 223,
"markings": 223,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 844
},
"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": "(5 <= p3905)",
"processed_size": 12,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1178
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p2888 <= 2) OR ((1 <= p5577) AND (p4142 <= 0) AND (2 <= p8637)))",
"processed_size": 66,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G (((2 <= p5502) OR (5 <= p4184))))",
"processed_size": 39,
"rewrites": 17
},
"result":
{
"edges": 223,
"markings": 223,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2))))",
"processed_size": 88,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))",
"processed_size": 47,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"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": "(5 <= p3905)",
"processed_size": 12,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2))))",
"processed_size": 88,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": "EG(AF((p2165 <= 4)))",
"processed_size": 20,
"rewrites": 18
},
"net":
{
"conflict_clusters": 8001,
"singleton_clusters": 0
},
"result":
{
"edges": 12004,
"markings": 6002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 9756,
"runtime": 1689.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U E(G(**)))) : (E(F(A((** U **)))) OR **) : E(X(A(G(**)))) : (A(X(E(X(**)))) AND A(X(**))) : E((A((** U **)) U (E(X(**)) AND E(G(**))))) : E(X(E(F(**)))) : A((** U E(G(**)))) : (E(X(**)) AND (A(X(A(X(**)))) OR E(F(**)))) : (A((** U **)) AND E(G(A(F(**))))) : E(G(A(F(*)))) : (E((** U **)) AND **) : (A(X(**)) OR (E(X(A(X(**)))) OR **)) : (A(F(E(X(**)))) OR **) : A(F((E(X(**)) AND (** AND E(G(*)))))) : (E(G(**)) AND (A(F(**)) OR (** OR **))) : A(F((A(G(*)) AND **)))"
},
"net":
{
"arcs": 46000,
"conflict_clusters": 8001,
"places": 10000,
"places_significant": 8000,
"singleton_clusters": 0,
"transitions": 16001
},
"result":
{
"preliminary_value": "yes unknown no no unknown yes yes no yes yes unknown yes no no yes unknown ",
"value": "yes unknown no no unknown yes yes no yes yes unknown yes no no yes unknown "
},
"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: 26001/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 320000
lola: finding significant places
lola: 10000 places, 16001 transitions, 8000 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 CTLFireability.xml
lola: E (((5 <= p3785) U E (G (((2 <= p4571) OR (2 <= p5227)))))) : (E (F (A (((2 <= p4507) U (4 <= p6603))))) OR (5 <= p3905)) : E (X (A (G ((3 <= p515))))) : A (X ((E (X (((5 <= p8434) OR (3 <= p5273)))) AND ((3 <= p2633) OR (1 <= p5667))))) : E ((A (((3 <= p3755) U (2 <= p4712))) U (E (X ((2 <= p7321))) AND E (G ((3 <= p9620)))))) : E (X (E (F (((4 <= p2523) AND (5 <= p8165) AND (p5130 <= 4)))))) : A (((2 <= p3641) U E (G ((p9470 <= 4))))) : (E (X ((3 <= p3478))) AND (A (X (A (X ((2 <= p9722))))) OR E (F ((((3 <= p9840) AND (3 <= p2873)) OR ((5 <= p8310) AND (4 <= p7593))))))) : (A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2)))) AND E (G (A (F ((p2165 <= 4)))))) : NOT(A (F (E (G (((3 <= p9585) OR (5 <= p1249))))))) : (E (((1 <= p9352) U (5 <= p8894))) AND ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))) : ((A (X ((((p7173 <= 2) AND (p1530 <= 4)) OR (5 <= p5870) OR (3 <= p6723) OR ((3 <= p3815) AND (5 <= p9689))))) OR E (X (A (X ((3 <= p358)))))) OR (3 <= p4770)) : (A (F (E (X (((4 <= p6678) OR (5 <= p4590)))))) OR (3 <= p7265)) : A (F (((E (X ((3 <= p7220))) AND (3 <= p1515)) AND NOT(A (F ((1 <= p6147))))))) : (E (G (E (G (((2 <= p5502) OR (5 <= p4184)))))) AND ((A (F ((1 <= p17))) OR (p2888 <= 2)) OR ((1 <= p5577) AND (p4142 <= 0) AND (2 <= p8637)))) : A (F ((NOT(E (F ((3 <= p4280)))) AND ((p1406 <= 1) OR (p5808 <= 3) OR (p7833 <= 2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((3 <= p515)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((3 <= p515)))
lola: processed formula length: 19
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4001 markings, 4000 edges
lola: ========================================
lola: subprocess 1 will run for 190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (X (((5 <= p8434) OR (3 <= p5273)))))) AND A (X (((3 <= p2633) OR (1 <= p5667)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p2633) OR (1 <= p5667))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((3 <= p2633) OR (1 <= p5667)))
lola: processed formula length: 35
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (((5 <= p8434) OR (3 <= p5273))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX(((5 <= p8434) OR (3 <= p5273))))
lola: processed formula length: 39
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 204 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (((3 <= p3755) U (2 <= p4712))) U (E (X ((2 <= p7321))) AND E (G ((3 <= p9620))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(A((3 <= p3755) U (2 <= p4712)) U (EX((2 <= p7321)) AND EG((3 <= p9620))))
lola: processed formula length: 75
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 21940 markings, 73274 edges, 4388 markings/sec, 0 secs
lola: 42941 markings, 146788 edges, 4200 markings/sec, 5 secs
lola: 64704 markings, 220148 edges, 4353 markings/sec, 10 secs
lola: 86046 markings, 294070 edges, 4268 markings/sec, 15 secs
lola: 107608 markings, 367556 edges, 4312 markings/sec, 20 secs
lola: 129292 markings, 441773 edges, 4337 markings/sec, 25 secs
lola: 150800 markings, 516033 edges, 4302 markings/sec, 30 secs
lola: 172610 markings, 589691 edges, 4362 markings/sec, 35 secs
lola: 193918 markings, 664234 edges, 4262 markings/sec, 40 secs
lola: 215945 markings, 737849 edges, 4405 markings/sec, 45 secs
lola: 237121 markings, 812754 edges, 4235 markings/sec, 50 secs
lola: 259155 markings, 886390 edges, 4407 markings/sec, 55 secs
lola: 280404 markings, 960976 edges, 4250 markings/sec, 60 secs
lola: 302310 markings, 1034731 edges, 4381 markings/sec, 65 secs
lola: 323821 markings, 1109196 edges, 4302 markings/sec, 70 secs
lola: 345444 markings, 1182989 edges, 4325 markings/sec, 75 secs
lola: 362752 markings, 1243411 edges, 3462 markings/sec, 80 secs
lola: 381065 markings, 1304966 edges, 3663 markings/sec, 85 secs
lola: 398646 markings, 1364507 edges, 3516 markings/sec, 90 secs
lola: 415432 markings, 1422962 edges, 3357 markings/sec, 95 secs
lola: 433231 markings, 1485213 edges, 3560 markings/sec, 100 secs
lola: 444469 markings, 1522862 edges, 2248 markings/sec, 105 secs
lola: 452605 markings, 1549439 edges, 1627 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((4 <= p2523) AND (5 <= p8165) AND (p5130 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((4 <= p2523) AND (5 <= p8165) AND (p5130 <= 4))
lola: processed formula length: 48
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((4 <= p2523) AND (5 <= p8165) AND (p5130 <= 4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((3 <= p3478))) AND (A (X (A (X ((2 <= p9722))))) OR E (F ((((3 <= p9840) AND (3 <= p2873)) OR ((5 <= p8310) AND (4 <= p7593)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= p3478)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((3 <= p3478))
lola: processed formula length: 16
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p7173 <= 2) AND (p1530 <= 4)) OR (5 <= p5870) OR (3 <= p6723) OR ((3 <= p3815) AND (5 <= p9689))))) OR (E (X (A (X ((3 <= p358))))) OR (3 <= p4770)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p4770)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p4770)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLFireability.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 6 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p7173 <= 2) AND (p1530 <= 4)) OR (5 <= p5870) OR (3 <= p6723) OR ((3 <= p3815) AND (5 <= p9689)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p7173 <= 2) AND (p1530 <= 4)) OR (5 <= p5870) OR (3 <= p6723) OR ((3 <= p3815) AND (5 <= p9689))))
lola: processed formula length: 107
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X (((4 <= p6678) OR (5 <= p4590)))))) OR (3 <= p7265))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p7265)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p7265)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLFireability.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 7 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((4 <= p6678) OR (5 <= p4590))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((4 <= p6678) OR (5 <= p4590))))
lola: processed formula length: 39
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2885 markings, 2884 edges, 577 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6002 markings, 6002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((3 <= p7220))) AND ((3 <= p1515) AND E (G ((p6147 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX((3 <= p7220)) AND ((3 <= p1515) AND EG((p6147 <= 0)))))
lola: processed formula length: 62
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6002 markings, 6002 edges
lola: ========================================
lola: subprocess 8 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p9585 <= 2) AND (p1249 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p9585 <= 2) AND (p1249 <= 4))))
lola: processed formula length: 39
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6002 markings, 12004 edges
lola: ========================================
lola: subprocess 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p3641) U E (G ((p9470 <= 4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((2 <= p3641) U EG((p9470 <= 4)))
lola: processed formula length: 34
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6002 markings, 6003 edges
lola: ========================================
lola: subprocess 10 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p4280 <= 2))) AND ((p1406 <= 1) OR (p5808 <= 3) OR (p7833 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG((p4280 <= 2)) AND ((p1406 <= 1) OR (p5808 <= 3) OR (p7833 <= 2))))
lola: processed formula length: 75
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 51299 markings, 71787 edges, 10260 markings/sec, 0 secs
lola: 100940 markings, 142861 edges, 9928 markings/sec, 5 secs
lola: 149477 markings, 212120 edges, 9707 markings/sec, 10 secs
lola: 195659 markings, 279446 edges, 9236 markings/sec, 15 secs
lola: 246079 markings, 349695 edges, 10084 markings/sec, 20 secs
lola: 296547 markings, 422303 edges, 10094 markings/sec, 25 secs
lola: 346515 markings, 493978 edges, 9994 markings/sec, 30 secs
lola: 398756 markings, 567413 edges, 10448 markings/sec, 35 secs
lola: 450292 markings, 641917 edges, 10307 markings/sec, 40 secs
lola: 502591 markings, 717653 edges, 10460 markings/sec, 45 secs
lola: 556031 markings, 793185 edges, 10688 markings/sec, 50 secs
lola: 609549 markings, 868855 edges, 10704 markings/sec, 55 secs
lola: 662989 markings, 944439 edges, 10688 markings/sec, 60 secs
lola: 711288 markings, 1015415 edges, 9660 markings/sec, 65 secs
lola: 736821 markings, 1051109 edges, 5107 markings/sec, 70 secs
lola: 763200 markings, 1088273 edges, 5276 markings/sec, 75 secs
lola: 777733 markings, 1109216 edges, 2907 markings/sec, 80 secs
lola: 784708 markings, 1120050 edges, 1395 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((1 <= p9352) U (5 <= p8894))) AND ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))
lola: processed formula length: 47
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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: subprocess 12 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p9352) U (5 <= p8894)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= p9352) U (5 <= p8894)))
lola: processed formula length: 33
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p8894)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
lola: sara is running 0 secs || 19017 markings, 25006 edges, 3803 markings/sec, 0 secs
lola: sara is running 5 secs || 59017 markings, 82968 edges, 8000 markings/sec, 5 secs
lola: sara is running 10 secs || 108449 markings, 153815 edges, 9886 markings/sec, 10 secs
lola: sara is running 15 secs || 133939 markings, 189423 edges, 5098 markings/sec, 15 secs
lola: sara is running 20 secs || 159257 markings, 225133 edges, 5064 markings/sec, 20 secs
lola: sara is running 25 secs || 204882 markings, 291090 edges, 9125 markings/sec, 25 secs
lola: sara is running 30 secs || 254026 markings, 361819 edges, 9829 markings/sec, 30 secs
lola: sara is running 35 secs || 303489 markings, 432174 edges, 9893 markings/sec, 35 secs
lola: sara is running 40 secs || 353440 markings, 503148 edges, 9990 markings/sec, 40 secs
lola: sara is running 45 secs || 403208 markings, 575200 edges, 9954 markings/sec, 45 secs
lola: sara is running 50 secs || 454111 markings, 646293 edges, 10181 markings/sec, 50 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 55 secs || 503000 markings, 718368 edges, 9778 markings/sec, 55 secs

lola: sara is running 60 secs || 553833 markings, 789340 edges, 10167 markings/sec, 60 secs
lola: sara is running 65 secs || 602837 markings, 860332 edges, 9801 markings/sec, 65 secs
lola: state equation 0: solution produced
lola: sara is running 70 secs || 652046 markings, 929727 edges, 9842 markings/sec, 70 secs
lola: sara is running 75 secs || 701828 markings, 1001241 edges, 9956 markings/sec, 75 secs
lola: sara is running 80 secs || 739094 markings, 1055079 edges, 7453 markings/sec, 80 secs
lola: sara is running 85 secs || 772584 markings, 1101939 edges, 6698 markings/sec, 85 secs
lola: sara is running 90 secs || 791300 markings, 1128451 edges, 3743 markings/sec, 90 secs
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: subprocess 12 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((5 <= p3785) U E (G (((2 <= p4571) OR (2 <= p5227))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p3785 <= 4) R F (((p4571 <= 1) AND (p5227 <= 1))))
lola: processed formula length: 52
lola: 25 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 223 markings, 223 edges
lola: ========================================
lola: subprocess 13 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (((2 <= p4507) U (4 <= p6603))))) OR (5 <= p3905))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (5 <= p3905)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (5 <= p3905)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLFireability.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 14 will run for 1266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((2 <= p4507) U (4 <= p6603)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((2 <= p4507) U (4 <= p6603)))
lola: processed formula length: 34
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 10115 markings, 33428 edges, 2023 markings/sec, 0 secs
lola: 33962 markings, 110113 edges, 4769 markings/sec, 5 secs
lola: 55114 markings, 188690 edges, 4230 markings/sec, 10 secs
lola: 78107 markings, 265918 edges, 4599 markings/sec, 15 secs
lola: 103856 markings, 344360 edges, 5150 markings/sec, 20 secs
lola: 123800 markings, 423773 edges, 3989 markings/sec, 25 secs
lola: 147111 markings, 502201 edges, 4662 markings/sec, 30 secs
lola: 170286 markings, 577682 edges, 4635 markings/sec, 35 secs
lola: 191349 markings, 654599 edges, 4213 markings/sec, 40 secs
lola: 215697 markings, 734077 edges, 4870 markings/sec, 45 secs
lola: 237562 markings, 814410 edges, 4373 markings/sec, 50 secs
lola: 260815 markings, 892609 edges, 4651 markings/sec, 55 secs
lola: 285604 markings, 970071 edges, 4958 markings/sec, 60 secs
lola: 306368 markings, 1049946 edges, 4153 markings/sec, 65 secs
lola: 329852 markings, 1129022 edges, 4697 markings/sec, 70 secs
lola: 355504 markings, 1208160 edges, 5130 markings/sec, 75 secs
lola: 375373 markings, 1286231 edges, 3974 markings/sec, 80 secs
lola: 399103 markings, 1366221 edges, 4746 markings/sec, 85 secs
lola: 425404 markings, 1446570 edges, 5260 markings/sec, 90 secs
lola: 446133 markings, 1529104 edges, 4146 markings/sec, 95 secs
lola: 470092 markings, 1609949 edges, 4792 markings/sec, 100 secs
lola: 495297 markings, 1691211 edges, 5041 markings/sec, 105 secs
lola: 517023 markings, 1772446 edges, 4345 markings/sec, 110 secs
lola: 541259 markings, 1854341 edges, 4847 markings/sec, 115 secs
lola: 565204 markings, 1934955 edges, 4789 markings/sec, 120 secs
lola: 590470 markings, 2016313 edges, 5053 markings/sec, 125 secs
lola: 612500 markings, 2099012 edges, 4406 markings/sec, 130 secs
lola: 636832 markings, 2181263 edges, 4866 markings/sec, 135 secs
lola: 663057 markings, 2263346 edges, 5245 markings/sec, 140 secs
lola: 684578 markings, 2346815 edges, 4304 markings/sec, 145 secs
lola: 708671 markings, 2428175 edges, 4819 markings/sec, 150 secs
lola: 732964 markings, 2500727 edges, 4859 markings/sec, 155 secs
lola: 752269 markings, 2578190 edges, 3861 markings/sec, 160 secs
lola: 775033 markings, 2654554 edges, 4553 markings/sec, 165 secs
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: subprocess 14 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((2 <= p5502) OR (5 <= p4184)))) AND (A (F ((1 <= p17))) OR ((p2888 <= 2) OR ((1 <= p5577) AND (p4142 <= 0) AND (2 <= p8637)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2888 <= 2) OR ((1 <= p5577) AND (p4142 <= 0) AND (2 <= p8637)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p2888 <= 2) OR ((1 <= p5577) AND (p4142 <= 0) AND (2 <= p8637)))
lola: processed formula length: 66
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: subprocess 15 will run for 2355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p5502) OR (5 <= p4184))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p5502) OR (5 <= p4184))))
lola: processed formula length: 39
lola: 17 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p5502 <= 1) AND (p4184 <= 4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 223 markings, 223 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2)))) AND E (G (A (F ((p2165 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2))))
lola: processed formula length: 88
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
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: E ((A (((3 <= p3755) U (2 <= p4712))) U (E (X ((2 <= p7321))) AND E (G ((3 <= p9620))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(A((3 <= p3755) U (2 <= p4712)) U (EX((2 <= p7321)) AND EG((3 <= p9620))))
lola: processed formula length: 75
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 16386 markings, 55146 edges, 3277 markings/sec, 0 secs
lola: 37779 markings, 128176 edges, 4279 markings/sec, 5 secs
lola: 59201 markings, 201552 edges, 4284 markings/sec, 10 secs
lola: 80572 markings, 275160 edges, 4274 markings/sec, 15 secs
lola: 102207 markings, 348540 edges, 4327 markings/sec, 20 secs
lola: 123451 markings, 422464 edges, 4249 markings/sec, 25 secs
lola: 145211 markings, 495520 edges, 4352 markings/sec, 30 secs
lola: 165946 markings, 568341 edges, 4147 markings/sec, 35 secs
lola: 186513 markings, 637389 edges, 4113 markings/sec, 40 secs
lola: 207385 markings, 710241 edges, 4174 markings/sec, 45 secs
lola: 228852 markings, 782371 edges, 4293 markings/sec, 50 secs
lola: 249920 markings, 856255 edges, 4214 markings/sec, 55 secs
lola: 271591 markings, 928553 edges, 4334 markings/sec, 60 secs
lola: 292002 markings, 1000572 edges, 4082 markings/sec, 65 secs
lola: 313037 markings, 1070855 edges, 4207 markings/sec, 70 secs
lola: 333426 markings, 1142427 edges, 4078 markings/sec, 75 secs
lola: 354899 markings, 1214404 edges, 4295 markings/sec, 80 secs
lola: 375759 markings, 1287677 edges, 4172 markings/sec, 85 secs
lola: 397399 markings, 1359867 edges, 4328 markings/sec, 90 secs
lola: 417878 markings, 1432367 edges, 4096 markings/sec, 95 secs
lola: 436546 markings, 1495276 edges, 3734 markings/sec, 100 secs
lola: 455108 markings, 1558268 edges, 3712 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p4280 <= 2))) AND ((p1406 <= 1) OR (p5808 <= 3) OR (p7833 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG((p4280 <= 2)) AND ((p1406 <= 1) OR (p5808 <= 3) OR (p7833 <= 2))))
lola: processed formula length: 75
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 7220 markings, 8133 edges, 1444 markings/sec, 0 secs
lola: 55780 markings, 79630 edges, 9712 markings/sec, 5 secs
lola: 106864 markings, 151043 edges, 10217 markings/sec, 10 secs
lola: 158168 markings, 224045 edges, 10261 markings/sec, 15 secs
lola: 209372 markings, 298949 edges, 10241 markings/sec, 20 secs
lola: 261834 markings, 372769 edges, 10492 markings/sec, 25 secs
lola: 313823 markings, 445761 edges, 10398 markings/sec, 30 secs
lola: 365119 markings, 520817 edges, 10259 markings/sec, 35 secs
lola: 417559 markings, 595821 edges, 10488 markings/sec, 40 secs
lola: 471109 markings, 671546 edges, 10710 markings/sec, 45 secs
lola: 524784 markings, 747492 edges, 10735 markings/sec, 50 secs
lola: 577876 markings, 823395 edges, 10618 markings/sec, 55 secs
lola: 630258 markings, 899729 edges, 10476 markings/sec, 60 secs
lola: 683387 markings, 975580 edges, 10626 markings/sec, 65 secs
lola: 733914 markings, 1046020 edges, 10105 markings/sec, 70 secs
lola: 777736 markings, 1109229 edges, 8764 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (((1 <= p9352) U (5 <= p8894))) AND ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p4253 <= 2) OR (p8128 <= 3) OR (p937 <= 0))
lola: processed formula length: 47
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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: E (((1 <= p9352) U (5 <= p8894)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= p9352) U (5 <= p8894)))
lola: processed formula length: 33
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p8894)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-0.sara.
lola: sara is running 0 secs || 49701 markings, 68990 edges, 9940 markings/sec, 0 secs
lola: sara is running 5 secs || 99068 markings, 140989 edges, 9873 markings/sec, 5 secs
lola: sara is running 10 secs || 149602 markings, 212338 edges, 10107 markings/sec, 10 secs
lola: sara is running 15 secs || 199768 markings, 283608 edges, 10033 markings/sec, 15 secs
lola: sara is running 20 secs || 248969 markings, 354751 edges, 9840 markings/sec, 20 secs
lola: sara is running 25 secs || 299591 markings, 425352 edges, 10124 markings/sec, 25 secs
lola: sara is running 30 secs || 348040 markings, 496644 edges, 9690 markings/sec, 30 secs
lola: sara is running 35 secs || 398936 markings, 567725 edges, 10179 markings/sec, 35 secs
lola: sara is running 40 secs || 447341 markings, 638952 edges, 9681 markings/sec, 40 secs
lola: sara is running 45 secs || 497691 markings, 709077 edges, 10070 markings/sec, 45 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 50 secs || 546531 markings, 780075 edges, 9768 markings/sec, 50 secs
lola: sara is running 55 secs || 596940 markings, 851280 edges, 10082 markings/sec, 55 secs
lola: state equation 0: solution produced
lola: sara is running 60 secs || 643562 markings, 919023 edges, 9324 markings/sec, 60 secs
lola: sara is running 65 secs || 694161 markings, 989938 edges, 10120 markings/sec, 65 secs
lola: sara is running 70 secs || 733844 markings, 1045892 edges, 7937 markings/sec, 70 secs
lola: sara is running 75 secs || 774028 markings, 1103382 edges, 8037 markings/sec, 75 secs
lola: sara is running 80 secs || 795728 markings, 1136200 edges, 4340 markings/sec, 80 secs
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: (E (F (A (((2 <= p4507) U (4 <= p6603))))) OR (5 <= p3905))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (5 <= p3905)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (5 <= p3905)
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (((2 <= p4507) U (4 <= p6603)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((2 <= p4507) U (4 <= p6603)))
lola: processed formula length: 34
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 12094 markings, 40848 edges, 2419 markings/sec, 0 secs
lola: 34748 markings, 116808 edges, 4531 markings/sec, 5 secs
lola: 58947 markings, 194750 edges, 4840 markings/sec, 10 secs
lola: 79914 markings, 272688 edges, 4193 markings/sec, 15 secs
lola: 103856 markings, 352317 edges, 4788 markings/sec, 20 secs
lola: 127168 markings, 432724 edges, 4662 markings/sec, 25 secs
lola: 149949 markings, 512842 edges, 4556 markings/sec, 30 secs
lola: 173764 markings, 592912 edges, 4763 markings/sec, 35 secs
lola: 198716 markings, 674011 edges, 4990 markings/sec, 40 secs
lola: 220485 markings, 754874 edges, 4354 markings/sec, 45 secs
lola: 243664 markings, 832725 edges, 4636 markings/sec, 50 secs
lola: 267849 markings, 912882 edges, 4837 markings/sec, 55 secs
lola: 285604 markings, 970402 edges, 3551 markings/sec, 60 secs
lola: 305974 markings, 1048469 edges, 4074 markings/sec, 65 secs
lola: 329647 markings, 1128257 edges, 4735 markings/sec, 70 secs
lola: 355504 markings, 1207127 edges, 5171 markings/sec, 75 secs
lola: 375998 markings, 1288573 edges, 4099 markings/sec, 80 secs
lola: 400010 markings, 1369622 edges, 4802 markings/sec, 85 secs
lola: 425404 markings, 1451912 edges, 5079 markings/sec, 90 secs
lola: 448673 markings, 1535032 edges, 4654 markings/sec, 95 secs
lola: 472182 markings, 1617783 edges, 4702 markings/sec, 100 secs
lola: 496593 markings, 1700338 edges, 4882 markings/sec, 105 secs
lola: 523264 markings, 1782434 edges, 5334 markings/sec, 110 secs
lola: 544401 markings, 1866123 edges, 4227 markings/sec, 115 secs
lola: 568761 markings, 1948478 edges, 4872 markings/sec, 120 secs
lola: 593164 markings, 2030866 edges, 4881 markings/sec, 125 secs
lola: 618674 markings, 2112411 edges, 5102 markings/sec, 130 secs
lola: 640635 markings, 2195518 edges, 4392 markings/sec, 135 secs
lola: 664669 markings, 2276664 edges, 4807 markings/sec, 140 secs
lola: 691024 markings, 2356479 edges, 5271 markings/sec, 145 secs
lola: 709837 markings, 2432547 edges, 3763 markings/sec, 150 secs
lola: 729689 markings, 2495026 edges, 3970 markings/sec, 155 secs
lola: 748710 markings, 2564840 edges, 3804 markings/sec, 160 secs
lola: 771182 markings, 2638349 edges, 4494 markings/sec, 165 secs
lola: 791271 markings, 2710940 edges, 4018 markings/sec, 170 secs
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: (A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2)))) AND E (G (A (F ((p2165 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718)) U ((5 <= p7759) OR (p9363 <= 2))))
lola: processed formula length: 88
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6866 <= 1) OR (4 <= p6523) OR (4 <= p4718))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p2165 <= 4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((p2165 <= 4)))
lola: processed formula length: 20
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6002 markings, 12004 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no no unknown yes yes no yes yes unknown yes no no yes unknown
lola:
preliminary result: yes unknown no no unknown yes yes no yes yes unknown yes no no yes unknown
lola: memory consumption: 9756 KB
lola: time consumption: 1689 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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-2000"
export BK_EXAMINATION="CTLFireability"
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-2000, examination is CTLFireability"
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-158987928600468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;