Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334400022.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CircadianClock-PT-100000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334400022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K 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.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-100000-00
FORMULA_NAME CircadianClock-PT-100000-01
FORMULA_NAME CircadianClock-PT-100000-02
FORMULA_NAME CircadianClock-PT-100000-03
FORMULA_NAME CircadianClock-PT-100000-04
FORMULA_NAME CircadianClock-PT-100000-05
FORMULA_NAME CircadianClock-PT-100000-06
FORMULA_NAME CircadianClock-PT-100000-07
FORMULA_NAME CircadianClock-PT-100000-08
FORMULA_NAME CircadianClock-PT-100000-09
FORMULA_NAME CircadianClock-PT-100000-10
FORMULA_NAME CircadianClock-PT-100000-11
FORMULA_NAME CircadianClock-PT-100000-12
FORMULA_NAME CircadianClock-PT-100000-13
FORMULA_NAME CircadianClock-PT-100000-14
FORMULA_NAME CircadianClock-PT-100000-15

=== Now, execution of the tool begins

BK_START 1620896347892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 08:59:13] [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-13 08:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:59:14] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-13 08:59:14] [INFO ] Transformed 14 places.
[2021-05-13 08:59:14] [INFO ] Transformed 16 transitions.
[2021-05-13 08:59:14] [INFO ] Parsed PT model containing 14 places and 16 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100002 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0]
[2021-05-13 08:59:14] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-13 08:59:14] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 08:59:14] [INFO ] [Real]Absence check using 7 positive place invariants in 354 ms returned sat
[2021-05-13 08:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:14] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-13 08:59:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 08:59:14] [INFO ] [Real]Added 4 Read/Feed constraints in 6 ms returned sat
[2021-05-13 08:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:15] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 19 ms.
[2021-05-13 08:59:15] [INFO ] Added : 10 causal constraints over 2 iterations in 113 ms. Result :sat
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using 7 positive place invariants in 48 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:59:15] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 4 ms.
[2021-05-13 08:59:15] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 67 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:59:15] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 11 ms.
[2021-05-13 08:59:15] [INFO ] Added : 10 causal constraints over 2 iterations in 36 ms. Result :sat
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Added 4 Read/Feed constraints in 16 ms returned sat
[2021-05-13 08:59:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:15] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2021-05-13 08:59:15] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Real]Added 4 Read/Feed constraints in 26 ms returned sat
[2021-05-13 08:59:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:15] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-13 08:59:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2021-05-13 08:59:15] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 4 ms.
[2021-05-13 08:59:16] [INFO ] Added : 10 causal constraints over 2 iterations in 35 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:16] [INFO ] Added : 10 causal constraints over 2 iterations in 56 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:16] [INFO ] Added : 10 causal constraints over 2 iterations in 52 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 51 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 53 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:16] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:16] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2021-05-13 08:59:16] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2021-05-13 08:59:16] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2021-05-13 08:59:16] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:16] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using 7 positive place invariants in 50 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:59:16] [INFO ] [Real]Added 4 Read/Feed constraints in 32 ms returned sat
[2021-05-13 08:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 51 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2021-05-13 08:59:17] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:17] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Added 4 Read/Feed constraints in 23 ms returned sat
[2021-05-13 08:59:17] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:17] [INFO ] Added : 8 causal constraints over 2 iterations in 74 ms. Result :sat
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-13 08:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Added 4 Read/Feed constraints in 11 ms returned sat
[2021-05-13 08:59:17] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:17] [INFO ] Added : 10 causal constraints over 2 iterations in 56 ms. Result :sat
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 31 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Added 4 Read/Feed constraints in 26 ms returned sat
[2021-05-13 08:59:17] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2021-05-13 08:59:17] [INFO ] Added : 10 causal constraints over 2 iterations in 45 ms. Result :sat
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Nat]Added 4 Read/Feed constraints in 19 ms returned sat
[2021-05-13 08:59:17] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:17] [INFO ] Added : 10 causal constraints over 2 iterations in 25 ms. Result :sat
[2021-05-13 08:59:17] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2021-05-13 08:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 08:59:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 57 ms returned sat
[2021-05-13 08:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:18] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-13 08:59:18] [INFO ] [Nat]Added 4 Read/Feed constraints in 19 ms returned sat
[2021-05-13 08:59:18] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:18] [INFO ] Added : 10 causal constraints over 2 iterations in 39 ms. Result :sat
[2021-05-13 08:59:18] [INFO ] [Real]Absence check using 7 positive place invariants in 23 ms returned sat
[2021-05-13 08:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 08:59:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:59:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2021-05-13 08:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:59:18] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-13 08:59:18] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2021-05-13 08:59:18] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:59:18] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-13 08:59:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 08:59:18] [INFO ] Flatten gal took : 28 ms
FORMULA CircadianClock-PT-100000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:59:18] [INFO ] Flatten gal took : 6 ms
[2021-05-13 08:59:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2021-05-13 08:59:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CircadianClock-PT-100000 @ 3570 seconds

FORMULA CircadianClock-PT-100000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2758
rslt: Output for LTLFireability @ CircadianClock-PT-100000

{
"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": "Thu May 13 08:59:19 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((F ((X (((1 <= p7) AND (1 <= p9))) OR (F (((1 <= p7) AND (1 <= p9))) OR ((1 <= p0) AND (1 <= p2))))) AND ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p4))) OR (X (((1 <= p7) AND (1 <= p9))) OR (F (((1 <= p7) AND (1 <= p9))) OR ((1 <= p0) AND (1 <= p2))))))))",
"processed_size": 272,
"rewrites": 54
},
"result":
{
"edges": 400004,
"markings": 400004,
"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": 280
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 280
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((((p5 <= 0) OR (p10 <= 0)) AND (p7 <= 0)))",
"processed_size": 46,
"rewrites": 54
},
"result":
{
"edges": 300002,
"markings": 300002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 306
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X (G (((1 <= p3) AND (1 <= p13)))) AND (1 <= p8))))",
"processed_size": 58,
"rewrites": 54
},
"result":
{
"edges": 400002,
"markings": 400002,
"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": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"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": "X (F ((X (X (F (((1 <= p6) AND (1 <= p13))))) OR (1 <= p0))))",
"processed_size": 61,
"rewrites": 54
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((p6 <= 0) U (((1 <= p3) AND (1 <= p13)) U ((1 <= p0) AND (1 <= p2)))))",
"processed_size": 74,
"rewrites": 54
},
"result":
{
"edges": 400004,
"markings": 400004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 421
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (F ((1 <= p6))) OR (F ((1 <= p6)) AND G (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13)))",
"processed_size": 104,
"rewrites": 54
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 481
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (F ((F ((1 <= p0)) OR (1 <= p0)))) OR G (((1 <= p5) AND (1 <= p10)))))",
"processed_size": 76,
"rewrites": 54
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "F (G ((X ((X (F ((1 <= p0))) OR ((1 <= p3) AND (1 <= p13)))) AND ((1 <= p7) AND (1 <= p9)))))",
"processed_size": 93,
"rewrites": 54
},
"result":
{
"edges": 2400003,
"markings": 2100005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 673
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p7 <= 0)))",
"processed_size": 17,
"rewrites": 54
},
"result":
{
"edges": 400004,
"markings": 400003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((p6 <= 0) AND (F (((p2 <= 0) OR (p11 <= 0))) OR G ((p6 <= 0))))))",
"processed_size": 73,
"rewrites": 54
},
"result":
{
"edges": 400004,
"markings": 400003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1582
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F ((G (F (((1 <= p6) AND (1 <= p13)))) AND ((((1 <= p0) AND (1 <= p8) AND (1 <= p12)) U ((1 <= p2) AND (1 <= p11))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))",
"processed_size": 163,
"rewrites": 54
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"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": 3164
},
"child":
[

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p8)",
"processed_size": 9,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (((((1 <= p4) AND (1 <= p10)) U ((1 <= p6) AND (1 <= p13))) OR F ((1 <= p8))))",
"processed_size": 80,
"rewrites": 54
},
"result":
{
"edges": 200002,
"markings": 200002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3452,
"runtime": 812.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F((X(**) OR (F(**) OR **))) AND (** OR (X(**) OR (F(**) OR **)))))) : F(G((* AND (F(*) OR G(*))))) : X((G((X(**) AND **)) OR (F(**) AND (** AND **)))) : F((G(F(**)) AND ((** U **) AND **))) : (G(**) AND X(G(*))) : X(G((X(G(**)) AND **))) : F(G(*)) : X(F((X(X(F(**))) OR **))) : (F(((** U **) OR F(**))) OR **) : X((** U (** U **))) : ((X(F(**)) OR (F(**) AND G(**))) U **) : X((X(F((F(**) OR **))) OR G(**))) : ((G(F(**)) AND (** AND **)) U G(**)) : F(G((X((X(F(**)) OR **)) AND (** AND **))))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no unknown no no no no no no no no no unknown no ",
"value": "no no unknown no no no no no no no no no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 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: G (X (((((1 <= p7) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p4))) U ((X (((1 <= p7) AND (1 <= p9))) OR F (((1 <= p7) AND (1 <= p9)))) OR ((1 <= p0) AND (1 <= p2)))))) : F (X (NOT(F ((X (G (((1 <= p2) AND (1 <= p11)))) U X ((1 <= p6))))))) : X ((G ((X ((1 <= p7)) AND ((p3 <= 0) OR (p13 <= 0)))) OR ((F ((1 <= p7)) AND (1 <= p5)) AND (1 <= p10)))) : F (((G (F (((1 <= p6) AND (1 <= p13)))) AND (((1 <= p0) AND (1 <= p8) AND (1 <= p12)) U ((1 <= p2) AND (1 <= p11)))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))) : (G ((((p5 <= 0) OR (p10 <= 0)) AND (p7 <= 0))) AND NOT(F (X (F ((((1 <= p0) AND (1 <= p4)) U ((1 <= p7) AND (1 <= p9)))))))) : G (X ((G (X (((1 <= p3) AND (1 <= p13)))) AND (1 <= p8)))) : G (NOT(X (G (X (X (F (X (F ((1 <= p7)))))))))) : F (X ((F (X (X (((G (((1 <= p0) AND (1 <= p2))) OR ((1 <= p0) AND (1 <= p2))) U ((1 <= p6) AND (1 <= p13)))))) OR (1 <= p0)))) : (F ((X (((1 <= p2) AND (1 <= p11))) U ((((1 <= p4) AND (1 <= p10)) U ((1 <= p6) AND (1 <= p13))) OR F ((1 <= p8))))) OR (1 <= p8)) : X (((p6 <= 0) U (((1 <= p3) AND (1 <= p13)) U ((1 <= p0) AND (1 <= p2))))) : ((X (F ((1 <= p6))) OR (((p6 <= 0) U (1 <= p6)) AND G (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13))) : X ((F (X (F ((F ((1 <= p0)) OR (1 <= p0))))) OR G (((1 <= p5) AND (1 <= p10))))) : (((G (F ((1 <= p0))) AND (1 <= p8)) AND ((p0 <= 0) OR (p12 <= 0))) U G (((1 <= p4) AND (1 <= p10)))) : G (F (G (((X ((X (F ((1 <= p0))) OR ((1 <= p3) AND (1 <= p13)))) AND (1 <= p7)) AND (1 <= p9)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((X (((1 <= p7) AND (1 <= p9))) OR (F (((1 <= p7) AND (1 <= p9))) OR ((1 <= p0) AND (1 <= p2))))) AND ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p4))) OR (X (((1 <= p7) AND (1 <= p9))) OR (F (((1 <= p7) AND (1 <= p9))) OR ((1 <= p0) AND (1 <= p2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((X (((1 <= p7) AND (1 <= p9))) OR (F (((1 <= p7) AND (1 <= p9))) OR ((1 <= p0) AND (1 <= p2))))) AND ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p4))) OR (X (((1 <= p7) AND (1 <= p9))) OR (F (((1 <= p7) AND (1 <= p9))) OR ((1 <= p0) AND (1 <= p2))))))))
lola: processed formula length: 272
lola: 54 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: 400004 markings, 400004 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((1 <= p7)) AND ((p3 <= 0) OR (p13 <= 0)))) OR (F ((1 <= p7)) AND ((1 <= p5) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((1 <= p7)) AND ((p3 <= 0) OR (p13 <= 0)))) OR (F ((1 <= p7)) AND ((1 <= p5) AND (1 <= p10)))))
lola: processed formula length: 106
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 3822345 markings, 6822387 edges, 764469 markings/sec, 0 secs
lola: 7221950 markings, 13465813 edges, 679921 markings/sec, 5 secs
lola: 10516149 markings, 20148393 edges, 658840 markings/sec, 10 secs
lola: 13761334 markings, 26683932 edges, 649037 markings/sec, 15 secs
lola: 16969018 markings, 33106970 edges, 641537 markings/sec, 20 secs
lola: 19632692 markings, 38297978 edges, 532735 markings/sec, 25 secs
lola: 22827656 markings, 44682866 edges, 638993 markings/sec, 30 secs
lola: 26039176 markings, 51117395 edges, 642304 markings/sec, 35 secs
lola: 29157436 markings, 57357857 edges, 623652 markings/sec, 40 secs
lola: 32319003 markings, 63719471 edges, 632313 markings/sec, 45 secs
lola: 35564232 markings, 70164748 edges, 649046 markings/sec, 50 secs
lola: 38840669 markings, 76721811 edges, 655287 markings/sec, 55 secs
lola: 42062146 markings, 83186225 edges, 644295 markings/sec, 60 secs
lola: 45284480 markings, 89653212 edges, 644467 markings/sec, 65 secs
lola: 48468865 markings, 96006351 edges, 636877 markings/sec, 70 secs
lola: 51669040 markings, 102406861 edges, 640035 markings/sec, 75 secs
lola: 54804316 markings, 108612670 edges, 627055 markings/sec, 80 secs
lola: 57968970 markings, 114969822 edges, 632931 markings/sec, 85 secs
lola: 61204338 markings, 121412707 edges, 647074 markings/sec, 90 secs
lola: 64424429 markings, 127872963 edges, 644018 markings/sec, 95 secs
lola: 67605678 markings, 134216695 edges, 636250 markings/sec, 100 secs
lola: 70758162 markings, 140559206 edges, 630497 markings/sec, 105 secs
lola: 74668521 markings, 148469624 edges, 782072 markings/sec, 110 secs
lola: 77809921 markings, 154811073 edges, 628280 markings/sec, 115 secs
lola: 80986640 markings, 161159512 edges, 635344 markings/sec, 120 secs
lola: 84143158 markings, 167429049 edges, 631304 markings/sec, 125 secs
lola: 87375870 markings, 173927171 edges, 646542 markings/sec, 130 secs
lola: 90581474 markings, 180343966 edges, 641121 markings/sec, 135 secs
lola: 93799634 markings, 186798430 edges, 643632 markings/sec, 140 secs
lola: 96149591 markings, 191471101 edges, 469991 markings/sec, 145 secs
lola: 98927122 markings, 196996599 edges, 555506 markings/sec, 150 secs
lola: 101445357 markings, 202046863 edges, 503647 markings/sec, 155 secs
lola: 104185914 markings, 207557222 edges, 548111 markings/sec, 160 secs
lola: 106980480 markings, 213140906 edges, 558913 markings/sec, 165 secs
lola: 109653835 markings, 218360954 edges, 534671 markings/sec, 170 secs
lola: 112385979 markings, 223787650 edges, 546429 markings/sec, 175 secs
lola: 114224285 markings, 227625982 edges, 367661 markings/sec, 180 secs
lola: 116844826 markings, 232733894 edges, 524108 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p5 <= 0) OR (p10 <= 0)) AND (p7 <= 0))) AND X (G (((p7 <= 0) OR (p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p5 <= 0) OR (p10 <= 0)) AND (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p5 <= 0) OR (p10 <= 0)) AND (p7 <= 0)))
lola: processed formula length: 46
lola: 54 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: 300002 markings, 300002 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G (((1 <= p3) AND (1 <= p13)))) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G (((1 <= p3) AND (1 <= p13)))) AND (1 <= p8))))
lola: processed formula length: 58
lola: 54 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: 400002 markings, 400002 edges
lola: ========================================
lola: subprocess 4 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (F (((1 <= p6) AND (1 <= p13))))) OR (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (F (((1 <= p6) AND (1 <= p13))))) OR (1 <= p0))))
lola: processed formula length: 61
lola: 54 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 5 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p6 <= 0) U (((1 <= p3) AND (1 <= p13)) U ((1 <= p0) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p6 <= 0) U (((1 <= p3) AND (1 <= p13)) U ((1 <= p0) AND (1 <= p2)))))
lola: processed formula length: 74
lola: 54 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: 400004 markings, 400004 edges
lola: ========================================
lola: subprocess 6 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((1 <= p6))) OR (F ((1 <= p6)) AND G (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (F ((1 <= p6))) OR (F ((1 <= p6)) AND G (((1 <= p5) AND (1 <= p13))))) U ((1 <= p5) AND (1 <= p13)))
lola: processed formula length: 104
lola: 54 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 7 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((F ((1 <= p0)) OR (1 <= p0)))) OR G (((1 <= p5) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((F ((1 <= p0)) OR (1 <= p0)))) OR G (((1 <= p5) AND (1 <= p10)))))
lola: processed formula length: 76
lola: 54 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: 400002 markings, 400002 edges
lola: subprocess 8 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X ((X (F ((1 <= p0))) OR ((1 <= p3) AND (1 <= p13)))) AND ((1 <= p7) AND (1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((X (F ((1 <= p0))) OR ((1 <= p3) AND (1 <= p13)))) AND ((1 <= p7) AND (1 <= p9)))))
lola: processed formula length: 93
lola: 54 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: add low 15
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: 2100005 markings, 2400003 edges
lola: subprocess 9 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p7 <= 0)))
lola: processed formula length: 17
lola: 54 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: add low 15
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: 400003 markings, 400004 edges
lola: ========================================
lola: subprocess 10 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p6 <= 0) AND (F (((p2 <= 0) OR (p11 <= 0))) OR G ((p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p6 <= 0) AND (F (((p2 <= 0) OR (p11 <= 0))) OR G ((p6 <= 0))))))
lola: processed formula length: 73
lola: 54 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: 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: add low 15
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: 400003 markings, 400004 edges
lola: ========================================
lola: subprocess 11 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F ((1 <= p0))) AND ((1 <= p8) AND ((p0 <= 0) OR (p12 <= 0)))) U G (((1 <= p4) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F ((1 <= p0))) AND ((1 <= p8) AND ((p0 <= 0) OR (p12 <= 0)))) U G (((1 <= p4) AND (1 <= p10))))
lola: processed formula length: 101
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2661564 markings, 4884664 edges, 532313 markings/sec, 0 secs
lola: 5197551 markings, 9897596 edges, 507197 markings/sec, 5 secs
lola: 7805892 markings, 15117597 edges, 521668 markings/sec, 10 secs
lola: 10430436 markings, 20391204 edges, 524909 markings/sec, 15 secs
lola: 13081769 markings, 25745178 edges, 530267 markings/sec, 20 secs
lola: 15728712 markings, 31028864 edges, 529389 markings/sec, 25 secs
lola: 18419910 markings, 36359546 edges, 538240 markings/sec, 30 secs
lola: 21072424 markings, 41717062 edges, 530503 markings/sec, 35 secs
lola: 23748378 markings, 47048610 edges, 535191 markings/sec, 40 secs
lola: 26409035 markings, 52326841 edges, 532131 markings/sec, 45 secs
lola: 29038924 markings, 57616483 edges, 525978 markings/sec, 50 secs
lola: 31678662 markings, 62935670 edges, 527948 markings/sec, 55 secs
lola: 34320316 markings, 68220654 edges, 528331 markings/sec, 60 secs
lola: 36977567 markings, 73477930 edges, 531450 markings/sec, 65 secs
lola: 39613544 markings, 78740234 edges, 527195 markings/sec, 70 secs
lola: 42209388 markings, 83927743 edges, 519169 markings/sec, 75 secs
lola: 44831599 markings, 89194349 edges, 524442 markings/sec, 80 secs
lola: 47417326 markings, 94351502 edges, 517145 markings/sec, 85 secs
lola: 50029680 markings, 99588539 edges, 522471 markings/sec, 90 secs
lola: 52648011 markings, 104843507 edges, 523666 markings/sec, 95 secs
lola: 55263842 markings, 110090973 edges, 523166 markings/sec, 100 secs
lola: 57911730 markings, 115412304 edges, 529578 markings/sec, 105 secs
lola: 60566598 markings, 120667197 edges, 530974 markings/sec, 110 secs
lola: 63179705 markings, 125880331 edges, 522621 markings/sec, 115 secs
lola: 65763579 markings, 131064231 edges, 516775 markings/sec, 120 secs
lola: 68321272 markings, 136221950 edges, 511539 markings/sec, 125 secs
lola: 71026283 markings, 141578140 edges, 541002 markings/sec, 130 secs
lola: 73670271 markings, 146910076 edges, 528798 markings/sec, 135 secs
lola: 76333734 markings, 152234492 edges, 532693 markings/sec, 140 secs
lola: 78889682 markings, 157368256 edges, 511190 markings/sec, 145 secs
lola: 81546657 markings, 162647467 edges, 531395 markings/sec, 150 secs
lola: 83922539 markings, 167423831 edges, 475176 markings/sec, 155 secs
lola: 86261517 markings, 172084488 edges, 467796 markings/sec, 160 secs
lola: 88588370 markings, 176689251 edges, 465371 markings/sec, 165 secs
lola: 90812264 markings, 181135885 edges, 444779 markings/sec, 170 secs
lola: 93116267 markings, 185817193 edges, 460801 markings/sec, 175 secs
lola: 95579986 markings, 190680950 edges, 492744 markings/sec, 180 secs
lola: 97837783 markings, 195212372 edges, 451559 markings/sec, 185 secs
lola: 100050338 markings, 199650013 edges, 442511 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F (((1 <= p6) AND (1 <= p13)))) AND ((((1 <= p0) AND (1 <= p8) AND (1 <= p12)) U ((1 <= p2) AND (1 <= p11))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F (((1 <= p6) AND (1 <= p13)))) AND ((((1 <= p0) AND (1 <= p8) AND (1 <= p12)) U ((1 <= p2) AND (1 <= p11))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 163
lola: 54 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: 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 13 will run for 3164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((((1 <= p4) AND (1 <= p10)) U ((1 <= p6) AND (1 <= p13))) OR F ((1 <= p8)))) OR (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 54 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((1 <= p7)) AND ((p3 <= 0) OR (p13 <= 0)))) OR (F ((1 <= p7)) AND ((1 <= p5) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((1 <= p7)) AND ((p3 <= 0) OR (p13 <= 0)))) OR (F ((1 <= p7)) AND ((1 <= p5) AND (1 <= p10)))))
lola: processed formula length: 106
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 3773504 markings, 6720493 edges, 754701 markings/sec, 0 secs
lola: 7086395 markings, 13286485 edges, 662578 markings/sec, 5 secs
lola: 10411946 markings, 19835782 edges, 665110 markings/sec, 10 secs
lola: 13626776 markings, 26280257 edges, 642966 markings/sec, 15 secs
lola: 16843723 markings, 32731083 edges, 643389 markings/sec, 20 secs
lola: 20013997 markings, 39041889 edges, 634055 markings/sec, 25 secs
lola: 23226491 markings, 45479355 edges, 642499 markings/sec, 30 secs
lola: 26407682 markings, 51822909 edges, 636238 markings/sec, 35 secs
lola: 29524246 markings, 58124672 edges, 623313 markings/sec, 40 secs
lola: 32625179 markings, 64425653 edges, 620187 markings/sec, 45 secs
lola: 35814476 markings, 70814998 edges, 637859 markings/sec, 50 secs
lola: 38991166 markings, 77173300 edges, 635338 markings/sec, 55 secs
lola: 42115548 markings, 83346430 edges, 624876 markings/sec, 60 secs
lola: 45233538 markings, 89500388 edges, 623598 markings/sec, 65 secs
lola: 48316280 markings, 95716988 edges, 616548 markings/sec, 70 secs
lola: 51312324 markings, 101736714 edges, 599209 markings/sec, 75 secs
lola: 54403170 markings, 107809237 edges, 618169 markings/sec, 80 secs
lola: 57454187 markings, 114055032 edges, 610203 markings/sec, 85 secs
lola: 60521152 markings, 120163152 edges, 613393 markings/sec, 90 secs
lola: 63654522 markings, 126363248 edges, 626674 markings/sec, 95 secs
lola: 66610555 markings, 132411539 edges, 591207 markings/sec, 100 secs
lola: 69724232 markings, 138572348 edges, 622735 markings/sec, 105 secs
lola: 72910287 markings, 144930495 edges, 637211 markings/sec, 110 secs
lola: 76124319 markings, 151372575 edges, 642806 markings/sec, 115 secs
lola: 79276716 markings, 157629749 edges, 630479 markings/sec, 120 secs
lola: 82375194 markings, 163776412 edges, 619696 markings/sec, 125 secs
lola: 85321374 markings, 169763695 edges, 589236 markings/sec, 130 secs
lola: 88451985 markings, 175955511 edges, 626122 markings/sec, 135 secs
lola: 91495040 markings, 182096396 edges, 608611 markings/sec, 140 secs
lola: 94560804 markings, 188281936 edges, 613153 markings/sec, 145 secs
lola: 97391626 markings, 193976607 edges, 566164 markings/sec, 150 secs
lola: 100299453 markings, 199700942 edges, 581565 markings/sec, 155 secs
lola: 101466695 markings, 202068202 edges, 233448 markings/sec, 160 secs
lola: 104050331 markings, 207150473 edges, 516727 markings/sec, 165 secs
lola: 105535743 markings, 210137309 edges, 297082 markings/sec, 170 secs
lola: 107567766 markings, 214169362 edges, 406405 markings/sec, 175 secs
lola: 110308733 markings, 219710371 edges, 548193 markings/sec, 180 secs
lola: 113148379 markings, 225350059 edges, 567929 markings/sec, 185 secs
lola: 115950414 markings, 230952135 edges, 560407 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((G (F ((1 <= p0))) AND ((1 <= p8) AND ((p0 <= 0) OR (p12 <= 0)))) U G (((1 <= p4) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F ((1 <= p0))) AND ((1 <= p8) AND ((p0 <= 0) OR (p12 <= 0)))) U G (((1 <= p4) AND (1 <= p10))))
lola: processed formula length: 101
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2830444 markings, 5191305 edges, 566089 markings/sec, 0 secs
lola: 5492619 markings, 10577803 edges, 532435 markings/sec, 5 secs
lola: 8183669 markings, 15883745 edges, 538210 markings/sec, 10 secs
lola: 10812420 markings, 21137150 edges, 525750 markings/sec, 15 secs
lola: 13420111 markings, 26360198 edges, 521538 markings/sec, 20 secs
lola: 16015728 markings, 31547025 edges, 519123 markings/sec, 25 secs
lola: 18663143 markings, 36889243 edges, 529483 markings/sec, 30 secs
lola: 21299921 markings, 42199552 edges, 527356 markings/sec, 35 secs
lola: 23970649 markings, 47470882 edges, 534146 markings/sec, 40 secs
lola: 26581935 markings, 52682195 edges, 522257 markings/sec, 45 secs
lola: 29218445 markings, 57955042 edges, 527302 markings/sec, 50 secs
lola: 31775580 markings, 63075892 edges, 511427 markings/sec, 55 secs
lola: 34364032 markings, 68264370 edges, 517690 markings/sec, 60 secs
lola: 37002123 markings, 73505999 edges, 527618 markings/sec, 65 secs
lola: 39610702 markings, 78731710 edges, 521716 markings/sec, 70 secs
lola: 42132586 markings, 83833002 edges, 504377 markings/sec, 75 secs
lola: 44800455 markings, 89100918 edges, 533574 markings/sec, 80 secs
lola: 47372358 markings, 94272826 edges, 514381 markings/sec, 85 secs
lola: 50016609 markings, 99549326 edges, 528850 markings/sec, 90 secs
lola: 52605449 markings, 104715821 edges, 517768 markings/sec, 95 secs
lola: 55223536 markings, 109970057 edges, 523617 markings/sec, 100 secs
lola: 57843324 markings, 115229395 edges, 523958 markings/sec, 105 secs
lola: 60482984 markings, 120548348 edges, 527932 markings/sec, 110 secs
lola: 63066402 markings, 125698576 edges, 516684 markings/sec, 115 secs
lola: 65638795 markings, 130815728 edges, 514479 markings/sec, 120 secs
lola: 68240763 markings, 136021608 edges, 520394 markings/sec, 125 secs
lola: 70958899 markings, 141459603 edges, 543627 markings/sec, 130 secs
lola: 73602996 markings, 146708252 edges, 528819 markings/sec, 135 secs
lola: 76246744 markings, 152039470 edges, 528750 markings/sec, 140 secs
lola: 78829157 markings, 157186681 edges, 516483 markings/sec, 145 secs
lola: 81461494 markings, 162483667 edges, 526467 markings/sec, 150 secs
lola: 82592155 markings, 164692974 edges, 226132 markings/sec, 155 secs
lola: 83062625 markings, 165687045 edges, 94094 markings/sec, 160 secs
lola: 85166521 markings, 169867490 edges, 420779 markings/sec, 165 secs
lola: 87524845 markings, 174626079 edges, 471665 markings/sec, 170 secs
lola: 89912335 markings, 179413229 edges, 477498 markings/sec, 175 secs
lola: 92288876 markings, 184165706 edges, 475308 markings/sec, 180 secs
lola: 94659333 markings, 188877055 edges, 474091 markings/sec, 185 secs
lola: 96899096 markings, 193396321 edges, 447953 markings/sec, 190 secs
lola: 99212428 markings, 197936292 edges, 462666 markings/sec, 195 secs
lola: 101535555 markings, 202636564 edges, 464625 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((((1 <= p4) AND (1 <= p10)) U ((1 <= p6) AND (1 <= p13))) OR F ((1 <= p8)))) OR (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 54 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: ...considering subproblem: F (((((1 <= p4) AND (1 <= p10)) U ((1 <= p6) AND (1 <= p13))) OR F ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p4) AND (1 <= p10)) U ((1 <= p6) AND (1 <= p13))) OR F ((1 <= p8))))
lola: processed formula length: 80
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: ========================================
lola: the resulting Büchi automaton has 1 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: 200002 markings, 200002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola: ========================================
lola:
SUMMARY: no no unknown no no no no no no no no no unknown no
lola:
preliminary result: no no unknown no no no no no no no no no unknown no
lola: memory consumption: 3452 KB
lola: time consumption: 812 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="CircadianClock-PT-100000"
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 CircadianClock-PT-100000, 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 r056-oct2-162038334400022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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