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-162038334400018.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-010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334400018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.4K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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-010000-00
FORMULA_NAME CircadianClock-PT-010000-01
FORMULA_NAME CircadianClock-PT-010000-02
FORMULA_NAME CircadianClock-PT-010000-03
FORMULA_NAME CircadianClock-PT-010000-04
FORMULA_NAME CircadianClock-PT-010000-05
FORMULA_NAME CircadianClock-PT-010000-06
FORMULA_NAME CircadianClock-PT-010000-07
FORMULA_NAME CircadianClock-PT-010000-08
FORMULA_NAME CircadianClock-PT-010000-09
FORMULA_NAME CircadianClock-PT-010000-10
FORMULA_NAME CircadianClock-PT-010000-11
FORMULA_NAME CircadianClock-PT-010000-12
FORMULA_NAME CircadianClock-PT-010000-13
FORMULA_NAME CircadianClock-PT-010000-14
FORMULA_NAME CircadianClock-PT-010000-15

=== Now, execution of the tool begins

BK_START 1620896327701

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

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

FORMULA CircadianClock-PT-010000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircadianClock-PT-010000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircadianClock-PT-010000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA CircadianClock-PT-010000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2332
rslt: Output for LTLFireability @ CircadianClock-PT-010000

{
"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:58:53 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 6,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((X ((F (((p0 <= 0) OR (p2 <= 0))) AND (((p7 <= 0) OR (p9 <= 0)) AND ((1 <= p6) AND (1 <= p13))))) OR ((p6 <= 0) OR (p13 <= 0)))))",
"processed_size": 137,
"rewrites": 67
},
"result":
{
"edges": 40003,
"markings": 40003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p5) AND (1 <= p10)))",
"processed_size": 30,
"rewrites": 67
},
"result":
{
"edges": 30003,
"markings": 30003,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p3) AND (1 <= p13)))))",
"processed_size": 66,
"rewrites": 67
},
"result":
{
"edges": 30002,
"markings": 30002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 306
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((((p2 <= 0) OR (p11 <= 0)) U (G (F (((1 <= p6) AND (1 <= p13)))) OR ((1 <= p2) AND (1 <= p11))))))",
"processed_size": 105,
"rewrites": 67
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p8) U (X (G (((1 <= p7) OR ((G ((1 <= p7)) AND F ((1 <= p7))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12)))))) AND F ((1 <= p8))))",
"processed_size": 136,
"rewrites": 67
},
"result":
{
"edges": 200095002,
"markings": 100080003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 35
},
"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": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p6) AND (1 <= p13))))",
"processed_size": 34,
"rewrites": 67
},
"result":
{
"edges": 20003,
"markings": 20003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p0)) OR (G ((F (((p0 <= 0) OR (p2 <= 0))) OR (p0 <= 0))) AND F ((1 <= p0)))))",
"processed_size": 91,
"rewrites": 67
},
"result":
{
"edges": 40002,
"markings": 40002,
"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": 503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F (((1 <= p3) AND (1 <= p11))) AND G (((1 <= p3) AND (1 <= p11))))))",
"processed_size": 75,
"rewrites": 67
},
"result":
{
"edges": 40002,
"markings": 40002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 603
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G (F ((G ((F ((1 <= p0)) AND ((1 <= p8) OR (1 <= p0)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) AND ((1 <= p4) AND (1 <= p10))))",
"processed_size": 139,
"rewrites": 67
},
"result":
{
"edges": 40003,
"markings": 40003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1424
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 2,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((((p7 <= 0) OR (p9 <= 0)) U G ((F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p0) OR ((1 <= p3) AND (1 <= p13)))))) OR G ((1 <= p0))) U (F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p3) AND (1 <= p13))))",
"processed_size": 199,
"rewrites": 67
},
"result":
{
"edges": 40002,
"markings": 40002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"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": 2848
},
"child":
[

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

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

{
"child":
[

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

{
"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 <= p0))",
"processed_size": 13,
"rewrites": 67
},
"result":
{
"edges": 30003,
"markings": 30003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13))))",
"processed_size": 87,
"rewrites": 67
},
"result":
{
"edges": 30003,
"markings": 30003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 19,
"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": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3616,
"runtime": 1238.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((X((F(*) AND (* AND (* AND *)))) OR (* OR *)))) : G(F((G(**) OR (G(**) AND F(G(**)))))) : (X(F(**)) OR (X(**) AND G(**))) : G((X(**) OR (F(**) AND (** AND **)))) : X(X((** U (G(F(**)) OR **)))) : G((X(G(*)) AND (G(*) AND **))) : (** U (X(G((** OR ((G(**) AND F(**)) OR **)))) AND F(**))) : F(**) : X(F(**)) : X((F(**) OR (G((F(*) OR *)) AND F(**)))) : ((** U **) OR (G(**) OR **)) : X(F((F(**) AND G(**)))) : X((G(F((G((F(**) AND (** OR **))) OR **))) AND (** AND **))) : (((** U G((F(**) AND (** OR **)))) OR G(**)) U (F(**) AND (** AND **)))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no unknown no unknown yes unknown no no no no no no no no ",
"value": "no unknown no unknown yes unknown 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: 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: NOT(F (X (F (((X ((((G (((1 <= p0) AND (1 <= p2))) OR ((1 <= p7) AND (1 <= p9))) OR (p6 <= 0)) OR (p13 <= 0))) AND (1 <= p6)) AND (1 <= p13)))))) : F (G (F ((G (((1 <= p0) AND (1 <= p4))) U G (((1 <= p2) AND (1 <= p11))))))) : (F (X ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p3) AND (1 <= p13))))) OR (X ((((1 <= p3) AND (1 <= p13)) OR (1 <= p7))) AND G (((1 <= p5) AND (1 <= p10))))) : G ((X (((p5 <= 0) OR (p10 <= 0))) OR ((F (((1 <= p5) AND (1 <= p10))) AND (1 <= p5)) AND (1 <= p10)))) : X (X ((((p2 <= 0) OR (p11 <= 0)) U (G (F (((1 <= p6) AND (1 <= p13)))) OR ((1 <= p2) AND (1 <= p11)))))) : G (((NOT(X (F ((p7 <= 0)))) AND NOT(F (((1 <= p5) AND (1 <= p10))))) AND ((p6 <= 0) OR (p13 <= 0)))) : ((1 <= p8) U (X (G (((G ((1 <= p7)) U (1 <= p7)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) AND F ((1 <= p8)))) : F ((1 <= p0)) : (NOT(X (NOT((G ((1 <= p8)) U (0 <= 0))))) U X (((1 <= p6) AND (1 <= p13)))) : (NOT(X (F ((G (((1 <= p0) AND (1 <= p2))) AND (1 <= p0))))) U X (F ((1 <= p0)))) : ((((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13)))) OR G ((1 <= p0))) OR ((1 <= p5) AND (1 <= p10))) : F (X ((F (((1 <= p3) AND (1 <= p11))) AND G (((1 <= p3) AND (1 <= p11)))))) : X (((G ((X (F (X (G (X (((1 <= p8) U (1 <= p0))))))) OR F (((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) AND (1 <= p4)) AND (1 <= p10))) : (((((p7 <= 0) OR (p9 <= 0)) U G (((1 <= p0) U ((1 <= p3) AND (1 <= p13))))) OR G ((1 <= p0))) U ((F (((1 <= p3) AND (1 <= p13))) AND (1 <= p3)) AND (1 <= p13)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 ((X ((F (((p0 <= 0) OR (p2 <= 0))) AND (((p7 <= 0) OR (p9 <= 0)) AND ((1 <= p6) AND (1 <= p13))))) OR ((p6 <= 0) OR (p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((F (((p0 <= 0) OR (p2 <= 0))) AND (((p7 <= 0) OR (p9 <= 0)) AND ((1 <= p6) AND (1 <= p13))))) OR ((p6 <= 0) OR (p13 <= 0)))))
lola: processed formula length: 137
lola: 67 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: 40003 markings, 40003 edges
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p3) AND (1 <= p13))))) OR (X ((((1 <= p3) AND (1 <= p13)) OR (1 <= p7))) AND G (((1 <= p5) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p5) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p5) AND (1 <= p10)))
lola: processed formula length: 30
lola: 67 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: ========================================
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: 30003 markings, 30003 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p3) AND (1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p7) AND (1 <= p9)) OR ((1 <= p3) AND (1 <= p13)))))
lola: processed formula length: 66
lola: 67 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: 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: 30002 markings, 30002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p5 <= 0) OR (p10 <= 0))) OR (F (((1 <= p5) AND (1 <= p10))) AND ((1 <= p5) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p5 <= 0) OR (p10 <= 0))) OR (F (((1 <= p5) AND (1 <= p10))) AND ((1 <= p5) AND (1 <= p10)))))
lola: processed formula length: 103
lola: 67 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: 3834296 markings, 7524845 edges, 766859 markings/sec, 0 secs
lola: 6626865 markings, 13130265 edges, 558514 markings/sec, 5 secs
lola: 10294977 markings, 20466497 edges, 733622 markings/sec, 10 secs
lola: 13855590 markings, 27567641 edges, 712123 markings/sec, 15 secs
lola: 17484343 markings, 34842156 edges, 725751 markings/sec, 20 secs
lola: 21057332 markings, 41970464 edges, 714598 markings/sec, 25 secs
lola: 24619213 markings, 49106411 edges, 712376 markings/sec, 30 secs
lola: 28178029 markings, 56232232 edges, 711763 markings/sec, 35 secs
lola: 31750733 markings, 63360614 edges, 714541 markings/sec, 40 secs
lola: 35231090 markings, 70321511 edges, 696071 markings/sec, 45 secs
lola: 38096792 markings, 76052480 edges, 573140 markings/sec, 50 secs
lola: 41602678 markings, 83075955 edges, 701177 markings/sec, 55 secs
lola: 45152674 markings, 90185767 edges, 709999 markings/sec, 60 secs
lola: 48675554 markings, 97214230 edges, 704576 markings/sec, 65 secs
lola: 52163491 markings, 104197865 edges, 697587 markings/sec, 70 secs
lola: 55601616 markings, 111079931 edges, 687625 markings/sec, 75 secs
lola: 59117536 markings, 118099653 edges, 703184 markings/sec, 80 secs
lola: 62666062 markings, 125205055 edges, 709705 markings/sec, 85 secs
lola: 66122198 markings, 132102089 edges, 691227 markings/sec, 90 secs
lola: 69584089 markings, 139044502 edges, 692378 markings/sec, 95 secs
lola: 73069599 markings, 146010534 edges, 697102 markings/sec, 100 secs
lola: 76568205 markings, 152990787 edges, 699721 markings/sec, 105 secs
lola: 79939456 markings, 159744375 edges, 674250 markings/sec, 110 secs
lola: 83360134 markings, 166586236 edges, 684136 markings/sec, 115 secs
lola: 86751342 markings, 173374329 edges, 678242 markings/sec, 120 secs
lola: 90217228 markings, 180317175 edges, 693177 markings/sec, 125 secs
lola: 93613816 markings, 187086767 edges, 679318 markings/sec, 130 secs
lola: 97062912 markings, 194007446 edges, 689819 markings/sec, 135 secs
lola: 100438093 markings, 200743132 edges, 675036 markings/sec, 140 secs
lola: 101400198 markings, 202665381 edges, 192421 markings/sec, 145 secs
lola: 101659435 markings, 203183220 edges, 51847 markings/sec, 150 secs
lola: 104365426 markings, 208601592 edges, 541198 markings/sec, 155 secs
lola: 106787913 markings, 213453906 edges, 484497 markings/sec, 160 secs
lola: 109850241 markings, 219576696 edges, 612466 markings/sec, 165 secs
lola: 112750498 markings, 225357381 edges, 580051 markings/sec, 170 secs
lola: 115529446 markings, 230932568 edges, 555790 markings/sec, 175 secs
lola: 118621440 markings, 237109212 edges, 618399 markings/sec, 180 secs
lola: 121695022 markings, 243248986 edges, 614716 markings/sec, 185 secs
lola: 124769215 markings, 249411412 edges, 614839 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p2 <= 0) OR (p11 <= 0)) U (G (F (((1 <= p6) AND (1 <= p13)))) OR ((1 <= p2) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p2 <= 0) OR (p11 <= 0)) U (G (F (((1 <= p6) AND (1 <= p13)))) OR ((1 <= p2) AND (1 <= p11))))))
lola: processed formula length: 105
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((1 <= p7))) AND (G (((p5 <= 0) OR (p10 <= 0))) AND ((p6 <= 0) OR (p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((1 <= p7))) AND (G (((p5 <= 0) OR (p10 <= 0))) AND ((p6 <= 0) OR (p13 <= 0)))))
lola: processed formula length: 91
lola: 67 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: 3548901 markings, 7056523 edges, 709780 markings/sec, 0 secs
lola: 7234880 markings, 14425957 edges, 737196 markings/sec, 5 secs
lola: 10923407 markings, 21799675 edges, 737705 markings/sec, 10 secs
lola: 14528995 markings, 29016257 edges, 721118 markings/sec, 15 secs
lola: 18085603 markings, 36125903 edges, 711322 markings/sec, 20 secs
lola: 21788271 markings, 43533722 edges, 740534 markings/sec, 25 secs
lola: 25382424 markings, 50716222 edges, 718831 markings/sec, 30 secs
lola: 28941244 markings, 57835576 edges, 711764 markings/sec, 35 secs
lola: 32646537 markings, 65247979 edges, 741059 markings/sec, 40 secs
lola: 36288478 markings, 72533621 edges, 728388 markings/sec, 45 secs
lola: 39932001 markings, 79824006 edges, 728705 markings/sec, 50 secs
lola: 43606464 markings, 87167212 edges, 734893 markings/sec, 55 secs
lola: 47198111 markings, 94355182 edges, 718329 markings/sec, 60 secs
lola: 50765181 markings, 101483005 edges, 713414 markings/sec, 65 secs
lola: 54293694 markings, 108548367 edges, 705703 markings/sec, 70 secs
lola: 57727853 markings, 115410673 edges, 686832 markings/sec, 75 secs
lola: 61306438 markings, 122566249 edges, 715717 markings/sec, 80 secs
lola: 65012139 markings, 129983166 edges, 741140 markings/sec, 85 secs
lola: 68709373 markings, 137374684 edges, 739447 markings/sec, 90 secs
lola: 72445404 markings, 144846261 edges, 747206 markings/sec, 95 secs
lola: 76128652 markings, 152212151 edges, 736650 markings/sec, 100 secs
lola: 79767086 markings, 159489041 edges, 727687 markings/sec, 105 secs
lola: 83586319 markings, 167128847 edges, 763847 markings/sec, 110 secs
lola: 86974983 markings, 173912368 edges, 677733 markings/sec, 115 secs
lola: 90114310 markings, 180189979 edges, 627865 markings/sec, 120 secs
lola: 93420309 markings, 186804323 edges, 661200 markings/sec, 125 secs
lola: 96696850 markings, 193355716 edges, 655308 markings/sec, 130 secs
lola: 100074107 markings, 200089107 edges, 675451 markings/sec, 135 secs
lola: 101227469 markings, 202965042 edges, 230672 markings/sec, 140 secs
lola: 102670247 markings, 206576371 edges, 288556 markings/sec, 145 secs
lola: 103774030 markings, 209330689 edges, 220757 markings/sec, 150 secs
lola: 104812647 markings, 211930738 edges, 207723 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) U (X (G (((1 <= p7) OR ((G ((1 <= p7)) AND F ((1 <= p7))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12)))))) AND F ((1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p8) U (X (G (((1 <= p7) OR ((G ((1 <= p7)) AND F ((1 <= p7))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12)))))) AND F ((1 <= p8))))
lola: processed formula length: 136
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 35 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: 3507905 markings, 6973539 edges, 701581 markings/sec, 0 secs
lola: 7008650 markings, 13975597 edges, 700149 markings/sec, 5 secs
lola: 10469542 markings, 20898102 edges, 692178 markings/sec, 10 secs
lola: 13941370 markings, 27833451 edges, 694366 markings/sec, 15 secs
lola: 17282230 markings, 34515826 edges, 668172 markings/sec, 20 secs
lola: 20770441 markings, 41500285 edges, 697642 markings/sec, 25 secs
lola: 24229690 markings, 48417860 edges, 691850 markings/sec, 30 secs
lola: 27634765 markings, 55228903 edges, 681015 markings/sec, 35 secs
lola: 31045110 markings, 62043779 edges, 682069 markings/sec, 40 secs
lola: 34412237 markings, 68784990 edges, 673425 markings/sec, 45 secs
lola: 37705239 markings, 75363832 edges, 658600 markings/sec, 50 secs
lola: 41067970 markings, 82091857 edges, 672546 markings/sec, 55 secs
lola: 44446690 markings, 88847846 edges, 675744 markings/sec, 60 secs
lola: 47776765 markings, 95513923 edges, 666015 markings/sec, 65 secs
lola: 51179831 markings, 102317499 edges, 680613 markings/sec, 70 secs
lola: 54543470 markings, 109041642 edges, 672728 markings/sec, 75 secs
lola: 57865669 markings, 115684339 edges, 664440 markings/sec, 80 secs
lola: 61311299 markings, 122580832 edges, 689126 markings/sec, 85 secs
lola: 64797071 markings, 129556783 edges, 697154 markings/sec, 90 secs
lola: 68240329 markings, 136440556 edges, 688652 markings/sec, 95 secs
lola: 71704571 markings, 143365318 edges, 692848 markings/sec, 100 secs
lola: 75136515 markings, 150235788 edges, 686389 markings/sec, 105 secs
lola: 78546511 markings, 157048284 edges, 681999 markings/sec, 110 secs
lola: 82037320 markings, 164037858 edges, 698162 markings/sec, 115 secs
lola: 85072244 markings, 170104149 edges, 606985 markings/sec, 120 secs
lola: 88250748 markings, 176457829 edges, 635701 markings/sec, 125 secs
lola: 91249380 markings, 182453575 edges, 599726 markings/sec, 130 secs
lola: 94499758 markings, 188963924 edges, 650076 markings/sec, 135 secs
lola: 97641113 markings, 195245749 edges, 628271 markings/sec, 140 secs
lola: 99337798 markings, 198638431 edges, 339337 markings/sec, 145 secs
lola: 99549157 markings, 199054078 edges, 42272 markings/sec, 150 secs
lola: 100080003 markings, 200095002 edges, 106169 markings/sec, 155 secs
lola: 100080003 markings, 200095002 edges, 0 markings/sec, 160 secs
lola: 100080003 markings, 200095002 edges, 0 markings/sec, 165 secs
lola: 100080003 markings, 200095002 edges, 0 markings/sec, 170 secs
lola: 100080003 markings, 200095002 edges, 0 markings/sec, 175 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100080003 markings, 200095002 edges
lola: 100080003 markings, 200095002 edges, 0 markings/sec, 180 secs
lola: ========================================
lola: subprocess 6 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p6) 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) AND (1 <= p13))))
lola: processed formula length: 34
lola: 67 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: 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: 20003 markings, 20003 edges
lola: ========================================
lola: subprocess 7 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p0)) OR (G ((F (((p0 <= 0) OR (p2 <= 0))) OR (p0 <= 0))) AND F ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p0)) OR (G ((F (((p0 <= 0) OR (p2 <= 0))) OR (p0 <= 0))) AND F ((1 <= p0)))))
lola: processed formula length: 91
lola: 67 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: 40002 markings, 40002 edges
lola: ========================================
lola: subprocess 8 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((1 <= p3) AND (1 <= p11))) AND G (((1 <= p3) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((1 <= p3) AND (1 <= p11))) AND G (((1 <= p3) AND (1 <= p11))))))
lola: processed formula length: 75
lola: 67 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: 40002 markings, 40002 edges
lola: ========================================
lola: subprocess 9 will run for 603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((G ((F ((1 <= p0)) AND ((1 <= p8) OR (1 <= p0)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) AND ((1 <= p4) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((G ((F ((1 <= p0)) AND ((1 <= p8) OR (1 <= p0)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) AND ((1 <= p4) AND (1 <= p10))))
lola: processed formula length: 139
lola: 67 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: 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: 40003 markings, 40003 edges
lola: ========================================
lola: subprocess 10 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p0 <= 0)
lola: processed formula length: 9
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 30002 markings, 30002 edges
lola: ========================================
lola: subprocess 11 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p2) AND (1 <= p11))) OR (G (((1 <= p0) AND (1 <= p4))) AND F (G (((1 <= p2) AND (1 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p2) AND (1 <= p11))) OR (G (((1 <= p0) AND (1 <= p4))) AND F (G (((1 <= p2) AND (1 <= p11))))))))
lola: processed formula length: 114
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 3536624 markings, 7027672 edges, 707325 markings/sec, 0 secs
lola: 6985236 markings, 13925007 edges, 689722 markings/sec, 5 secs
lola: 10409614 markings, 20777801 edges, 684876 markings/sec, 10 secs
lola: 13843079 markings, 27637852 edges, 686693 markings/sec, 15 secs
lola: 17184090 markings, 34320552 edges, 668202 markings/sec, 20 secs
lola: 20508929 markings, 40974735 edges, 664968 markings/sec, 25 secs
lola: 23834268 markings, 47630420 edges, 665068 markings/sec, 30 secs
lola: 27130783 markings, 54219636 edges, 659303 markings/sec, 35 secs
lola: 30421008 markings, 60800120 edges, 658045 markings/sec, 40 secs
lola: 33688818 markings, 67333086 edges, 653562 markings/sec, 45 secs
lola: 36948956 markings, 73853173 edges, 652028 markings/sec, 50 secs
lola: 40228156 markings, 80410443 edges, 655840 markings/sec, 55 secs
lola: 43473719 markings, 86906810 edges, 649113 markings/sec, 60 secs
lola: 46737123 markings, 93436693 edges, 652681 markings/sec, 65 secs
lola: 49977237 markings, 99916711 edges, 648023 markings/sec, 70 secs
lola: 53171135 markings, 106298087 edges, 638780 markings/sec, 75 secs
lola: 56319892 markings, 112604045 edges, 629751 markings/sec, 80 secs
lola: 59537544 markings, 119036679 edges, 643530 markings/sec, 85 secs
lola: 62961167 markings, 125887206 edges, 684725 markings/sec, 90 secs
lola: 66363073 markings, 132692581 edges, 680381 markings/sec, 95 secs
lola: 69683738 markings, 139334244 edges, 664133 markings/sec, 100 secs
lola: 73109166 markings, 146181085 edges, 685086 markings/sec, 105 secs
lola: 76442607 markings, 152850179 edges, 666688 markings/sec, 110 secs
lola: 79739359 markings, 159440103 edges, 659350 markings/sec, 115 secs
lola: 83197024 markings, 166352751 edges, 691533 markings/sec, 120 secs
lola: 86062232 markings, 172088653 edges, 573042 markings/sec, 125 secs
lola: 88903147 markings, 177770552 edges, 568183 markings/sec, 130 secs
lola: 91859847 markings, 183680355 edges, 591340 markings/sec, 135 secs
lola: 94835278 markings, 189633713 edges, 595086 markings/sec, 140 secs
lola: 97902573 markings, 195767929 edges, 613459 markings/sec, 145 secs
lola: 100446384 markings, 201026418 edges, 508762 markings/sec, 150 secs
lola: 101947364 markings, 204777548 edges, 300196 markings/sec, 155 secs
lola: 103401393 markings, 208421723 edges, 290806 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p7 <= 0) OR (p9 <= 0)) U G ((F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p0) OR ((1 <= p3) AND (1 <= p13)))))) OR G ((1 <= p0))) U (F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p7 <= 0) OR (p9 <= 0)) U G ((F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p0) OR ((1 <= p3) AND (1 <= p13)))))) OR G ((1 <= p0))) U (F (((1 <= p3) AND (1 <= p13))) AND ((1 <= p3) AND (1 <= p13))))
lola: processed formula length: 199
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 24 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: 40002 markings, 40002 edges
lola: ========================================
lola: subprocess 13 will run for 2848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13)))) OR (G ((1 <= p0)) OR ((1 <= p5) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p10))
lola: processed formula length: 26
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13))))
lola: processed formula length: 87
lola: 67 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: 30003 markings, 30003 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (((p5 <= 0) OR (p10 <= 0))) OR (F (((1 <= p5) AND (1 <= p10))) AND ((1 <= p5) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p5 <= 0) OR (p10 <= 0))) OR (F (((1 <= p5) AND (1 <= p10))) AND ((1 <= p5) AND (1 <= p10)))))
lola: processed formula length: 103
lola: 67 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: 3651413 markings, 7161934 edges, 730283 markings/sec, 0 secs
lola: 7191692 markings, 14242744 edges, 708056 markings/sec, 5 secs
lola: 10694314 markings, 21252408 edges, 700524 markings/sec, 10 secs
lola: 14171233 markings, 28202991 edges, 695384 markings/sec, 15 secs
lola: 17589749 markings, 35038370 edges, 683703 markings/sec, 20 secs
lola: 20972587 markings, 41825710 edges, 676568 markings/sec, 25 secs
lola: 24330094 markings, 48539071 edges, 671501 markings/sec, 30 secs
lola: 27799285 markings, 55466468 edges, 693838 markings/sec, 35 secs
lola: 31211392 markings, 62282618 edges, 682421 markings/sec, 40 secs
lola: 34637896 markings, 69141958 edges, 685301 markings/sec, 45 secs
lola: 38030017 markings, 75925696 edges, 678424 markings/sec, 50 secs
lola: 41478355 markings, 82822993 edges, 689668 markings/sec, 55 secs
lola: 44914042 markings, 89709884 edges, 687137 markings/sec, 60 secs
lola: 48352403 markings, 96569630 edges, 687672 markings/sec, 65 secs
lola: 51728863 markings, 103314003 edges, 675292 markings/sec, 70 secs
lola: 55121288 markings, 110119532 edges, 678485 markings/sec, 75 secs
lola: 58755713 markings, 117374204 edges, 726885 markings/sec, 80 secs
lola: 62306035 markings, 124484992 edges, 710064 markings/sec, 85 secs
lola: 65896036 markings, 131654819 edges, 718000 markings/sec, 90 secs
lola: 69460584 markings, 138800980 edges, 712910 markings/sec, 95 secs
lola: 73112867 markings, 146104949 edges, 730457 markings/sec, 100 secs
lola: 76616171 markings, 153097637 edges, 700661 markings/sec, 105 secs
lola: 80132491 markings, 160143470 edges, 703264 markings/sec, 110 secs
lola: 83597017 markings, 167056875 edges, 692905 markings/sec, 115 secs
lola: 87129670 markings, 174114658 edges, 706531 markings/sec, 120 secs
lola: 90761662 markings, 181405252 edges, 726398 markings/sec, 125 secs
lola: 94329755 markings, 188514552 edges, 713619 markings/sec, 130 secs
lola: 97828798 markings, 195531502 edges, 699809 markings/sec, 135 secs
lola: 101318425 markings, 202520212 edges, 697925 markings/sec, 140 secs
lola: 104607874 markings, 209097447 edges, 657890 markings/sec, 145 secs
lola: 107834444 markings, 215527944 edges, 645314 markings/sec, 150 secs
lola: 111059772 markings, 221986406 edges, 645066 markings/sec, 155 secs
lola: 114286341 markings, 228453461 edges, 645314 markings/sec, 160 secs
lola: 117600701 markings, 235068316 edges, 662872 markings/sec, 165 secs
lola: 120918117 markings, 241698308 edges, 663483 markings/sec, 170 secs
lola: 122475490 markings, 244810348 edges, 311475 markings/sec, 175 secs
lola: 125419573 markings, 250702448 edges, 588817 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((X (G ((1 <= p7))) AND (G (((p5 <= 0) OR (p10 <= 0))) AND ((p6 <= 0) OR (p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((1 <= p7))) AND (G (((p5 <= 0) OR (p10 <= 0))) AND ((p6 <= 0) OR (p13 <= 0)))))
lola: processed formula length: 91
lola: 67 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: 3835012 markings, 7625579 edges, 767002 markings/sec, 0 secs
lola: 7589185 markings, 15137176 edges, 750835 markings/sec, 5 secs
lola: 11368970 markings, 22696342 edges, 755957 markings/sec, 10 secs
lola: 15092015 markings, 30144271 edges, 744609 markings/sec, 15 secs
lola: 18814683 markings, 37587497 edges, 744534 markings/sec, 20 secs
lola: 22646969 markings, 45249773 edges, 766457 markings/sec, 25 secs
lola: 26332561 markings, 52626366 edges, 737118 markings/sec, 30 secs
lola: 29989696 markings, 59937589 edges, 731427 markings/sec, 35 secs
lola: 33615116 markings, 67190150 edges, 725084 markings/sec, 40 secs
lola: 37258493 markings, 74474073 edges, 728675 markings/sec, 45 secs
lola: 40911385 markings, 81782108 edges, 730578 markings/sec, 50 secs
lola: 44563753 markings, 89080427 edges, 730474 markings/sec, 55 secs
lola: 48150605 markings, 96259408 edges, 717370 markings/sec, 60 secs
lola: 51769985 markings, 103497365 edges, 723876 markings/sec, 65 secs
lola: 55347706 markings, 110650351 edges, 715544 markings/sec, 70 secs
lola: 58830504 markings, 117618569 edges, 696560 markings/sec, 75 secs
lola: 62591840 markings, 125142389 edges, 752267 markings/sec, 80 secs
lola: 66330578 markings, 132618418 edges, 747748 markings/sec, 85 secs
lola: 70009543 markings, 139975129 edges, 735793 markings/sec, 90 secs
lola: 73746661 markings, 147447713 edges, 747424 markings/sec, 95 secs
lola: 77385922 markings, 154727519 edges, 727852 markings/sec, 100 secs
lola: 81049658 markings, 162054922 edges, 732747 markings/sec, 105 secs
lola: 84308481 markings, 168572438 edges, 651765 markings/sec, 110 secs
lola: 87592321 markings, 175144077 edges, 656768 markings/sec, 115 secs
lola: 90853686 markings, 181666517 edges, 652273 markings/sec, 120 secs
lola: 94213831 markings, 188386786 edges, 672029 markings/sec, 125 secs
lola: 97521567 markings, 195006187 edges, 661547 markings/sec, 130 secs
lola: 100217884 markings, 200432942 edges, 539263 markings/sec, 135 secs
lola: 101553186 markings, 203778845 edges, 267060 markings/sec, 140 secs
lola: 102923025 markings, 207197520 edges, 273968 markings/sec, 145 secs
lola: 104231630 markings, 210478496 edges, 261721 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p2) AND (1 <= p11))) OR (G (((1 <= p0) AND (1 <= p4))) AND F (G (((1 <= p2) AND (1 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p2) AND (1 <= p11))) OR (G (((1 <= p0) AND (1 <= p4))) AND F (G (((1 <= p2) AND (1 <= p11))))))))
lola: processed formula length: 114
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 3649857 markings, 7259204 edges, 729971 markings/sec, 0 secs
lola: 7241875 markings, 14434900 edges, 718404 markings/sec, 5 secs
lola: 10831121 markings, 21622278 edges, 717849 markings/sec, 10 secs
lola: 14372414 markings, 28705805 edges, 708259 markings/sec, 15 secs
lola: 17806459 markings, 35567595 edges, 686809 markings/sec, 20 secs
lola: 21317286 markings, 42593667 edges, 702165 markings/sec, 25 secs
lola: 24772118 markings, 49503876 edges, 690966 markings/sec, 30 secs
lola: 28191681 markings, 56342224 edges, 683913 markings/sec, 35 secs
lola: 31629395 markings, 63215022 edges, 687543 markings/sec, 40 secs
lola: 35074094 markings, 70108774 edges, 688940 markings/sec, 45 secs
lola: 38424577 markings, 76806091 edges, 670097 markings/sec, 50 secs
lola: 41896708 markings, 83755933 edges, 694426 markings/sec, 55 secs
lola: 45344614 markings, 90648205 edges, 689581 markings/sec, 60 secs
lola: 48712242 markings, 97381856 edges, 673526 markings/sec, 65 secs
lola: 52110268 markings, 104175887 edges, 679605 markings/sec, 70 secs
lola: 55479821 markings, 110923914 edges, 673911 markings/sec, 75 secs
lola: 58810400 markings, 117578029 edges, 666116 markings/sec, 80 secs
lola: 62344480 markings, 124653167 edges, 706816 markings/sec, 85 secs
lola: 65790426 markings, 131540148 edges, 689189 markings/sec, 90 secs
lola: 69264034 markings, 138494798 edges, 694722 markings/sec, 95 secs
lola: 72795761 markings, 145550004 edges, 706345 markings/sec, 100 secs
lola: 76254860 markings, 152467721 edges, 691820 markings/sec, 105 secs
lola: 79676296 markings, 159310920 edges, 684287 markings/sec, 110 secs
lola: 83229610 markings, 166424565 edges, 710663 markings/sec, 115 secs
lola: 86201337 markings, 172384992 edges, 594345 markings/sec, 120 secs
lola: 88834854 markings, 177631489 edges, 526703 markings/sec, 125 secs
lola: 91976215 markings, 183913794 edges, 628272 markings/sec, 130 secs
lola: 95200748 markings, 190362723 edges, 644907 markings/sec, 135 secs
lola: 98527215 markings, 197021795 edges, 665293 markings/sec, 140 secs
lola: 100839772 markings, 202019158 edges, 462511 markings/sec, 145 secs
lola: 102340363 markings, 205770587 edges, 300118 markings/sec, 150 secs
lola: 103756482 markings, 209306290 edges, 283224 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13)))) OR (G ((1 <= p0)) OR ((1 <= p5) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p10))
lola: processed formula length: 26
lola: 67 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p0))
lola: processed formula length: 13
lola: 67 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: 30003 markings, 30003 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p0 <= 0) U (((1 <= p0) AND (1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p13))))
lola: processed formula length: 87
lola: 67 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: 30003 markings, 30003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no unknown yes unknown no no no no no no no no
lola:
preliminary result: no unknown no unknown yes unknown no no no no no no no no
lola: memory consumption: 3616 KB
lola: time consumption: 1238 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-010000"
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-010000, 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-162038334400018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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