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.r066-tajo-158922814800764.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 itstools
Input is DoubleExponent-PT-003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 50K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590134460909

[2020-05-22 08:01:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 08:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:01:02] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-05-22 08:01:02] [INFO ] Transformed 163 places.
[2020-05-22 08:01:02] [INFO ] Transformed 148 transitions.
[2020-05-22 08:01:02] [INFO ] Parsed PT model containing 163 places and 148 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Incomplete random walk after 100000 steps, including 3322 resets, run finished after 238 ms. (steps per millisecond=420 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 148 rows 163 cols
[2020-05-22 08:01:03] [INFO ] Computed 19 place invariants in 11 ms
[2020-05-22 08:01:03] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-05-22 08:01:03] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 08:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:03] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-05-22 08:01:03] [INFO ] Deduced a trap composed of 75 places in 107 ms
[2020-05-22 08:01:03] [INFO ] Deduced a trap composed of 64 places in 317 ms
[2020-05-22 08:01:03] [INFO ] Deduced a trap composed of 42 places in 57 ms
[2020-05-22 08:01:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2020-05-22 08:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 115 ms returned sat
[2020-05-22 08:01:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 24 ms returned sat
[2020-05-22 08:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:04] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-05-22 08:01:04] [INFO ] Deduced a trap composed of 75 places in 110 ms
[2020-05-22 08:01:04] [INFO ] Deduced a trap composed of 64 places in 71 ms
[2020-05-22 08:01:04] [INFO ] Deduced a trap composed of 42 places in 27 ms
[2020-05-22 08:01:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2020-05-22 08:01:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 17 ms.
[2020-05-22 08:01:04] [INFO ] Added : 145 causal constraints over 29 iterations in 454 ms. Result :sat
[2020-05-22 08:01:05] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 08:01:05] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:05] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-22 08:01:05] [INFO ] Deduced a trap composed of 47 places in 116 ms
[2020-05-22 08:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2020-05-22 08:01:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 08:01:05] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:05] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-22 08:01:05] [INFO ] Deduced a trap composed of 47 places in 128 ms
[2020-05-22 08:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2020-05-22 08:01:05] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 25 ms.
[2020-05-22 08:01:06] [INFO ] Added : 143 causal constraints over 29 iterations in 592 ms. Result :sat
[2020-05-22 08:01:06] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 08:01:06] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:06] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-05-22 08:01:06] [INFO ] Deduced a trap composed of 53 places in 143 ms
[2020-05-22 08:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2020-05-22 08:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-05-22 08:01:06] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 08:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:06] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-22 08:01:06] [INFO ] Deduced a trap composed of 53 places in 51 ms
[2020-05-22 08:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-05-22 08:01:06] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 15 ms.
[2020-05-22 08:01:07] [INFO ] Added : 145 causal constraints over 29 iterations in 442 ms. Result :sat
[2020-05-22 08:01:07] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 08:01:07] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 08:01:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:07] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-05-22 08:01:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 16 ms.
[2020-05-22 08:01:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 08:01:07] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 08:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:07] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2020-05-22 08:01:07] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 08:01:08] [INFO ] Added : 142 causal constraints over 29 iterations in 331 ms. Result :sat
[2020-05-22 08:01:08] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-05-22 08:01:08] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 08:01:08] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:08] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-22 08:01:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-05-22 08:01:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 08:01:08] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 08:01:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:08] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2020-05-22 08:01:08] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 08:01:08] [INFO ] Added : 143 causal constraints over 30 iterations in 357 ms. Result :sat
[2020-05-22 08:01:09] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2020-05-22 08:01:09] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 08:01:09] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 08:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:09] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 48 places in 49 ms
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 65 places in 41 ms
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2020-05-22 08:01:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2020-05-22 08:01:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:01:09] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:09] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 48 places in 76 ms
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 65 places in 55 ms
[2020-05-22 08:01:09] [INFO ] Deduced a trap composed of 56 places in 50 ms
[2020-05-22 08:01:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2020-05-22 08:01:09] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-05-22 08:01:10] [INFO ] Added : 141 causal constraints over 29 iterations in 441 ms. Result :sat
[2020-05-22 08:01:10] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-05-22 08:01:10] [INFO ] Deduced a trap composed of 65 places in 66 ms
[2020-05-22 08:01:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2020-05-22 08:01:10] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 08:01:10] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:10] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-05-22 08:01:10] [INFO ] Deduced a trap composed of 42 places in 36 ms
[2020-05-22 08:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2020-05-22 08:01:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 08:01:10] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 08:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:10] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-05-22 08:01:10] [INFO ] Deduced a trap composed of 42 places in 16 ms
[2020-05-22 08:01:10] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 72 places in 80 ms
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2020-05-22 08:01:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 246 ms
[2020-05-22 08:01:11] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 10 ms.
[2020-05-22 08:01:11] [INFO ] Added : 143 causal constraints over 29 iterations in 295 ms. Result :sat
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 25 places in 65 ms
[2020-05-22 08:01:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2020-05-22 08:01:11] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:01:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned unsat
[2020-05-22 08:01:11] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-22 08:01:11] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 08:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:11] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 75 places in 62 ms
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 64 places in 75 ms
[2020-05-22 08:01:11] [INFO ] Deduced a trap composed of 42 places in 27 ms
[2020-05-22 08:01:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2020-05-22 08:01:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 08:01:11] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2020-05-22 08:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:12] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-05-22 08:01:12] [INFO ] Deduced a trap composed of 75 places in 68 ms
[2020-05-22 08:01:12] [INFO ] Deduced a trap composed of 64 places in 83 ms
[2020-05-22 08:01:12] [INFO ] Deduced a trap composed of 42 places in 32 ms
[2020-05-22 08:01:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2020-05-22 08:01:12] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-05-22 08:01:12] [INFO ] Added : 145 causal constraints over 29 iterations in 299 ms. Result :sat
[2020-05-22 08:01:12] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2020-05-22 08:01:12] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 08:01:12] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 08:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:12] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-05-22 08:01:12] [INFO ] Deduced a trap composed of 73 places in 56 ms
[2020-05-22 08:01:12] [INFO ] Deduced a trap composed of 67 places in 97 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 74 places in 99 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 53 places in 50 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 74 places in 49 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 82 places in 85 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 79 places in 71 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 82 places in 57 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 85 places in 54 ms
[2020-05-22 08:01:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 722 ms
[2020-05-22 08:01:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 08:01:13] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:13] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 73 places in 71 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 58 places in 66 ms
[2020-05-22 08:01:13] [INFO ] Deduced a trap composed of 74 places in 151 ms
[2020-05-22 08:01:14] [INFO ] Deduced a trap composed of 42 places in 133 ms
[2020-05-22 08:01:14] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2020-05-22 08:01:14] [INFO ] Deduced a trap composed of 76 places in 92 ms
[2020-05-22 08:01:14] [INFO ] Deduced a trap composed of 76 places in 56 ms
[2020-05-22 08:01:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 768 ms
[2020-05-22 08:01:14] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2020-05-22 08:01:14] [INFO ] Added : 140 causal constraints over 28 iterations in 390 ms. Result :sat
[2020-05-22 08:01:14] [INFO ] Deduced a trap composed of 80 places in 81 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 74 places in 79 ms
[2020-05-22 08:01:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2020-05-22 08:01:15] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 08:01:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned unsat
[2020-05-22 08:01:15] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-05-22 08:01:15] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 08:01:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 08:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:15] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 58 places in 74 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 53 places in 80 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 77 places in 81 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 81 places in 62 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 86 places in 82 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 79 places in 66 ms
[2020-05-22 08:01:15] [INFO ] Deduced a trap composed of 85 places in 71 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 77 places in 66 ms
[2020-05-22 08:01:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 686 ms
[2020-05-22 08:01:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 08:01:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:16] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 58 places in 68 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 88 places in 69 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 62 places in 61 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 29 places in 62 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 72 places in 58 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 80 places in 60 ms
[2020-05-22 08:01:16] [INFO ] Deduced a trap composed of 42 places in 25 ms
[2020-05-22 08:01:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 559 ms
[2020-05-22 08:01:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 08:01:17] [INFO ] Added : 145 causal constraints over 29 iterations in 449 ms. Result :sat
[2020-05-22 08:01:17] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-05-22 08:01:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2020-05-22 08:01:17] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 08:01:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:17] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2020-05-22 08:01:17] [INFO ] Deduced a trap composed of 29 places in 38 ms
[2020-05-22 08:01:17] [INFO ] Deduced a trap composed of 42 places in 38 ms
[2020-05-22 08:01:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2020-05-22 08:01:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-05-22 08:01:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:17] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-22 08:01:17] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2020-05-22 08:01:17] [INFO ] Deduced a trap composed of 42 places in 31 ms
[2020-05-22 08:01:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2020-05-22 08:01:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 12 ms.
[2020-05-22 08:01:18] [INFO ] Added : 143 causal constraints over 29 iterations in 407 ms. Result :sat
[2020-05-22 08:01:18] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2020-05-22 08:01:18] [INFO ] Deduced a trap composed of 25 places in 42 ms
[2020-05-22 08:01:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2020-05-22 08:01:18] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 08:01:18] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 8 ms returned sat
[2020-05-22 08:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:18] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-05-22 08:01:18] [INFO ] Deduced a trap composed of 60 places in 69 ms
[2020-05-22 08:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2020-05-22 08:01:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 08:01:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:18] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-05-22 08:01:18] [INFO ] Deduced a trap composed of 60 places in 49 ms
[2020-05-22 08:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2020-05-22 08:01:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 15 ms.
[2020-05-22 08:01:19] [INFO ] Added : 139 causal constraints over 28 iterations in 419 ms. Result :sat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned unsat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned unsat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned unsat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned unsat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 08:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:19] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-05-22 08:01:19] [INFO ] Deduced a trap composed of 42 places in 67 ms
[2020-05-22 08:01:19] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-05-22 08:01:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2020-05-22 08:01:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-05-22 08:01:19] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2020-05-22 08:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:19] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-05-22 08:01:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2020-05-22 08:01:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-05-22 08:01:20] [INFO ] Added : 142 causal constraints over 29 iterations in 331 ms. Result :sat
[2020-05-22 08:01:20] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 08:01:20] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:20] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 42 places in 57 ms
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 56 places in 42 ms
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 63 places in 63 ms
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 67 places in 52 ms
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 69 places in 46 ms
[2020-05-22 08:01:20] [INFO ] Deduced a trap composed of 48 places in 34 ms
[2020-05-22 08:01:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 374 ms
[2020-05-22 08:01:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2020-05-22 08:01:21] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 08:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:21] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-22 08:01:21] [INFO ] Deduced a trap composed of 42 places in 62 ms
[2020-05-22 08:01:21] [INFO ] Deduced a trap composed of 48 places in 49 ms
[2020-05-22 08:01:21] [INFO ] Deduced a trap composed of 66 places in 46 ms
[2020-05-22 08:01:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2020-05-22 08:01:21] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-05-22 08:01:21] [INFO ] Added : 145 causal constraints over 29 iterations in 380 ms. Result :sat
[2020-05-22 08:01:21] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:01:21] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:21] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-22 08:01:21] [INFO ] Deduced a trap composed of 42 places in 21 ms
[2020-05-22 08:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-05-22 08:01:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-05-22 08:01:22] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2020-05-22 08:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:22] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2020-05-22 08:01:22] [INFO ] Deduced a trap composed of 42 places in 31 ms
[2020-05-22 08:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2020-05-22 08:01:22] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2020-05-22 08:01:22] [INFO ] Added : 143 causal constraints over 29 iterations in 399 ms. Result :sat
[2020-05-22 08:01:22] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2020-05-22 08:01:22] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 08:01:22] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2020-05-22 08:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:22] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-05-22 08:01:22] [INFO ] Deduced a trap composed of 43 places in 31 ms
[2020-05-22 08:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-05-22 08:01:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 08:01:22] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:23] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-05-22 08:01:23] [INFO ] Deduced a trap composed of 43 places in 28 ms
[2020-05-22 08:01:23] [INFO ] Deduced a trap composed of 42 places in 21 ms
[2020-05-22 08:01:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2020-05-22 08:01:23] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2020-05-22 08:01:23] [INFO ] Added : 141 causal constraints over 29 iterations in 406 ms. Result :sat
[2020-05-22 08:01:23] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-22 08:01:23] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 10 ms returned sat
[2020-05-22 08:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:23] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-22 08:01:23] [INFO ] Deduced a trap composed of 42 places in 46 ms
[2020-05-22 08:01:23] [INFO ] Deduced a trap composed of 57 places in 77 ms
[2020-05-22 08:01:23] [INFO ] Deduced a trap composed of 58 places in 57 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 67 places in 54 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 78 places in 54 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 73 places in 54 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 48 places in 39 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 68 places in 62 ms
[2020-05-22 08:01:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 527 ms
[2020-05-22 08:01:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:01:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:01:24] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 7 ms returned sat
[2020-05-22 08:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:01:24] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 42 places in 47 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 73 places in 48 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 69 places in 59 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 68 places in 54 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 48 places in 74 ms
[2020-05-22 08:01:24] [INFO ] Deduced a trap composed of 67 places in 77 ms
[2020-05-22 08:01:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 415 ms
[2020-05-22 08:01:24] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 9 ms.
[2020-05-22 08:01:25] [INFO ] Added : 129 causal constraints over 26 iterations in 370 ms. Result :sat
[2020-05-22 08:01:25] [INFO ] Deduced a trap composed of 38 places in 50 ms
[2020-05-22 08:01:25] [INFO ] Deduced a trap composed of 73 places in 76 ms
[2020-05-22 08:01:25] [INFO ] Deduced a trap composed of 75 places in 70 ms
[2020-05-22 08:01:25] [INFO ] Deduced a trap composed of 66 places in 54 ms
[2020-05-22 08:01:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2020-05-22 08:01:25] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
[2020-05-22 08:01:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 08:01:25] [INFO ] Flatten gal took : 55 ms
[2020-05-22 08:01:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-22 08:01:25] [INFO ] Flatten gal took : 18 ms
FORMULA DoubleExponent-PT-003-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 08:01:25] [INFO ] Applying decomposition
[2020-05-22 08:01:25] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph6744272001545091225.txt, -o, /tmp/graph6744272001545091225.bin, -w, /tmp/graph6744272001545091225.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6744272001545091225.bin, -l, -1, -v, -w, /tmp/graph6744272001545091225.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 08:01:26] [INFO ] Decomposing Gal with order
[2020-05-22 08:01:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:01:26] [INFO ] Removed a total of 43 redundant transitions.
[2020-05-22 08:01:26] [INFO ] Flatten gal took : 50 ms
[2020-05-22 08:01:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2020-05-22 08:01:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2020-05-22 08:01:26] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
built 17 ordering constraints for composite.
built 20 ordering constraints for composite.
built 22 ordering constraints for composite.
built 24 ordering constraints for composite.
built 21 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 32 ordering constraints for composite.
built 25 ordering constraints for composite.
built 28 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38507e+06,86.6345,540604,69857,1363,815173,2904,483,937650,27,17308,0


Converting to forward existential form...Done !
original formula: (AF(AG(((i5.u24.p152>=1)&&(i6.i0.i0.u53.p56>=1)))) * (AG((i2.u33.p2<1)) + A((i2.u66.p98<1) U ((i3.u48.p43>=1)&&(i2.u66.p9>=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((i5.u24.p152>=1)&&(i6.i0.i0.u53.p56>=1)))))))] = FALSE * [(FwdU((Init * !(!((E(!(((i3.u48.p43>=1)&&(i2.u66.p9>=1))) U (!((i2.u66.p98<1)) * !(((i3.u48.p43>=1)&&(i2.u66.p9>=1))))) + EG(!(((i3.u48.p43>=1)&&(i2.u66.p9>=1)))))))),TRUE) * !((i2.u33.p2<1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t101, t123, t135, t144, t147, t16, t19, t51, t58, t61, t73, t85, t88, t94, t97, i0.t117, i0.t108, i0.u14.t122, i1.t129, i1.t111, i1.u8.t99, i1.u20.t134, i2.t9, i2.u18.t7, i3.t37, i3.u48.t42, i4.t25, i4.u42.t30, i5.t79, i5.t138, i5.u37.t49, i5.u67.t84, i6.i1.i2.t67, i6.i1.i2.u62.t72, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/112/34/146
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2020-05-22 08:21:33] [INFO ] Flatten gal took : 19 ms
[2020-05-22 08:21:33] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2020-05-22 08:21:33] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38507e+06,0.590625,18044,2,23042,5,58478,6,0,790,32593,0


Converting to forward existential form...Done !
original formula: (AF(AG(((p152>=1)&&(p56>=1)))) * (AG((p2<1)) + A((p98<1) U ((p43>=1)&&(p9>=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((p152>=1)&&(p56>=1)))))))] = FALSE * [(FwdU((Init * !(!((E(!(((p43>=1)&&(p9>=1))) U (!((p98<1)) * !(((p43>=1)&&(p9>=1))))) + EG(!(((p43>=1)&&(p9>=1)))))))),TRUE) * !((p2<1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t101, t108, t111, t117, t122, t123, t129, t134, t135, t138, t144, t147, t16, t19, t25, t30, t37, t42, t49, t51, t58, t61, t67, t7, t72, t73, t79, t84, t85, t88, t9, t94, t97, t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/114/34/148
(forward)formula 0,0,164.269,2778096,1,0,18722,1.40005e+07,13,333,3320,1.15933e+07,2
FORMULA DoubleExponent-PT-003-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AX(EG(((((p2>=1)||(p105>=1))||(p59<1))||(p78<1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((((p2>=1)||(p105>=1))||(p59<1))||(p78<1)))))] = FALSE
(forward)formula 1,1,175.972,2778096,1,0,18722,1.40005e+07,17,333,3953,1.15933e+07,310
FORMULA DoubleExponent-PT-003-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: A(((EG((p41>=1)) + (p26>=1)) + (p132>=1)) U EG((p117<1)))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((p117<1)))))) * !(E(!(EG((p117<1))) U (!(((EG((p41>=1)) + (p26>=1)) + (p132>=1))) * !(EG((p117<1)))))))] != FALSE
(forward)formula 2,1,182.537,2778096,1,0,18722,1.40005e+07,30,333,3954,1.15933e+07,498
FORMULA DoubleExponent-PT-003-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: AG(AF(((p152<1)||(p56<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p152<1)||(p56<1))))] = FALSE
dead was empty
(forward)formula 3,1,182.562,2778096,1,0,18722,1.40005e+07,32,333,3958,1.15933e+07,499
FORMULA DoubleExponent-PT-003-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: AF(((p55>=1)&&(p61>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p55>=1)&&(p61>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 140/0/8
(forward)formula 4,0,182.595,2778096,1,0,18722,1.40005e+07,40,333,4101,1.15933e+07,502
FORMULA DoubleExponent-PT-003-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AF(E((p102>=1) U (p138>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(E((p102>=1) U (p138>=1))))] = FALSE
(forward)formula 5,0,192.533,2778096,1,0,18722,1.40005e+07,48,4039,4101,1.15933e+07,4323
FORMULA DoubleExponent-PT-003-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: (E(EF((p135>=1)) U EG((p82>=1))) + (AX(((p13>=1)&&(p34>=1))) * E((p17>=1) U (p138>=1))))
=> equivalent forward existential formula: ([(EY((Init * !(E(E(TRUE U (p135>=1)) U EG((p82>=1)))))) * !(((p13>=1)&&(p34>=1))))] = FALSE * [((Init * !(E(E(TRUE U (p135>=1)) U EG((p82>=1))))) * !(E((p17>=1) U (p138>=1))))] = FALSE)
(forward)formula 6,0,198.688,2778096,1,0,18722,1.40005e+07,65,4271,4309,1.15933e+07,4909
FORMULA DoubleExponent-PT-003-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: EF((p141>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (p141>=1))] != FALSE
(forward)formula 7,1,198.7,2778096,1,0,18722,1.40005e+07,66,4272,4309,1.15933e+07,4910
FORMULA DoubleExponent-PT-003-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: AX(AF((((p21<1)&&(p122>=1))&&(p137>=1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((p21<1)&&(p122>=1))&&(p137>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 142/0/6
(forward)formula 8,0,198.815,2778096,1,0,18722,1.40005e+07,74,4275,4494,1.15933e+07,4913
FORMULA DoubleExponent-PT-003-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AX(AF(EX(((p55>=1)&&(p61>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(((p55>=1)&&(p61>=1)))))] = FALSE
(forward)formula 9,0,199.006,2778096,1,0,18722,1.40005e+07,77,4490,4494,1.15933e+07,5129
FORMULA DoubleExponent-PT-003-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: AF(EG(((p124>=1)&&(p142>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p124>=1)&&(p142>=1)))))] = FALSE
(forward)formula 10,0,199.015,2778096,1,0,18722,1.40005e+07,81,4492,4495,1.15933e+07,5130
FORMULA DoubleExponent-PT-003-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

original formula: A(EG(((p108<1)||(p140<1))) U AF(((p104>=1)&&(p30>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((p104>=1)&&(p30>=1))))))))) * !(E(!(!(EG(!(((p104>=1)&&(p30>=1)))))) U (!(EG(((p108<1)||(p140<1)))) * !(!(EG(!(((p104>=1)&&(p30>=1))))))))))] != FALSE
(forward)formula 11,0,218.194,2786288,1,0,18722,1.50178e+07,93,4791,4502,1.40794e+07,5766
FORMULA DoubleExponent-PT-003-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************


BK_STOP 1590135912848

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-003"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DoubleExponent-PT-003, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814800764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;