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.r083-tall-162048875400431.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 itstools
Input is DoubleExponent-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875400431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 5 16:58 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.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.6K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 169K 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-010-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620589757912

Running Version 0
[2021-05-09 19:49:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 19:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 19:49:19] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-09 19:49:19] [INFO ] Transformed 534 places.
[2021-05-09 19:49:19] [INFO ] Transformed 498 transitions.
[2021-05-09 19:49:19] [INFO ] Parsed PT model containing 534 places and 498 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 336 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Probabilistic random walk after 1000001 steps, saw 500065 distinct states, run finished after 6322 ms. (steps per millisecond=158 ) properties seen :{0=1, 12=1}
FORMULA DoubleExponent-PT-010-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-010-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
// Phase 1: matrix 498 rows 534 cols
[2021-05-09 19:49:26] [INFO ] Computed 54 place invariants in 69 ms
[2021-05-09 19:49:26] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2021-05-09 19:49:26] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2021-05-09 19:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:26] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-09 19:49:26] [INFO ] Deduced a trap composed of 209 places in 191 ms of which 3 ms to minimize.
[2021-05-09 19:49:27] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 2 ms to minimize.
[2021-05-09 19:49:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 537 ms
[2021-05-09 19:49:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:49:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:27] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:27] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-09 19:49:27] [INFO ] Deduced a trap composed of 209 places in 160 ms of which 2 ms to minimize.
[2021-05-09 19:49:27] [INFO ] Deduced a trap composed of 191 places in 143 ms of which 1 ms to minimize.
[2021-05-09 19:49:27] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2021-05-09 19:49:28] [INFO ] Deduced a trap composed of 205 places in 148 ms of which 2 ms to minimize.
[2021-05-09 19:49:28] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2021-05-09 19:49:28] [INFO ] Deduced a trap composed of 205 places in 139 ms of which 1 ms to minimize.
[2021-05-09 19:49:28] [INFO ] Deduced a trap composed of 197 places in 138 ms of which 0 ms to minimize.
[2021-05-09 19:49:28] [INFO ] Deduced a trap composed of 203 places in 136 ms of which 0 ms to minimize.
[2021-05-09 19:49:28] [INFO ] Deduced a trap composed of 175 places in 139 ms of which 0 ms to minimize.
[2021-05-09 19:49:29] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 0 ms to minimize.
[2021-05-09 19:49:29] [INFO ] Deduced a trap composed of 185 places in 148 ms of which 0 ms to minimize.
[2021-05-09 19:49:29] [INFO ] Deduced a trap composed of 195 places in 156 ms of which 0 ms to minimize.
[2021-05-09 19:49:29] [INFO ] Deduced a trap composed of 199 places in 149 ms of which 1 ms to minimize.
[2021-05-09 19:49:29] [INFO ] Deduced a trap composed of 211 places in 149 ms of which 0 ms to minimize.
[2021-05-09 19:49:29] [INFO ] Deduced a trap composed of 208 places in 151 ms of which 0 ms to minimize.
[2021-05-09 19:49:30] [INFO ] Deduced a trap composed of 208 places in 131 ms of which 0 ms to minimize.
[2021-05-09 19:49:30] [INFO ] Deduced a trap composed of 207 places in 145 ms of which 0 ms to minimize.
[2021-05-09 19:49:30] [INFO ] Deduced a trap composed of 230 places in 147 ms of which 1 ms to minimize.
[2021-05-09 19:49:30] [INFO ] Deduced a trap composed of 217 places in 151 ms of which 1 ms to minimize.
[2021-05-09 19:49:30] [INFO ] Deduced a trap composed of 178 places in 125 ms of which 0 ms to minimize.
[2021-05-09 19:49:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3479 ms
[2021-05-09 19:49:30] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-09 19:49:32] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2021-05-09 19:49:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-09 19:49:32] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned unsat
[2021-05-09 19:49:32] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-09 19:49:32] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2021-05-09 19:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:32] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-09 19:49:32] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 1 ms to minimize.
[2021-05-09 19:49:33] [INFO ] Deduced a trap composed of 191 places in 146 ms of which 1 ms to minimize.
[2021-05-09 19:49:33] [INFO ] Deduced a trap composed of 215 places in 140 ms of which 0 ms to minimize.
[2021-05-09 19:49:33] [INFO ] Deduced a trap composed of 188 places in 139 ms of which 1 ms to minimize.
[2021-05-09 19:49:33] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:49:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 778 ms
[2021-05-09 19:49:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:49:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:33] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:33] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-09 19:49:34] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 0 ms to minimize.
[2021-05-09 19:49:34] [INFO ] Deduced a trap composed of 181 places in 140 ms of which 1 ms to minimize.
[2021-05-09 19:49:34] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:49:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
[2021-05-09 19:49:34] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-09 19:49:38] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2021-05-09 19:49:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-09 19:49:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2021-05-09 19:49:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-09 19:49:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:49:38] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:39] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-09 19:49:39] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-09 19:49:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:49:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:39] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2021-05-09 19:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:39] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-09 19:49:39] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-09 19:49:44] [INFO ] Added : 454 causal constraints over 91 iterations in 4625 ms. Result :unknown
[2021-05-09 19:49:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:44] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:44] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-09 19:49:44] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2021-05-09 19:49:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2021-05-09 19:49:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:49:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:44] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:45] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-09 19:49:45] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2021-05-09 19:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2021-05-09 19:49:45] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-09 19:49:49] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2021-05-09 19:49:49] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2021-05-09 19:49:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2021-05-09 19:49:49] [INFO ] Added : 445 causal constraints over 89 iterations in 4365 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2021-05-09 19:49:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:49] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:49] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-09 19:49:49] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-09 19:49:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:49:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:49:50] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:50] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-09 19:49:50] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-09 19:49:54] [INFO ] Added : 338 causal constraints over 68 iterations in 4312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-09 19:49:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:49:54] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:54] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-09 19:49:55] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2021-05-09 19:49:55] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 0 ms to minimize.
[2021-05-09 19:49:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2021-05-09 19:49:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:49:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2021-05-09 19:49:55] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:49:55] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2021-05-09 19:49:55] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 1 ms to minimize.
[2021-05-09 19:49:55] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2021-05-09 19:49:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2021-05-09 19:49:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-09 19:50:00] [INFO ] Added : 485 causal constraints over 97 iterations in 4425 ms. Result :unknown
[2021-05-09 19:50:00] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:50:00] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2021-05-09 19:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:50:00] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2021-05-09 19:50:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:50:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:50:00] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:50:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:50:01] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2021-05-09 19:50:01] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2021-05-09 19:50:01] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2021-05-09 19:50:01] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2021-05-09 19:50:01] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 0 ms to minimize.
[2021-05-09 19:50:01] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2021-05-09 19:50:01] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2021-05-09 19:50:02] [INFO ] Deduced a trap composed of 129 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:50:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 825 ms
[2021-05-09 19:50:02] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-09 19:50:05] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2021-05-09 19:50:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-09 19:50:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:50:05] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:50:06] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-09 19:50:06] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2021-05-09 19:50:06] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2021-05-09 19:50:06] [INFO ] Deduced a trap composed of 126 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:50:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 318 ms
[2021-05-09 19:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:50:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:50:06] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:50:06] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2021-05-09 19:50:06] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 0 ms to minimize.
[2021-05-09 19:50:07] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 0 ms to minimize.
[2021-05-09 19:50:07] [INFO ] Deduced a trap composed of 126 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:50:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2021-05-09 19:50:07] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-09 19:50:11] [INFO ] Added : 400 causal constraints over 80 iterations in 4399 ms. Result :unknown
[2021-05-09 19:50:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-09 19:50:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-09 19:50:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
FORMULA DoubleExponent-PT-010-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 2629700 steps, including 91536 resets, run finished after 6078 ms. (steps per millisecond=432 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1514400 steps, including 55947 resets, run finished after 3467 ms. (steps per millisecond=436 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 473700 steps, including 16739 resets, run finished after 1070 ms. (steps per millisecond=442 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10233100 steps, including 378379 resets, run finished after 22916 ms. (steps per millisecond=446 ) properties (out of 8) seen :0 could not realise parikh vector
Interrupted Parikh walk after 13134815 steps, including 459630 resets, run timeout after 30001 ms. (steps per millisecond=437 ) properties (out of 8) seen :0
Support contains 24 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 527 transition count 399
Reduce places removed 97 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 105 rules applied. Total rules applied 206 place count 430 transition count 391
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 214 place count 422 transition count 391
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 214 place count 422 transition count 369
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 258 place count 400 transition count 369
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 426 place count 316 transition count 285
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 450 place count 304 transition count 285
Free-agglomeration rule (complex) applied 35 times.
Iterating global reduction 3 with 35 rules applied. Total rules applied 485 place count 304 transition count 250
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 520 place count 269 transition count 250
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 562 place count 269 transition count 250
Applied a total of 562 rules in 151 ms. Remains 269 /534 variables (removed 265) and now considering 250/498 (removed 248) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/534 places, 250/498 transitions.
[2021-05-09 19:51:15] [INFO ] Flatten gal took : 62 ms
[2021-05-09 19:51:15] [INFO ] Flatten gal took : 26 ms
[2021-05-09 19:51:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17030142508487471982.gal : 15 ms
[2021-05-09 19:51:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12654658891052856582.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17030142508487471982.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12654658891052856582.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17030142508487471982.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12654658891052856582.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12654658891052856582.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :19 after 32
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :32 after 52
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :52 after 116
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :116 after 482
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :482 after 1397
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1397 after 11601
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :11601 after 39201
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :39201 after 112069
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :112069 after 388197
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :388197 after 929779
Reachability property DoubleExponent-PT-010-ReachabilityFireability-01 is true.
FORMULA DoubleExponent-PT-010-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :929779 after 1.25481e+07
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :1.25481e+07 after 3.07033e+07
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :3.07033e+07 after 7.16361e+07
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :7.16361e+07 after 1.64455e+08
Detected timeout of ITS tools.
[2021-05-09 19:51:30] [INFO ] Flatten gal took : 22 ms
[2021-05-09 19:51:30] [INFO ] Applying decomposition
[2021-05-09 19:51:30] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13882658677870443478.txt, -o, /tmp/graph13882658677870443478.bin, -w, /tmp/graph13882658677870443478.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13882658677870443478.bin, -l, -1, -v, -w, /tmp/graph13882658677870443478.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 19:51:30] [INFO ] Decomposing Gal with order
[2021-05-09 19:51:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 19:51:30] [INFO ] Removed a total of 209 redundant transitions.
[2021-05-09 19:51:30] [INFO ] Flatten gal took : 67 ms
[2021-05-09 19:51:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 14 ms.
[2021-05-09 19:51:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16933932620028855666.gal : 8 ms
[2021-05-09 19:51:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10852715514518405176.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16933932620028855666.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10852715514518405176.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16933932620028855666.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10852715514518405176.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10852715514518405176.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :4 after 21
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :21 after 64
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :64 after 208
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :208 after 676
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :676 after 1097
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10372374660495212760
[2021-05-09 19:51:46] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10372374660495212760
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10372374660495212760]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10372374660495212760] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10372374660495212760] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 100773 resets, run finished after 2230 ms. (steps per millisecond=448 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71544 resets, run finished after 1621 ms. (steps per millisecond=616 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71979 resets, run finished after 1596 ms. (steps per millisecond=626 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71561 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 71864 resets, run finished after 1496 ms. (steps per millisecond=668 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71687 resets, run finished after 1595 ms. (steps per millisecond=626 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71670 resets, run finished after 1613 ms. (steps per millisecond=619 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71904 resets, run finished after 1499 ms. (steps per millisecond=667 ) properties (out of 7) seen :0
Probably explored full state space saw : 935297 states, properties seen :{}
Probabilistic random walk after 1870702 steps, saw 935297 distinct states, run finished after 8330 ms. (steps per millisecond=224 ) properties seen :{}
Interrupted probabilistic random walk after 5838932 steps, run timeout after 30157 ms. (steps per millisecond=193 ) properties seen :{}
Exhaustive walk after 5838932 steps, saw 2919693 distinct states, run finished after 30157 ms. (steps per millisecond=193 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 250 rows 269 cols
[2021-05-09 19:52:38] [INFO ] Computed 50 place invariants in 57 ms
[2021-05-09 19:52:38] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2021-05-09 19:52:38] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:39] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-09 19:52:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-09 19:52:39] [INFO ] [Real]Added 38 Read/Feed constraints in 23 ms returned sat
[2021-05-09 19:52:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:39] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:39] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-09 19:52:39] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:52:39] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2021-05-09 19:52:39] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 27 ms.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2021-05-09 19:52:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 870 ms
[2021-05-09 19:52:41] [INFO ] Added : 218 causal constraints over 44 iterations in 2620 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-09 19:52:41] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:42] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-09 19:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:42] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-09 19:52:42] [INFO ] [Real]Added 38 Read/Feed constraints in 11 ms returned sat
[2021-05-09 19:52:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:52:42] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-09 19:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:42] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-09 19:52:42] [INFO ] [Nat]Added 38 Read/Feed constraints in 14 ms returned sat
[2021-05-09 19:52:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2021-05-09 19:52:42] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:52:44] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:52:44] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2021-05-09 19:52:44] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:52:44] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 0 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:52:45] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:46] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 1 ms to minimize.
[2021-05-09 19:52:47] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 40 places in 23 ms of which 0 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 43 places in 24 ms of which 1 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 3924 ms
[2021-05-09 19:52:48] [INFO ] Added : 230 causal constraints over 46 iterations in 6108 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-09 19:52:48] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:52:48] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 4 ms returned sat
[2021-05-09 19:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:48] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-09 19:52:48] [INFO ] [Real]Added 38 Read/Feed constraints in 13 ms returned sat
[2021-05-09 19:52:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:52:48] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 4 ms returned sat
[2021-05-09 19:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-09 19:52:48] [INFO ] [Nat]Added 38 Read/Feed constraints in 17 ms returned sat
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:52:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 194 ms
[2021-05-09 19:52:49] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:52:50] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2021-05-09 19:52:50] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2021-05-09 19:52:50] [INFO ] Added : 214 causal constraints over 43 iterations in 1871 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-09 19:52:50] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:50] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:51] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-09 19:52:51] [INFO ] [Real]Added 38 Read/Feed constraints in 13 ms returned sat
[2021-05-09 19:52:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:51] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:51] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-09 19:52:51] [INFO ] [Nat]Added 38 Read/Feed constraints in 12 ms returned sat
[2021-05-09 19:52:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2021-05-09 19:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-09 19:52:51] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 15 ms.
[2021-05-09 19:52:52] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2021-05-09 19:52:52] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2021-05-09 19:52:52] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 0 ms to minimize.
[2021-05-09 19:52:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 246 ms
[2021-05-09 19:52:52] [INFO ] Added : 187 causal constraints over 39 iterations in 1650 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-09 19:52:53] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:52:53] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:53] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-09 19:52:53] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:52:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:53] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:53] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-09 19:52:53] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:52:53] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:52:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-09 19:52:53] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 18 ms.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 37 places in 22 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Deduced a trap composed of 39 places in 18 ms of which 0 ms to minimize.
[2021-05-09 19:52:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 543 ms
[2021-05-09 19:52:55] [INFO ] Added : 213 causal constraints over 45 iterations in 2376 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 19:52:55] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:55] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:55] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-09 19:52:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:52:55] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-09 19:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:56] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-09 19:52:56] [INFO ] [Nat]Added 38 Read/Feed constraints in 27 ms returned sat
[2021-05-09 19:52:56] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:52:56] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:52:56] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:52:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2021-05-09 19:52:56] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 16 ms.
[2021-05-09 19:52:58] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:52:58] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2021-05-09 19:52:58] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2021-05-09 19:52:58] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:52:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 255 ms
[2021-05-09 19:52:58] [INFO ] Added : 231 causal constraints over 47 iterations in 2239 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-09 19:52:58] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:52:58] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:58] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-09 19:52:58] [INFO ] [Real]Added 38 Read/Feed constraints in 6 ms returned sat
[2021-05-09 19:52:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:52:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:52:58] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:52:58] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-09 19:52:58] [INFO ] [Nat]Added 38 Read/Feed constraints in 9 ms returned sat
[2021-05-09 19:52:58] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-09 19:52:58] [INFO ] Computed and/alt/rep : 233/1199/233 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:53:00] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:53:00] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:53:00] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2021-05-09 19:53:00] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 44 places in 23 ms of which 1 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 40 places in 22 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 48 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 41 places in 18 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2021-05-09 19:53:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 960 ms
[2021-05-09 19:53:01] [INFO ] Added : 211 causal constraints over 43 iterations in 2688 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 2662100 steps, including 314078 resets, run finished after 6231 ms. (steps per millisecond=427 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1766300 steps, including 208255 resets, run finished after 3867 ms. (steps per millisecond=456 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2493500 steps, including 293980 resets, run finished after 5456 ms. (steps per millisecond=457 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2709700 steps, including 299468 resets, run finished after 5903 ms. (steps per millisecond=459 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5675100 steps, including 668964 resets, run finished after 12336 ms. (steps per millisecond=460 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8939600 steps, including 1031309 resets, run finished after 19521 ms. (steps per millisecond=457 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4341900 steps, including 511988 resets, run finished after 9498 ms. (steps per millisecond=457 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 22 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 250/250 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 268 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 267 transition count 248
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 267 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 266 transition count 247
Applied a total of 6 rules in 31 ms. Remains 266 /269 variables (removed 3) and now considering 247/250 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/269 places, 247/250 transitions.
[2021-05-09 19:54:04] [INFO ] Flatten gal took : 21 ms
[2021-05-09 19:54:04] [INFO ] Flatten gal took : 20 ms
[2021-05-09 19:54:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7767767407317422809.gal : 2 ms
[2021-05-09 19:54:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16867455454906202529.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7767767407317422809.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16867455454906202529.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7767767407317422809.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16867455454906202529.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16867455454906202529.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :19 after 32
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :32 after 52
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :52 after 116
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :116 after 482
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :482 after 1414
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1414 after 16583
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :16583 after 46252
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :46252 after 112776
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :112776 after 307110
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :307110 after 670054
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :670054 after 2.09066e+07
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :2.09066e+07 after 1.25511e+08
Detected timeout of ITS tools.
[2021-05-09 19:54:19] [INFO ] Flatten gal took : 18 ms
[2021-05-09 19:54:19] [INFO ] Applying decomposition
[2021-05-09 19:54:19] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12394241570725534129.txt, -o, /tmp/graph12394241570725534129.bin, -w, /tmp/graph12394241570725534129.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12394241570725534129.bin, -l, -1, -v, -w, /tmp/graph12394241570725534129.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 19:54:19] [INFO ] Decomposing Gal with order
[2021-05-09 19:54:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 19:54:19] [INFO ] Removed a total of 109 redundant transitions.
[2021-05-09 19:54:19] [INFO ] Flatten gal took : 35 ms
[2021-05-09 19:54:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 7 ms.
[2021-05-09 19:54:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2842078970330084117.gal : 10 ms
[2021-05-09 19:54:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13612627162237028594.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2842078970330084117.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13612627162237028594.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2842078970330084117.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13612627162237028594.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13612627162237028594.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 32
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :32 after 1453
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :1453 after 940312
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :940312 after 5.89855e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2932367755449943966
[2021-05-09 19:54:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2932367755449943966
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2932367755449943966]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2932367755449943966] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2932367755449943966] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 100764 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71989 resets, run finished after 1545 ms. (steps per millisecond=647 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71701 resets, run finished after 1543 ms. (steps per millisecond=648 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 71760 resets, run finished after 1531 ms. (steps per millisecond=653 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 71708 resets, run finished after 1515 ms. (steps per millisecond=660 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71642 resets, run finished after 1550 ms. (steps per millisecond=645 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 71937 resets, run finished after 1591 ms. (steps per millisecond=628 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 71742 resets, run finished after 1518 ms. (steps per millisecond=658 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 6188156 steps, run timeout after 30001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 6188156 steps, saw 3093987 distinct states, run finished after 30001 ms. (steps per millisecond=206 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 247 rows 266 cols
[2021-05-09 19:55:18] [INFO ] Computed 50 place invariants in 26 ms
[2021-05-09 19:55:18] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:55:18] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:18] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-09 19:55:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:55:18] [INFO ] [Real]Added 39 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:55:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:18] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 4 ms returned sat
[2021-05-09 19:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:18] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-09 19:55:18] [INFO ] [Nat]Added 39 Read/Feed constraints in 13 ms returned sat
[2021-05-09 19:55:19] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2021-05-09 19:55:19] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:55:20] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2021-05-09 19:55:20] [INFO ] Added : 209 causal constraints over 42 iterations in 1790 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 19:55:20] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:55:20] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-09 19:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:21] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-09 19:55:21] [INFO ] [Real]Added 39 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:55:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:55:21] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 6 ms returned sat
[2021-05-09 19:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:21] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2021-05-09 19:55:21] [INFO ] [Nat]Added 39 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:55:21] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:55:23] [INFO ] Deduced a trap composed of 39 places in 23 ms of which 1 ms to minimize.
[2021-05-09 19:55:23] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2021-05-09 19:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2021-05-09 19:55:23] [INFO ] Added : 230 causal constraints over 47 iterations in 2134 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-09 19:55:23] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:23] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:23] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-09 19:55:23] [INFO ] [Real]Added 39 Read/Feed constraints in 11 ms returned sat
[2021-05-09 19:55:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:23] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 4 ms returned sat
[2021-05-09 19:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:23] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-09 19:55:23] [INFO ] [Nat]Added 39 Read/Feed constraints in 19 ms returned sat
[2021-05-09 19:55:23] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:55:25] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2021-05-09 19:55:25] [INFO ] Added : 210 causal constraints over 44 iterations in 1898 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-09 19:55:25] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:25] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:25] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:55:25] [INFO ] [Real]Added 39 Read/Feed constraints in 28 ms returned sat
[2021-05-09 19:55:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:25] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:25] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-09 19:55:25] [INFO ] [Nat]Added 39 Read/Feed constraints in 30 ms returned sat
[2021-05-09 19:55:25] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 1 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 62 places in 28 ms of which 1 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 65 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 68 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 65 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 69 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 66 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 69 places in 27 ms of which 1 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 67 places in 27 ms of which 1 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 71 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:55:28] [INFO ] Deduced a trap composed of 70 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:55:29] [INFO ] Deduced a trap composed of 74 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:55:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 939 ms
[2021-05-09 19:55:29] [INFO ] Added : 230 causal constraints over 47 iterations in 3161 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-09 19:55:29] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:29] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:29] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-09 19:55:29] [INFO ] [Real]Added 39 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:29] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 4 ms returned sat
[2021-05-09 19:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:29] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:55:29] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:55:29] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:55:31] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2021-05-09 19:55:31] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2021-05-09 19:55:31] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2021-05-09 19:55:31] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2021-05-09 19:55:31] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2021-05-09 19:55:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 323 ms
[2021-05-09 19:55:31] [INFO ] Added : 228 causal constraints over 46 iterations in 2219 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-09 19:55:31] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2021-05-09 19:55:31] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:31] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-09 19:55:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:31] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:31] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-09 19:55:31] [INFO ] [Nat]Added 39 Read/Feed constraints in 13 ms returned sat
[2021-05-09 19:55:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:55:32] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:55:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2021-05-09 19:55:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2021-05-09 19:55:32] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:55:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2021-05-09 19:55:34] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2021-05-09 19:55:34] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2021-05-09 19:55:34] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2021-05-09 19:55:34] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2021-05-09 19:55:34] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2021-05-09 19:55:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 415 ms
[2021-05-09 19:55:34] [INFO ] Added : 228 causal constraints over 46 iterations in 2389 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-09 19:55:34] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:34] [INFO ] [Real]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:34] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2021-05-09 19:55:34] [INFO ] [Real]Added 39 Read/Feed constraints in 9 ms returned sat
[2021-05-09 19:55:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:55:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2021-05-09 19:55:34] [INFO ] [Nat]Absence check using 20 positive and 30 generalized place invariants in 5 ms returned sat
[2021-05-09 19:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:55:34] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 19:55:34] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:55:34] [INFO ] Computed and/alt/rep : 230/1196/230 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2021-05-09 19:55:36] [INFO ] Deduced a trap composed of 38 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:55:37] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:55:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 533 ms
[2021-05-09 19:55:37] [INFO ] Added : 221 causal constraints over 45 iterations in 2242 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 1418200 steps, including 167465 resets, run finished after 3200 ms. (steps per millisecond=443 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6963400 steps, including 821101 resets, run finished after 15489 ms. (steps per millisecond=449 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1030700 steps, including 121517 resets, run finished after 2251 ms. (steps per millisecond=457 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4036000 steps, including 475758 resets, run finished after 8837 ms. (steps per millisecond=456 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5219400 steps, including 615745 resets, run finished after 11580 ms. (steps per millisecond=450 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8014600 steps, including 944567 resets, run finished after 17641 ms. (steps per millisecond=454 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4727300 steps, including 557130 resets, run finished after 10403 ms. (steps per millisecond=454 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 22 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 247/247 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 247/247 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 247/247 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 266 cols
[2021-05-09 19:56:46] [INFO ] Computed 50 place invariants in 16 ms
[2021-05-09 19:56:46] [INFO ] Implicit Places using invariants in 259 ms returned [23, 29, 49, 55, 78, 84, 104, 110, 132, 137, 138, 222, 229, 257, 263]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 261 ms to find 15 implicit places.
[2021-05-09 19:56:46] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 247 rows 251 cols
[2021-05-09 19:56:46] [INFO ] Computed 36 place invariants in 20 ms
[2021-05-09 19:56:46] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Starting structural reductions, iteration 1 : 251/266 places, 247/247 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 251 transition count 242
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 242
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 246 transition count 242
Applied a total of 14 rules in 24 ms. Remains 246 /251 variables (removed 5) and now considering 242/247 (removed 5) transitions.
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:56:46] [INFO ] Computed 36 place invariants in 13 ms
[2021-05-09 19:56:47] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:56:47] [INFO ] Computed 36 place invariants in 11 ms
[2021-05-09 19:56:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:56:47] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 246/266 places, 242/247 transitions.
[2021-05-09 19:56:47] [INFO ] Flatten gal took : 16 ms
[2021-05-09 19:56:47] [INFO ] Flatten gal took : 14 ms
[2021-05-09 19:56:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4435704959933135845.gal : 1 ms
[2021-05-09 19:56:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9385654469684961613.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4435704959933135845.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9385654469684961613.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4435704959933135845.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9385654469684961613.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9385654469684961613.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :17 after 29
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :29 after 49
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :49 after 156
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :156 after 546
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :546 after 1557
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1557 after 9875
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :9875 after 27306
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :27306 after 90133
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :90133 after 387945
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :387945 after 1.6166e+06
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :1.6166e+06 after 3.30126e+07
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :3.30126e+07 after 1.23529e+08
Detected timeout of ITS tools.
[2021-05-09 19:57:02] [INFO ] Flatten gal took : 13 ms
[2021-05-09 19:57:02] [INFO ] Applying decomposition
[2021-05-09 19:57:02] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15206621958685154635.txt, -o, /tmp/graph15206621958685154635.bin, -w, /tmp/graph15206621958685154635.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15206621958685154635.bin, -l, -1, -v, -w, /tmp/graph15206621958685154635.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 19:57:02] [INFO ] Decomposing Gal with order
[2021-05-09 19:57:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 19:57:02] [INFO ] Removed a total of 93 redundant transitions.
[2021-05-09 19:57:02] [INFO ] Flatten gal took : 25 ms
[2021-05-09 19:57:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 7 ms.
[2021-05-09 19:57:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16100310371469150627.gal : 3 ms
[2021-05-09 19:57:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16127190720960744658.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16100310371469150627.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16127190720960744658.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16100310371469150627.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16127190720960744658.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16127190720960744658.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :12 after 31
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :31 after 61
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :61 after 154
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :154 after 1296
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1296 after 24826
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5885162649124282953
[2021-05-09 19:57:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5885162649124282953
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5885162649124282953]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5885162649124282953] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5885162649124282953] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 109145 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76287 resets, run finished after 1540 ms. (steps per millisecond=649 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 75952 resets, run finished after 1550 ms. (steps per millisecond=645 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 76072 resets, run finished after 1497 ms. (steps per millisecond=668 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76100 resets, run finished after 1474 ms. (steps per millisecond=678 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 76071 resets, run finished after 1491 ms. (steps per millisecond=670 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 76127 resets, run finished after 1566 ms. (steps per millisecond=638 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 76140 resets, run finished after 1467 ms. (steps per millisecond=681 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 6493740 steps, run timeout after 30001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 6493740 steps, saw 3246482 distinct states, run finished after 30001 ms. (steps per millisecond=216 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:58:01] [INFO ] Computed 36 place invariants in 11 ms
[2021-05-09 19:58:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:01] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:01] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:58:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:58:01] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:58:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:01] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:01] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-09 19:58:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:58:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2021-05-09 19:58:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-09 19:58:01] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:58:03] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2021-05-09 19:58:03] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2021-05-09 19:58:03] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:58:03] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2021-05-09 19:58:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 221 ms
[2021-05-09 19:58:03] [INFO ] Added : 202 causal constraints over 41 iterations in 1684 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 19:58:03] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:03] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 7 ms returned sat
[2021-05-09 19:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:03] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-09 19:58:03] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:58:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:03] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:04] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 19:58:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:58:04] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2021-05-09 19:58:04] [INFO ] Deduced a trap composed of 38 places in 18 ms of which 0 ms to minimize.
[2021-05-09 19:58:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2021-05-09 19:58:04] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:58:05] [INFO ] Deduced a trap composed of 31 places in 21 ms of which 0 ms to minimize.
[2021-05-09 19:58:05] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 1 ms to minimize.
[2021-05-09 19:58:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2021-05-09 19:58:05] [INFO ] Added : 203 causal constraints over 42 iterations in 1677 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-09 19:58:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:05] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:05] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 19:58:05] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:58:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-09 19:58:05] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:06] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:58:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:58:06] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:58:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:58:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-09 19:58:07] [INFO ] Added : 194 causal constraints over 39 iterations in 1439 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-09 19:58:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:07] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:07] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2021-05-09 19:58:07] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:58:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:07] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:07] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-09 19:58:07] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2021-05-09 19:58:07] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:58:08] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:58:09] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 3 ms to minimize.
[2021-05-09 19:58:10] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 2762 ms
[2021-05-09 19:58:10] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:58:11] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:58:11] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2021-05-09 19:58:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2021-05-09 19:58:12] [INFO ] Added : 160 causal constraints over 32 iterations in 1405 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 19:58:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:12] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 19:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:12] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-09 19:58:12] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2021-05-09 19:58:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:12] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:12] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 19:58:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:12] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:58:13] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:58:13] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:58:13] [INFO ] Deduced a trap composed of 38 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:58:13] [INFO ] Deduced a trap composed of 36 places in 20 ms of which 1 ms to minimize.
[2021-05-09 19:58:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 685 ms
[2021-05-09 19:58:13] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 11 ms.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2021-05-09 19:58:14] [INFO ] Deduced a trap composed of 39 places in 18 ms of which 0 ms to minimize.
[2021-05-09 19:58:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 643 ms
[2021-05-09 19:58:15] [INFO ] Added : 185 causal constraints over 38 iterations in 1902 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 19:58:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:15] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:15] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2021-05-09 19:58:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:15] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:15] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-09 19:58:15] [INFO ] [Nat]Added 40 Read/Feed constraints in 18 ms returned sat
[2021-05-09 19:58:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:58:15] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2021-05-09 19:58:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2021-05-09 19:58:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2021-05-09 19:58:15] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
[2021-05-09 19:58:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 254 ms
[2021-05-09 19:58:15] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:58:17] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:58:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2021-05-09 19:58:17] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2021-05-09 19:58:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2021-05-09 19:58:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:58:18] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2021-05-09 19:58:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:58:18] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:58:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 527 ms
[2021-05-09 19:58:18] [INFO ] Added : 211 causal constraints over 43 iterations in 2575 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-09 19:58:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:18] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 7 ms returned sat
[2021-05-09 19:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:18] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-09 19:58:18] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2021-05-09 19:58:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:58:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:58:18] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:58:18] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-09 19:58:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:58:18] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:58:19] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2021-05-09 19:58:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 559 ms
[2021-05-09 19:58:20] [INFO ] Added : 205 causal constraints over 41 iterations in 1941 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 1060600 steps, including 136289 resets, run finished after 2321 ms. (steps per millisecond=456 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2669200 steps, including 332221 resets, run finished after 5961 ms. (steps per millisecond=447 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 670300 steps, including 83482 resets, run finished after 1471 ms. (steps per millisecond=455 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 455200 steps, including 58538 resets, run finished after 998 ms. (steps per millisecond=456 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1408600 steps, including 180938 resets, run finished after 3074 ms. (steps per millisecond=458 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3431100 steps, including 427253 resets, run finished after 7664 ms. (steps per millisecond=447 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10250200 steps, including 1275726 resets, run finished after 22882 ms. (steps per millisecond=447 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 22 out of 246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 246/246 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 246 /246 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 242/242 transitions.
Starting structural reductions, iteration 0 : 246/246 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 246 /246 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:59:04] [INFO ] Computed 36 place invariants in 12 ms
[2021-05-09 19:59:05] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:59:05] [INFO ] Computed 36 place invariants in 12 ms
[2021-05-09 19:59:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:59:05] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2021-05-09 19:59:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:59:05] [INFO ] Computed 36 place invariants in 12 ms
[2021-05-09 19:59:05] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 242/242 transitions.
Incomplete random walk after 100000 steps, including 10957 resets, run finished after 356 ms. (steps per millisecond=280 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 19:59:06] [INFO ] Computed 36 place invariants in 12 ms
[2021-05-09 19:59:06] [INFO ] [Real]Absence check using 5 positive place invariants in 22 ms returned sat
[2021-05-09 19:59:06] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 7 ms returned sat
[2021-05-09 19:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:06] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-09 19:59:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:59:06] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:59:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:06] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:06] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-09 19:59:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:59:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-09 19:59:06] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 15 ms.
[2021-05-09 19:59:08] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2021-05-09 19:59:08] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:59:08] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2021-05-09 19:59:08] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:59:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 251 ms
[2021-05-09 19:59:08] [INFO ] Added : 202 causal constraints over 41 iterations in 1755 ms. Result :sat
[2021-05-09 19:59:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-09 19:59:08] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 7 ms returned sat
[2021-05-09 19:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:08] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-09 19:59:08] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2021-05-09 19:59:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:08] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 7 ms returned sat
[2021-05-09 19:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:08] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 19:59:08] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:59:08] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:59:08] [INFO ] Deduced a trap composed of 38 places in 18 ms of which 1 ms to minimize.
[2021-05-09 19:59:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2021-05-09 19:59:08] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:59:10] [INFO ] Deduced a trap composed of 31 places in 21 ms of which 0 ms to minimize.
[2021-05-09 19:59:10] [INFO ] Deduced a trap composed of 33 places in 21 ms of which 1 ms to minimize.
[2021-05-09 19:59:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2021-05-09 19:59:10] [INFO ] Added : 203 causal constraints over 42 iterations in 1686 ms. Result :sat
[2021-05-09 19:59:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:10] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:10] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 19:59:10] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2021-05-09 19:59:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:10] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:10] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:59:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:59:10] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 14 ms.
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2021-05-09 19:59:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2021-05-09 19:59:12] [INFO ] Added : 194 causal constraints over 39 iterations in 1468 ms. Result :sat
[2021-05-09 19:59:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:12] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:12] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 19:59:12] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:59:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:12] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:12] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-09 19:59:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:59:12] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:13] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:14] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:59:15] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:59:15] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:59:15] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:59:15] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:59:15] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:59:15] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 2749 ms
[2021-05-09 19:59:15] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:59:16] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:59:16] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2021-05-09 19:59:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:59:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2021-05-09 19:59:16] [INFO ] Added : 160 causal constraints over 32 iterations in 1420 ms. Result :sat
[2021-05-09 19:59:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:16] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:16] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 19:59:16] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2021-05-09 19:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:17] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:17] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 19:59:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 38 places in 21 ms of which 1 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Deduced a trap composed of 36 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:59:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 705 ms
[2021-05-09 19:59:17] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Deduced a trap composed of 39 places in 19 ms of which 0 ms to minimize.
[2021-05-09 19:59:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 646 ms
[2021-05-09 19:59:19] [INFO ] Added : 185 causal constraints over 38 iterations in 1903 ms. Result :sat
[2021-05-09 19:59:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:19] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:19] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-09 19:59:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-09 19:59:19] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:20] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-09 19:59:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2021-05-09 19:59:20] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:59:20] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:59:20] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:59:20] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2021-05-09 19:59:20] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:59:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 267 ms
[2021-05-09 19:59:20] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 12 ms.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:59:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 518 ms
[2021-05-09 19:59:22] [INFO ] Added : 211 causal constraints over 43 iterations in 2575 ms. Result :sat
[2021-05-09 19:59:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:22] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:23] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-09 19:59:23] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:59:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 19:59:23] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 19:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:59:23] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-09 19:59:23] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:59:23] [INFO ] Computed and/alt/rep : 225/1210/225 causal constraints (skipped 16 transitions) in 13 ms.
[2021-05-09 19:59:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2021-05-09 19:59:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:59:24] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:59:24] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:59:24] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:59:24] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:59:25] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:59:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 483 ms
[2021-05-09 19:59:25] [INFO ] Added : 205 causal constraints over 41 iterations in 1867 ms. Result :sat
[2021-05-09 19:59:25] [INFO ] Flatten gal took : 12 ms
[2021-05-09 19:59:25] [INFO ] Flatten gal took : 11 ms
[2021-05-09 19:59:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7053239276097054685.gal : 1 ms
[2021-05-09 19:59:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16939638288246778719.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality7053239276097054685.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16939638288246778719.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality7053239276097054685.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16939638288246778719.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16939638288246778719.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :17 after 29
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :29 after 49
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :49 after 156
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :156 after 546
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :546 after 1557
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1557 after 9875
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :9875 after 27306
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :27306 after 90133
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :90133 after 387945
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :387945 after 1.6166e+06
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :1.6166e+06 after 3.30126e+07
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :3.30126e+07 after 1.23529e+08
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :1.23529e+08 after 3.28529e+08
Detected timeout of ITS tools.
[2021-05-09 19:59:45] [INFO ] Flatten gal took : 11 ms
[2021-05-09 19:59:45] [INFO ] Applying decomposition
[2021-05-09 19:59:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18207442370631424895.txt, -o, /tmp/graph18207442370631424895.bin, -w, /tmp/graph18207442370631424895.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18207442370631424895.bin, -l, -1, -v, -w, /tmp/graph18207442370631424895.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 19:59:45] [INFO ] Decomposing Gal with order
[2021-05-09 19:59:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 19:59:45] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-09 19:59:45] [INFO ] Flatten gal took : 21 ms
[2021-05-09 19:59:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 7 ms.
[2021-05-09 19:59:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11730824000338030538.gal : 2 ms
[2021-05-09 19:59:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5615815473222434876.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11730824000338030538.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5615815473222434876.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11730824000338030538.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5615815473222434876.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5615815473222434876.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :8 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :100 after 100
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :178 after 242
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :291 after 292
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1260 after 1913
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :49117 after 49164
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :49164 after 50506
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :96993 after 98186
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :144924 after 146804
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :241297 after 242176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12247868449968241546
[2021-05-09 20:00:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12247868449968241546
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12247868449968241546]
Compilation finished in 1170 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12247868449968241546]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, DoubleExponentPT010ReachabilityFireability03==true], workingDir=/tmp/ltsmin12247868449968241546]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 246 transition count 238
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 242 transition count 238
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 8 place count 242 transition count 226
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 32 place count 230 transition count 226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 224 transition count 220
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 224 transition count 220
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 223 transition count 219
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 223 transition count 219
Applied a total of 47 rules in 43 ms. Remains 223 /246 variables (removed 23) and now considering 219/242 (removed 23) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 219 rows 223 cols
[2021-05-09 20:00:25] [INFO ] Computed 36 place invariants in 12 ms
[2021-05-09 20:00:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 20:00:25] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:25] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-09 20:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 20:00:25] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:25] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2021-05-09 20:00:25] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2021-05-09 20:00:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2021-05-09 20:00:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:25] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:25] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 20:00:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:25] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2021-05-09 20:00:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2021-05-09 20:00:25] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 1 ms to minimize.
[2021-05-09 20:00:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2021-05-09 20:00:25] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 11 ms.
[2021-05-09 20:00:27] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2021-05-09 20:00:27] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2021-05-09 20:00:27] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2021-05-09 20:00:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2021-05-09 20:00:27] [INFO ] Added : 178 causal constraints over 37 iterations in 1491 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 20:00:27] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:27] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 20:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:27] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-09 20:00:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-09 20:00:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:27] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 20:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:27] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-09 20:00:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-09 20:00:27] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 11 ms.
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 38 places in 19 ms of which 0 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 331 ms
[2021-05-09 20:00:29] [INFO ] Added : 194 causal constraints over 39 iterations in 1686 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-09 20:00:29] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:29] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 20:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:29] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-09 20:00:29] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 20:00:29] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-09 20:00:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-09 20:00:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2021-05-09 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-09 20:00:29] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 10 ms.
[2021-05-09 20:00:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2021-05-09 20:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-09 20:00:30] [INFO ] Added : 145 causal constraints over 30 iterations in 971 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-09 20:00:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:30] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 20:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:30] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 20:00:30] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:30] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 20:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:31] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-09 20:00:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2021-05-09 20:00:31] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2021-05-09 20:00:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2021-05-09 20:00:31] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 10 ms.
[2021-05-09 20:00:32] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 0 ms to minimize.
[2021-05-09 20:00:32] [INFO ] Deduced a trap composed of 91 places in 51 ms of which 0 ms to minimize.
[2021-05-09 20:00:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2021-05-09 20:00:32] [INFO ] Added : 158 causal constraints over 32 iterations in 1335 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-09 20:00:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:32] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:32] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-09 20:00:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-09 20:00:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 20:00:32] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:32] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-09 20:00:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2021-05-09 20:00:32] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 0 ms to minimize.
[2021-05-09 20:00:32] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2021-05-09 20:00:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1016 ms
[2021-05-09 20:00:33] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 10 ms.
[2021-05-09 20:00:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2021-05-09 20:00:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2021-05-09 20:00:35] [INFO ] Added : 200 causal constraints over 40 iterations in 1743 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 20:00:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 20:00:35] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 7 ms returned sat
[2021-05-09 20:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:35] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-09 20:00:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:35] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-09 20:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:35] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-09 20:00:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:35] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2021-05-09 20:00:35] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2021-05-09 20:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2021-05-09 20:00:35] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 10 ms.
[2021-05-09 20:00:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2021-05-09 20:00:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2021-05-09 20:00:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2021-05-09 20:00:37] [INFO ] Added : 201 causal constraints over 41 iterations in 2066 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-09 20:00:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:38] [INFO ] [Real]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:38] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-09 20:00:38] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:00:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-09 20:00:38] [INFO ] [Nat]Absence check using 5 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-09 20:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:00:38] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-09 20:00:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-09 20:00:38] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2021-05-09 20:00:38] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2021-05-09 20:00:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-09 20:00:38] [INFO ] Computed and/alt/rep : 204/1071/204 causal constraints (skipped 14 transitions) in 11 ms.
[2021-05-09 20:00:40] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2021-05-09 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-09 20:00:40] [INFO ] Added : 200 causal constraints over 40 iterations in 2106 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-09 20:00:40] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2021-05-09 20:00:40] [INFO ] Flatten gal took : 11 ms
[2021-05-09 20:00:40] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin16788917525974145640
[2021-05-09 20:00:40] [INFO ] Computing symmetric may disable matrix : 242 transitions.
[2021-05-09 20:00:40] [INFO ] Input system was already deterministic with 242 transitions.
[2021-05-09 20:00:40] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 20:00:40] [INFO ] Flatten gal took : 19 ms
[2021-05-09 20:00:40] [INFO ] Computing symmetric may enable matrix : 242 transitions.
[2021-05-09 20:00:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 20:00:40] [INFO ] Computing Do-Not-Accords matrix : 242 transitions.
[2021-05-09 20:00:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 20:00:40] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16788917525974145640
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16788917525974145640]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13612057302362561967.txt, -o, /tmp/graph13612057302362561967.bin, -w, /tmp/graph13612057302362561967.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13612057302362561967.bin, -l, -1, -v, -w, /tmp/graph13612057302362561967.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 20:00:40] [INFO ] Decomposing Gal with order
[2021-05-09 20:00:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 20:00:40] [INFO ] Removed a total of 98 redundant transitions.
[2021-05-09 20:00:40] [INFO ] Flatten gal took : 51 ms
[2021-05-09 20:00:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 6 ms.
[2021-05-09 20:00:40] [INFO ] Ran tautology test, simplified 0 / 7 in 158 ms.
[2021-05-09 20:00:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1608340537307079022.gal : 4 ms
[2021-05-09 20:00:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13560499438766581477.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability1608340537307079022.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability13560499438766581477.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability1608340537307079022.gal -t CGAL -reachable-file /tmp/ReachabilityFireability13560499438766581477.prop --nowitness
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=0 took 11 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=0 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=0 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=0 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=0 took 0 ms
Loading property file /tmp/ReachabilityFireability13560499438766581477.prop.
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=1 took 9 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=1 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=1 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=1 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=1 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=1 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=1 took 0 ms
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :3 after 4
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :4 after 10
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :50 after 61
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=2 took 60 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=2 took 2 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=2 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=2 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=2 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=2 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=2 took 1 ms
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :180 after 243
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 242 rows 246 cols
[2021-05-09 20:00:40] [INFO ] Computed 36 place invariants in 23 ms
inv : 2*p1 + p10 + p11 + p4 = 2
inv : -p104 - p22 + p28 + p30 + p31 + p34 - p48 + p50 + p52 + p54 = 0
inv : p320 - p322 + p323 - p325 + p346 + p358 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 + p228 + p230 - p232 - p233 - p234 - p236 - p237 + p24 - p240 - p244 - p246 - p248 - p249 - p252 - p258 - p260 + p281 + p283 - p287 - p289 - p290 - p293 - p299 - p301 - p302 - p305 - p311 - p313 + p334 + p336 - p340 - p342 - p343 - p346 - p352 - p354 - p355 - p358 - p364 - p366 - p368 - p38 + p389 - p40 + p401 - p405 - p407 - p408 - p41 - p411 - p414 - p415 - p417 - p419 - p42 - p425 - p46 + p477 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 + p228 + p230 - p232 - p233 - p234 - p236 - p237 + p24 - p240 - p244 - p246 - p248 - p249 - p252 - p258 - p260 + p281 + p283 - p287 - p289 - p290 - p293 - p299 - p301 - p302 - p305 - p311 - p313 + p334 + p336 - p340 - p342 - p343 - p346 - p352 - p354 - p355 - p358 - p364 - p366 - p368 - p38 - p40 - p41 - p42 + p422 + p424 - p46 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 + p228 + p230 - p232 - p233 - p234 - p236 - p237 + p24 - p240 - p244 - p246 - p248 - p249 - p252 - p258 - p260 + p316 + p318 - p38 - p40 - p41 - p42 - p46 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : -p389 + p405 + p407 + p408 + p411 + p413 + p414 - p477 = 0
inv : p108 - p110 + p111 - p113 + p134 + p146 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p210 + p212 + p24 - p38 - p40 - p41 - p42 - p46 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : p373 - p375 + p376 - p378 + p399 + p411 = 0
inv : p161 - p163 + p164 - p166 + p187 + p194 + p199 = 0
inv : p215 - p216 + p218 - p219 + p240 + p252 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 + p228 + p230 - p232 - p233 - p234 - p236 - p237 + p24 - p240 - p244 - p246 - p248 - p249 - p252 - p258 - p260 + p281 + p283 - p287 - p289 - p290 - p293 - p299 - p301 - p302 - p305 - p311 - p313 + p334 + p336 - p340 - p342 - p343 - p346 - p352 - p354 - p355 - p358 - p364 - p366 - p368 - p38 + p387 + p389 - p391 - p392 - p393 - p395 - p396 - p399 - p40 - p402 - p405 - p407 - p408 - p41 - p411 - p414 - p415 - p417 - p419 - p42 - p425 - p46 + p475 + p477 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p268 - p269 + p271 - p272 + p293 + p305 = 0
inv : p1 + p116 + p118 + p122 + p124 + p14 + p16 + p169 + p175 + p176 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p337 + p379 + p381 + p387 + p389 + p4 + p434 + p436 + p437 + p438 + p439 + p440 + p442 + p485 + p487 + p499 + p500 + p501 + p502 + p505 + p510 + p511 + p514 + p517 + p518 + p521 + p523 + p525 + p528 + p530 + p61 + p63 + p69 + p71 = 1
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 + p228 + p230 - p232 - p233 - p234 - p236 - p237 + p24 - p240 - p244 - p246 - p248 - p249 - p252 - p258 - p260 + p281 + p283 - p287 - p289 - p290 - p293 - p299 - p301 - p302 - p305 - p311 - p313 + p369 + p371 - p38 - p40 - p41 - p42 - p46 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : -p101 - p104 - p107 + p157 + p159 + p24 - p38 - p40 - p41 - p42 - p46 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : p267 - p269 + p270 - p272 + p293 + p305 = 0
inv : -p101 - p104 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 + p24 + p263 + p265 - p38 - p40 - p41 - p42 - p46 - p48 - p49 + p69 + p71 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = 0
inv : 2*p1 - p104 + p12 + p13 - p22 + p28 + p30 + p31 + p4 - p46 - p48 + p50 + p52 + p54 = 2
inv : p1 + p101 + p104 + p107 + p116 + p118 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p176 + p179 + p183 + p187 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p22 + p222 + p232 + p233 + p234 + p236 + p237 + p240 + p244 + p246 + p248 + p249 + p252 + p258 + p260 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p328 + p337 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p368 + p379 + p38 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p4 + p40 + p402 + p405 + p407 + p408 + p41 + p411 + p414 + p415 + p417 + p419 + p42 + p425 + p434 + p436 + p437 + p438 + p439 + p446 + p448 + p449 + p452 + p455 + p458 + p46 + p460 + p461 + p464 + p467 + p468 + p470 + p472 + p478 + p48 + p485 + p487 + p49 + p499 + p500 + p501 + p502 + p505 + p510 + p511 + p514 + p517 + p518 + p521 + p523 + p525 + p61 + p63 + p75 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p97 + p99 = 1
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p374 - p375 + p377 - p378 + p399 + p411 = 0
inv : 2*p1 + p4 + p41 + p8 + p9 = 2
inv : p321 - p322 + p324 - p325 + p346 + p358 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p214 - p216 + p217 - p219 + p240 + p252 = 0
inv : p106 + p24 - p38 - p40 - p41 - p42 - p46 - p48 - p49 = 0
inv : -p438 + p480 - p481 + p483 - p484 + p500 + p505 + p517 = 0
inv : p1 + p116 + p118 + p122 + p124 + p14 + p16 + p169 + p175 + p176 + p177 + p22 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p337 + p379 + p381 + p387 + p389 + p4 + p434 + p436 + p437 + p438 + p439 + p442 + p446 + p448 + p449 + p452 + p454 + p455 + p485 + p487 + p499 + p500 + p501 + p502 + p505 + p510 + p511 + p514 + p517 + p518 + p521 + p523 + p525 + p530 + p61 + p63 + p69 + p71 = 1
inv : -p437 - p438 + p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : -p1 - p101 - p104 - p107 - p116 - p118 - p128 - p130 - p131 - p134 - p14 - p140 - p142 - p143 - p146 - p152 - p154 - p16 - p169 - p176 - p179 - p183 - p187 - p191 - p193 - p194 - p195 - p199 - p205 - p207 - p22 - p222 - p232 - p233 - p234 - p236 - p237 - p240 - p244 - p246 - p248 - p249 - p252 - p258 - p260 - p275 - p287 - p289 - p290 - p293 - p299 - p301 - p302 - p305 - p311 - p313 - p328 - p337 - p340 - p342 - p343 - p346 - p352 - p354 - p355 - p358 - p364 - p366 - p368 - p379 - p38 - p381 - p391 - p392 - p393 - p395 - p396 - p399 - p4 - p40 - p402 - p405 - p407 - p408 - p41 - p411 - p414 - p415 - p417 - p419 - p42 - p425 - p434 - p436 - p437 - p438 - p439 - p442 - p446 - p448 - p449 - p452 - p455 - p46 + p466 - p468 - p470 - p472 - p478 - p48 - p485 - p487 - p49 - p499 - p500 - p501 - p502 - p505 - p510 - p511 - p514 - p517 - p518 - p521 - p523 - p525 - p530 - p61 - p63 - p75 - p77 - p78 - p81 - p87 - p89 - p90 - p93 - p97 - p99 = -1
Total of 36 invariants.
[2021-05-09 20:00:40] [INFO ] Computed 36 place invariants in 24 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=3 took 39 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=3 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=3 took 1 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=3 took 0 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=3 took 2 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=3 took 10 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=3 took 3 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=4 took 64 ms
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :292 after 358
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=4 took 8 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=4 took 7 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=4 took 6 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=4 took 8 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=4 took 9 ms
[2021-05-09 20:00:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=4 took 6 ms
[2021-05-09 20:00:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=5 took 120 ms
[2021-05-09 20:00:41] [INFO ] Proved 246 variables to be positive in 504 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=0 took 68 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=0 took 43 ms
[2021-05-09 20:00:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=5 took 329 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=0 took 48 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=0 took 21 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=0 took 21 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=0 took 25 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=0 took 21 ms
[2021-05-09 20:00:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=5 took 145 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=1 took 57 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=1 took 96 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=1 took 76 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=1 took 77 ms
[2021-05-09 20:00:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=5 took 348 ms
[2021-05-09 20:00:41] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:00:41] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=1 took 109 ms
Compilation finished in 1466 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16788917525974145640]
[2021-05-09 20:00:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=5 took 100 ms
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability03==true], workingDir=/tmp/ltsmin16788917525974145640]
[2021-05-09 20:00:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:00:42] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=1 took 70 ms
[2021-05-09 20:00:42] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=5 took 81 ms
[2021-05-09 20:00:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:00:42] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=1 took 73 ms
[2021-05-09 20:00:42] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=5 took 250 ms
[2021-05-09 20:00:43] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=6 took 1619 ms
[2021-05-09 20:00:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=6 took 4309 ms
[2021-05-09 20:00:52] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=6 took 3914 ms
[2021-05-09 20:00:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:00:53] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=2 took 10918 ms
[2021-05-09 20:00:53] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=6 took 1243 ms
[2021-05-09 20:00:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=6 took 3232 ms
[2021-05-09 20:00:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=6 took 1378 ms
[2021-05-09 20:00:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=6 took 698 ms
[2021-05-09 20:00:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:00:59] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=2 took 6362 ms
[2021-05-09 20:01:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:01:06] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=2 took 6735 ms
[2021-05-09 20:01:07] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=7 took 8561 ms
[2021-05-09 20:01:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=7 took 3412 ms
[2021-05-09 20:01:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:01:23] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=2 took 17511 ms
[2021-05-09 20:01:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:01:24] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=2 took 973 ms
[2021-05-09 20:01:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:01:29] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=2 took 4459 ms
[2021-05-09 20:01:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=7 took 25049 ms
[2021-05-09 20:01:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:01:48] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=2 took 19417 ms
[2021-05-09 20:01:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=7 took 22212 ms
[2021-05-09 20:02:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:02:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=3 took 21443 ms
[2021-05-09 20:02:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=7 took 32090 ms
[2021-05-09 20:02:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=7 took 11658 ms
[2021-05-09 20:02:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:02:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=3 took 41479 ms
[2021-05-09 20:02:52] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=7 took 10523 ms
[2021-05-09 20:03:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=8 took 20518 ms
[2021-05-09 20:03:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:03:30] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=3 took 39240 ms
[2021-05-09 20:03:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=8 took 18003 ms
[2021-05-09 20:04:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=8 took 30426 ms
[2021-05-09 20:04:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:04:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=3 took 48086 ms
[2021-05-09 20:04:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=8 took 34685 ms
[2021-05-09 20:04:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=8 took 12924 ms
[2021-05-09 20:05:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=8 took 35948 ms
[2021-05-09 20:05:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:05:29] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=3 took 70522 ms
[2021-05-09 20:05:34] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=8 took 9255 ms
[2021-05-09 20:05:47] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=9 took 13168 ms
[2021-05-09 20:06:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:06:20] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=3 took 51017 ms
[2021-05-09 20:06:39] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=9 took 52359 ms
[2021-05-09 20:06:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:06:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=3 took 38304 ms
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 249, guards 242
pins2lts-mc-linux64( 1/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.058: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.058: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.066: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.066: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.070: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.070: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.212: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 0.435: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.442: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.443: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.443: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.443: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.443: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.443: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.444: "DoubleExponentPT010ReachabilityFireability03==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.444: There are 249 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.444: State length is 246, there are 242 groups
pins2lts-mc-linux64( 0/ 8), 0.444: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.444: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.444: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.444: Visible groups: 7 / 242, labels: 1 / 249
pins2lts-mc-linux64( 0/ 8), 0.444: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.444: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.851: ~48 levels ~960 states ~1040 transitions
pins2lts-mc-linux64( 2/ 8), 0.960: ~85 levels ~1920 states ~1952 transitions
pins2lts-mc-linux64( 3/ 8), 1.107: ~105 levels ~3840 states ~4152 transitions
pins2lts-mc-linux64( 3/ 8), 1.132: ~125 levels ~7680 states ~8024 transitions
pins2lts-mc-linux64( 7/ 8), 1.193: ~67 levels ~15360 states ~15896 transitions
pins2lts-mc-linux64( 0/ 8), 1.273: ~176 levels ~30720 states ~34120 transitions
pins2lts-mc-linux64( 0/ 8), 1.370: ~201 levels ~61440 states ~64000 transitions
pins2lts-mc-linux64( 7/ 8), 1.728: ~850 levels ~122880 states ~123744 transitions
pins2lts-mc-linux64( 0/ 8), 2.452: ~1439 levels ~245760 states ~249672 transitions
pins2lts-mc-linux64( 0/ 8), 4.008: ~3792 levels ~491520 states ~495432 transitions
pins2lts-mc-linux64( 0/ 8), 7.130: ~8156 levels ~983040 states ~986088 transitions
pins2lts-mc-linux64( 0/ 8), 11.051: ~8722 levels ~1966080 states ~2023432 transitions
pins2lts-mc-linux64( 0/ 8), 19.427: ~8744 levels ~3932160 states ~4065104 transitions
pins2lts-mc-linux64( 1/ 8), 35.074: ~11995 levels ~7864320 states ~7827960 transitions
pins2lts-mc-linux64( 4/ 8), 66.989: ~17818 levels ~15728640 states ~15585944 transitions
pins2lts-mc-linux64( 4/ 8), 131.350: ~21824 levels ~31457280 states ~31348648 transitions
pins2lts-mc-linux64( 7/ 8), 260.348: ~37594 levels ~62914560 states ~62769664 transitions
pins2lts-mc-linux64( 2/ 8), 391.984: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 392.043:
pins2lts-mc-linux64( 0/ 8), 392.043: mean standard work distribution: 0.8% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 392.043:
pins2lts-mc-linux64( 0/ 8), 392.043: Explored 92870525 states 93164924 transitions, fanout: 1.003
pins2lts-mc-linux64( 0/ 8), 392.043: Total exploration time 391.590 sec (391.540 sec minimum, 391.556 sec on average)
pins2lts-mc-linux64( 0/ 8), 392.043: States per second: 237163, Transitions per second: 237914
pins2lts-mc-linux64( 0/ 8), 392.043: Ignoring proviso: 1
pins2lts-mc-linux64( 0/ 8), 392.043:
pins2lts-mc-linux64( 0/ 8), 392.043: Queue width: 8B, total height: 462826, memory: 3.53MB
pins2lts-mc-linux64( 0/ 8), 392.043: Tree memory: 966.8MB, 10.9 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 392.043: Tree fill ratio (roots/leafs): 69.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 392.043: Stored 242 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 392.043: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 392.043: Est. total memory use: 970.3MB (~1027.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability03==true], workingDir=/tmp/ltsmin16788917525974145640]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability03==true], workingDir=/tmp/ltsmin16788917525974145640]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-09 20:07:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=9 took 41469 ms
[2021-05-09 20:07:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:07:35] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=4 took 36710 ms
[2021-05-09 20:07:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=9 took 15105 ms
[2021-05-09 20:07:37] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=9 took 1225 ms
[2021-05-09 20:07:45] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=9 took 8092 ms
[2021-05-09 20:07:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:07:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=4 took 23183 ms
[2021-05-09 20:08:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=9 took 24224 ms
[2021-05-09 20:08:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:08:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=4 took 19702 ms
[2021-05-09 20:08:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=10 took 19112 ms
[2021-05-09 20:08:42] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=10 took 14036 ms
[2021-05-09 20:08:46] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=10 took 3620 ms
[2021-05-09 20:08:50] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=10 took 4044 ms
[2021-05-09 20:08:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:08:54] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=4 took 35838 ms
[2021-05-09 20:08:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=10 took 6214 ms
[2021-05-09 20:09:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=10 took 31173 ms
[2021-05-09 20:09:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:09:37] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=4 took 43168 ms
[2021-05-09 20:09:50] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=10 took 23079 ms
[2021-05-09 20:10:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=11 took 15030 ms
[2021-05-09 20:10:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=11 took 8395 ms
[2021-05-09 20:10:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=11 took 6943 ms
[2021-05-09 20:10:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=11 took 4772 ms
[2021-05-09 20:10:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:10:32] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=4 took 55395 ms
[2021-05-09 20:10:45] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=11 took 18982 ms
[2021-05-09 20:11:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:11:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=4 took 35332 ms
[2021-05-09 20:11:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=11 took 33335 ms
[2021-05-09 20:11:30] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=11 took 12528 ms
[2021-05-09 20:11:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:11:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=5 took 37411 ms
[2021-05-09 20:11:59] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=12 took 28914 ms
[2021-05-09 20:12:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=12 took 17649 ms
[2021-05-09 20:12:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:12:42] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=5 took 57094 ms
[2021-05-09 20:12:44] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=12 took 26640 ms
[2021-05-09 20:13:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:13:06] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=5 took 23995 ms
[2021-05-09 20:13:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:13:12] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=5 took 6001 ms
[2021-05-09 20:13:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=12 took 34810 ms
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :381543 after 381543
[2021-05-09 20:13:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=12 took 32824 ms
[2021-05-09 20:14:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=12 took 33856 ms
[2021-05-09 20:15:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:15:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=5 took 115135 ms
[2021-05-09 20:15:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=12 took 63387 ms
[2021-05-09 20:15:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:15:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=5 took 43824 ms
[2021-05-09 20:15:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=13 took 26955 ms
[2021-05-09 20:16:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:16:42] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=5 took 51463 ms
[2021-05-09 20:17:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:17:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=6 took 75979 ms
[2021-05-09 20:18:25] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=13 took 149911 ms
[2021-05-09 20:19:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:19:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=6 took 89631 ms
[2021-05-09 20:20:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:20:13] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=6 took 44864 ms
[2021-05-09 20:20:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:20:22] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=6 took 8950 ms
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :434126 after 434126
[2021-05-09 20:22:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:22:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=6 took 114421 ms
[2021-05-09 20:23:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:23:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=6 took 59757 ms
[2021-05-09 20:24:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=13 took 339137 ms
[2021-05-09 20:24:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:24:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=6 took 62511 ms
[2021-05-09 20:24:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=13 took 19741 ms
Detected timeout of ITS tools.
[2021-05-09 20:24:27] [INFO ] Applying decomposition
[2021-05-09 20:24:27] [INFO ] Flatten gal took : 27 ms
[2021-05-09 20:24:27] [INFO ] Decomposing Gal with order
[2021-05-09 20:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 20:24:27] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-09 20:24:27] [INFO ] Flatten gal took : 31 ms
[2021-05-09 20:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 6 ms.
[2021-05-09 20:24:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability457660258339862770.gal : 2 ms
[2021-05-09 20:24:30] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15243873456674583687.prop : 2391 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability457660258339862770.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability15243873456674583687.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability457660258339862770.gal -t CGAL -reachable-file /tmp/ReachabilityFireability15243873456674583687.prop --nowitness
Loading property file /tmp/ReachabilityFireability15243873456674583687.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :8 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :50 after 103
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :180 after 243
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :292 after 358
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1260 after 1774
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :49117 after 49142
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :49142 after 50299
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :96993 after 97996
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :144924 after 146563
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :241297 after 242020
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :338784 after 340732
[2021-05-09 20:25:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=13 took 54413 ms
[2021-05-09 20:25:33] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=13 took 14168 ms
[2021-05-09 20:25:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=13 took 23185 ms
[2021-05-09 20:26:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=14 took 14030 ms
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :539232 after 539532
[2021-05-09 20:26:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:26:29] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=7 took 130675 ms
[2021-05-09 20:26:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=14 took 28222 ms
[2021-05-09 20:27:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=14 took 45672 ms
[2021-05-09 20:28:21] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=14 took 57484 ms
[2021-05-09 20:28:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:28:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=7 took 123440 ms
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :650488 after 650488
[2021-05-09 20:29:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:29:27] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=7 took 54629 ms
[2021-05-09 20:29:34] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=14 took 72942 ms
[2021-05-09 20:29:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:29:40] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=7 took 12320 ms
[2021-05-09 20:32:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:32:14] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=7 took 154858 ms
[2021-05-09 20:33:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=14 took 219868 ms
[2021-05-09 20:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:33:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=7 took 61387 ms
[2021-05-09 20:34:20] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=14 took 65939 ms
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :734801 after 734801
[2021-05-09 20:34:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=15 took 16099 ms
[2021-05-09 20:34:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-11
[2021-05-09 20:34:39] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-11(SAT) depth K=7 took 83488 ms
[2021-05-09 20:35:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=15 took 61523 ms
[2021-05-09 20:36:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=15 took 21682 ms
[2021-05-09 20:36:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=15 took 8250 ms
[2021-05-09 20:36:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=15 took 17821 ms
[2021-05-09 20:36:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2021-05-09 20:36:37] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=8 took 117877 ms
[2021-05-09 20:36:54] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-10(UNSAT) depth K=15 took 28492 ms
[2021-05-09 20:38:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-06
[2021-05-09 20:38:54] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-06(SAT) depth K=8 took 136453 ms
[2021-05-09 20:40:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-11(UNSAT) depth K=15 took 186014 ms
[2021-05-09 20:40:45] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=16 took 44565 ms
[2021-05-09 20:40:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2021-05-09 20:40:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=8 took 122058 ms
[2021-05-09 20:41:59] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-06(UNSAT) depth K=16 took 74179 ms
[2021-05-09 20:43:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2021-05-09 20:43:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=8 took 174942 ms
[2021-05-09 20:46:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=16 took 262962 ms
[2021-05-09 20:46:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2021-05-09 20:46:32] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=8 took 161848 ms
Detected timeout of ITS tools.
[2021-05-09 20:48:17] [INFO ] Flatten gal took : 11 ms
[2021-05-09 20:48:17] [INFO ] Input system was already deterministic with 242 transitions.
[2021-05-09 20:48:17] [INFO ] Transformed 246 places.
[2021-05-09 20:48:17] [INFO ] Transformed 242 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 20:48:17] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12756750865299255063.gal : 1 ms
[2021-05-09 20:48:17] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10192964670690996728.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability12756750865299255063.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability10192964670690996728.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability12756750865299255063.gal -t CGAL -reachable-file /tmp/ReachabilityFireability10192964670690996728.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability10192964670690996728.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :4 after 6
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 38
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :38 after 56
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :56 after 204
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :204 after 308
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :308 after 757
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :757 after 2516
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :2516 after 49179
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :49179 after 144870
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :144870 after 337016
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :337016 after 718354
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :718354 after 8.04958e+09
[2021-05-09 20:49:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-10
[2021-05-09 20:49:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-10(SAT) depth K=8 took 154435 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

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