Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882400482.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is Diffusion2D-PT-D20N150, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882400482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.3K Mar 31 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 29 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 22:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591222465414

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:14:26] [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]
[2020-06-03 22:14:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:14:27] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2020-06-03 22:14:27] [INFO ] Transformed 400 places.
[2020-06-03 22:14:27] [INFO ] Transformed 2964 transitions.
[2020-06-03 22:14:27] [INFO ] Parsed PT model containing 400 places and 2964 transitions in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100003 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=2564 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 2964 rows 400 cols
[2020-06-03 22:14:27] [INFO ] Computed 1 place invariants in 25 ms
[2020-06-03 22:14:27] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 22:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:14:28] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2020-06-03 22:14:29] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 229 ms.
[2020-06-03 22:14:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:14:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2020-06-03 22:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:14:31] [INFO ] [Nat]Absence check using state equation in 1479 ms returned sat
[2020-06-03 22:14:31] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 179 ms.
[2020-06-03 22:14:49] [INFO ] Added : 440 causal constraints over 88 iterations in 18352 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:14:49] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2020-06-03 22:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:14:51] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2020-06-03 22:14:51] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 204 ms.
[2020-06-03 22:14:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:14:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 22:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:14:53] [INFO ] [Nat]Absence check using state equation in 1563 ms returned sat
[2020-06-03 22:14:53] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 207 ms.
[2020-06-03 22:15:11] [INFO ] Added : 440 causal constraints over 88 iterations in 18283 ms. Result :unknown
[2020-06-03 22:15:12] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2020-06-03 22:15:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:15:13] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2020-06-03 22:15:13] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 175 ms.
[2020-06-03 22:15:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:15:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 24 ms returned sat
[2020-06-03 22:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:15:15] [INFO ] [Nat]Absence check using state equation in 1351 ms returned sat
[2020-06-03 22:15:15] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 179 ms.
[2020-06-03 22:15:34] [INFO ] Added : 425 causal constraints over 85 iterations in 18514 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:15:34] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2020-06-03 22:15:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:15:35] [INFO ] [Real]Absence check using state equation in 1630 ms returned sat
[2020-06-03 22:15:36] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 181 ms.
[2020-06-03 22:15:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:15:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2020-06-03 22:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:15:38] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2020-06-03 22:15:38] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 238 ms.
[2020-06-03 22:15:56] [INFO ] Added : 460 causal constraints over 92 iterations in 18533 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:15:56] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:15:58] [INFO ] [Real]Absence check using state equation in 1424 ms returned sat
[2020-06-03 22:15:58] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 182 ms.
[2020-06-03 22:15:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:15:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 22:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:16:00] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2020-06-03 22:16:00] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 181 ms.
[2020-06-03 22:16:18] [INFO ] Added : 460 causal constraints over 92 iterations in 18616 ms. Result :unknown
[2020-06-03 22:16:18] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:16:20] [INFO ] [Real]Absence check using state equation in 1602 ms returned sat
[2020-06-03 22:16:20] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 138 ms.
[2020-06-03 22:16:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:16:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 22:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:16:22] [INFO ] [Nat]Absence check using state equation in 1623 ms returned sat
[2020-06-03 22:16:22] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 175 ms.
[2020-06-03 22:16:41] [INFO ] Added : 455 causal constraints over 91 iterations in 18261 ms. Result :unknown
[2020-06-03 22:16:41] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 22:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:16:42] [INFO ] [Real]Absence check using state equation in 1543 ms returned sat
[2020-06-03 22:16:42] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 168 ms.
[2020-06-03 22:16:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:16:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 22:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:16:44] [INFO ] [Nat]Absence check using state equation in 1445 ms returned sat
[2020-06-03 22:16:45] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 200 ms.
[2020-06-03 22:17:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t563 0) (or (and (> t405 0) (< o405 o563)) (and (> t412 0) (< o412 o563)) (and (> t419 0) (< o419 o563)) (and (> t556 0) (< o556 o563)) (and (> t571 0) (< o571 o563)) (and (> t708 0) (< o708 o563)) (and (> t715 0) (< o715 o563)) (and (> t722 0) (< o722 o563))))") while checking expression at index 6
[2020-06-03 22:17:03] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:17:04] [INFO ] [Real]Absence check using state equation in 1540 ms returned sat
[2020-06-03 22:17:05] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 160 ms.
[2020-06-03 22:17:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:17:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2020-06-03 22:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:17:07] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2020-06-03 22:17:07] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 144 ms.
[2020-06-03 22:17:25] [INFO ] Added : 450 causal constraints over 90 iterations in 18209 ms. Result :unknown
[2020-06-03 22:17:25] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2020-06-03 22:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:17:27] [INFO ] [Real]Absence check using state equation in 1386 ms returned sat
[2020-06-03 22:17:27] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 199 ms.
[2020-06-03 22:17:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:17:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 22:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:17:29] [INFO ] [Nat]Absence check using state equation in 1656 ms returned sat
[2020-06-03 22:17:29] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 152 ms.
[2020-06-03 22:17:47] [INFO ] Added : 450 causal constraints over 90 iterations in 18228 ms. Result :unknown
[2020-06-03 22:17:47] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2020-06-03 22:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:17:49] [INFO ] [Real]Absence check using state equation in 1434 ms returned sat
[2020-06-03 22:17:49] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 133 ms.
[2020-06-03 22:17:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:17:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2020-06-03 22:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:17:51] [INFO ] [Nat]Absence check using state equation in 1383 ms returned sat
[2020-06-03 22:17:51] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 139 ms.
[2020-06-03 22:18:09] [INFO ] Added : 510 causal constraints over 102 iterations in 18503 ms. Result :unknown
[2020-06-03 22:18:09] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2020-06-03 22:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:18:11] [INFO ] [Real]Absence check using state equation in 1382 ms returned sat
[2020-06-03 22:18:11] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 194 ms.
[2020-06-03 22:18:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:18:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2020-06-03 22:18:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:18:13] [INFO ] [Nat]Absence check using state equation in 1387 ms returned sat
[2020-06-03 22:18:13] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 196 ms.
[2020-06-03 22:18:31] [INFO ] Added : 455 causal constraints over 91 iterations in 18496 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:18:31] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:18:33] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2020-06-03 22:18:33] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 180 ms.
[2020-06-03 22:18:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:18:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2020-06-03 22:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:18:35] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2020-06-03 22:18:35] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 178 ms.
[2020-06-03 22:18:54] [INFO ] Added : 495 causal constraints over 99 iterations in 18508 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:18:54] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2020-06-03 22:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:18:55] [INFO ] [Real]Absence check using state equation in 1431 ms returned sat
[2020-06-03 22:18:55] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 203 ms.
[2020-06-03 22:18:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:18:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2020-06-03 22:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:18:57] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2020-06-03 22:18:58] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 197 ms.
[2020-06-03 22:19:16] [INFO ] Added : 445 causal constraints over 89 iterations in 18389 ms. Result :unknown
[2020-06-03 22:19:16] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2020-06-03 22:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:19:17] [INFO ] [Real]Absence check using state equation in 1498 ms returned sat
[2020-06-03 22:19:18] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 196 ms.
[2020-06-03 22:19:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:19:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 24 ms returned sat
[2020-06-03 22:19:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:19:20] [INFO ] [Nat]Absence check using state equation in 1639 ms returned sat
[2020-06-03 22:19:20] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 175 ms.
[2020-06-03 22:19:38] [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 (=> (> t600 0) (or (and (> t445 0) (< o445 o600)) (and (> t452 0) (< o452 o600)) (and (> t460 0) (< o460 o600)) (and (> t596 0) (< o596 o600)) (and (> t612 0) (< o612 o600)) (and (> t748 0) (< o748 o600)) (and (> t755 0) (< o755 o600)) (and (> t763 0) (< o763 o600))))") while checking expression at index 13
[2020-06-03 22:19:38] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 22:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:19:40] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2020-06-03 22:19:40] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 224 ms.
[2020-06-03 22:19:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:19:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2020-06-03 22:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:19:43] [INFO ] [Nat]Absence check using state equation in 2750 ms returned sat
[2020-06-03 22:19:44] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 240 ms.
[2020-06-03 22:20:00] [INFO ] Added : 415 causal constraints over 83 iterations in 17105 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:20:00] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2020-06-03 22:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:20:02] [INFO ] [Real]Absence check using state equation in 1848 ms returned sat
[2020-06-03 22:20:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 203 ms.
[2020-06-03 22:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:20:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 31 ms returned sat
[2020-06-03 22:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:20:06] [INFO ] [Nat]Absence check using state equation in 2924 ms returned sat
[2020-06-03 22:20:06] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 206 ms.
[2020-06-03 22:20:23] [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 (=> (> t437 0) (or (and (> t275 0) (< o275 o437)) (and (> t282 0) (< o282 o437)) (and (> t289 0) (< o289 o437)) (and (> t426 0) (< o426 o437)) (and (> t441 0) (< o441 o437)) (and (> t578 0) (< o578 o437)) (and (> t585 0) (< o585 o437)) (and (> t592 0) (< o592 o437))))") while checking expression at index 15
[2020-06-03 22:20:24] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 22:20:24] [INFO ] Flatten gal took : 228 ms
FORMULA Diffusion2D-PT-D20N150-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N150-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N150-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N150-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N150-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:20:24] [INFO ] Flatten gal took : 108 ms
[2020-06-03 22:20:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2020-06-03 22:20:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 31 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Diffusion2D-PT-D20N150 @ 3570 seconds

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

FORMULA Diffusion2D-PT-D20N150-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Diffusion2D-PT-D20N150-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Diffusion2D-PT-D20N150-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D20N150-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Diffusion2D-PT-D20N150-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for LTLFireability @ Diffusion2D-PT-D20N150

{
"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": "Wed Jun 3 22:20:24 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((p53 <= 0)))",
"processed_size": 18,
"rewrites": 77
},
"result":
{
"edges": 137078,
"markings": 36701,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p113))",
"processed_size": 15,
"rewrites": 77
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((1 <= p26))",
"processed_size": 14,
"rewrites": 77
},
"result":
{
"edges": 607,
"markings": 607,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((1 <= p68) U G ((G ((p17 <= 0)) AND X ((p188 <= 0))))))",
"processed_size": 59,
"rewrites": 77
},
"result":
{
"edges": 698305,
"markings": 183969,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p66) OR (1 <= p363)) U (X (X (X (F ((1 <= p66))))) OR (1 <= p295)))",
"processed_size": 76,
"rewrites": 77
},
"result":
{
"edges": 607,
"markings": 607,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((G ((1 <= p233)) OR ((p395 <= 0) AND ((F ((1 <= p292)) OR G ((p395 <= 0))) AND (1 <= p233))))))",
"processed_size": 101,
"rewrites": 77
},
"result":
{
"edges": 607,
"markings": 607,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((X ((p370 <= 0)) U (X ((1 <= p48)) OR (1 <= p370))))",
"processed_size": 55,
"rewrites": 77
},
"result":
{
"edges": 1213,
"markings": 1212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G ((p107 <= 0)) OR (p346 <= 0)))",
"processed_size": 36,
"rewrites": 77
},
"result":
{
"edges": 352173,
"markings": 123862,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p325) OR ((G ((F ((1 <= p325)) AND ((1 <= p181) OR (1 <= p325)))) AND F ((1 <= p325))) OR (1 <= p47)))))",
"processed_size": 117,
"rewrites": 77
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 8,
"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": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((((G ((1 <= p161)) OR (1 <= p234)) U G ((1 <= p314))) AND (F ((1 <= p161)) AND (p153 <= 0))))",
"processed_size": 96,
"rewrites": 77
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"compoundnumber": 9,
"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": 3559
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p87)))",
"processed_size": 18,
"rewrites": 77
},
"result":
{
"edges": 3,
"markings": 3,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 36644,
"runtime": 11.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(*)) : (X(**) OR (G(**) AND X(F(**)))) : (((F(**) OR **) U G(**)) AND G(F(**))) : F(G((** OR ((G((F(**) AND (** OR **))) AND F(**)) OR *)))) : X((** U G((G(*) AND X(*))))) : F((((G(**) OR **) U G(**)) AND (F(*) AND **))) : G((G(*) OR *)) : (** U (X(X(X(F(**)))) OR **)) : X(F((G(*) OR (* AND ((F(**) OR G(*)) AND *))))) : G(F(**)) : X((X(*) U (X(**) OR **)))"
},
"net":
{
"arcs": 5928,
"conflict_clusters": 400,
"places": 400,
"places_significant": 399,
"singleton_clusters": 0,
"transitions": 2964
},
"result":
{
"preliminary_value": "no no no no no no no no no no no ",
"value": "no 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: 3364/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12800
lola: finding significant places
lola: 400 places, 2964 transitions, 399 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: NOT(F (X ((1 <= p53)))) : (G ((1 <= p113)) U X ((1 <= p26))) : (((F ((1 <= p249)) OR (1 <= p87)) U G ((1 <= p285))) AND G (F ((1 <= p87)))) : G (F (X (NOT(F ((NOT((G (((1 <= p181) U (1 <= p325))) U (1 <= p325))) AND (p47 <= 0))))))) : X (((1 <= p68) U G ((NOT((F ((1 <= p182)) U F ((1 <= p17)))) AND NOT(X ((1 <= p188))))))) : F (((((G ((1 <= p161)) OR (1 <= p234)) U G ((1 <= p314))) AND NOT(G ((p161 <= 0)))) AND (p153 <= 0))) : NOT(F ((F ((1 <= p107)) AND (1 <= p346)))) : (((1 <= p66) OR (1 <= p363)) U (X (X (X (F ((1 <= p66))))) OR (1 <= p295))) : NOT(G (X (((NOT(F ((1 <= p292))) U (1 <= p395)) U (p233 <= 0))))) : F (G (F ((1 <= p332)))) : X ((NOT(X ((1 <= p370))) U (X ((1 <= p48)) OR (1 <= p370))))
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:335
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p53 <= 0)))
lola: processed formula length: 18
lola: 77 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: 36701 markings, 137078 edges
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p26)) OR (G ((1 <= p113)) AND X (F ((1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p113))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p113))
lola: processed formula length: 15
lola: 77 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p26))
lola: processed formula length: 14
lola: 77 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: 607 markings, 607 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p68) U G ((G ((p17 <= 0)) AND X ((p188 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p68) U G ((G ((p17 <= 0)) AND X ((p188 <= 0))))))
lola: processed formula length: 59
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 183969 markings, 698305 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p66) OR (1 <= p363)) U (X (X (X (F ((1 <= p66))))) OR (1 <= p295)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p66) OR (1 <= p363)) U (X (X (X (F ((1 <= p66))))) OR (1 <= p295)))
lola: processed formula length: 76
lola: 77 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: 607 markings, 607 edges
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((1 <= p233)) OR ((p395 <= 0) AND ((F ((1 <= p292)) OR G ((p395 <= 0))) AND (1 <= p233))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((1 <= p233)) OR ((p395 <= 0) AND ((F ((1 <= p292)) OR G ((p395 <= 0))) AND (1 <= p233))))))
lola: processed formula length: 101
lola: 77 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: 607 markings, 607 edges
lola: ========================================
lola: subprocess 5 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p370 <= 0)) U (X ((1 <= p48)) OR (1 <= p370))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p370 <= 0)) U (X ((1 <= p48)) OR (1 <= p370))))
lola: processed formula length: 55
lola: 77 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: 1212 markings, 1213 edges
lola: ========================================
lola: subprocess 6 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p332)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p332)))
lola: processed formula length: 19
lola: 77 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p107 <= 0)) OR (p346 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p107 <= 0)) OR (p346 <= 0)))
lola: processed formula length: 36
lola: 77 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: 123862 markings, 352173 edges
lola: ========================================
lola: subprocess 8 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p325) OR ((G ((F ((1 <= p325)) AND ((1 <= p181) OR (1 <= p325)))) AND F ((1 <= p325))) OR (1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p325) OR ((G ((F ((1 <= p325)) AND ((1 <= p181) OR (1 <= p325)))) AND F ((1 <= p325))) OR (1 <= p47)))))
lola: processed formula length: 117
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((G ((1 <= p161)) OR (1 <= p234)) U G ((1 <= p314))) AND (F ((1 <= p161)) AND (p153 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((G ((1 <= p161)) OR (1 <= p234)) U G ((1 <= p314))) AND (F ((1 <= p161)) AND (p153 <= 0))))
lola: processed formula length: 96
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F ((1 <= p249)) OR (1 <= p87)) U G ((1 <= p285))) AND G (F ((1 <= p87))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p87)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p87)))
lola: processed formula length: 18
lola: 77 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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no
lola: memory consumption: 36644 KB
lola: time consumption: 11 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-D20N150"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Diffusion2D-PT-D20N150, 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 r178-tajo-158987882400482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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