Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620896345645

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

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

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

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

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

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

FORMULA CircadianClock-PT-100000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
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": "Thu May 13 08:59:11 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(p13 + 1 <= p1)",
"processed_size": 15,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"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": 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": "(p0 <= 0)",
"processed_size": 9,
"rewrites": 53
},
"result":
{
"edges": 300002,
"markings": 300002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(2 <= p8)",
"processed_size": 9,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F ((p8 <= 2)) AND X (G ((p11 + 1 <= p9))))))",
"processed_size": 51,
"rewrites": 51
},
"result":
{
"edges": 400003,
"markings": 400003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1782
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": "G (F ((p6 <= p5)))",
"processed_size": 18,
"rewrites": 51
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3 + 1 <= p13)",
"processed_size": 15,
"rewrites": 53
},
"result":
{
"edges": 400001,
"markings": 400001,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 21388,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND X(G(**))) : (G(F((F(*) OR X(*)))) AND F(*)) : X(F(*)) : F(**) : X(X(X(F((X(**) AND **))))) : (X(G(**)) OR F((G(**) OR X(X(**))))) : X((X(G((X(*) OR **))) OR F(**))) : (X((X((G(**) OR **)) AND **)) AND (** OR (G(**) AND F(**)))) : G(F((F(*) AND X(G(**))))) : (G(F(**)) AND (** U X(**)))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no yes no no no no no no no ",
"value": "no no yes no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (F ((F ((p5 <= p2)) U (((1 <= p5) AND (p1 <= p13)) U ((p7 <= p12) U (p1 <= p13))))) AND X (G ((2 <= p1)))) : (NOT(F (G (F (G ((G ((3 <= p6)) AND X ((1 <= p0)))))))) AND NOT(G ((p0 <= 0)))) : F (X (NOT(G (((p0 + 1 <= p8) OR (p13 <= p2)))))) : (F ((p13 <= p3)) AND ((1 <= 0) U (0 <= 0))) : X (X (F ((((p2 <= p4) U G ((p2 <= p4))) U X ((X ((p2 <= p4)) AND (p2 <= p4))))))) : (G (X ((p8 <= p6))) OR F ((G ((p0 <= p8)) OR X (X ((1 <= p5)))))) : NOT(X ((X (NOT(G ((NOT(X ((1 <= p8))) OR (p8 + 1 <= p4))))) AND NOT(F ((p13 + 1 <= p0)))))) : (X ((X ((G ((p1 <= p10)) OR (p4 + 1 <= p5))) AND (p1 <= p10))) AND (G ((p1 <= p10)) U (2 <= p8))) : G (F ((((0 <= 0) U NOT(G ((3 <= p8)))) AND G (X ((p11 + 1 <= p9)))))) : (G (F ((p6 <= p5))) AND ((p6 <= p5) U X ((p6 <= p5))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p1 <= p13)) AND X (G ((2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p13 + 1 <= p1)
lola: processed formula length: 15
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p1)))
lola: processed formula length: 17
lola: 51 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((F ((p6 <= 2)) OR X ((p0 <= 0))))) AND F ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p0 <= 0)
lola: processed formula length: 9
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 300002 markings, 300002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p8 <= p0) AND (p2 + 1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p8 <= p0) AND (p2 + 1 <= p13))))
lola: processed formula length: 40
lola: 51 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: 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 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((X ((p2 <= p4)) AND (p2 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((X ((p2 <= p4)) AND (p2 <= p4))))))
lola: processed formula length: 47
lola: 51 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400034 markings, 400057 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p8 <= p6))) OR F ((G ((p0 <= p8)) OR X (X ((1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p8 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p8 <= p6)))
lola: processed formula length: 18
lola: 51 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p0 <= p8)) OR X (X ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p0 <= p8)) OR X (X ((1 <= p5)))))
lola: processed formula length: 41
lola: 51 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: 400003 markings, 400003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((X ((p8 <= 0)) OR (p8 + 1 <= p4)))) OR F ((p13 + 1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((X ((p8 <= 0)) OR (p8 + 1 <= p4)))) OR F ((p13 + 1 <= p0))))
lola: processed formula length: 70
lola: 51 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 450002 markings, 450002 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((G ((p1 <= p10)) OR (p4 + 1 <= p5))) AND (p1 <= p10))) AND ((2 <= p8) OR (G ((p1 <= p10)) AND F ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p8)
lola: processed formula length: 9
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p8 <= 1)
lola: processed formula length: 9
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 300003 markings, 300003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p8 <= 2)) AND X (G ((p11 + 1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p8 <= 2)) AND X (G ((p11 + 1 <= p9))))))
lola: processed formula length: 51
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 400003 markings, 400003 edges
lola: ========================================
lola: subprocess 8 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p6 <= p5))) AND ((p6 <= p5) U X ((p6 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p6 <= p5)))
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 ((p6 <= p5)))
lola: processed formula length: 18
lola: 51 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p13 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 + 1 <= p13)
lola: processed formula length: 15
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 400001 markings, 400001 edges
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no
lola:
preliminary result: no no yes no no no no no no no
lola: ========================================
lola: memory consumption: 21388 KB
lola: time consumption: 7 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="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is CircadianClock-PT-100000, examination is 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 r056-oct2-162038334400021"
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 ;