Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902500209.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is DoubleExponent-PT-004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 67K 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 DoubleExponent-PT-004-00
FORMULA_NAME DoubleExponent-PT-004-01
FORMULA_NAME DoubleExponent-PT-004-02
FORMULA_NAME DoubleExponent-PT-004-03
FORMULA_NAME DoubleExponent-PT-004-04
FORMULA_NAME DoubleExponent-PT-004-05
FORMULA_NAME DoubleExponent-PT-004-06
FORMULA_NAME DoubleExponent-PT-004-07
FORMULA_NAME DoubleExponent-PT-004-08
FORMULA_NAME DoubleExponent-PT-004-09
FORMULA_NAME DoubleExponent-PT-004-10
FORMULA_NAME DoubleExponent-PT-004-11
FORMULA_NAME DoubleExponent-PT-004-12
FORMULA_NAME DoubleExponent-PT-004-13
FORMULA_NAME DoubleExponent-PT-004-14
FORMULA_NAME DoubleExponent-PT-004-15

=== Now, execution of the tool begins

BK_START 1620745958941

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 15:12:40] [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-11 15:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:12:40] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-11 15:12:40] [INFO ] Transformed 216 places.
[2021-05-11 15:12:40] [INFO ] Transformed 198 transitions.
[2021-05-11 15:12:40] [INFO ] Parsed PT model containing 216 places and 198 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3320 resets, run finished after 424 ms. (steps per millisecond=235 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 198 rows 216 cols
[2021-05-11 15:12:41] [INFO ] Computed 24 place invariants in 15 ms
[2021-05-11 15:12:41] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned unsat
[2021-05-11 15:12:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-11 15:12:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-11 15:12:41] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-11 15:12:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:41] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-11 15:12:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2021-05-11 15:12:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:41] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-11 15:12:41] [INFO ] Deduced a trap composed of 69 places in 89 ms
[2021-05-11 15:12:41] [INFO ] Deduced a trap composed of 41 places in 81 ms
[2021-05-11 15:12:41] [INFO ] Deduced a trap composed of 74 places in 62 ms
[2021-05-11 15:12:42] [INFO ] Deduced a trap composed of 73 places in 58 ms
[2021-05-11 15:12:42] [INFO ] Deduced a trap composed of 43 places in 57 ms
[2021-05-11 15:12:42] [INFO ] Deduced a trap composed of 49 places in 49 ms
[2021-05-11 15:12:42] [INFO ] Deduced a trap composed of 59 places in 54 ms
[2021-05-11 15:12:42] [INFO ] Deduced a trap composed of 63 places in 47 ms
[2021-05-11 15:12:42] [INFO ] Deduced a trap composed of 67 places in 38 ms
[2021-05-11 15:12:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 676 ms
[2021-05-11 15:12:42] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 24 ms.
[2021-05-11 15:12:43] [INFO ] Added : 195 causal constraints over 39 iterations in 846 ms. Result :sat
[2021-05-11 15:12:43] [INFO ] Deduced a trap composed of 68 places in 43 ms
[2021-05-11 15:12:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-11 15:12:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:43] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-11 15:12:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:43] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-11 15:12:43] [INFO ] Deduced a trap composed of 70 places in 69 ms
[2021-05-11 15:12:43] [INFO ] Deduced a trap composed of 51 places in 66 ms
[2021-05-11 15:12:43] [INFO ] Deduced a trap composed of 87 places in 64 ms
[2021-05-11 15:12:44] [INFO ] Deduced a trap composed of 49 places in 74 ms
[2021-05-11 15:12:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 320 ms
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-11 15:12:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:44] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:12:44] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:44] [INFO ] Added : 108 causal constraints over 22 iterations in 295 ms. Result :sat
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:44] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 61 places in 70 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 77 places in 71 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 84 places in 67 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 79 places in 67 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 76 places in 63 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 75 places in 59 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 88 places in 58 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 106 places in 60 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 63 places in 58 ms
[2021-05-11 15:12:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 676 ms
[2021-05-11 15:12:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:45] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:45] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 61 places in 72 ms
[2021-05-11 15:12:45] [INFO ] Deduced a trap composed of 51 places in 62 ms
[2021-05-11 15:12:46] [INFO ] Deduced a trap composed of 81 places in 67 ms
[2021-05-11 15:12:46] [INFO ] Deduced a trap composed of 88 places in 58 ms
[2021-05-11 15:12:46] [INFO ] Deduced a trap composed of 64 places in 60 ms
[2021-05-11 15:12:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 369 ms
[2021-05-11 15:12:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2021-05-11 15:12:46] [INFO ] Added : 160 causal constraints over 32 iterations in 497 ms. Result :sat
[2021-05-11 15:12:46] [INFO ] Deduced a trap composed of 77 places in 60 ms
[2021-05-11 15:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2021-05-11 15:12:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:46] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:46] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 61 places in 68 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 77 places in 66 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 84 places in 68 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 79 places in 57 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 76 places in 67 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 75 places in 61 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 88 places in 65 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 106 places in 65 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 63 places in 67 ms
[2021-05-11 15:12:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 682 ms
[2021-05-11 15:12:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:47] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:47] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 61 places in 61 ms
[2021-05-11 15:12:47] [INFO ] Deduced a trap composed of 51 places in 62 ms
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 81 places in 63 ms
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 88 places in 61 ms
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 64 places in 62 ms
[2021-05-11 15:12:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 356 ms
[2021-05-11 15:12:48] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:12:48] [INFO ] Added : 160 causal constraints over 32 iterations in 513 ms. Result :sat
[2021-05-11 15:12:48] [INFO ] Deduced a trap composed of 77 places in 62 ms
[2021-05-11 15:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2021-05-11 15:12:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:12:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned unsat
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:49] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-11 15:12:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:49] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:49] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 91 places in 63 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 29 places in 62 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 59 places in 39 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 49 places in 35 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 57 places in 33 ms
[2021-05-11 15:12:49] [INFO ] Deduced a trap composed of 101 places in 74 ms
[2021-05-11 15:12:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 509 ms
[2021-05-11 15:12:49] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 17 ms.
[2021-05-11 15:12:50] [INFO ] Added : 151 causal constraints over 31 iterations in 534 ms. Result :sat
[2021-05-11 15:12:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:50] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-11 15:12:50] [INFO ] Deduced a trap composed of 66 places in 78 ms
[2021-05-11 15:12:50] [INFO ] Deduced a trap composed of 94 places in 67 ms
[2021-05-11 15:12:50] [INFO ] Deduced a trap composed of 96 places in 66 ms
[2021-05-11 15:12:50] [INFO ] Deduced a trap composed of 98 places in 72 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 88 places in 74 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 121 places in 60 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 103 places in 69 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 69 places in 62 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 118 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 109 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 93 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 77 places in 45 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 83 places in 45 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 57 places in 59 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 105 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 102 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Deduced a trap composed of 97 places in 61 ms
[2021-05-11 15:12:51] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1299 ms
[2021-05-11 15:12:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:52] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 66 places in 72 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 89 places in 72 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 85 places in 71 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 85 places in 71 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 88 places in 70 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 84 places in 70 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 76 places in 61 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 90 places in 72 ms
[2021-05-11 15:12:52] [INFO ] Deduced a trap composed of 86 places in 71 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 77 places in 69 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 78 places in 70 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 100 places in 71 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 102 places in 68 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 105 places in 58 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 100 places in 68 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 89 places in 72 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 90 places in 69 ms
[2021-05-11 15:12:53] [INFO ] Deduced a trap composed of 59 places in 41 ms
[2021-05-11 15:12:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1526 ms
[2021-05-11 15:12:53] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:12:54] [INFO ] Added : 194 causal constraints over 39 iterations in 611 ms. Result :sat
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 106 places in 64 ms
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 112 places in 60 ms
[2021-05-11 15:12:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2021-05-11 15:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-11 15:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:54] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:54] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 65 places in 62 ms
[2021-05-11 15:12:54] [INFO ] Deduced a trap composed of 90 places in 63 ms
[2021-05-11 15:12:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2021-05-11 15:12:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:54] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:55] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-11 15:12:55] [INFO ] Deduced a trap composed of 65 places in 73 ms
[2021-05-11 15:12:55] [INFO ] Deduced a trap composed of 87 places in 73 ms
[2021-05-11 15:12:55] [INFO ] Deduced a trap composed of 87 places in 74 ms
[2021-05-11 15:12:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2021-05-11 15:12:55] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:55] [INFO ] Added : 194 causal constraints over 41 iterations in 629 ms. Result :sat
[2021-05-11 15:12:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:55] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-11 15:12:56] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:56] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-11 15:12:56] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:56] [INFO ] Added : 160 causal constraints over 32 iterations in 446 ms. Result :sat
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 2 ms returned unsat
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-11 15:12:57] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 11 ms.
[2021-05-11 15:12:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:57] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-11 15:12:57] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:57] [INFO ] Added : 151 causal constraints over 31 iterations in 411 ms. Result :sat
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:57] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:12:57] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:58] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-11 15:12:58] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:12:58] [INFO ] Added : 151 causal constraints over 31 iterations in 416 ms. Result :sat
[2021-05-11 15:12:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-11 15:12:58] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2021-05-11 15:12:58] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 35 ms returned sat
[2021-05-11 15:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:58] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-11 15:12:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:58] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:59] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 62 places in 45 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 63 places in 45 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 82 places in 43 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 59 places in 43 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 46 places in 43 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 88 places in 42 ms
[2021-05-11 15:12:59] [INFO ] Deduced a trap composed of 57 places in 39 ms
[2021-05-11 15:12:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 370 ms
[2021-05-11 15:12:59] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:00] [INFO ] Added : 195 causal constraints over 39 iterations in 684 ms. Result :sat
[2021-05-11 15:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:00] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:00] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:13:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:00] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:00] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-11 15:13:00] [INFO ] Deduced a trap composed of 43 places in 36 ms
[2021-05-11 15:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-11 15:13:00] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 12 ms.
[2021-05-11 15:13:00] [INFO ] Added : 161 causal constraints over 33 iterations in 508 ms. Result :sat
[2021-05-11 15:13:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:01] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:13:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:01] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 74 places in 61 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 95 places in 66 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 90 places in 57 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 86 places in 56 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 79 places in 56 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 41 places in 56 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 87 places in 59 ms
[2021-05-11 15:13:01] [INFO ] Deduced a trap composed of 78 places in 57 ms
[2021-05-11 15:13:02] [INFO ] Deduced a trap composed of 49 places in 56 ms
[2021-05-11 15:13:02] [INFO ] Deduced a trap composed of 98 places in 55 ms
[2021-05-11 15:13:02] [INFO ] Deduced a trap composed of 95 places in 56 ms
[2021-05-11 15:13:02] [INFO ] Deduced a trap composed of 99 places in 55 ms
[2021-05-11 15:13:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 839 ms
[2021-05-11 15:13:02] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:02] [INFO ] Added : 134 causal constraints over 27 iterations in 417 ms. Result :sat
[2021-05-11 15:13:02] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:02] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-11 15:13:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:03] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 91 places in 59 ms
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 85 places in 58 ms
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 59 places in 34 ms
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 106 places in 61 ms
[2021-05-11 15:13:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2021-05-11 15:13:03] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 21 ms.
[2021-05-11 15:13:03] [INFO ] Added : 143 causal constraints over 29 iterations in 469 ms. Result :sat
[2021-05-11 15:13:03] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2021-05-11 15:13:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-11 15:13:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:03] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-11 15:13:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:04] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:13:04] [INFO ] Deduced a trap composed of 76 places in 64 ms
[2021-05-11 15:13:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2021-05-11 15:13:04] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:04] [INFO ] Added : 128 causal constraints over 26 iterations in 395 ms. Result :sat
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned unsat
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:04] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-11 15:13:04] [INFO ] Deduced a trap composed of 63 places in 61 ms
[2021-05-11 15:13:04] [INFO ] Deduced a trap composed of 41 places in 24 ms
[2021-05-11 15:13:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2021-05-11 15:13:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:05] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-11 15:13:05] [INFO ] Deduced a trap composed of 63 places in 59 ms
[2021-05-11 15:13:05] [INFO ] Deduced a trap composed of 41 places in 28 ms
[2021-05-11 15:13:05] [INFO ] Deduced a trap composed of 49 places in 21 ms
[2021-05-11 15:13:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2021-05-11 15:13:05] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:05] [INFO ] Added : 154 causal constraints over 31 iterations in 443 ms. Result :sat
[2021-05-11 15:13:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-11 15:13:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:06] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-11 15:13:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-11 15:13:06] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:06] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 106 places in 60 ms
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 59 places in 34 ms
[2021-05-11 15:13:06] [INFO ] Deduced a trap composed of 49 places in 58 ms
[2021-05-11 15:13:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2021-05-11 15:13:06] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:07] [INFO ] Added : 193 causal constraints over 39 iterations in 770 ms. Result :sat
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:07] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:13:07] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:07] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:07] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:13:07] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:08] [INFO ] Added : 185 causal constraints over 37 iterations in 577 ms. Result :sat
[2021-05-11 15:13:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-11 15:13:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:08] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:08] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-11 15:13:08] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 10 ms.
[2021-05-11 15:13:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:08] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:08] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-11 15:13:08] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:09] [INFO ] Added : 195 causal constraints over 39 iterations in 616 ms. Result :sat
[2021-05-11 15:13:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:09] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-11 15:13:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:09] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-11 15:13:09] [INFO ] Deduced a trap composed of 85 places in 64 ms
[2021-05-11 15:13:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2021-05-11 15:13:09] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:10] [INFO ] Added : 152 causal constraints over 31 iterations in 504 ms. Result :sat
[2021-05-11 15:13:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-11 15:13:10] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2021-05-11 15:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:10] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-11 15:13:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:13:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-11 15:13:10] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-11 15:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:13:10] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 94 places in 73 ms
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 101 places in 66 ms
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 57 places in 60 ms
[2021-05-11 15:13:10] [INFO ] Deduced a trap composed of 41 places in 27 ms
[2021-05-11 15:13:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 264 ms
[2021-05-11 15:13:10] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints in 9 ms.
[2021-05-11 15:13:11] [INFO ] Added : 195 causal constraints over 39 iterations in 585 ms. Result :sat
[2021-05-11 15:13:11] [INFO ] Deduced a trap composed of 39 places in 33 ms
[2021-05-11 15:13:11] [INFO ] Deduced a trap composed of 24 places in 22 ms
[2021-05-11 15:13:11] [INFO ] Deduced a trap composed of 25 places in 22 ms
[2021-05-11 15:13:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
Successfully simplified 15 atomic propositions for a total of 17 simplifications.
[2021-05-11 15:13:11] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-11 15:13:11] [INFO ] Flatten gal took : 64 ms
FORMULA DoubleExponent-PT-004-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 15:13:11] [INFO ] Flatten gal took : 20 ms
[2021-05-11 15:13:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 15:13:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DoubleExponent-PT-004 @ 3570 seconds

FORMULA DoubleExponent-PT-004-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-004-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DoubleExponent-PT-004

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p178 <= p24)",
"processed_size": 13,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p117)) R F ((X ((p117 <= 0)) AND (p24 + 1 <= p178)))))",
"processed_size": 67,
"rewrites": 58
},
"result":
{
"edges": 48,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "F (G ((2 <= p69)))",
"processed_size": 18,
"rewrites": 58
},
"result":
{
"edges": 27,
"markings": 26,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p151)))",
"processed_size": 19,
"rewrites": 58
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p1 <= 1)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 34,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p172 + 1 <= p162)))",
"processed_size": 26,
"rewrites": 58
},
"result":
{
"edges": 27,
"markings": 26,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 21308,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : X((F(**) U **)) : X((F(G((** OR (G(**) AND F(**))))) OR (G(F(*)) AND F(G((** OR (G(**) AND F(**)))))))) : F(G(**)) : F(G(**)) : (X((G(**) R F((X(*) AND *)))) AND **) : G(F(*))"
},
"net":
{
"arcs": 558,
"conflict_clusters": 143,
"places": 216,
"places_significant": 192,
"singleton_clusters": 0,
"transitions": 198
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "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: 414/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6912
lola: finding significant places
lola: 216 places, 198 transitions, 192 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (NOT(G (F (X ((p162 <= p172)))))) : X ((F ((1 <= p40)) U (1 <= p72))) : X ((G (F (NOT(X ((p170 <= 2))))) U F (G ((G ((2 <= p169)) U (3 <= p170)))))) : F (NOT(G (F (X (NOT(X ((1 <= p151)))))))) : F (G (((F (G (F ((p176 <= p163)))) U (1 <= 0)) OR X (G ((2 <= p69)))))) : (NOT(X ((NOT(G ((1 <= p117))) U G ((X ((1 <= p117)) OR (p178 <= p24)))))) AND (p178 <= p24)) : (X (G ((p15 <= p75))) U X (G (X (G (NOT(X (G ((2 <= p1)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p40)) U (1 <= p72)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p40)) U (1 <= p72)))
lola: processed formula length: 33
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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((3 <= p170) OR (G ((2 <= p169)) AND F ((3 <= p170)))))) OR (G (F ((3 <= p170))) AND F (G (((3 <= p170) OR (G ((2 <= p169)) AND F ((3 <= p170)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((3 <= p170) OR (G ((2 <= p169)) AND F ((3 <= p170)))))) OR (G (F ((3 <= p170))) AND F (G (((3 <= p170) OR (G ((2 <= p169)) AND F ((3 <= p170)))))))))
lola: processed formula length: 160
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 61 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: 28 markings, 29 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((1 <= p117)) R F ((X ((p117 <= 0)) AND (p24 + 1 <= p178))))) AND (p178 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p178 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p178 <= p24)
lola: processed formula length: 13
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p117)) R F ((X ((p117 <= 0)) AND (p24 + 1 <= p178)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p117)) R F ((X ((p117 <= 0)) AND (p24 + 1 <= p178)))))
lola: processed formula length: 67
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 48 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p69)))
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 ((2 <= p69)))
lola: processed formula length: 18
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: 26 markings, 27 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p151)))
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 <= p151)))
lola: processed formula length: 19
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: 26 markings, 27 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p1 <= 1)))
lola: processed formula length: 17
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: 30 markings, 34 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p172 + 1 <= p162)))
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 ((p172 + 1 <= p162)))
lola: processed formula length: 26
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: 26 markings, 27 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 21308 KB
lola: time consumption: 3 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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r094-tall-162048902500209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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