Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200313.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 141K Apr 27 14:36 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 Dekker-PT-015-00
FORMULA_NAME Dekker-PT-015-01
FORMULA_NAME Dekker-PT-015-02
FORMULA_NAME Dekker-PT-015-03
FORMULA_NAME Dekker-PT-015-04
FORMULA_NAME Dekker-PT-015-05
FORMULA_NAME Dekker-PT-015-06
FORMULA_NAME Dekker-PT-015-07
FORMULA_NAME Dekker-PT-015-08
FORMULA_NAME Dekker-PT-015-09
FORMULA_NAME Dekker-PT-015-10
FORMULA_NAME Dekker-PT-015-11
FORMULA_NAME Dekker-PT-015-12
FORMULA_NAME Dekker-PT-015-13
FORMULA_NAME Dekker-PT-015-14
FORMULA_NAME Dekker-PT-015-15

=== Now, execution of the tool begins

BK_START 1591216179878

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:29:41] [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-03 20:29:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:29:41] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2020-06-03 20:29:41] [INFO ] Transformed 75 places.
[2020-06-03 20:29:41] [INFO ] Transformed 255 transitions.
[2020-06-03 20:29:41] [INFO ] Found NUPN structural information;
[2020-06-03 20:29:41] [INFO ] Parsed PT model containing 75 places and 255 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 362 ms. (steps per millisecond=276 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1]
[2020-06-03 20:29:42] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2020-06-03 20:29:42] [INFO ] Computed 45 place invariants in 8 ms
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive place invariants in 34 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 6 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 20:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned unsat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 20:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-03 20:29:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2020-06-03 20:29:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:29:42] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2020-06-03 20:29:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2020-06-03 20:29:42] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 8 ms.
[2020-06-03 20:29:42] [INFO ] Added : 16 causal constraints over 4 iterations in 60 ms. Result :sat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 13 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-06-03 20:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:42] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-03 20:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:42] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-03 20:29:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2020-06-03 20:29:42] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2020-06-03 20:29:42] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-06-03 20:29:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2020-06-03 20:29:42] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 9 ms.
[2020-06-03 20:29:42] [INFO ] Added : 16 causal constraints over 4 iterations in 42 ms. Result :sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 5 places in 10 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 5 places in 9 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:29:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 83 ms
[2020-06-03 20:29:43] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2020-06-03 20:29:43] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 5 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 5 places in 15 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2020-06-03 20:29:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 32 ms
[2020-06-03 20:29:43] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 10 ms.
[2020-06-03 20:29:43] [INFO ] Added : 16 causal constraints over 4 iterations in 44 ms. Result :sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:29:43] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:29:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 53 ms
[2020-06-03 20:29:43] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 8 ms.
[2020-06-03 20:29:43] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-03 20:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] Deduced a trap composed of 5 places in 9 ms
[2020-06-03 20:29:44] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2020-06-03 20:29:44] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:29:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 39 ms
[2020-06-03 20:29:44] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 8 ms.
[2020-06-03 20:29:44] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 20:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned unsat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 20:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-03 20:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:29:44] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-03 20:29:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2020-06-03 20:29:44] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 8 ms.
[2020-06-03 20:29:44] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-03 20:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-03 20:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:29:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-03 20:29:44] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2020-06-03 20:29:44] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2020-06-03 20:29:44] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-06-03 20:29:44] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 20:29:44] [INFO ] Flatten gal took : 60 ms
FORMULA Dekker-PT-015-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:29:44] [INFO ] Applying decomposition
[2020-06-03 20:29:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 20:29:44] [INFO ] Flatten gal took : 26 ms
[2020-06-03 20:29:44] [INFO ] Decomposing Gal with order
[2020-06-03 20:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 20:29:44] [INFO ] Removed a total of 795 redundant transitions.
[2020-06-03 20:29:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 20:29:44] [INFO ] Flatten gal took : 55 ms
[2020-06-03 20:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-06-03 20:29:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Dekker-PT-015-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:29:44] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 20:29:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-015 @ 3570 seconds

FORMULA Dekker-PT-015-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3549
rslt: Output for LTLCardinality @ Dekker-PT-015

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:29:45 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((((p18 <= 0)) OR ((1 <= p65))) U ((1 <= p49))))",
"processed_size": 52,
"rewrites": 58
},
"result":
{
"edges": 5,
"markings": 5,
"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": 356
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((((p56 <= 0)) OR ((1 <= p42))))))",
"processed_size": 43,
"rewrites": 58
},
"result":
{
"edges": 240,
"markings": 136,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p37)) AND ((p33 <= 0)))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 4,
"markings": 4,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((p29 <= 0)) OR ((1 <= p49))) OR (((p26 <= 0)) OR ((1 <= p18)))))",
"processed_size": 72,
"rewrites": 58
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((p13 <= 0)) OR ((1 <= p16)))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p2 <= 0)) OR ((1 <= p46)))))",
"processed_size": 38,
"rewrites": 58
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p67)) AND ((p10 <= 0)))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p68 <= 0)) OR ((1 <= p10)))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 13861749,
"markings": 229637,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p50 <= 0)) OR ((1 <= p43)))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 7900696,
"markings": 131077,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p36)) AND ((p3 <= 0)) AND ((1 <= p32)) AND ((p24 <= 0)))))",
"processed_size": 72,
"rewrites": 58
},
"result":
{
"edges": 5,
"markings": 4,
"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": 3549
},
"child":
[

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p17 <= 0)) OR ((1 <= p51)))))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 388,
"markings": 133,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 38356,
"runtime": 21.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F(G(*)) : (G(F(**)) AND **) : (X((** U **)) OR G(**)) : F(G(**)) : (X(X(G(*))) AND ((** U **) OR (** U **))) : X(X(F(*))) : (X((** OR **)) OR G(F(**))) : F(G(**)) : X(F(**)) : X(G(*))"
},
"net":
{
"arcs": 1830,
"conflict_clusters": 1,
"places": 75,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 255
},
"result":
{
"preliminary_value": "no no no no no no yes yes no yes no ",
"value": "no no no no no no yes yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 330/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 75
lola: finding significant places
lola: 75 places, 255 transitions, 30 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: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: F (X ((G ((((p50 <= 0)) OR ((1 <= p43)))) OR ((1 <= 0) U (1 <= 0))))) : NOT(F ((F (((1 <= p61))) U G (((0 <= 0) U (((1 <= p68)) AND ((p10 <= 0)))))))) : (F (G (F (((0 <= 0) U (X ((((1 <= p45)) AND ((p70 <= 0)))) U (((p17 <= 0)) OR ((1 <= p51)))))))) AND (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51)))) : (X (((((p18 <= 0)) OR ((1 <= p65))) U ((1 <= p49)))) OR G ((((p55 <= 0)) OR ((1 <= p58))))) : F (((((p67 <= 0)) OR ((1 <= p10))) U G ((X (((1 <= 0) U (1 <= 0))) OR (((1 <= p67)) AND ((p10 <= 0))))))) : (NOT(X (F (X ((((p22 <= 0)) OR ((1 <= p33))))))) AND (((((p68 <= 0)) OR ((1 <= p54))) U (((p22 <= 0)) OR ((1 <= p33)))) OR ((((p22 <= 0)) OR ((1 <= p33))) U (((p68 <= 0)) OR ((1 <= p54)))))) : F (((((p39 <= 0)) OR ((1 <= p58))) U X (((((p56 <= 0)) OR ((1 <= p42))) U NOT(X ((((1 <= p56)) AND ((p42 <= 0))))))))) : ((X ((((p29 <= 0)) OR ((1 <= p49)))) OR X ((((p26 <= 0)) OR ((1 <= p18))))) OR G (F ((((1 <= p37)) AND ((p33 <= 0)))))) : G (F (X (G (X (((0 <= 0) U G ((((1 <= p36)) AND ((p3 <= 0)) AND ((1 <= p32)) AND ((p24 <= 0)))))))))) : (((1 <= 0) U (0 <= 0)) AND F (((1 <= 0) U F (X ((((p20 <= 0)) U (((p13 <= 0)) OR ((1 <= p16))))))))) : G (NOT(X (F ((((1 <= p2)) AND ((p46 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((p18 <= 0)) OR ((1 <= p65))) U ((1 <= p49)))) OR G ((((p55 <= 0)) OR ((1 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p55 <= 0)) OR ((1 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p55 <= 0)) OR ((1 <= p58))))
lola: processed formula length: 35
lola: 58 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: 104 markings, 294 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p18 <= 0)) OR ((1 <= p65))) U ((1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p18 <= 0)) OR ((1 <= p65))) U ((1 <= p49))))
lola: processed formula length: 52
lola: 58 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((((1 <= p22)) AND ((p33 <= 0)))))) AND (((((p68 <= 0)) OR ((1 <= p54))) U (((p22 <= 0)) OR ((1 <= p33)))) OR ((((p22 <= 0)) OR ((1 <= p33))) U (((p68 <= 0)) OR ((1 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p22 <= 0)) OR ((1 <= p33))) U (((p68 <= 0)) OR ((1 <= p54))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p22 <= 0)) OR ((1 <= p33))) U (((p68 <= 0)) OR ((1 <= p54))))
lola: processed formula length: 67
lola: 58 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p22)) AND ((p33 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p22)) AND ((p33 <= 0))))))
lola: processed formula length: 43
lola: 58 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p56 <= 0)) OR ((1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p56 <= 0)) OR ((1 <= p42))))))
lola: processed formula length: 43
lola: 58 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: 136 markings, 240 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((p29 <= 0)) OR ((1 <= p49))) OR (((p26 <= 0)) OR ((1 <= p18))))) OR G (F ((((1 <= p37)) AND ((p33 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p37)) AND ((p33 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p37)) AND ((p33 <= 0)))))
lola: processed formula length: 39
lola: 58 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p29 <= 0)) OR ((1 <= p49))) OR (((p26 <= 0)) OR ((1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p29 <= 0)) OR ((1 <= p49))) OR (((p26 <= 0)) OR ((1 <= p18)))))
lola: processed formula length: 72
lola: 58 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: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p13 <= 0)) OR ((1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p13 <= 0)) OR ((1 <= p16)))))
lola: processed formula length: 39
lola: 58 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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p2 <= 0)) OR ((1 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p2 <= 0)) OR ((1 <= p46)))))
lola: processed formula length: 38
lola: 58 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p67)) AND ((p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p67)) AND ((p10 <= 0)))))
lola: processed formula length: 39
lola: 58 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p68 <= 0)) OR ((1 <= p10)))))
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 ((((p68 <= 0)) OR ((1 <= p10)))))
lola: processed formula length: 39
lola: 58 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: 98306 markings, 5429786 edges, 19661 markings/sec, 0 secs
lola: 201022 markings, 11898090 edges, 20543 markings/sec, 5 secs
lola: add low 250
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: 229637 markings, 13861749 edges
lola: ========================================
lola: subprocess 8 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p50 <= 0)) OR ((1 <= p43)))))
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 ((((p50 <= 0)) OR ((1 <= p43)))))
lola: processed formula length: 39
lola: 58 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: 106864 markings, 6014566 edges, 21373 markings/sec, 0 secs
lola: add low 244
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: 131077 markings, 7900696 edges
lola: ========================================
lola: subprocess 9 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p36)) AND ((p3 <= 0)) AND ((1 <= p32)) AND ((p24 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p36)) AND ((p3 <= 0)) AND ((1 <= p32)) AND ((p24 <= 0)))))
lola: processed formula length: 72
lola: 58 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((p17 <= 0)) OR ((1 <= p51))))) AND (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51)))
lola: processed formula length: 48
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((((p17 <= 0)) OR ((1 <= p51))))) AND (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p11)) OR ((p17 <= 0)) OR ((1 <= p51)))
lola: processed formula length: 48
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((p17 <= 0)) OR ((1 <= p51)))))
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 ((((p17 <= 0)) OR ((1 <= p51)))))
lola: processed formula length: 39
lola: 58 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: 133 markings, 388 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes yes no yes no
lola:
preliminary result: no no no no no no yes yes no yes no
lola: memory consumption: 38356 KB
lola: time consumption: 21 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="Dekker-PT-015"
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 Dekker-PT-015, 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 r178-tajo-158987882200313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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