Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.0M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D30N150-00
FORMULA_NAME Diffusion2D-PT-D30N150-01
FORMULA_NAME Diffusion2D-PT-D30N150-02
FORMULA_NAME Diffusion2D-PT-D30N150-03
FORMULA_NAME Diffusion2D-PT-D30N150-04
FORMULA_NAME Diffusion2D-PT-D30N150-05
FORMULA_NAME Diffusion2D-PT-D30N150-06
FORMULA_NAME Diffusion2D-PT-D30N150-07
FORMULA_NAME Diffusion2D-PT-D30N150-08
FORMULA_NAME Diffusion2D-PT-D30N150-09
FORMULA_NAME Diffusion2D-PT-D30N150-10
FORMULA_NAME Diffusion2D-PT-D30N150-11
FORMULA_NAME Diffusion2D-PT-D30N150-12
FORMULA_NAME Diffusion2D-PT-D30N150-13
FORMULA_NAME Diffusion2D-PT-D30N150-14
FORMULA_NAME Diffusion2D-PT-D30N150-15

=== Now, execution of the tool begins

BK_START 1620729871243

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 10:44:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-11 10:44:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 10:44:33] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2021-05-11 10:44:33] [INFO ] Transformed 900 places.
[2021-05-11 10:44:33] [INFO ] Transformed 6844 transitions.
[2021-05-11 10:44:33] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 58 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100045 steps, including 0 resets, run finished after 80 ms. (steps per millisecond=1250 ) properties seen :[1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 6844 rows 900 cols
[2021-05-11 10:44:33] [INFO ] Computed 1 place invariants in 64 ms
[2021-05-11 10:44:33] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2021-05-11 10:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:44:40] [INFO ] [Real]Absence check using state equation in 6952 ms returned sat
[2021-05-11 10:44:41] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 458 ms.
[2021-05-11 10:44:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:44:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 37 ms returned sat
[2021-05-11 10:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:44:49] [INFO ] [Nat]Absence check using state equation in 7248 ms returned sat
[2021-05-11 10:44:50] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 416 ms.
[2021-05-11 10:45:02] [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 (=> (> t153 0) (or (and (> t142 0) (< o142 o153)) (and (> t157 0) (< o157 o153)) (and (> t377 0) (< o377 o153)) (and (> t384 0) (< o384 o153)) (and (> t391 0) (< o391 o153)) (and (> t6753 0) (< o6753 o153)) (and (> t6760 0) (< o6760 o153)) (and (> t6767 0) (< o6767 o153))))") while checking expression at index 0
[2021-05-11 10:45:02] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:45:09] [INFO ] [Real]Absence check using state equation in 7197 ms returned sat
[2021-05-11 10:45:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 386 ms.
[2021-05-11 10:45:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:45:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:45:17] [INFO ] [Nat]Absence check using state equation in 7087 ms returned sat
[2021-05-11 10:45:18] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 343 ms.
[2021-05-11 10:45:30] [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 (=> (> t161 0) (or (and (> t150 0) (< o150 o161)) (and (> t173 0) (< o173 o161)) (and (> t385 0) (< o385 o161)) (and (> t392 0) (< o392 o161)) (and (> t407 0) (< o407 o161)) (and (> t6761 0) (< o6761 o161)) (and (> t6768 0) (< o6768 o161)) (and (> t6783 0) (< o6783 o161))))") while checking expression at index 1
[2021-05-11 10:45:30] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:45:37] [INFO ] [Real]Absence check using state equation in 7040 ms returned sat
[2021-05-11 10:45:38] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 321 ms.
[2021-05-11 10:45:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:45:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:45:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:45:46] [INFO ] [Nat]Absence check using state equation in 7291 ms returned sat
[2021-05-11 10:45:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 317 ms.
[2021-05-11 10:45:58] [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 (=> (> t169 0) (or (and (> t80 0) (< o80 o169)) (and (> t178 0) (< o178 o169)) (and (> t315 0) (< o315 o169)) (and (> t400 0) (< o400 o169)) (and (> t412 0) (< o412 o169)) (and (> t6691 0) (< o6691 o169)) (and (> t6776 0) (< o6776 o169)) (and (> t6788 0) (< o6788 o169))))") while checking expression at index 2
[2021-05-11 10:45:58] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:46:06] [INFO ] [Real]Absence check using state equation in 7148 ms returned sat
[2021-05-11 10:46:06] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 359 ms.
[2021-05-11 10:46:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:46:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:46:14] [INFO ] [Nat]Absence check using state equation in 6980 ms returned sat
[2021-05-11 10:46:14] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 322 ms.
[2021-05-11 10:46:27] [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 (=> (> t182 0) (or (and (> t166 0) (< o166 o182)) (and (> t186 0) (< o186 o182)) (and (> t401 0) (< o401 o182)) (and (> t413 0) (< o413 o182)) (and (> t420 0) (< o420 o182)) (and (> t6777 0) (< o6777 o182)) (and (> t6789 0) (< o6789 o182)) (and (> t6796 0) (< o6796 o182))))") while checking expression at index 3
[2021-05-11 10:46:27] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:46:34] [INFO ] [Real]Absence check using state equation in 7262 ms returned sat
[2021-05-11 10:46:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 316 ms.
[2021-05-11 10:46:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:46:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:46:42] [INFO ] [Nat]Absence check using state equation in 6845 ms returned sat
[2021-05-11 10:46:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 326 ms.
[2021-05-11 10:46:55] [INFO ] Added : 285 causal constraints over 57 iterations in 12962 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:46:55] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:47:02] [INFO ] [Real]Absence check using state equation in 7048 ms returned sat
[2021-05-11 10:47:03] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 276 ms.
[2021-05-11 10:47:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:47:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:47:10] [INFO ] [Nat]Absence check using state equation in 6661 ms returned sat
[2021-05-11 10:47:11] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 364 ms.
[2021-05-11 10:47:23] [INFO ] Added : 280 causal constraints over 56 iterations in 13184 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:47:23] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:47:31] [INFO ] [Real]Absence check using state equation in 7080 ms returned sat
[2021-05-11 10:47:31] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 415 ms.
[2021-05-11 10:47:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:47:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:47:38] [INFO ] [Nat]Absence check using state equation in 6481 ms returned sat
[2021-05-11 10:47:39] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 362 ms.
[2021-05-11 10:47:52] [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 (=> (> t189 0) (or (and (> t179 0) (< o179 o189)) (and (> t194 0) (< o194 o189)) (and (> t414 0) (< o414 o189)) (and (> t421 0) (< o421 o189)) (and (> t428 0) (< o428 o189)) (and (> t6790 0) (< o6790 o189)) (and (> t6797 0) (< o6797 o189)) (and (> t6804 0) (< o6804 o189))))") while checking expression at index 6
[2021-05-11 10:47:52] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:47:59] [INFO ] [Real]Absence check using state equation in 7168 ms returned sat
[2021-05-11 10:48:00] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 315 ms.
[2021-05-11 10:48:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:48:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2021-05-11 10:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:48:07] [INFO ] [Nat]Absence check using state equation in 6739 ms returned sat
[2021-05-11 10:48:08] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 324 ms.
[2021-05-11 10:48:20] [INFO ] Added : 280 causal constraints over 56 iterations in 13060 ms. Result :unknown
[2021-05-11 10:48:20] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:48:28] [INFO ] [Real]Absence check using state equation in 7461 ms returned sat
[2021-05-11 10:48:28] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 317 ms.
[2021-05-11 10:48:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:48:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:48:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:48:36] [INFO ] [Nat]Absence check using state equation in 6798 ms returned sat
[2021-05-11 10:48:36] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 321 ms.
[2021-05-11 10:48:49] [INFO ] Added : 285 causal constraints over 57 iterations in 13012 ms. Result :unknown
[2021-05-11 10:48:49] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:48:56] [INFO ] [Real]Absence check using state equation in 7229 ms returned sat
[2021-05-11 10:48:57] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 378 ms.
[2021-05-11 10:48:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:48:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:49:04] [INFO ] [Nat]Absence check using state equation in 6682 ms returned sat
[2021-05-11 10:49:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 333 ms.
[2021-05-11 10:49:17] [INFO ] Added : 275 causal constraints over 55 iterations in 13122 ms. Result :unknown
[2021-05-11 10:49:17] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:49:25] [INFO ] [Real]Absence check using state equation in 7276 ms returned sat
[2021-05-11 10:49:25] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 325 ms.
[2021-05-11 10:49:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:49:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:49:33] [INFO ] [Nat]Absence check using state equation in 6961 ms returned sat
[2021-05-11 10:49:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 322 ms.
[2021-05-11 10:49:46] [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 (=> (> t430 0) (or (and (> t190 0) (< o190 o430)) (and (> t197 0) (< o197 o430)) (and (> t204 0) (< o204 o430)) (and (> t424 0) (< o424 o430)) (and (> t439 0) (< o439 o430)) (and (> t656 0) (< o656 o430)) (and (> t663 0) (< o663 o430)) (and (> t670 0) (< o670 o430))))") while checking expression at index 10
[2021-05-11 10:49:46] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:49:53] [INFO ] [Real]Absence check using state equation in 7287 ms returned sat
[2021-05-11 10:49:54] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 315 ms.
[2021-05-11 10:49:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:49:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:50:01] [INFO ] [Nat]Absence check using state equation in 6877 ms returned sat
[2021-05-11 10:50:02] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 317 ms.
[2021-05-11 10:50:14] [INFO ] Added : 280 causal constraints over 56 iterations in 12933 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:50:14] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:50:21] [INFO ] [Real]Absence check using state equation in 7141 ms returned sat
[2021-05-11 10:50:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 316 ms.
[2021-05-11 10:50:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:50:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:50:29] [INFO ] [Nat]Absence check using state equation in 6771 ms returned sat
[2021-05-11 10:50:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 322 ms.
[2021-05-11 10:50:42] [INFO ] Added : 285 causal constraints over 57 iterations in 13053 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:50:43] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:50:49] [INFO ] [Real]Absence check using state equation in 6455 ms returned sat
[2021-05-11 10:50:50] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 347 ms.
[2021-05-11 10:50:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:50:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:50:57] [INFO ] [Nat]Absence check using state equation in 6641 ms returned sat
[2021-05-11 10:50:57] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 297 ms.
[2021-05-11 10:51:10] [INFO ] Added : 290 causal constraints over 58 iterations in 13170 ms. Result :unknown
[2021-05-11 10:51:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-11 10:51:11] [INFO ] Flatten gal took : 337 ms
FORMULA Diffusion2D-PT-D30N150-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 10:51:11] [INFO ] Flatten gal took : 167 ms
[2021-05-11 10:51:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-11 10:51:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 40 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Diffusion2D-PT-D30N150 @ 3570 seconds

FORMULA Diffusion2D-PT-D30N150-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N150-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3509
rslt: Output for LTLFireability @ Diffusion2D-PT-D30N150

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 11 10:51:12 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"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": "(p218 <= 0)",
"processed_size": 11,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 440
},
"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": "(p732 <= 0)",
"processed_size": 11,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((p527 <= 0))",
"processed_size": 15,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1175
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G ((p385 <= 0))",
"processed_size": 15,
"rewrites": 86
},
"result":
{
"edges": 318744,
"markings": 137906,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((p411 <= 0)) OR ((p571 <= 0) AND (p411 <= 0)))))",
"processed_size": 58,
"rewrites": 86
},
"result":
{
"edges": 1188272,
"markings": 399787,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((1 <= p587)) AND (1 <= p780))))",
"processed_size": 41,
"rewrites": 86
},
"result":
{
"edges": 621,
"markings": 621,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 73336,
"runtime": 61.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) OR (** U **))) : (** OR (G(F((G(**) AND **))) AND F(**))) : ((X((* AND (F(*) OR G(*)))) OR F(**)) AND (F(*) OR **)) : F((G((F(**) OR X(F(**)))) AND X(X(*)))) : X((F(**) AND G(**))) : G(F((G(*) OR (* AND *)))) : G(*) : F((X((F(**) AND *)) AND (G(**) OR **))) : (F(*) AND ((* R X(**)) AND **)) : F(**) : (X(**) U **) : X(((** U G(**)) U (X(G(**)) OR **))) : (X(*) AND G((X(X(F(**))) OR (** U **))))"
},
"net":
{
"arcs": 13688,
"conflict_clusters": 900,
"places": 900,
"places_significant": 899,
"singleton_clusters": 0,
"transitions": 6844
},
"result":
{
"preliminary_value": "no no yes no no no no no no no no no no ",
"value": "no no yes no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 7744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 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 LTLFireability.xml
lola: X ((G ((p19 <= 0)) OR ((p322 <= 0) U ((1 <= p19) AND (1 <= p354))))) : (X (G (F (X ((G ((1 <= p587)) AND (1 <= p780)))))) U (1 <= p587)) : ((NOT(X ((G ((1 <= p478)) U (1 <= p436)))) OR F ((1 <= p218))) AND (NOT(G ((1 <= p305))) OR (p218 <= 0))) : F ((G ((F ((1 <= p86)) OR F (X ((1 <= p898))))) AND NOT(X (X ((1 <= p176)))))) : (F (X ((1 <= p653))) AND NOT(F (NOT(X ((1 <= p161)))))) : NOT(G (NOT(F (NOT(F (G (X (((1 <= p571) U (1 <= p411)))))))))) : NOT(((F (X (F (X (X ((1 <= p837)))))) U (1 <= p385)) U F ((X ((1 <= p88)) U (1 <= p385))))) : F (((F (X (F ((1 <= p743)))) AND NOT(X ((1 <= p409)))) AND (G ((1 <= p743)) OR (1 <= p796)))) : ((NOT(G ((1 <= p273))) AND NOT(((1 <= p273) U NOT(X ((1 <= p732)))))) AND (p732 <= 0)) : F ((1 <= p685)) : (X ((1 <= p393)) U (1 <= p134)) : X ((((1 <= p668) U G ((1 <= p69))) U (G (X ((1 <= p668))) OR (1 <= p815)))) : (NOT(X ((1 <= p527))) AND G ((X (X (F ((1 <= p527)))) OR ((1 <= p139) U (1 <= p586)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p19 <= 0)) OR ((p322 <= 0) U ((1 <= p19) AND (1 <= p354)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p19 <= 0)) OR ((p322 <= 0) U ((1 <= p19) AND (1 <= p354)))))
lola: processed formula length: 68
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 153295 markings, 550135 edges, 30659 markings/sec, 0 secs
lola: 289698 markings, 1118211 edges, 27281 markings/sec, 5 secs
lola: 429105 markings, 1698588 edges, 27881 markings/sec, 10 secs
lola: 560296 markings, 2240823 edges, 26238 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 616316 markings, 2467107 edges
lola: ========================================
lola: subprocess 1 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((p436 <= 0) AND (F ((p478 <= 0)) OR G ((p436 <= 0))))) OR F ((1 <= p218))) AND (F ((p305 <= 0)) OR (p218 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p218))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p218 <= 0)
lola: processed formula length: 11
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 618 markings, 618 edges
lola: ========================================
lola: subprocess 2 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p218 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p218 <= 0)
lola: processed formula length: 11
lola: 86 rewrites
lola: closed formula file LTLFireability.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 3 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p436 <= 0) AND (F ((p478 <= 0)) OR G ((p436 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p436 <= 0) AND (F ((p478 <= 0)) OR G ((p436 <= 0)))))
lola: processed formula length: 58
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((1 <= p86)) OR X (F ((1 <= p898))))) AND X (X ((p176 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((1 <= p86)) OR X (F ((1 <= p898))))) AND X (X ((p176 <= 0)))))
lola: processed formula length: 73
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2300 markings, 2300 edges
lola: ========================================
lola: subprocess 3 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p653)) AND G ((1 <= p161))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p653)) AND G ((1 <= p161))))
lola: processed formula length: 41
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2251 markings, 2251 edges
lola: ========================================
lola: subprocess 4 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((F ((1 <= p743)) AND (p409 <= 0))) AND (G ((1 <= p743)) OR (1 <= p796))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((F ((1 <= p743)) AND (p409 <= 0))) AND (G ((1 <= p743)) OR (1 <= p796))))
lola: processed formula length: 80
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2252 markings, 2252 edges
lola: ========================================
lola: subprocess 5 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p273 <= 0)) AND (((p273 <= 0) R X ((1 <= p732))) AND (p732 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p732 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p732 <= 0)
lola: processed formula length: 11
lola: 86 rewrites
lola: closed formula file LTLFireability.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 6 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p273 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p273)
lola: processed formula length: 11
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p273 <= 0) R X ((1 <= p732)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p273 <= 0) R X ((1 <= p732)))
lola: processed formula length: 31
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2251 markings, 2251 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p393)) U (1 <= p134))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((1 <= p393)) U (1 <= p134))
lola: processed formula length: 31
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2251 markings, 2251 edges
lola: ========================================
lola: subprocess 7 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p668) U G ((1 <= p69))) U (X (G ((1 <= p668))) OR (1 <= p815))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p668) U G ((1 <= p69))) U (X (G ((1 <= p668))) OR (1 <= p815))))
lola: processed formula length: 75
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2251 markings, 2251 edges
lola: ========================================
lola: subprocess 8 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p527 <= 0)) AND G ((X (X (F ((1 <= p527)))) OR ((1 <= p139) U (1 <= p586)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p527 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p527 <= 0))
lola: processed formula length: 15
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F ((1 <= p527)))) OR ((1 <= p139) U (1 <= p586))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F ((1 <= p527)))) OR ((1 <= p139) U (1 <= p586))))
lola: processed formula length: 60
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2252 markings, 2252 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p685))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p685 <= 0)
lola: processed formula length: 11
lola: 88 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 618 markings, 618 edges
lola: ========================================
lola: subprocess 10 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p385 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p385 <= 0))
lola: processed formula length: 15
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 137906 markings, 318744 edges
lola: ========================================
lola: subprocess 11 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p411 <= 0)) OR ((p571 <= 0) AND (p411 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p411 <= 0)) OR ((p571 <= 0) AND (p411 <= 0)))))
lola: processed formula length: 58
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 179074 markings, 454877 edges, 35815 markings/sec, 0 secs
lola: 318527 markings, 901410 edges, 27891 markings/sec, 5 secs
lola: add low 3824
lola: add low 3078
lola: add low 2324
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 399787 markings, 1188272 edges
lola: ========================================
lola: subprocess 12 will run for 3509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p587) OR (G (F ((G ((1 <= p587)) AND (1 <= p780)))) AND F ((1 <= p587))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p587)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p587)
lola: processed formula length: 11
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p587)) AND (1 <= p780))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p587)) AND (1 <= p780))))
lola: processed formula length: 41
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 621 markings, 621 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no no no
lola:
preliminary result: no no yes no no no no no no no no no no
lola: memory consumption: 73336 KB
lola: time consumption: 61 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="Diffusion2D-PT-D30N150"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is Diffusion2D-PT-D30N150, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-tall-162048902300082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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