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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 3.6K Apr 7 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 7 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 22:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 6 22:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 6 05:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 6 05:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 5 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 5 12:06 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 2.9M 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-0500-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0500-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591208456501

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:20:59] [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:20:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:20:59] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2020-06-03 18:20:59] [INFO ] Transformed 2501 places.
[2020-06-03 18:20:59] [INFO ] Transformed 4001 transitions.
[2020-06-03 18:20:59] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 361 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 58 ms.
Incomplete random walk after 100030 steps, including 0 resets, run finished after 2274 ms. (steps per millisecond=43 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 4001 rows 2500 cols
[2020-06-03 18:21:02] [INFO ] Computed 500 place invariants in 65 ms
[2020-06-03 18:21:02] [INFO ] [Real]Absence check using 500 positive place invariants in 449 ms returned sat
[2020-06-03 18:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:21:22] [INFO ] [Real]Absence check using state equation in 19278 ms returned (error "Failed to check-sat")
[2020-06-03 18:21:23] [INFO ] [Real]Absence check using 500 positive place invariants in 1290 ms returned sat
[2020-06-03 18:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:21:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:21:42] [INFO ] [Real]Absence check using state equation in 18202 ms returned unknown
[2020-06-03 18:21:44] [INFO ] [Real]Absence check using 500 positive place invariants in 1603 ms returned sat
[2020-06-03 18:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:02] [INFO ] [Real]Absence check using state equation in 18084 ms returned (error "Failed to check-sat")
[2020-06-03 18:22:04] [INFO ] [Real]Absence check using 500 positive place invariants in 1986 ms returned sat
[2020-06-03 18:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:22] [INFO ] [Real]Absence check using state equation in 17650 ms returned unknown
[2020-06-03 18:22:23] [INFO ] [Real]Absence check using 500 positive place invariants in 1156 ms returned sat
[2020-06-03 18:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:22:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:22:42] [INFO ] [Real]Absence check using state equation in 18487 ms returned (error "Failed to check-sat")
[2020-06-03 18:22:42] [INFO ] [Real]Absence check using 500 positive place invariants in 517 ms returned sat
[2020-06-03 18:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:02] [INFO ] [Real]Absence check using state equation in 19243 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:02] [INFO ] [Real]Absence check using 500 positive place invariants in 480 ms returned sat
[2020-06-03 18:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:23:22] [INFO ] [Real]Absence check using state equation in 19289 ms returned (error "Failed to check-sat")
[2020-06-03 18:23:23] [INFO ] [Real]Absence check using 500 positive place invariants in 479 ms returned sat
[2020-06-03 18:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:23:42] [INFO ] [Real]Absence check using state equation in 19194 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:23:44] [INFO ] [Real]Absence check using 500 positive place invariants in 2113 ms returned sat
[2020-06-03 18:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:02] [INFO ] [Real]Absence check using state equation in 17563 ms returned (error "Failed to check-sat")
[2020-06-03 18:24:02] [INFO ] [Real]Absence check using 500 positive place invariants in 401 ms returned sat
[2020-06-03 18:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:21] [INFO ] [Real]Absence check using state equation in 18852 ms returned sat
[2020-06-03 18:24:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:24:22] [INFO ] [Nat]Absence check using 500 positive place invariants in 479 ms returned sat
[2020-06-03 18:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:24:36] [INFO ] [Nat]Absence check using state equation in 14166 ms returned unknown
[2020-06-03 18:24:37] [INFO ] [Real]Absence check using 500 positive place invariants in 461 ms returned sat
[2020-06-03 18:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:24:54] [INFO ] [Real]Absence check using state equation in 17427 ms returned sat
[2020-06-03 18:24:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:24:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 785 ms returned sat
[2020-06-03 18:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:09] [INFO ] [Nat]Absence check using state equation in 13856 ms returned unknown
[2020-06-03 18:25:11] [INFO ] [Real]Absence check using 500 positive place invariants in 1082 ms returned sat
[2020-06-03 18:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:29] [INFO ] [Real]Absence check using state equation in 18576 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:25:30] [INFO ] [Real]Absence check using 500 positive place invariants in 629 ms returned sat
[2020-06-03 18:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:49] [INFO ] [Real]Absence check using state equation in 19251 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:25:50] [INFO ] [Real]Absence check using 500 positive place invariants in 865 ms returned sat
[2020-06-03 18:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:09] [INFO ] [Real]Absence check using state equation in 18996 ms returned unknown
[2020-06-03 18:26:10] [INFO ] [Real]Absence check using 500 positive place invariants in 432 ms returned sat
[2020-06-03 18:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:29] [INFO ] [Real]Absence check using state equation in 18977 ms returned sat
[2020-06-03 18:26:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:26:30] [INFO ] [Nat]Absence check using 500 positive place invariants in 424 ms returned sat
[2020-06-03 18:26:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:44] [INFO ] [Nat]Absence check using state equation in 14248 ms returned unknown
[2020-06-03 18:26:45] [INFO ] [Real]Absence check using 500 positive place invariants in 428 ms returned sat
[2020-06-03 18:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:27:04] [INFO ] [Real]Absence check using state equation in 19462 ms returned unknown
[2020-06-03 18:27:05] [INFO ] [Real]Absence check using 500 positive place invariants in 437 ms returned sat
[2020-06-03 18:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:22] [INFO ] [Real]Absence check using state equation in 17507 ms returned sat
[2020-06-03 18:27:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:27:23] [INFO ] [Nat]Absence check using 500 positive place invariants in 492 ms returned sat
[2020-06-03 18:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:27:42] [INFO ] [Nat]Absence check using state equation in 19183 ms returned (error "Failed to check-sat")
[2020-06-03 18:27:43] [INFO ] [Real]Absence check using 500 positive place invariants in 417 ms returned sat
[2020-06-03 18:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:02] [INFO ] [Real]Absence check using state equation in 19483 ms returned unknown
[2020-06-03 18:28:03] [INFO ] [Real]Absence check using 500 positive place invariants in 764 ms returned sat
[2020-06-03 18:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:22] [INFO ] [Real]Absence check using state equation in 18915 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:24] [INFO ] [Real]Absence check using 500 positive place invariants in 1033 ms returned sat
[2020-06-03 18:28:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:42] [INFO ] [Real]Absence check using state equation in 18650 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:44] [INFO ] [Real]Absence check using 500 positive place invariants in 989 ms returned sat
[2020-06-03 18:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:02] [INFO ] [Real]Absence check using state equation in 18676 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:04] [INFO ] [Real]Absence check using 500 positive place invariants in 1096 ms returned sat
[2020-06-03 18:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:22] [INFO ] [Real]Absence check using state equation in 18776 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:29:23] [INFO ] [Real]Absence check using 500 positive place invariants in 437 ms returned sat
[2020-06-03 18:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:42] [INFO ] [Real]Absence check using state equation in 19444 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:29:44] [INFO ] [Real]Absence check using 500 positive place invariants in 1415 ms returned sat
[2020-06-03 18:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:02] [INFO ] [Real]Absence check using state equation in 18251 ms returned (error "Failed to check-sat")
[2020-06-03 18:30:03] [INFO ] [Real]Absence check using 500 positive place invariants in 429 ms returned sat
[2020-06-03 18:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:22] [INFO ] [Real]Absence check using state equation in 18889 ms returned sat
[2020-06-03 18:30:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:30:23] [INFO ] [Nat]Absence check using 500 positive place invariants in 546 ms returned sat
[2020-06-03 18:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:33] [INFO ] [Nat]Absence check using state equation in 10658 ms returned sat
[2020-06-03 18:30:35] [INFO ] Deduced a trap composed of 3 places in 1272 ms
[2020-06-03 18:30:36] [INFO ] Deduced a trap composed of 3 places in 1058 ms
[2020-06-03 18:30:37] [INFO ] Deduced a trap composed of 3 places in 840 ms
[2020-06-03 18:30:40] [INFO ] Deduced a trap composed of 3 places in 2900 ms
[2020-06-03 18:30:41] [INFO ] Deduced a trap composed of 3 places in 705 ms
[2020-06-03 18:30:42] [INFO ] Deduced a trap composed of 3 places in 1438 ms
[2020-06-03 18:30:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s880 s883 s884) 0)") while checking expression at index 24
[2020-06-03 18:30:43] [INFO ] [Real]Absence check using 500 positive place invariants in 754 ms returned sat
[2020-06-03 18:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:02] [INFO ] [Real]Absence check using state equation in 18932 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:03] [INFO ] [Real]Absence check using 500 positive place invariants in 425 ms returned sat
[2020-06-03 18:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:22] [INFO ] [Real]Absence check using state equation in 18933 ms returned sat
[2020-06-03 18:31:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:31:22] [INFO ] [Nat]Absence check using 500 positive place invariants in 440 ms returned sat
[2020-06-03 18:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:37] [INFO ] [Nat]Absence check using state equation in 14194 ms returned unknown
[2020-06-03 18:31:38] [INFO ] [Real]Absence check using 500 positive place invariants in 768 ms returned sat
[2020-06-03 18:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:57] [INFO ] [Real]Absence check using state equation in 18904 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:58] [INFO ] [Real]Absence check using 500 positive place invariants in 706 ms returned sat
[2020-06-03 18:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:17] [INFO ] [Real]Absence check using state equation in 18987 ms returned unknown
[2020-06-03 18:32:17] [INFO ] [Real]Absence check using 500 positive place invariants in 472 ms returned sat
[2020-06-03 18:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:37] [INFO ] [Real]Absence check using state equation in 19341 ms returned (error "Failed to check-sat")
[2020-06-03 18:32:37] [INFO ] [Real]Absence check using 500 positive place invariants in 522 ms returned sat
[2020-06-03 18:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:57] [INFO ] [Real]Absence check using state equation in 19408 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:32:57] [INFO ] [Real]Absence check using 500 positive place invariants in 440 ms returned sat
[2020-06-03 18:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:17] [INFO ] [Real]Absence check using state equation in 19369 ms returned unknown
[2020-06-03 18:33:17] [INFO ] [Real]Absence check using 500 positive place invariants in 562 ms returned sat
[2020-06-03 18:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:37] [INFO ] [Real]Absence check using state equation in 19314 ms returned (error "Failed to check-sat")
[2020-06-03 18:33:38] [INFO ] [Real]Absence check using 500 positive place invariants in 1379 ms returned sat
[2020-06-03 18:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:57] [INFO ] [Real]Absence check using state equation in 18534 ms returned (error "Failed to check-sat")
[2020-06-03 18:33:57] [INFO ] [Real]Absence check using 500 positive place invariants in 425 ms returned sat
[2020-06-03 18:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:16] [INFO ] [Real]Absence check using state equation in 19211 ms returned sat
[2020-06-03 18:34:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:34:17] [INFO ] [Nat]Absence check using 500 positive place invariants in 609 ms returned sat
[2020-06-03 18:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:31] [INFO ] [Nat]Absence check using state equation in 13717 ms returned unknown
[2020-06-03 18:34:32] [INFO ] [Real]Absence check using 500 positive place invariants in 751 ms returned sat
[2020-06-03 18:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:51] [INFO ] [Real]Absence check using state equation in 19128 ms returned (error "Failed to check-sat")
[2020-06-03 18:34:52] [INFO ] [Real]Absence check using 500 positive place invariants in 546 ms returned sat
[2020-06-03 18:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:11] [INFO ] [Real]Absence check using state equation in 19339 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:35:12] [INFO ] Flatten gal took : 345 ms
[2020-06-03 18:35:12] [INFO ] Flatten gal took : 116 ms
[2020-06-03 18:35:12] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2020-06-03 18:35:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0500 @ 3570 seconds

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

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

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

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

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

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

FORMULA JoinFreeModules-PT-0500-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

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

FORMULA JoinFreeModules-PT-0500-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1867
rslt: Output for CTLFireability @ JoinFreeModules-PT-0500

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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 18:35:12 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 213
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 3,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(A(AF((4 <= p2023)) U EG((3 <= p108))) AND EG(EX((p1645 <= 2))))",
"processed_size": 64,
"rewrites": 53
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 1504,
"markings": 1502,
"produced_by": "CTL model checker",
"value": false
},
"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": 228
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(EX(AF((4 <= p463))))",
"processed_size": 23,
"rewrites": 51
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 1501994,
"markings": 1500994,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "E((EG((5 <= p1935)) OR AX((5 <= p879))) U AF(((5 <= p314) OR (5 <= p959))))",
"processed_size": 76,
"rewrites": 52
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 1504,
"markings": 1502,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= p1930)))",
"processed_size": 20,
"rewrites": 49
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 286
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((p285 <= 4) OR (p316 <= 1) OR (p958 <= 2) OR (p649 <= 4)) AND ((p2342 <= 1) OR (p953 <= 2)) AND (3 <= p8))))",
"processed_size": 120,
"rewrites": 49
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "A(EG((p150 <= 4)) R ((3 <= p410) OR (2 <= p562)))",
"processed_size": 50,
"rewrites": 50
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 1503,
"markings": 1502,
"produced_by": "CTL model checker",
"value": true
},
"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": 380
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EG((AF((2 <= p772)) OR ((3 <= p2298) OR ((3 <= p1293) OR ((p926 <= 1) OR ((p230 <= 2) OR ((2 <= p1247) AND (1 <= p227))))))))",
"processed_size": 125,
"rewrites": 50
},
"net":
{
"conflict_clusters": 2001,
"singleton_clusters": 0
},
"result":
{
"edges": 3004,
"markings": 1502,
"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": 470
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 470
},
"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": "(p2200 <= 2)",
"processed_size": 12,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p2343 <= 2)))",
"processed_size": 20,
"rewrites": 50
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 680
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"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 (((1 <= p912) U ((5 <= p2299) OR (5 <= p1925) OR ((2 <= p21) AND (5 <= p1209)))))",
"processed_size": 85,
"rewrites": 53
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 907
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((p1599 <= 4) OR F ((2 <= p501))) U ((5 <= p475) AND (1 <= p2122) AND ((5 <= p1920) OR ((3 <= p605) AND (1 <= p2302)))))",
"processed_size": 122,
"rewrites": 50
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (((p1732 <= 0) R (p1485 <= 4)))",
"processed_size": 33,
"rewrites": 51
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2722
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393))))",
"processed_size": 68,
"rewrites": 53
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393))))",
"processed_size": 68,
"rewrites": 53
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3828,
"runtime": 1703.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) AND **) : A(X(E(F(*)))) : E(F(*)) : (E((* R *)) OR (E(F(*)) OR E(F(**)))) : E(G((** OR A(G(*))))) : E(F(**)) : A((* R *)) : (A((A(F(**)) U E(G(**)))) AND E(G(E(X(**))))) : A((E(G(*)) R *)) : A(X(E(X(A(F(**)))))) : (A((** U **)) AND (** OR E(F(**)))) : A(G((E(G(**)) OR (A((** U **)) OR **)))) : E(((E(G(**)) OR A(X(**))) U A(F(**)))) : E(G((A(F(**)) OR (** OR (** OR (** OR (** OR **))))))) : A(((** OR A(F(**))) U **)) : (A(G((A(G(**)) OR (** OR (** OR **))))) OR (A((** U **)) AND (A(G(**)) OR (** OR (** OR **)))))"
},
"net":
{
"arcs": 11500,
"conflict_clusters": 2001,
"places": 2500,
"places_significant": 2000,
"singleton_clusters": 0,
"transitions": 4001
},
"result":
{
"preliminary_value": "no unknown yes yes unknown yes unknown no yes no no unknown no yes no unknown ",
"value": "no unknown yes yes unknown yes unknown no yes no no unknown no yes no 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: 6501/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 4001 transitions, 2000 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (NOT(E (F ((3 <= p2343)))) AND (p2200 <= 2)) : A (X (NOT(A (G ((p2394 <= 4)))))) : NOT(A (G ((((5 <= p285) AND (2 <= p316) AND (3 <= p958) AND (5 <= p649)) OR ((2 <= p2342) AND (3 <= p953)) OR (p8 <= 2))))) : ((NOT(A (((1 <= p1732) U (5 <= p1485)))) OR NOT(A (G ((1 <= p1642))))) OR E (F (E (((2 <= p872) U (3 <= p1875)))))) : E (G ((((4 <= p2143) OR (3 <= p1108)) OR NOT(E (F ((5 <= p1874))))))) : E (F ((3 <= p1930))) : NOT(E ((((1 <= p2162) AND (1 <= p2407) AND ((5 <= p1229) OR (1 <= p1177))) U (4 <= p768)))) : (A ((A (F ((4 <= p2023))) U E (G ((3 <= p108))))) AND E (G (E (X ((p1645 <= 2)))))) : NOT(E ((A (F ((5 <= p150))) U ((p410 <= 2) AND (p562 <= 1))))) : A (X (E (X (A (F ((4 <= p463))))))) : (A (((1 <= p912) U ((5 <= p2299) OR (5 <= p1925) OR ((2 <= p21) AND (5 <= p1209))))) AND ((p2307 <= 0) OR E (F ((5 <= p2350))))) : A (G (((E (G ((2 <= p1377))) OR A (((2 <= p336) U (2 <= p1342)))) OR (((2 <= p2062) OR (1 <= p1262)) AND ((3 <= p1353) OR (3 <= p708)))))) : E (((E (G ((5 <= p1935))) OR A (X ((5 <= p879)))) U A (F (((5 <= p314) OR (5 <= p959)))))) : E (G ((((((A (F ((2 <= p772))) OR (3 <= p2298)) OR (3 <= p1293)) OR (p926 <= 1)) OR (p230 <= 2)) OR ((2 <= p1247) AND (1 <= p227))))) : A ((((p1599 <= 4) OR A (F ((2 <= p501)))) U ((5 <= p475) AND (1 <= p2122) AND ((5 <= p1920) OR ((3 <= p605) AND (1 <= p2302)))))) : (A (G ((((A (G ((5 <= p189))) OR (1 <= p1092)) OR (1 <= p602)) OR ((3 <= p2455) AND (3 <= p740))))) OR (A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393)))) AND (((A (G ((2 <= p2151))) OR (5 <= p1294)) OR (p2080 <= 2)) OR ((5 <= p2214) AND (5 <= p385)))))
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: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
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: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((5 <= p2394)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((5 <= p2394)))
lola: processed formula length: 20
lola: 50 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: 216054 markings, 308325 edges, 43211 markings/sec, 0 secs
lola: 432710 markings, 617247 edges, 43331 markings/sec, 5 secs
lola: 649593 markings, 927005 edges, 43377 markings/sec, 10 secs
lola: 865780 markings, 1235778 edges, 43237 markings/sec, 15 secs
lola: 1076649 markings, 1536507 edges, 42174 markings/sec, 20 secs
lola: 1286973 markings, 1837125 edges, 42065 markings/sec, 25 secs
lola: 1498058 markings, 2138093 edges, 42217 markings/sec, 30 secs
lola: 1711594 markings, 2443357 edges, 42707 markings/sec, 35 secs
lola: 1923847 markings, 2746359 edges, 42451 markings/sec, 40 secs
lola: 2137047 markings, 3050812 edges, 42640 markings/sec, 45 secs
lola: 2349415 markings, 3353965 edges, 42474 markings/sec, 50 secs
lola: 2561664 markings, 3656988 edges, 42450 markings/sec, 55 secs
lola: 2773155 markings, 3958922 edges, 42298 markings/sec, 60 secs
lola: 2984305 markings, 4260009 edges, 42230 markings/sec, 65 secs
lola: 3152514 markings, 4500546 edges, 33642 markings/sec, 70 secs
lola: 3300374 markings, 4711212 edges, 29572 markings/sec, 75 secs
lola: 3467017 markings, 4949278 edges, 33329 markings/sec, 80 secs
lola: 3641979 markings, 5199436 edges, 34992 markings/sec, 85 secs
lola: 3793362 markings, 5415513 edges, 30277 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((A (F ((4 <= p2023))) U E (G ((3 <= p108))))) AND E (G (E (X ((p1645 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
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: processed formula: (A(AF((4 <= p2023)) U EG((3 <= p108))) AND EG(EX((p1645 <= 2))))
lola: processed formula length: 64
lola: 53 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 4 significant temporal operators and needs 17 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: 1502 markings, 1504 edges
lola: ========================================
lola: subprocess 2 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (A (F ((4 <= p463)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX(AF((4 <= p463))))
lola: processed formula length: 23
lola: 51 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: 279158 markings, 279343 edges, 55832 markings/sec, 0 secs
lola: 514483 markings, 514826 edges, 47065 markings/sec, 5 secs
lola: 683213 markings, 683669 edges, 33746 markings/sec, 10 secs
lola: 818696 markings, 819242 edges, 27097 markings/sec, 15 secs
lola: 937422 markings, 938047 edges, 23745 markings/sec, 20 secs
lola: 1054593 markings, 1055296 edges, 23434 markings/sec, 25 secs
lola: 1152283 markings, 1153051 edges, 19538 markings/sec, 30 secs
lola: 1250058 markings, 1250891 edges, 19555 markings/sec, 35 secs
lola: 1478024 markings, 1479008 edges, 45593 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1500994 markings, 1501994 edges
lola: ========================================
lola: subprocess 3 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((E (G ((5 <= p1935))) OR A (X ((5 <= p879)))) U A (F (((5 <= p314) OR (5 <= p959))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((EG((5 <= p1935)) OR AX((5 <= p879))) U AF(((5 <= p314) OR (5 <= p959))))
lola: processed formula length: 76
lola: 52 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1502 markings, 1504 edges
lola: ========================================
lola: subprocess 4 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1930)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p1930)))
lola: processed formula length: 20
lola: 49 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
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: (3 <= p1930)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p285 <= 4) OR (p316 <= 1) OR (p958 <= 2) OR (p649 <= 4)) AND ((p2342 <= 1) OR (p953 <= 2)) AND (3 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p285 <= 4) OR (p316 <= 1) OR (p958 <= 2) OR (p649 <= 4)) AND ((p2342 <= 1) OR (p953 <= 2)) AND (3 <= p8))))
lola: processed formula length: 120
lola: 49 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
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: (((p285 <= 4) OR (p316 <= 1) OR (p958 <= 2) OR (p649 <= 4)) AND ((p2342 <= 1) OR (p953 <= 2)) AND (3 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((4 <= p2143) OR (3 <= p1108)) OR A (G ((p1874 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((4 <= p2143) OR (3 <= p1108)) OR AG((p1874 <= 4))))
lola: processed formula length: 57
lola: 50 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: 200065 markings, 285047 edges, 40013 markings/sec, 0 secs
lola: 397464 markings, 567122 edges, 39480 markings/sec, 5 secs
lola: 596396 markings, 850884 edges, 39786 markings/sec, 10 secs
lola: 796415 markings, 1136824 edges, 40004 markings/sec, 15 secs
lola: 993199 markings, 1417341 edges, 39357 markings/sec, 20 secs
lola: 1187500 markings, 1694980 edges, 38860 markings/sec, 25 secs
lola: 1381819 markings, 1972642 edges, 38864 markings/sec, 30 secs
lola: 1574064 markings, 2246741 edges, 38449 markings/sec, 35 secs
lola: 1770555 markings, 2527460 edges, 39298 markings/sec, 40 secs
lola: 1965790 markings, 2806301 edges, 39047 markings/sec, 45 secs
lola: 2161318 markings, 3085500 edges, 39106 markings/sec, 50 secs
lola: 2357887 markings, 3365708 edges, 39314 markings/sec, 55 secs
lola: 2550341 markings, 3640797 edges, 38491 markings/sec, 60 secs
lola: 2745606 markings, 3919689 edges, 39053 markings/sec, 65 secs
lola: 2940524 markings, 4197974 edges, 38984 markings/sec, 70 secs
lola: 3116620 markings, 4448952 edges, 35219 markings/sec, 75 secs
lola: 3283735 markings, 4687546 edges, 33423 markings/sec, 80 secs
lola: 3439959 markings, 4910455 edges, 31245 markings/sec, 85 secs
lola: 3612806 markings, 5158190 edges, 34569 markings/sec, 90 secs
lola: 3787714 markings, 5406907 edges, 34982 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((p150 <= 4))) R ((3 <= p410) OR (2 <= p562))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(EG((p150 <= 4)) R ((3 <= p410) OR (2 <= p562)))
lola: processed formula length: 50
lola: 50 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: 1502 markings, 1503 edges
lola: ========================================
lola: subprocess 8 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((2 <= p772))) OR ((3 <= p2298) OR ((3 <= p1293) OR ((p926 <= 1) OR ((p230 <= 2) OR ((2 <= p1247) AND (1 <= p227)))))))))
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((2 <= p772)) OR ((3 <= p2298) OR ((3 <= p1293) OR ((p926 <= 1) OR ((p230 <= 2) OR ((2 <= p1247) AND (1 <= p227))))))))
lola: processed formula length: 125
lola: 50 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: 1502 markings, 3004 edges
lola: ========================================
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p1377))) OR (A (((2 <= p336) U (2 <= p1342))) OR (((2 <= p2062) OR (1 <= p1262)) AND ((3 <= p1353) OR (3 <= p708)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG((2 <= p1377)) OR (A((2 <= p336) U (2 <= p1342)) OR (((2 <= p2062) OR (1 <= p1262)) AND ((3 <= p1353) OR (3 <= p708))))))
lola: processed formula length: 129
lola: 51 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: 86768 markings, 297330 edges, 17354 markings/sec, 0 secs
lola: 176646 markings, 605209 edges, 17976 markings/sec, 5 secs
lola: 266652 markings, 913559 edges, 18001 markings/sec, 10 secs
lola: 356682 markings, 1222004 edges, 18006 markings/sec, 15 secs
lola: 446946 markings, 1528641 edges, 18053 markings/sec, 20 secs
lola: 535511 markings, 1835398 edges, 17713 markings/sec, 25 secs
lola: 624423 markings, 2139583 edges, 17782 markings/sec, 30 secs
lola: 713078 markings, 2444058 edges, 17731 markings/sec, 35 secs
lola: 802525 markings, 2750327 edges, 17889 markings/sec, 40 secs
lola: 891945 markings, 3054724 edges, 17884 markings/sec, 45 secs
lola: 980719 markings, 3361337 edges, 17755 markings/sec, 50 secs
lola: 1069869 markings, 3666200 edges, 17830 markings/sec, 55 secs
lola: 1158343 markings, 3970208 edges, 17695 markings/sec, 60 secs
lola: 1247359 markings, 4274851 edges, 17803 markings/sec, 65 secs
lola: 1335738 markings, 4578241 edges, 17676 markings/sec, 70 secs
lola: 1424681 markings, 4880050 edges, 17789 markings/sec, 75 secs
lola: 1512160 markings, 5182602 edges, 17496 markings/sec, 80 secs
lola: 1600456 markings, 5485675 edges, 17659 markings/sec, 85 secs
lola: 1689324 markings, 5789406 edges, 17774 markings/sec, 90 secs
lola: 1777978 markings, 6094164 edges, 17731 markings/sec, 95 secs
lola: 1866806 markings, 6397674 edges, 17766 markings/sec, 100 secs
lola: 1955148 markings, 6701333 edges, 17668 markings/sec, 105 secs
lola: 2044280 markings, 7005943 edges, 17826 markings/sec, 110 secs
lola: 2132493 markings, 7309164 edges, 17643 markings/sec, 115 secs
lola: 2220988 markings, 7611051 edges, 17699 markings/sec, 120 secs
lola: 2309356 markings, 7915196 edges, 17674 markings/sec, 125 secs
lola: 2397881 markings, 8218779 edges, 17705 markings/sec, 130 secs
lola: 2486387 markings, 8521845 edges, 17701 markings/sec, 135 secs
lola: 2575057 markings, 8826318 edges, 17734 markings/sec, 140 secs
lola: 2664020 markings, 9130754 edges, 17793 markings/sec, 145 secs
lola: 2752691 markings, 9435220 edges, 17734 markings/sec, 150 secs
lola: 2841418 markings, 9738780 edges, 17745 markings/sec, 155 secs
lola: 2929991 markings, 10042884 edges, 17715 markings/sec, 160 secs
lola: 3018771 markings, 10346651 edges, 17756 markings/sec, 165 secs
lola: 3104130 markings, 10639855 edges, 17072 markings/sec, 170 secs
lola: 3186709 markings, 10922603 edges, 16516 markings/sec, 175 secs
lola: 3265786 markings, 11193316 edges, 15815 markings/sec, 180 secs
lola: 3337335 markings, 11439175 edges, 14310 markings/sec, 185 secs
lola: 3398918 markings, 11649915 edges, 12317 markings/sec, 190 secs
lola: 3471167 markings, 11897292 edges, 14450 markings/sec, 195 secs
lola: 3547911 markings, 12160409 edges, 15349 markings/sec, 200 secs
lola: 3631183 markings, 12445390 edges, 16654 markings/sec, 205 secs
lola: 3714703 markings, 12731557 edges, 16704 markings/sec, 210 secs
lola: 3792655 markings, 12999665 edges, 15590 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p2343 <= 2))) AND (p2200 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2200 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2200 <= 2)
lola: processed formula length: 12
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2343 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p2343 <= 2)))
lola: processed formula length: 20
lola: 50 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p2343)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p2162 <= 0) OR (p2407 <= 0) OR ((p1229 <= 4) AND (p1177 <= 0))) R (p768 <= 3)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p2162 <= 0) OR (p2407 <= 0) OR ((p1229 <= 4) AND (p1177 <= 0))) R (p768 <= 3)))
lola: processed formula length: 87
lola: 53 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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p768)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 188151 markings, 268516 edges, 37630 markings/sec, 0 secs
lola: sara is running 5 secs || 385373 markings, 549875 edges, 39444 markings/sec, 5 secs
lola: sara is running 10 secs || 582817 markings, 831467 edges, 39489 markings/sec, 10 secs
lola: sara is running 15 secs || 778048 markings, 1110297 edges, 39046 markings/sec, 15 secs
lola: sara is running 20 secs || 974300 markings, 1390919 edges, 39250 markings/sec, 20 secs
lola: sara is running 25 secs || 1172460 markings, 1673746 edges, 39632 markings/sec, 25 secs
lola: sara is running 30 secs || 1371504 markings, 1957863 edges, 39809 markings/sec, 30 secs
lola: sara is running 35 secs || 1570109 markings, 2241299 edges, 39721 markings/sec, 35 secs
lola: sara is running 40 secs || 1766293 markings, 2521128 edges, 39237 markings/sec, 40 secs
lola: sara is running 45 secs || 1959129 markings, 2796887 edges, 38567 markings/sec, 45 secs
lola: sara is running 50 secs || 2150915 markings, 3070633 edges, 38357 markings/sec, 50 secs
lola: sara is running 55 secs || 2348868 markings, 3353289 edges, 39591 markings/sec, 55 secs
lola: sara is running 60 secs || 2545313 markings, 3633198 edges, 39289 markings/sec, 60 secs
lola: sara is running 65 secs || 2743013 markings, 3915722 edges, 39540 markings/sec, 65 secs
lola: sara is running 70 secs || 2938970 markings, 4195253 edges, 39191 markings/sec, 70 secs
lola: sara is running 75 secs || 3129103 markings, 4467011 edges, 38027 markings/sec, 75 secs
lola: sara is running 80 secs || 3292419 markings, 4700269 edges, 32663 markings/sec, 80 secs
lola: sara is running 85 secs || 3467714 markings, 4950039 edges, 35059 markings/sec, 85 secs
lola: sara is running 90 secs || 3644241 markings, 5202404 edges, 35305 markings/sec, 90 secs
lola: sara is running 95 secs || 3814047 markings, 5445068 edges, 33961 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= p912) U ((5 <= p2299) OR (5 <= p1925) OR ((2 <= p21) AND (5 <= p1209))))) AND ((p2307 <= 0) OR E (F ((5 <= p2350)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p912) U ((5 <= p2299) OR (5 <= p1925) OR ((2 <= p21) AND (5 <= p1209)))))
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 (((1 <= p912) U ((5 <= p2299) OR (5 <= p1925) OR ((2 <= p21) AND (5 <= p1209)))))
lola: processed formula length: 85
lola: 53 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: (1 <= p912)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 65 markings, 65 edges
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
sara: try reading problem file CTLFireability-12-0.sara.
lola: subprocess 13 will run for 907 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p1599 <= 4) OR A (F ((2 <= p501)))) U ((5 <= p475) AND (1 <= p2122) AND ((5 <= p1920) OR ((3 <= p605) AND (1 <= p2302))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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: (((p1599 <= 4) OR F ((2 <= p501))) U ((5 <= p475) AND (1 <= p2122) AND ((5 <= p1920) OR ((3 <= p605) AND (1 <= p2302)))))
lola: processed formula length: 122
lola: 50 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: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 65 markings, 65 edges
lola: subprocess 14 will run for 1361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (((p1732 <= 0) R (p1485 <= 4))) OR (E (F ((p1642 <= 0))) OR E (F ((3 <= p1875)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p1732 <= 0) R (p1485 <= 4)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((p1732 <= 0) R (p1485 <= 4)))
lola: processed formula length: 33
lola: 51 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p1485)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 65 markings, 65 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((A (G ((5 <= p189))) OR ((1 <= p1092) OR ((1 <= p602) OR ((3 <= p2455) AND (3 <= p740))))))) OR (A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393)))) AND (A (G ((2 <= p2151))) OR ((5 <= p1294) OR ((p2080 <= 2) OR ((5 <= p2214) AND (5 <= p385)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393))))
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 ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393))))
lola: processed formula length: 68
lola: 53 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: ((2 <= p392) OR (4 <= p1068))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 65 markings, 65 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: A (X (E (F ((5 <= p2394)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((5 <= p2394)))
lola: processed formula length: 20
lola: 50 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).
sara: place or transition ordering is non-deterministic

lola: 153274 markings, 218756 edges, 30655 markings/sec, 0 secs
lola: 370649 markings, 528599 edges, 43475 markings/sec, 5 secs
lola: 585642 markings, 835663 edges, 42999 markings/sec, 10 secs
lola: 796155 markings, 1136369 edges, 42103 markings/sec, 15 secs
lola: 1005796 markings, 1435889 edges, 41928 markings/sec, 20 secs
lola: 1217774 markings, 1738463 edges, 42396 markings/sec, 25 secs
lola: 1431884 markings, 2043610 edges, 42822 markings/sec, 30 secs
lola: 1645320 markings, 2348685 edges, 42687 markings/sec, 35 secs
lola: 1859638 markings, 2654344 edges, 42864 markings/sec, 40 secs
lola: 2073806 markings, 2960555 edges, 42834 markings/sec, 45 secs
lola: 2286921 markings, 3264678 edges, 42623 markings/sec, 50 secs
lola: 2500604 markings, 3569467 edges, 42737 markings/sec, 55 secs
lola: 2714758 markings, 3875563 edges, 42831 markings/sec, 60 secs
lola: 2929285 markings, 4181672 edges, 42905 markings/sec, 65 secs
lola: 3136534 markings, 4477985 edges, 41450 markings/sec, 70 secs
lola: 3324118 markings, 4745424 edges, 37517 markings/sec, 75 secs
lola: 3510934 markings, 5012229 edges, 37363 markings/sec, 80 secs
lola: 3692593 markings, 5271954 edges, 36332 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G ((((4 <= p2143) OR (3 <= p1108)) OR A (G ((p1874 <= 4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((4 <= p2143) OR (3 <= p1108)) OR AG((p1874 <= 4))))
lola: processed formula length: 57
lola: 50 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: 188962 markings, 269328 edges, 37792 markings/sec, 0 secs
lola: 385558 markings, 550202 edges, 39319 markings/sec, 5 secs
lola: 581144 markings, 829657 edges, 39117 markings/sec, 10 secs
lola: 775944 markings, 1107733 edges, 38960 markings/sec, 15 secs
lola: 968325 markings, 1382052 edges, 38476 markings/sec, 20 secs
lola: 1163076 markings, 1660140 edges, 38950 markings/sec, 25 secs
lola: 1357747 markings, 1938154 edges, 38934 markings/sec, 30 secs
lola: 1552319 markings, 2216067 edges, 38914 markings/sec, 35 secs
lola: 1745870 markings, 2492115 edges, 38710 markings/sec, 40 secs
lola: 1940005 markings, 2769029 edges, 38827 markings/sec, 45 secs
lola: 2134817 markings, 3047130 edges, 38962 markings/sec, 50 secs
lola: 2329392 markings, 3325012 edges, 38915 markings/sec, 55 secs
lola: 2523706 markings, 3602662 edges, 38863 markings/sec, 60 secs
lola: 2718632 markings, 3880927 edges, 38985 markings/sec, 65 secs
lola: 2912681 markings, 4158224 edges, 38810 markings/sec, 70 secs
lola: 3104165 markings, 4431657 edges, 38297 markings/sec, 75 secs
lola: 3253963 markings, 4645466 edges, 29960 markings/sec, 80 secs
lola: 3420568 markings, 4883247 edges, 33321 markings/sec, 85 secs
lola: 3593546 markings, 5129873 edges, 34596 markings/sec, 90 secs
lola: 3759143 markings, 5366412 edges, 33119 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p1377))) OR (A (((2 <= p336) U (2 <= p1342))) OR (((2 <= p2062) OR (1 <= p1262)) AND ((3 <= p1353) OR (3 <= p708)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG((2 <= p1377)) OR (A((2 <= p336) U (2 <= p1342)) OR (((2 <= p2062) OR (1 <= p1262)) AND ((3 <= p1353) OR (3 <= p708))))))
lola: processed formula length: 129
lola: 51 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: 84253 markings, 287027 edges, 16851 markings/sec, 0 secs
lola: 174594 markings, 597021 edges, 18068 markings/sec, 5 secs
lola: 265999 markings, 911110 edges, 18281 markings/sec, 10 secs
lola: 356466 markings, 1219664 edges, 18093 markings/sec, 15 secs
lola: 446946 markings, 1529755 edges, 18096 markings/sec, 20 secs
lola: 537048 markings, 1838096 edges, 18020 markings/sec, 25 secs
lola: 625031 markings, 2141942 edges, 17597 markings/sec, 30 secs
lola: 713296 markings, 2444876 edges, 17653 markings/sec, 35 secs
lola: 802978 markings, 2752023 edges, 17936 markings/sec, 40 secs
lola: 892946 markings, 3060233 edges, 17994 markings/sec, 45 secs
lola: 982874 markings, 3365679 edges, 17986 markings/sec, 50 secs
lola: 1073032 markings, 3675120 edges, 18032 markings/sec, 55 secs
lola: 1162623 markings, 3984366 edges, 17918 markings/sec, 60 secs
lola: 1252243 markings, 4292051 edges, 17924 markings/sec, 65 secs
lola: 1342336 markings, 4600732 edges, 18019 markings/sec, 70 secs
lola: 1432220 markings, 4908633 edges, 17977 markings/sec, 75 secs
lola: 1522282 markings, 5214264 edges, 18012 markings/sec, 80 secs
lola: 1611212 markings, 5522642 edges, 17786 markings/sec, 85 secs
lola: 1701067 markings, 5830425 edges, 17971 markings/sec, 90 secs
lola: 1790682 markings, 6137312 edges, 17923 markings/sec, 95 secs
lola: 1878367 markings, 6438090 edges, 17537 markings/sec, 100 secs
lola: 1967844 markings, 6744455 edges, 17895 markings/sec, 105 secs
lola: 2058201 markings, 7051479 edges, 18071 markings/sec, 110 secs
lola: 2147689 markings, 7360306 edges, 17898 markings/sec, 115 secs
lola: 2237181 markings, 7668087 edges, 17898 markings/sec, 120 secs
lola: 2327083 markings, 7976055 edges, 17980 markings/sec, 125 secs
lola: 2416907 markings, 8283732 edges, 17965 markings/sec, 130 secs
lola: 2507134 markings, 8591726 edges, 18045 markings/sec, 135 secs
lola: 2594724 markings, 8893332 edges, 17518 markings/sec, 140 secs
lola: 2681958 markings, 9192415 edges, 17447 markings/sec, 145 secs
lola: 2771616 markings, 9498166 edges, 17932 markings/sec, 150 secs
lola: 2861687 markings, 9806209 edges, 18014 markings/sec, 155 secs
lola: 2950739 markings, 10113967 edges, 17810 markings/sec, 160 secs
lola: 3040592 markings, 10421744 edges, 17971 markings/sec, 165 secs
lola: 3126584 markings, 10715206 edges, 17198 markings/sec, 170 secs
lola: 3199193 markings, 10963201 edges, 14522 markings/sec, 175 secs
lola: 3281179 markings, 11246538 edges, 16397 markings/sec, 180 secs
lola: 3342345 markings, 11452908 edges, 12233 markings/sec, 185 secs
lola: 3410163 markings, 11688725 edges, 13564 markings/sec, 190 secs
lola: 3478059 markings, 11919865 edges, 13579 markings/sec, 195 secs
lola: 3552323 markings, 12175825 edges, 14853 markings/sec, 200 secs
lola: 3604059 markings, 12353011 edges, 10347 markings/sec, 205 secs
lola: 3662212 markings, 12549841 edges, 11631 markings/sec, 210 secs
lola: 3708980 markings, 12712805 edges, 9354 markings/sec, 215 secs
lola: 3777350 markings, 12944369 edges, 13674 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((((p2162 <= 0) OR (p2407 <= 0) OR ((p1229 <= 4) AND (p1177 <= 0))) R (p768 <= 3)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p2162 <= 0) OR (p2407 <= 0) OR ((p1229 <= 4) AND (p1177 <= 0))) R (p768 <= 3)))
lola: processed formula length: 87
lola: 53 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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p768)
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.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 191987 markings, 273842 edges, 38397 markings/sec, 0 secs
lola: sara is running 5 secs || 395076 markings, 563489 edges, 40618 markings/sec, 5 secs
lola: sara is running 10 secs || 598684 markings, 854657 edges, 40722 markings/sec, 10 secs
lola: sara is running 15 secs || 802782 markings, 1145727 edges, 40820 markings/sec, 15 secs
lola: sara is running 20 secs || 1005880 markings, 1435972 edges, 40620 markings/sec, 20 secs
lola: sara is running 25 secs || 1209776 markings, 1726715 edges, 40779 markings/sec, 25 secs
lola: sara is running 30 secs || 1410980 markings, 2013752 edges, 40241 markings/sec, 30 secs
lola: sara is running 35 secs || 1614568 markings, 2304973 edges, 40718 markings/sec, 35 secs
lola: sara is running 40 secs || 1818286 markings, 2595285 edges, 40744 markings/sec, 40 secs
lola: sara is running 45 secs || 2020077 markings, 2883349 edges, 40358 markings/sec, 45 secs
lola: sara is running 50 secs || 2222973 markings, 3173356 edges, 40579 markings/sec, 50 secs
lola: sara is running 55 secs || 2425658 markings, 3462944 edges, 40537 markings/sec, 55 secs
lola: sara is running 60 secs || 2629399 markings, 3753353 edges, 40748 markings/sec, 60 secs
lola: sara is running 65 secs || 2831696 markings, 4042300 edges, 40459 markings/sec, 65 secs
lola: sara is running 70 secs || 3032270 markings, 4328503 edges, 40115 markings/sec, 70 secs
lola: sara is running 75 secs || 3209345 markings, 4581481 edges, 35415 markings/sec, 75 secs
lola: sara is running 80 secs || 3373250 markings, 4815329 edges, 32781 markings/sec, 80 secs
lola: sara is running 85 secs || 3538814 markings, 5052024 edges, 33113 markings/sec, 85 secs
lola: sara is running 90 secs || 3687734 markings, 5264406 edges, 29784 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G ((A (G ((5 <= p189))) OR ((1 <= p1092) OR ((1 <= p602) OR ((3 <= p2455) AND (3 <= p740))))))) OR (A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393)))) AND (A (G ((2 <= p2151))) OR ((5 <= p1294) OR ((p2080 <= 2) OR ((5 <= p2214) AND (5 <= p385)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393))))
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 ((((2 <= p392) OR (4 <= p1068)) U ((2 <= p816) AND (4 <= p393))))
lola: processed formula length: 68
lola: 53 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: ((2 <= p392) OR (4 <= p1068))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 65 markings, 65 edges
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((5 <= p189))) OR ((1 <= p1092) OR ((1 <= p602) OR ((3 <= p2455) AND (3 <= p740)))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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: G ((G ((5 <= p189)) OR ((1 <= p1092) OR ((1 <= p602) OR ((3 <= p2455) AND (3 <= p740))))))
lola: processed formula length: 90
lola: 50 rewrites
sara: try reading problem file CTLFireability-20-0.sara.
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic

lola: 173044 markings, 284688 edges, 34609 markings/sec, 0 secs
lola: 386978 markings, 637015 edges, 42787 markings/sec, 5 secs
lola: 609668 markings, 1003505 edges, 44538 markings/sec, 10 secs
lola: 828235 markings, 1363475 edges, 43713 markings/sec, 15 secs
lola: 1051324 markings, 1730667 edges, 44618 markings/sec, 20 secs
lola: 1270489 markings, 2091465 edges, 43833 markings/sec, 25 secs
lola: 1492023 markings, 2456269 edges, 44307 markings/sec, 30 secs
lola: 1712020 markings, 2818329 edges, 43999 markings/sec, 35 secs
lola: 1940771 markings, 3195118 edges, 45750 markings/sec, 40 secs
lola: 2168469 markings, 3569923 edges, 45540 markings/sec, 45 secs
lola: 2393670 markings, 3940616 edges, 45040 markings/sec, 50 secs
lola: 2620292 markings, 4313757 edges, 45324 markings/sec, 55 secs
lola: 2848701 markings, 4689711 edges, 45682 markings/sec, 60 secs
lola: 3070405 markings, 5054838 edges, 44341 markings/sec, 65 secs
lola: 3293762 markings, 5422691 edges, 44671 markings/sec, 70 secs
lola: 3519933 markings, 5794767 edges, 45234 markings/sec, 75 secs
lola: 3742691 markings, 6161658 edges, 44552 markings/sec, 80 secs
lola: 3964885 markings, 6527443 edges, 44439 markings/sec, 85 secs
lola: 4184904 markings, 6889642 edges, 44004 markings/sec, 90 secs
lola: 4406455 markings, 7254542 edges, 44310 markings/sec, 95 secs
lola: 4628786 markings, 7620551 edges, 44466 markings/sec, 100 secs
lola: 4854197 markings, 7991726 edges, 45082 markings/sec, 105 secs
lola: 5076852 markings, 8358300 edges, 44531 markings/sec, 110 secs
lola: 5288673 markings, 8706920 edges, 42364 markings/sec, 115 secs
lola: 5517960 markings, 9084377 edges, 45857 markings/sec, 120 secs
lola: 5736593 markings, 9444429 edges, 43727 markings/sec, 125 secs
lola: 5956201 markings, 9806008 edges, 43922 markings/sec, 130 secs
lola: 6176598 markings, 10168924 edges, 44079 markings/sec, 135 secs
lola: 6396305 markings, 10530656 edges, 43941 markings/sec, 140 secs
lola: 6617176 markings, 10894248 edges, 44174 markings/sec, 145 secs
lola: 6841274 markings, 11263124 edges, 44820 markings/sec, 150 secs
lola: 7065536 markings, 11632447 edges, 44852 markings/sec, 155 secs
lola: 7285353 markings, 11994277 edges, 43963 markings/sec, 160 secs
lola: 7509106 markings, 12362716 edges, 44751 markings/sec, 165 secs
lola: 7732493 markings, 12730423 edges, 44677 markings/sec, 170 secs
lola: 7958128 markings, 13101993 edges, 45127 markings/sec, 175 secs
lola: 8185277 markings, 13475927 edges, 45430 markings/sec, 180 secs
lola: 8412526 markings, 13850012 edges, 45450 markings/sec, 185 secs
lola: 8638023 markings, 14221163 edges, 45099 markings/sec, 190 secs
lola: 8864586 markings, 14594407 edges, 45313 markings/sec, 195 secs
lola: 9093348 markings, 14970944 edges, 45752 markings/sec, 200 secs
lola: 9320174 markings, 15344393 edges, 45365 markings/sec, 205 secs
lola: 9544783 markings, 15714011 edges, 44922 markings/sec, 210 secs
lola: 9769283 markings, 16083872 edges, 44900 markings/sec, 215 secs
lola: 9992498 markings, 16451250 edges, 44643 markings/sec, 220 secs
lola: 10214349 markings, 16816589 edges, 44370 markings/sec, 225 secs
lola: 10442652 markings, 17192277 edges, 45661 markings/sec, 230 secs
lola: 10669469 markings, 17565790 edges, 45363 markings/sec, 235 secs
lola: 10891468 markings, 17931315 edges, 44400 markings/sec, 240 secs
lola: 11117646 markings, 18303725 edges, 45236 markings/sec, 245 secs
lola: 11341540 markings, 18672314 edges, 44779 markings/sec, 250 secs
lola: 11566415 markings, 19042611 edges, 44975 markings/sec, 255 secs
lola: 11792200 markings, 19414277 edges, 45157 markings/sec, 260 secs
lola: 12002743 markings, 19760937 edges, 42109 markings/sec, 265 secs
lola: 12201561 markings, 20088200 edges, 39764 markings/sec, 270 secs
lola: 12408678 markings, 20429149 edges, 41423 markings/sec, 275 secs
lola: 12611548 markings, 20763183 edges, 40574 markings/sec, 280 secs
lola: 12820829 markings, 21107843 edges, 41856 markings/sec, 285 secs
lola: 13029302 markings, 21450851 edges, 41695 markings/sec, 290 secs
lola: 13224230 markings, 21772117 edges, 38986 markings/sec, 295 secs
lola: 13436160 markings, 22121136 edges, 42386 markings/sec, 300 secs
lola: 13648785 markings, 22471210 edges, 42525 markings/sec, 305 secs
lola: 13860897 markings, 22820126 edges, 42422 markings/sec, 310 secs
lola: 14072242 markings, 23168147 edges, 42269 markings/sec, 315 secs
lola: 14283840 markings, 23516624 edges, 42320 markings/sec, 320 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: RESULT
lola:
SUMMARY: no unknown yes yes unknown yes unknown no yes no no unknown no yes no unknown
lola:
preliminary result: no unknown yes yes unknown yes unknown no yes no no unknown no yes no unknown
lola: memory consumption: 3828 KB
lola: time consumption: 1703 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-0500"
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-0500, 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-158987928600452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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