Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 26 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 26 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 11K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591138737121

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:58:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:59:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:59:00] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-02 22:59:00] [INFO ] Transformed 14 places.
[2020-06-02 22:59:00] [INFO ] Transformed 16 transitions.
[2020-06-02 22:59:00] [INFO ] Parsed PT model containing 14 places and 16 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=1428 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-02 22:59:00] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2020-06-02 22:59:00] [INFO ] Computed 7 place invariants in 3 ms
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-02 22:59:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-02 22:59:00] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:59:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:00] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 12 ms.
[2020-06-02 22:59:00] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Added 4 Read/Feed constraints in 6 ms returned sat
[2020-06-02 22:59:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:00] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 5 ms.
[2020-06-02 22:59:00] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:59:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:00] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 5 ms.
[2020-06-02 22:59:00] [INFO ] Added : 10 causal constraints over 2 iterations in 31 ms. Result :sat
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:00] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2020-06-02 22:59:00] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-02 22:59:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 21 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 4 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 58 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 5 ms.
[2020-06-02 22:59:01] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 4 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 31 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 5 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 4 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2020-06-02 22:59:01] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:01] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 58 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2020-06-02 22:59:01] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-02 22:59:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:01] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:01] [INFO ] Added : 10 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 12 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 7 ms.
[2020-06-02 22:59:02] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:02] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2020-06-02 22:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 15 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2020-06-02 22:59:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:59:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 22:59:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:59:02] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2020-06-02 22:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 22:59:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 22:59:03] [INFO ] Flatten gal took : 47 ms
FORMULA CircadianClock-PT-100000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-100000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:59:03] [INFO ] Flatten gal took : 11 ms
[2020-06-02 22:59:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-02 22:59:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CircadianClock-PT-100000 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

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

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:59:04 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((X (G (((1 <= p5) AND (1 <= p13)))) OR (G (((p4 <= 0) OR (p10 <= 0))) OR (G ((p0 <= 0)) OR ((1 <= p5) AND (1 <= p13)))))))",
"processed_size": 129,
"rewrites": 107
},
"result":
{
"edges": 700003,
"markings": 600003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p7) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p9)))",
"processed_size": 55,
"rewrites": 107
},
"result":
{
"edges": 300003,
"markings": 300003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p7 <= 0) OR (p9 <= 0))",
"processed_size": 25,
"rewrites": 109
},
"result":
{
"edges": 200001,
"markings": 200001,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p7 <= 0) OR (p9 <= 0)))",
"processed_size": 29,
"rewrites": 107
},
"result":
{
"edges": 300002,
"markings": 300002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p7)))",
"processed_size": 17,
"rewrites": 107
},
"result":
{
"edges": 300002,
"markings": 300002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 2,
"aneg": 5,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (F ((X ((p8 <= 0)) AND G (((1 <= p4) AND (1 <= p10)))))) AND (F (((p5 <= 0) OR (p13 <= 0))) OR G (F ((X ((p8 <= 0)) AND G (((1 <= p4) AND (1 <= p10)))))))))",
"processed_size": 163,
"rewrites": 107
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((G (((((1 <= p0) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p10))) AND (1 <= p1) AND (1 <= p9))) OR X (((1 <= p0) AND (1 <= p2)))) U ((1 <= p5) AND (1 <= p13) AND (1 <= p0) AND (1 <= p2)))",
"processed_size": 186,
"rewrites": 107
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((X (G (((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))) U (1 <= p0)) AND (X (((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))",
"processed_size": 164,
"rewrites": 107
},
"result":
{
"edges": 600001,
"markings": 600001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 535
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((1 <= p4) AND (1 <= p10)))",
"processed_size": 30,
"rewrites": 107
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p1) AND (1 <= p9))) OR ((G (((1 <= p3) AND (1 <= p11))) AND X (((1 <= p4) AND (1 <= p10)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12) AND (1 <= p1) AND (1 <= p9)))))",
"processed_size": 180,
"rewrites": 107
},
"result":
{
"edges": 600001,
"markings": 600001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p2) AND (1 <= p11))))",
"processed_size": 34,
"rewrites": 107
},
"result":
{
"edges": 400003,
"markings": 400003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3207
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))",
"processed_size": 42,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))",
"processed_size": 42,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0))",
"processed_size": 40,
"rewrites": 109
},
"result":
{
"edges": 300002,
"markings": 300002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3864,
"runtime": 700.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G((F(**) AND ((X(**) OR **) AND **))) AND (** AND **)))) : G(*) : X(F((X(G(**)) OR (G(*) OR (G(*) OR **))))) : (F(**) AND **) : G(F(**)) : ((** U **) OR ((G(**) AND F(**)) OR ((G(*) AND F(((** U **) OR (G(**) AND F(**))))) OR X(F(**))))) : F((X(F((X(*) AND G(*)))) AND (F(*) OR G(F((X(*) AND G(*))))))) : ((G(**) OR X(**)) U **) : G(F((X(F(*)) AND (F(**) OR G(F(*)))))) : G((G(**) OR (G(F(**)) AND F(G(**))))) : F(((X(G(*)) U **) AND (X(*) AND *))) : X(**) : F((G(**) OR ((G(**) AND X(**)) OR **)))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no no no no no no unknown no no yes no ",
"value": "no no no no no no no no unknown no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: G (F ((((G ((X ((1 <= p7)) U ((1 <= p7) OR (1 <= p0)))) AND G (((1 <= p3) AND (1 <= p11)))) AND (1 <= p0)) AND (1 <= p4)))) : NOT(((p0 <= 0) U (1 <= p0))) : F (X ((((G (X (((1 <= p5) AND (1 <= p13)))) OR NOT(F (((1 <= p4) AND (1 <= p10))))) OR NOT(F ((1 <= p0)))) OR ((1 <= p5) AND (1 <= p13))))) : (F (((1 <= p0) AND (1 <= p8) AND (1 <= p12))) AND ((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))) : G (NOT(G (X (NOT(G (F (X (((1 <= p2) AND (1 <= p11)))))))))) : ((NOT(F (((1 <= p7) AND (1 <= p9)))) U (G (((1 <= p7) AND (1 <= p9))) U (((1 <= p7) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p9))))) OR X (F ((1 <= p7)))) : F (NOT((G (((1 <= p5) AND (1 <= p13))) U G (X ((X ((1 <= p8)) OR F (((p4 <= 0) OR (p10 <= 0))))))))) : ((G (((((1 <= p0) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p10))) AND (1 <= p1) AND (1 <= p9))) OR X (((1 <= p0) AND (1 <= p2)))) U ((1 <= p5) AND (1 <= p13) AND (1 <= p0) AND (1 <= p2))) : NOT(F (G ((NOT(F (((1 <= p2) AND (1 <= p11)))) U NOT(X (NOT(G (((1 <= p3) AND (1 <= p13)))))))))) : G (((((p5 <= 0) OR (p13 <= 0)) U F (X (X (G (F (((1 <= p4) AND (1 <= p10)))))))) U G (((p4 <= 0) OR (p10 <= 0))))) : NOT(G (((NOT((G (NOT(X (((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) U (1 <= p0))) OR X (((1 <= p0) AND (1 <= p8) AND (1 <= p12)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12))))) : X (((1 <= p4) AND (1 <= p10))) : F (((G (((1 <= p1) AND (1 <= p9))) OR (G (((1 <= p3) AND (1 <= p11))) AND X (((1 <= p4) AND (1 <= p10))))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12) AND (1 <= p1) AND (1 <= p9))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F (((1 <= p7) OR (1 <= p0))) AND ((X ((1 <= p7)) OR ((1 <= p7) OR (1 <= p0))) AND ((1 <= p3) AND (1 <= p11))))) AND ((1 <= p0) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F (((1 <= p7) OR (1 <= p0))) AND ((X ((1 <= p7)) OR ((1 <= p7) OR (1 <= p0))) AND ((1 <= p3) AND (1 <= p11))))) AND ((1 <= p0) AND (1 <= p4)))))
lola: processed formula length: 157
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400004 markings, 400004 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G (((1 <= p5) AND (1 <= p13)))) OR (G (((p4 <= 0) OR (p10 <= 0))) OR (G ((p0 <= 0)) OR ((1 <= p5) AND (1 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G (((1 <= p5) AND (1 <= p13)))) OR (G (((p4 <= 0) OR (p10 <= 0))) OR (G ((p0 <= 0)) OR ((1 <= p5) AND (1 <= p13)))))))
lola: processed formula length: 129
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 15
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 600003 markings, 700003 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p7) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p9))) OR ((G (((1 <= p7) AND (1 <= p9))) AND F (((1 <= p7) AND (1 <= p9)))) OR ((G (((p7 <= 0) OR (p9 <= 0))) AND F (((((1 <= p7) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p9))) OR (G (((1 <= p7) AND (1 <= p9))) AND F (((1 <= p7) AND (1 <= p9))))))) OR X (F ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p7) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p7) AND (1 <= p9)) U ((1 <= p7) AND (1 <= p9)))
lola: processed formula length: 55
lola: 107 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: 300003 markings, 300003 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p7) AND (1 <= p9)))
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: ((p7 <= 0) OR (p9 <= 0))
lola: processed formula length: 25
lola: 109 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: 200001 markings, 200001 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p7 <= 0) OR (p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p7 <= 0) OR (p9 <= 0)))
lola: processed formula length: 29
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 300002 markings, 300002 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p7)))
lola: processed formula length: 17
lola: 107 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: 300002 markings, 300002 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((X ((p8 <= 0)) AND G (((1 <= p4) AND (1 <= p10)))))) AND (F (((p5 <= 0) OR (p13 <= 0))) OR G (F ((X ((p8 <= 0)) AND G (((1 <= p4) AND (1 <= p10)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((X ((p8 <= 0)) AND G (((1 <= p4) AND (1 <= p10)))))) AND (F (((p5 <= 0) OR (p13 <= 0))) OR G (F ((X ((p8 <= 0)) AND G (((1 <= p4) AND (1 <= p10)))))))))
lola: processed formula length: 163
lola: 107 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400002 markings, 400002 edges
lola: ========================================
lola: subprocess 4 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((((1 <= p0) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p10))) AND (1 <= p1) AND (1 <= p9))) OR X (((1 <= p0) AND (1 <= p2)))) U ((1 <= p5) AND (1 <= p13) AND (1 <= p0) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((((1 <= p0) AND (1 <= p2)) OR ((1 <= p4) AND (1 <= p10))) AND (1 <= p1) AND (1 <= p9))) OR X (((1 <= p0) AND (1 <= p2)))) U ((1 <= p5) AND (1 <= p13) AND (1 <= p0) AND (1 <= p2)))
lola: processed formula length: 186
lola: 107 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: 400002 markings, 400002 edges
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (F (((p3 <= 0) OR (p13 <= 0)))) AND (F (((1 <= p2) AND (1 <= p11))) OR G (F (((p3 <= 0) OR (p13 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F (((p3 <= 0) OR (p13 <= 0)))) AND (F (((1 <= p2) AND (1 <= p11))) OR G (F (((p3 <= 0) OR (p13 <= 0))))))))
lola: processed formula length: 119
lola: 107 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: 2270203 markings, 3710596 edges, 454041 markings/sec, 0 secs
lola: 4237325 markings, 7611951 edges, 393424 markings/sec, 5 secs
lola: 6223670 markings, 11570975 edges, 397269 markings/sec, 10 secs
lola: 8110755 markings, 15411011 edges, 377417 markings/sec, 15 secs
lola: 10019475 markings, 19158372 edges, 381744 markings/sec, 20 secs
lola: 11890909 markings, 22972664 edges, 374287 markings/sec, 25 secs
lola: 13793907 markings, 26694359 edges, 380600 markings/sec, 30 secs
lola: 15621645 markings, 30364855 edges, 365548 markings/sec, 35 secs
lola: 17433909 markings, 34001635 edges, 362453 markings/sec, 40 secs
lola: 19402818 markings, 37908353 edges, 393782 markings/sec, 45 secs
lola: 21281409 markings, 41744117 edges, 375718 markings/sec, 50 secs
lola: 23162391 markings, 45463171 edges, 376196 markings/sec, 55 secs
lola: 24933843 markings, 49034686 edges, 354290 markings/sec, 60 secs
lola: 26735378 markings, 52636285 edges, 360307 markings/sec, 65 secs
lola: 28542040 markings, 56243010 edges, 361332 markings/sec, 70 secs
lola: 30299879 markings, 59799484 edges, 351568 markings/sec, 75 secs
lola: 32202806 markings, 63508255 edges, 380585 markings/sec, 80 secs
lola: 34018260 markings, 67154606 edges, 363091 markings/sec, 85 secs
lola: 35788609 markings, 70689831 edges, 354070 markings/sec, 90 secs
lola: 37573480 markings, 74274765 edges, 356974 markings/sec, 95 secs
lola: 39302784 markings, 77804131 edges, 345861 markings/sec, 100 secs
lola: 41029233 markings, 81187490 edges, 345290 markings/sec, 105 secs
lola: 42618928 markings, 84356569 edges, 317939 markings/sec, 110 secs
lola: 44450384 markings, 88050926 edges, 366291 markings/sec, 115 secs
lola: 46229258 markings, 91587540 edges, 355775 markings/sec, 120 secs
lola: 48003338 markings, 95109770 edges, 354816 markings/sec, 125 secs
lola: 49641355 markings, 98423813 edges, 327603 markings/sec, 130 secs
lola: 51404685 markings, 101913795 edges, 352666 markings/sec, 135 secs
lola: 53063622 markings, 105290598 edges, 331787 markings/sec, 140 secs
lola: 54676880 markings, 108530365 edges, 322652 markings/sec, 145 secs
lola: 56386794 markings, 111888737 edges, 341983 markings/sec, 150 secs
lola: 58080754 markings, 115341969 edges, 338792 markings/sec, 155 secs
lola: 59771046 markings, 118673108 edges, 338058 markings/sec, 160 secs
lola: 61370336 markings, 121872453 edges, 319858 markings/sec, 165 secs
lola: 63029493 markings, 125188162 edges, 331831 markings/sec, 170 secs
lola: 64635829 markings, 128407162 edges, 321267 markings/sec, 175 secs
lola: 66224585 markings, 131573419 edges, 317751 markings/sec, 180 secs
lola: 67764601 markings, 134666943 edges, 308003 markings/sec, 185 secs
lola: 69524889 markings, 138227293 edges, 352058 markings/sec, 190 secs
lola: 71411215 markings, 141933286 edges, 377265 markings/sec, 195 secs
lola: 73237154 markings, 145611094 edges, 365188 markings/sec, 200 secs
lola: 75018852 markings, 149156179 edges, 356340 markings/sec, 205 secs
lola: 76819441 markings, 152757937 edges, 360118 markings/sec, 210 secs
lola: 78532977 markings, 156235697 edges, 342707 markings/sec, 215 secs
lola: 80248046 markings, 159643733 edges, 343014 markings/sec, 220 secs
lola: 81970099 markings, 163072938 edges, 344411 markings/sec, 225 secs
lola: 83616524 markings, 166349946 edges, 329285 markings/sec, 230 secs
lola: 84253264 markings, 167659367 edges, 127348 markings/sec, 235 secs
lola: 85567632 markings, 170271093 edges, 262874 markings/sec, 240 secs
lola: 86177799 markings, 171480785 edges, 122033 markings/sec, 245 secs
lola: 87292498 markings, 173777056 edges, 222940 markings/sec, 250 secs
lola: 88480640 markings, 176141474 edges, 237628 markings/sec, 255 secs
lola: 89251654 markings, 177654512 edges, 154203 markings/sec, 260 secs
lola: 90146621 markings, 179449747 edges, 178993 markings/sec, 265 secs
lola: 91180312 markings, 181483473 edges, 206738 markings/sec, 270 secs
lola: 92142367 markings, 183445563 edges, 192411 markings/sec, 275 secs
lola: 93166526 markings, 185469756 edges, 204832 markings/sec, 280 secs
lola: 94828903 markings, 188786230 edges, 332475 markings/sec, 285 secs
lola: 95588186 markings, 190291500 edges, 151857 markings/sec, 290 secs
lola: 96766725 markings, 192670082 edges, 235708 markings/sec, 295 secs
lola: 97437396 markings, 194011699 edges, 134134 markings/sec, 300 secs
lola: 98403265 markings, 195909299 edges, 193174 markings/sec, 305 secs
lola: 99607278 markings, 198321334 edges, 240803 markings/sec, 310 secs
lola: 100430906 markings, 199992212 edges, 164726 markings/sec, 315 secs
lola: 101424525 markings, 201973064 edges, 198724 markings/sec, 320 secs
lola: 102626980 markings, 204380425 edges, 240491 markings/sec, 325 secs
lola: 102734594 markings, 204638161 edges, 21523 markings/sec, 330 secs
lola: 102734655 markings, 204638221 edges, 12 markings/sec, 335 secs
lola: 102734797 markings, 204638363 edges, 28 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X (G (((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))) U (1 <= p0)) AND (X (((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X (G (((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))) U (1 <= p0)) AND (X (((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0))) AND ((p0 <= 0) OR (p8 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 164
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 600001 markings, 600001 edges
lola: ========================================
lola: subprocess 7 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p4) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p4) AND (1 <= p10)))
lola: processed formula length: 30
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p1) AND (1 <= p9))) OR ((G (((1 <= p3) AND (1 <= p11))) AND X (((1 <= p4) AND (1 <= p10)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12) AND (1 <= p1) AND (1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p1) AND (1 <= p9))) OR ((G (((1 <= p3) AND (1 <= p11))) AND X (((1 <= p4) AND (1 <= p10)))) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p12) AND (1 <= p1) AND (1 <= p9)))))
lola: processed formula length: 180
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 600001 markings, 600001 edges
lola: ========================================
lola: subprocess 9 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p2) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p2) AND (1 <= p11))))
lola: processed formula length: 34
lola: 107 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: 400003 markings, 400003 edges
lola: ========================================
lola: subprocess 10 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 <= 0))
lola: processed formula length: 13
lola: 107 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: 300003 markings, 300003 edges
lola: ========================================
lola: subprocess 11 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p4 <= 0) OR (p10 <= 0))) OR (G (F (((1 <= p4) AND (1 <= p10)))) AND F (G (((p4 <= 0) OR (p10 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p4 <= 0) OR (p10 <= 0))) OR (G (F (((1 <= p4) AND (1 <= p10)))) AND F (G (((p4 <= 0) OR (p10 <= 0)))))))
lola: processed formula length: 115
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 400002 markings, 400002 edges
lola: ========================================
lola: subprocess 12 will run for 3207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p0) AND (1 <= p8) AND (1 <= p12))) AND ((1 <= p0) OR ((1 <= p2) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))
lola: processed formula length: 42
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (F (((p3 <= 0) OR (p13 <= 0)))) AND (F (((1 <= p2) AND (1 <= p11))) OR G (F (((p3 <= 0) OR (p13 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F (((p3 <= 0) OR (p13 <= 0)))) AND (F (((1 <= p2) AND (1 <= p11))) OR G (F (((p3 <= 0) OR (p13 <= 0))))))))
lola: processed formula length: 119
lola: 107 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: 2347470 markings, 3847522 edges, 469494 markings/sec, 0 secs
lola: 4391562 markings, 7891685 edges, 408818 markings/sec, 5 secs
lola: 6408935 markings, 11926771 edges, 403475 markings/sec, 10 secs
lola: 8348618 markings, 15848881 edges, 387937 markings/sec, 15 secs
lola: 10269684 markings, 19708999 edges, 384213 markings/sec, 20 secs
lola: 12247489 markings, 23642405 edges, 395561 markings/sec, 25 secs
lola: 14206476 markings, 27519353 edges, 391797 markings/sec, 30 secs
lola: 16051531 markings, 31254510 edges, 369011 markings/sec, 35 secs
lola: 18030050 markings, 35190056 edges, 395704 markings/sec, 40 secs
lola: 20027887 markings, 39183559 edges, 399567 markings/sec, 45 secs
lola: 21993195 markings, 43093934 edges, 393062 markings/sec, 50 secs
lola: 23896871 markings, 46990492 edges, 380735 markings/sec, 55 secs
lola: 25851644 markings, 50854801 edges, 390955 markings/sec, 60 secs
lola: 27745740 markings, 54646682 edges, 378819 markings/sec, 65 secs
lola: 29625043 markings, 58374977 edges, 375861 markings/sec, 70 secs
lola: 31469555 markings, 62108506 edges, 368902 markings/sec, 75 secs
lola: 33403598 markings, 65910623 edges, 386809 markings/sec, 80 secs
lola: 35225499 markings, 69576317 edges, 364380 markings/sec, 85 secs
lola: 37093655 markings, 73380777 edges, 373631 markings/sec, 90 secs
lola: 39014492 markings, 77143278 edges, 384167 markings/sec, 95 secs
lola: 40865536 markings, 80896402 edges, 370209 markings/sec, 100 secs
lola: 42655998 markings, 84467777 edges, 358092 markings/sec, 105 secs
lola: 44656331 markings, 88468768 edges, 400067 markings/sec, 110 secs
lola: 46620763 markings, 92362054 edges, 392886 markings/sec, 115 secs
lola: 48493102 markings, 96179062 edges, 374468 markings/sec, 120 secs
lola: 50354515 markings, 99856248 edges, 372283 markings/sec, 125 secs
lola: 52249656 markings, 103648702 edges, 379028 markings/sec, 130 secs
lola: 54145731 markings, 107447597 edges, 379215 markings/sec, 135 secs
lola: 56054171 markings, 111262231 edges, 381688 markings/sec, 140 secs
lola: 57871230 markings, 114913397 edges, 363412 markings/sec, 145 secs
lola: 59774611 markings, 118676673 edges, 380676 markings/sec, 150 secs
lola: 61533220 markings, 122235345 edges, 351722 markings/sec, 155 secs
lola: 63426716 markings, 125979826 edges, 378699 markings/sec, 160 secs
lola: 65282125 markings, 129746047 edges, 371082 markings/sec, 165 secs
lola: 67135865 markings, 133438186 edges, 370748 markings/sec, 170 secs
lola: 69039760 markings, 137218931 edges, 380779 markings/sec, 175 secs
lola: 71030171 markings, 141190155 edges, 398082 markings/sec, 180 secs
lola: 72986832 markings, 145089356 edges, 391332 markings/sec, 185 secs
lola: 74887780 markings, 148962964 edges, 380190 markings/sec, 190 secs
lola: 76844789 markings, 152833981 edges, 391402 markings/sec, 195 secs
lola: 78717896 markings, 156620623 edges, 374621 markings/sec, 200 secs
lola: 80538209 markings, 160240999 edges, 364063 markings/sec, 205 secs
lola: 82458653 markings, 164075544 edges, 384089 markings/sec, 210 secs
lola: 83596933 markings, 166300675 edges, 227656 markings/sec, 215 secs
lola: 84496425 markings, 168189088 edges, 179898 markings/sec, 220 secs
lola: 86125553 markings, 171429137 edges, 325826 markings/sec, 225 secs
lola: 86266940 markings, 171700384 edges, 28277 markings/sec, 230 secs
lola: 87433316 markings, 173999507 edges, 233275 markings/sec, 235 secs
lola: 88029341 markings, 175187578 edges, 119205 markings/sec, 240 secs
lola: 88816136 markings, 176747962 edges, 157359 markings/sec, 245 secs
lola: 89776745 markings, 178679856 edges, 192122 markings/sec, 250 secs
lola: 90496353 markings, 180188605 edges, 143922 markings/sec, 255 secs
lola: 91546383 markings, 182249557 edges, 210006 markings/sec, 260 secs
lola: 92622840 markings, 184368056 edges, 215291 markings/sec, 265 secs
lola: 93807205 markings, 186721144 edges, 236873 markings/sec, 270 secs
lola: 94922680 markings, 189025973 edges, 223095 markings/sec, 275 secs
lola: 96027609 markings, 191182342 edges, 220986 markings/sec, 280 secs
lola: 97019323 markings, 193157482 edges, 198343 markings/sec, 285 secs
lola: 98075750 markings, 195326758 edges, 211285 markings/sec, 290 secs
lola: 99070620 markings, 197311360 edges, 198974 markings/sec, 295 secs
lola: 100136949 markings, 199440425 edges, 213266 markings/sec, 300 secs
lola: 101216794 markings, 201549871 edges, 215969 markings/sec, 305 secs
lola: 102187054 markings, 203490601 edges, 194052 markings/sec, 310 secs
lola: 102705050 markings, 204608616 edges, 103599 markings/sec, 315 secs
lola: 102719436 markings, 204623003 edges, 2877 markings/sec, 320 secs
lola: 102722210 markings, 204625776 edges, 555 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p0) AND (1 <= p8) AND (1 <= p12))) AND ((1 <= p0) OR ((1 <= p2) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) OR ((1 <= p2) AND (1 <= p11)))
lola: processed formula length: 42
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((1 <= p0) AND (1 <= p8) AND (1 <= p12)))
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) OR (p8 <= 0) OR (p12 <= 0))
lola: processed formula length: 40
lola: 109 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: 300002 markings, 300002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no no no no unknown no no yes no
lola:
preliminary result: no no no no no no no no unknown no no yes no
lola: ========================================
lola: memory consumption: 3864 KB
lola: time consumption: 700 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircadianClock-PT-100000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is CircadianClock-PT-100000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-smll-158987806100042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;