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-158987806100041.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806100041
=====================================================================

--------------------
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 1591138579357

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

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

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

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

FORMULA CircadianClock-PT-100000-13 TRUE 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-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CircadianClock-PT-100000-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2731
rslt: Output for LTLCardinality @ 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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:56:26 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G ((F ((p10 <= p8)) AND (p6 <= p11))) AND X ((F ((p10 <= p8)) AND (p8 + 1 <= p10))))))",
"processed_size": 93,
"rewrites": 49
},
"result":
{
"edges": 600003,
"markings": 600003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 (X ((p12 + 1 <= p7)))",
"processed_size": 23,
"rewrites": 49
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F ((p0 <= p7)) OR X (F (((p4 <= p7) AND G ((p0 <= p7))))))))",
"processed_size": 67,
"rewrites": 49
},
"result":
{
"edges": 700004,
"markings": 600004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 (G ((p8 + 1 <= p7)))",
"processed_size": 22,
"rewrites": 49
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p10 + 1 <= p13) U G ((X (G ((p6 + 1 <= p7))) OR (p7 <= p6))))",
"processed_size": 63,
"rewrites": 49
},
"result":
{
"edges": 400003,
"markings": 400003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p5 <= p6))",
"processed_size": 14,
"rewrites": 49
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": "((p5 <= p3) R X ((p0 <= 0)))",
"processed_size": 28,
"rewrites": 49
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((G ((p12 + 1 <= p0)) AND X (F ((p12 + 1 <= p0)))) U (p7 <= p12)))",
"processed_size": 69,
"rewrites": 49
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p7 <= 1)))",
"processed_size": 17,
"rewrites": 49
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p12 <= p2)))",
"processed_size": 19,
"rewrites": 49
},
"result":
{
"edges": 200004,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (G ((3 <= p11))) AND G (((p9 <= p12) OR G ((3 <= p11))))))",
"processed_size": 64,
"rewrites": 49
},
"result":
{
"edges": 400002,
"markings": 400002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3252,
"runtime": 838.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G((F(**) AND **)) AND X((F(**) AND **))))) : F((F(G(**)) AND G((** OR G(**))))) : X(X(*)) : X(G((F(**) OR X(F((** AND G(**))))))) : (X((** AND X(F(**)))) AND G(**)) : F(G(**)) : X(G(**)) : F(G((F(**) AND (F(**) OR (G(**) OR **))))) : (** U G((X(G(*)) OR **))) : ((* R X(*)) AND (X(*) AND **)) : X(((G(*) AND X(F(**))) U **)) : G(F(*))"
},
"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 unknown no yes yes no ",
"value": "no no no no no no no unknown no yes 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 LTLCardinality.xml
lola: G (F ((G ((F ((p10 <= p8)) AND (p6 <= p11))) AND X ((F ((p10 <= p8)) AND (p8 + 1 <= p10)))))) : F (G (((p9 <= p12) U G ((3 <= p11))))) : X (NOT(((1 <= 0) U X ((p7 <= p12))))) : G (X ((F (((p10 <= p12) U (p0 <= p7))) OR F ((X ((p4 <= p7)) AND X (G ((p0 <= p7)))))))) : ((X ((p2 <= p10)) AND F (X (X (F (((p12 <= p9) AND (p3 <= p13))))))) AND G ((p12 <= p9))) : F (G ((p12 <= p2))) : X (G ((p8 + 1 <= p7))) : X (F (G (((F (((p0 + 1 <= p1) AND (p12 <= 0))) OR G ((p1 <= p0))) U (3 <= p0))))) : ((p10 + 1 <= p13) U G ((X (NOT(((0 <= 0) U (p7 <= p6)))) OR (p7 <= p6)))) : ((NOT(((p3 + 1 <= p5) U X ((1 <= p0)))) AND X (NOT(((1 <= 0) U (p6 + 1 <= p5))))) AND (1 <= p2)) : X (((NOT(F ((p0 <= p12))) AND X (((0 <= 0) U (p12 + 1 <= p0)))) U (p7 <= p12))) : NOT(F (((0 <= 0) U X (NOT(X (NOT(G ((2 <= p7)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F ((p10 <= p8)) AND (p6 <= p11))) AND X ((F ((p10 <= p8)) AND (p8 + 1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F ((p10 <= p8)) AND (p6 <= p11))) AND X ((F ((p10 <= p8)) AND (p8 + 1 <= p10))))))
lola: processed formula length: 93
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 600003 markings, 600003 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p12 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p12 + 1 <= p7)))
lola: processed formula length: 23
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400002 markings, 400002 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p0 <= p7)) OR X (F (((p4 <= p7) AND G ((p0 <= p7))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p0 <= p7)) OR X (F (((p4 <= p7) AND G ((p0 <= p7))))))))
lola: processed formula length: 67
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 600004 markings, 700004 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p2 <= p10) AND X (F (((p12 <= p9) AND (p3 <= p13)))))) AND G ((p12 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p12 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p12 <= p9))
lola: processed formula length: 15
lola: 49 rewrites
lola: closed formula file LTLCardinality.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: 300004 markings, 300004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p8 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p8 + 1 <= p7)))
lola: processed formula length: 22
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400002 markings, 400002 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 + 1 <= p13) U G ((X (G ((p6 + 1 <= p7))) OR (p7 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p10 + 1 <= p13) U G ((X (G ((p6 + 1 <= p7))) OR (p7 <= p6))))
lola: processed formula length: 63
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400003 markings, 400003 edges
lola: lola: ========================================subprocess 6 will run for 594 seconds at most (--localtimelimit=0)

lola: ========================================
lola: ...considering subproblem: (((p5 <= p3) R X ((p0 <= 0))) AND (X ((p5 <= p6)) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2)
lola: processed formula length: 9
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p5 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p5 <= p6))
lola: processed formula length: 14
lola: 49 rewrites
lola: closed formula file LTLCardinality.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 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= p3) R X ((p0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p5 <= p3) R X ((p0 <= 0)))
lola: processed formula length: 28
lola: 49 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((p12 + 1 <= p0)) AND X (F ((p12 + 1 <= p0)))) U (p7 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((p12 + 1 <= p0)) AND X (F ((p12 + 1 <= p0)))) U (p7 <= p12)))
lola: processed formula length: 69
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p7 <= 1)))
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 ((p7 <= 1)))
lola: processed formula length: 17
lola: 49 rewrites
lola: closed formula file LTLCardinality.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: 400002 markings, 400002 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p12 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p12 <= p2)))
lola: processed formula length: 19
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 5
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 200003 markings, 200004 edges
lola: ========================================
lola: subprocess 10 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((3 <= p11))) AND G (((p9 <= p12) OR G ((3 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((3 <= p11))) AND G (((p9 <= p12) OR G ((3 <= p11))))))
lola: processed formula length: 64
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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 11 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((3 <= p0)) AND (F (((p0 + 1 <= p1) AND (p12 <= 0))) OR (G ((p1 <= p0)) OR (3 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((3 <= p0)) AND (F (((p0 + 1 <= p1) AND (p12 <= 0))) OR (G ((p1 <= p0)) OR (3 <= p0))))))
lola: processed formula length: 98
lola: 49 rewrites
lola: closed formula file LTLCardinality.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: 1849409 markings, 3248210 edges, 369882 markings/sec, 0 secs
lola: 3452381 markings, 6457109 edges, 320594 markings/sec, 5 secs
lola: 5013608 markings, 9540776 edges, 312245 markings/sec, 10 secs
lola: 6504501 markings, 12604560 edges, 298179 markings/sec, 15 secs
lola: 8026879 markings, 15580560 edges, 304476 markings/sec, 20 secs
lola: 9485918 markings, 18557663 edges, 291808 markings/sec, 25 secs
lola: 11006642 markings, 21519818 edges, 304145 markings/sec, 30 secs
lola: 12477856 markings, 24533445 edges, 294243 markings/sec, 35 secs
lola: 13967582 markings, 27467715 edges, 297945 markings/sec, 40 secs
lola: 15423939 markings, 30371665 edges, 291271 markings/sec, 45 secs
lola: 16859969 markings, 33279741 edges, 287206 markings/sec, 50 secs
lola: 18421675 markings, 36364842 edges, 312341 markings/sec, 55 secs
lola: 19893208 markings, 39379428 edges, 294307 markings/sec, 60 secs
lola: 21420623 markings, 42361656 edges, 305483 markings/sec, 65 secs
lola: 22863559 markings, 45290452 edges, 288587 markings/sec, 70 secs
lola: 24362296 markings, 48262533 edges, 299747 markings/sec, 75 secs
lola: 25816612 markings, 51149581 edges, 290863 markings/sec, 80 secs
lola: 27247805 markings, 54043146 edges, 286239 markings/sec, 85 secs
lola: 28665153 markings, 56895174 edges, 283470 markings/sec, 90 secs
lola: 30144320 markings, 59844616 edges, 295833 markings/sec, 95 secs
lola: 31669727 markings, 62908867 edges, 305081 markings/sec, 100 secs
lola: 33206909 markings, 65920398 edges, 307436 markings/sec, 105 secs
lola: 34678829 markings, 68936142 edges, 294384 markings/sec, 110 secs
lola: 36200612 markings, 71901474 edges, 304357 markings/sec, 115 secs
lola: 37659085 markings, 74876882 edges, 291695 markings/sec, 120 secs
lola: 39100256 markings, 77800381 edges, 288234 markings/sec, 125 secs
lola: 40581347 markings, 80681746 edges, 296218 markings/sec, 130 secs
lola: 42025673 markings, 83576602 edges, 288865 markings/sec, 135 secs
lola: 43591879 markings, 86692309 edges, 313241 markings/sec, 140 secs
lola: 45027763 markings, 89582840 edges, 287177 markings/sec, 145 secs
lola: 46547914 markings, 92648373 edges, 304030 markings/sec, 150 secs
lola: 48038514 markings, 95615062 edges, 298120 markings/sec, 155 secs
lola: 49558728 markings, 98659218 edges, 304043 markings/sec, 160 secs
lola: 51052998 markings, 101658485 edges, 298854 markings/sec, 165 secs
lola: 52552263 markings, 104652782 edges, 299853 markings/sec, 170 secs
lola: 54029763 markings, 107588752 edges, 295500 markings/sec, 175 secs
lola: 55493642 markings, 110580373 edges, 292776 markings/sec, 180 secs
lola: 57034852 markings, 113603989 edges, 308242 markings/sec, 185 secs
lola: 58520361 markings, 116620941 edges, 297102 markings/sec, 190 secs
lola: 60028034 markings, 119583502 edges, 301535 markings/sec, 195 secs
lola: 61480437 markings, 122540698 edges, 290481 markings/sec, 200 secs
lola: 63013721 markings, 125540536 edges, 306657 markings/sec, 205 secs
lola: 64465880 markings, 128496999 edges, 290432 markings/sec, 210 secs
lola: 65938107 markings, 131438761 edges, 294445 markings/sec, 215 secs
lola: 67404810 markings, 134313759 edges, 293341 markings/sec, 220 secs
lola: 68944351 markings, 137445035 edges, 307908 markings/sec, 225 secs
lola: 70513394 markings, 140614094 edges, 313809 markings/sec, 230 secs
lola: 72075566 markings, 143725980 edges, 312434 markings/sec, 235 secs
lola: 73628409 markings, 146784492 edges, 310569 markings/sec, 240 secs
lola: 75180809 markings, 149881555 edges, 310480 markings/sec, 245 secs
lola: 76682385 markings, 152946390 edges, 300315 markings/sec, 250 secs
lola: 78219606 markings, 155958039 edges, 307444 markings/sec, 255 secs
lola: 79690864 markings, 158971798 edges, 294252 markings/sec, 260 secs
lola: 81222265 markings, 161965985 edges, 306280 markings/sec, 265 secs
lola: 82698793 markings, 164995880 edges, 295306 markings/sec, 270 secs
lola: 83670803 markings, 166912928 edges, 194402 markings/sec, 275 secs
lola: 84782143 markings, 169082985 edges, 222268 markings/sec, 280 secs
lola: 85634697 markings, 170803238 edges, 170511 markings/sec, 285 secs
lola: 86351578 markings, 172252435 edges, 143376 markings/sec, 290 secs
lola: 87431885 markings, 174394781 edges, 216061 markings/sec, 295 secs
lola: 88008909 markings, 175525847 edges, 115405 markings/sec, 300 secs
lola: 89089874 markings, 177768735 edges, 216193 markings/sec, 305 secs
lola: 89837092 markings, 179210380 edges, 149444 markings/sec, 310 secs
lola: 90755216 markings, 181056119 edges, 183625 markings/sec, 315 secs
lola: 91518369 markings, 182619281 edges, 152631 markings/sec, 320 secs
lola: 92478088 markings, 184533343 edges, 191944 markings/sec, 325 secs
lola: 93422904 markings, 186367778 edges, 188963 markings/sec, 330 secs
lola: 94640759 markings, 188821331 edges, 243571 markings/sec, 335 secs
lola: 95304426 markings, 190205375 edges, 132733 markings/sec, 340 secs
lola: 96547678 markings, 192648639 edges, 248650 markings/sec, 345 secs
lola: 96986803 markings, 193487768 edges, 87825 markings/sec, 350 secs
lola: 98009858 markings, 195528595 edges, 204611 markings/sec, 355 secs
lola: 98931507 markings, 197432490 edges, 184330 markings/sec, 360 secs
lola: 99759700 markings, 199060692 edges, 165639 markings/sec, 365 secs
lola: 100629365 markings, 200787091 edges, 173933 markings/sec, 370 secs
lola: 101887744 markings, 203362217 edges, 251676 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((F ((3 <= p0)) AND (F (((p0 + 1 <= p1) AND (p12 <= 0))) OR (G ((p1 <= p0)) OR (3 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((3 <= p0)) AND (F (((p0 + 1 <= p1) AND (p12 <= 0))) OR (G ((p1 <= p0)) OR (3 <= p0))))))
lola: processed formula length: 98
lola: 49 rewrites
lola: closed formula file LTLCardinality.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: 1834854 markings, 3204545 edges, 366971 markings/sec, 0 secs
lola: 3479795 markings, 6539352 edges, 328988 markings/sec, 5 secs
lola: 5139511 markings, 9839557 edges, 331943 markings/sec, 10 secs
lola: 6794720 markings, 13094782 edges, 331042 markings/sec, 15 secs
lola: 8411277 markings, 16333748 edges, 323311 markings/sec, 20 secs
lola: 10014781 markings, 19544245 edges, 320701 markings/sec, 25 secs
lola: 11639999 markings, 22819882 edges, 325044 markings/sec, 30 secs
lola: 13243829 markings, 26031358 edges, 320766 markings/sec, 35 secs
lola: 14844993 markings, 29234833 edges, 320233 markings/sec, 40 secs
lola: 16434836 markings, 32404345 edges, 317969 markings/sec, 45 secs
lola: 18071544 markings, 35714455 edges, 327342 markings/sec, 50 secs
lola: 19688606 markings, 38965627 edges, 323412 markings/sec, 55 secs
lola: 21309964 markings, 42210171 edges, 324272 markings/sec, 60 secs
lola: 22909859 markings, 45410084 edges, 319979 markings/sec, 65 secs
lola: 24532836 markings, 48633077 edges, 324595 markings/sec, 70 secs
lola: 26102060 markings, 51802317 edges, 313845 markings/sec, 75 secs
lola: 27684749 markings, 54953975 edges, 316538 markings/sec, 80 secs
lola: 29259384 markings, 58077862 edges, 314927 markings/sec, 85 secs
lola: 30865748 markings, 61296937 edges, 321273 markings/sec, 90 secs
lola: 32459821 markings, 64479144 edges, 318815 markings/sec, 95 secs
lola: 34041025 markings, 67622738 edges, 316241 markings/sec, 100 secs
lola: 35603323 markings, 70709616 edges, 312460 markings/sec, 105 secs
lola: 37144838 markings, 73845205 edges, 308303 markings/sec, 110 secs
lola: 38687788 markings, 76962981 edges, 308590 markings/sec, 115 secs
lola: 40212545 markings, 79937233 edges, 304951 markings/sec, 120 secs
lola: 41734492 markings, 83034906 edges, 304389 markings/sec, 125 secs
lola: 43292564 markings, 86177264 edges, 311614 markings/sec, 130 secs
lola: 44868260 markings, 89304332 edges, 315139 markings/sec, 135 secs
lola: 46447096 markings, 92440826 edges, 315767 markings/sec, 140 secs
lola: 48001299 markings, 95503417 edges, 310841 markings/sec, 145 secs
lola: 49565894 markings, 98666384 edges, 312919 markings/sec, 150 secs
lola: 51118950 markings, 101819456 edges, 310611 markings/sec, 155 secs
lola: 52677747 markings, 104932716 edges, 311759 markings/sec, 160 secs
lola: 54237705 markings, 108012575 edges, 311992 markings/sec, 165 secs
lola: 55809022 markings, 111126509 edges, 314263 markings/sec, 170 secs
lola: 57388492 markings, 114289060 edges, 315894 markings/sec, 175 secs
lola: 58936939 markings, 117437523 edges, 309689 markings/sec, 180 secs
lola: 60483662 markings, 120550383 edges, 309345 markings/sec, 185 secs
lola: 62051481 markings, 123653826 edges, 313564 markings/sec, 190 secs
lola: 63626430 markings, 126778657 edges, 314990 markings/sec, 195 secs
lola: 65140773 markings, 129841419 edges, 302869 markings/sec, 200 secs
lola: 66663468 markings, 132889740 edges, 304539 markings/sec, 205 secs
lola: 68219529 markings, 135957907 edges, 311212 markings/sec, 210 secs
lola: 69849738 markings, 139248518 edges, 326042 markings/sec, 215 secs
lola: 71454668 markings, 142463291 edges, 320986 markings/sec, 220 secs
lola: 73054035 markings, 145661378 edges, 319873 markings/sec, 225 secs
lola: 74647919 markings, 148843013 edges, 318777 markings/sec, 230 secs
lola: 76246657 markings, 152039212 edges, 319748 markings/sec, 235 secs
lola: 77822876 markings, 155167851 edges, 315244 markings/sec, 240 secs
lola: 79394138 markings, 158294926 edges, 314252 markings/sec, 245 secs
lola: 80924379 markings, 161425183 edges, 306048 markings/sec, 250 secs
lola: 82422894 markings, 164368033 edges, 299703 markings/sec, 255 secs
lola: 83743595 markings, 167044962 edges, 264140 markings/sec, 260 secs
lola: 84362302 markings, 168263142 edges, 123741 markings/sec, 265 secs
lola: 85459263 markings, 170476936 edges, 219392 markings/sec, 270 secs
lola: 85985215 markings, 171486070 edges, 105190 markings/sec, 275 secs
lola: 86814290 markings, 173142005 edges, 165815 markings/sec, 280 secs
lola: 87988191 markings, 175489065 edges, 234780 markings/sec, 285 secs
lola: 88590034 markings, 176690913 edges, 120369 markings/sec, 290 secs
lola: 89642291 markings, 178825977 edges, 210451 markings/sec, 295 secs
lola: 90623725 markings, 180770270 edges, 196287 markings/sec, 300 secs
lola: 91519773 markings, 182620683 edges, 179210 markings/sec, 305 secs
lola: 92853785 markings, 185260430 edges, 266802 markings/sec, 310 secs
lola: 93628605 markings, 186784881 edges, 154964 markings/sec, 315 secs
lola: 94646692 markings, 188839133 edges, 203617 markings/sec, 320 secs
lola: 95633025 markings, 190798121 edges, 197267 markings/sec, 325 secs
lola: 96457832 markings, 192472532 edges, 164961 markings/sec, 330 secs
lola: 97399364 markings, 194300332 edges, 188306 markings/sec, 335 secs
lola: 98400683 markings, 196301662 edges, 200264 markings/sec, 340 secs
lola: 98971717 markings, 197472702 edges, 114207 markings/sec, 345 secs
lola: 99988134 markings, 199489129 edges, 203283 markings/sec, 350 secs
lola: 100979000 markings, 201480004 edges, 198173 markings/sec, 355 secs
lola: 101603914 markings, 202710726 edges, 124983 markings/sec, 360 secs
lola: 102072530 markings, 203718124 edges, 93723 markings/sec, 365 secs
lola: 102201555 markings, 203903645 edges, 25805 markings/sec, 370 secs
lola: 102201607 markings, 203903802 edges, 10 markings/sec, 375 secs
lola: 102201642 markings, 203903907 edges, 7 markings/sec, 380 secs
lola: 102201682 markings, 203904024 edges, 8 markings/sec, 385 secs
lola: 102201719 markings, 203904135 edges, 7 markings/sec, 390 secs
lola: 102202044 markings, 203905113 edges, 65 markings/sec, 395 secs
lola: 102202078 markings, 203905213 edges, 7 markings/sec, 400 secs
lola: 102202109 markings, 203905307 edges, 6 markings/sec, 405 secs
lola: 102202134 markings, 203905381 edges, 5 markings/sec, 410 secs
lola: 102202158 markings, 203905455 edges, 5 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown no yes yes no
lola:
preliminary result: no no no no no no no unknown no yes yes no
lola: memory consumption: 3252 KB
lola: time consumption: 838 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="LTLCardinality"
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 LTLCardinality"
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-158987806100041"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;