fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902546000310
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DES-PT-50a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15747.210 326695.00 460191.00 237.30 FFTTFFFFFFFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902546000310.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-50a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 2.7K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 97K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1589556298437

[2020-05-15 15:25:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 15:25:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 15:25:02] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2020-05-15 15:25:02] [INFO ] Transformed 314 places.
[2020-05-15 15:25:02] [INFO ] Transformed 271 transitions.
[2020-05-15 15:25:02] [INFO ] Found NUPN structural information;
[2020-05-15 15:25:02] [INFO ] Parsed PT model containing 314 places and 271 transitions in 318 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 76 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 226 resets, run finished after 171 ms. (steps per millisecond=58 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 257 rows 314 cols
[2020-05-15 15:25:02] [INFO ] Computed 59 place invariants in 53 ms
[2020-05-15 15:25:03] [INFO ] [Real]Absence check using 34 positive place invariants in 89 ms returned sat
[2020-05-15 15:25:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2020-05-15 15:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:04] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2020-05-15 15:25:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:04] [INFO ] [Nat]Absence check using 34 positive place invariants in 66 ms returned sat
[2020-05-15 15:25:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 110 ms returned sat
[2020-05-15 15:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:05] [INFO ] [Nat]Absence check using state equation in 356 ms returned unsat
[2020-05-15 15:25:05] [INFO ] [Real]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 15:25:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 61 ms returned sat
[2020-05-15 15:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:06] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2020-05-15 15:25:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 15:25:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 225 ms returned sat
[2020-05-15 15:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:07] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2020-05-15 15:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 15:25:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 15:25:07] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 46 ms.
[2020-05-15 15:25:11] [INFO ] Added : 220 causal constraints over 44 iterations in 3524 ms. Result :unknown
[2020-05-15 15:25:11] [INFO ] [Real]Absence check using 34 positive place invariants in 53 ms returned sat
[2020-05-15 15:25:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 69 ms returned sat
[2020-05-15 15:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:12] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2020-05-15 15:25:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 15:25:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 179 ms returned sat
[2020-05-15 15:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:14] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2020-05-15 15:25:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 15:25:14] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 114 ms.
[2020-05-15 15:25:17] [INFO ] Added : 202 causal constraints over 41 iterations in 2841 ms. Result :sat
[2020-05-15 15:25:17] [INFO ] Deduced a trap composed of 13 places in 241 ms
[2020-05-15 15:25:18] [INFO ] Deduced a trap composed of 3 places in 512 ms
[2020-05-15 15:25:18] [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 closed (> (+ s0 s241 s242) 0)") while checking expression at index 2
[2020-05-15 15:25:18] [INFO ] [Real]Absence check using 34 positive place invariants in 63 ms returned sat
[2020-05-15 15:25:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 100 ms returned sat
[2020-05-15 15:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:20] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2020-05-15 15:25:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 15:25:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 146 ms returned sat
[2020-05-15 15:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:21] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2020-05-15 15:25:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 15:25:21] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 31 ms.
[2020-05-15 15:25:25] [INFO ] Added : 160 causal constraints over 32 iterations in 3559 ms. Result :(error "Failed to check-sat")
[2020-05-15 15:25:25] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-05-15 15:25:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 83 ms returned sat
[2020-05-15 15:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:27] [INFO ] [Real]Absence check using state equation in 2265 ms returned sat
[2020-05-15 15:25:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 15:25:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 168 ms returned sat
[2020-05-15 15:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:29] [INFO ] [Nat]Absence check using state equation in 1716 ms returned sat
[2020-05-15 15:25:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-05-15 15:25:30] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 30 ms.
[2020-05-15 15:25:32] [INFO ] Added : 197 causal constraints over 40 iterations in 2785 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-05-15 15:25:33] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 15:25:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2020-05-15 15:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:33] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2020-05-15 15:25:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 15:25:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 185 ms returned sat
[2020-05-15 15:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:35] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2020-05-15 15:25:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 15:25:35] [INFO ] Computed and/alt/rep : 256/1079/256 causal constraints in 38 ms.
[2020-05-15 15:25: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 closed (=> (> t208 0) (and (and (> t207 0) (< o207 o208)) (or (and (> t6 0) (< o6 o208)) (and (> t250 0) (< o250 o208)))))") while checking expression at index 5
[2020-05-15 15:25:39] [INFO ] [Real]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 15:25:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 83 ms returned sat
[2020-05-15 15:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:40] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2020-05-15 15:25:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:25:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-05-15 15:25:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 172 ms returned sat
[2020-05-15 15:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:25:40] [INFO ] [Nat]Absence check using state equation in 130 ms returned unsat
FORMULA DES-PT-50a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50a-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 187100 steps, including 4692 resets, run finished after 1095 ms. (steps per millisecond=170 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 199600 steps, including 5145 resets, run finished after 1252 ms. (steps per millisecond=159 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 314 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 314 transition count 256
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 314 transition count 256
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 313 transition count 255
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 313 transition count 255
Applied a total of 9 rules in 175 ms. Remains 313 /314 variables (removed 1) and now considering 255/257 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/314 places, 255/257 transitions.
Incomplete random walk after 1000000 steps, including 16489 resets, run finished after 4808 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3003 resets, run finished after 2194 ms. (steps per millisecond=455 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2928 resets, run finished after 2076 ms. (steps per millisecond=481 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3615 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4279 resets, run finished after 2758 ms. (steps per millisecond=362 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2972 resets, run finished after 1985 ms. (steps per millisecond=503 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8096529 steps, run timeout after 30001 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 8096529 steps, saw 975700 distinct states, run finished after 30001 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 313 cols
[2020-05-15 15:26:29] [INFO ] Computed 60 place invariants in 20 ms
[2020-05-15 15:26:29] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-05-15 15:26:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-15 15:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:30] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2020-05-15 15:26:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:26:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-05-15 15:26:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 15:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:31] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2020-05-15 15:26:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-15 15:26:31] [INFO ] [Nat]Added 4 Read/Feed constraints in 18 ms returned sat
[2020-05-15 15:26:31] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 33 ms.
[2020-05-15 15:26:35] [INFO ] Added : 226 causal constraints over 46 iterations in 3912 ms. Result :sat
[2020-05-15 15:26:36] [INFO ] Deduced a trap composed of 9 places in 163 ms
[2020-05-15 15:26:36] [INFO ] Deduced a trap composed of 11 places in 427 ms
[2020-05-15 15:26:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 806 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-05-15 15:26:36] [INFO ] [Real]Absence check using 35 positive place invariants in 66 ms returned sat
[2020-05-15 15:26:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2020-05-15 15:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:37] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2020-05-15 15:26:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:26:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-05-15 15:26:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 174 ms returned sat
[2020-05-15 15:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:39] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2020-05-15 15:26:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 13 ms returned sat
[2020-05-15 15:26:39] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 37 ms.
[2020-05-15 15:26:44] [INFO ] Added : 228 causal constraints over 46 iterations in 4897 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-05-15 15:26:44] [INFO ] [Real]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-05-15 15:26:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 15:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:45] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2020-05-15 15:26:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:26:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-05-15 15:26:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2020-05-15 15:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:46] [INFO ] [Nat]Absence check using state equation in 1359 ms returned sat
[2020-05-15 15:26:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-05-15 15:26:47] [INFO ] Deduced a trap composed of 51 places in 211 ms
[2020-05-15 15:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2020-05-15 15:26:47] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 36 ms.
[2020-05-15 15:26:49] [INFO ] Added : 205 causal constraints over 41 iterations in 2587 ms. Result :sat
[2020-05-15 15:26:49] [INFO ] Deduced a trap composed of 9 places in 164 ms
[2020-05-15 15:26:50] [INFO ] Deduced a trap composed of 11 places in 410 ms
[2020-05-15 15:26:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1159 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-05-15 15:26:51] [INFO ] [Real]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-05-15 15:26:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 67 ms returned sat
[2020-05-15 15:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:53] [INFO ] [Real]Absence check using state equation in 2312 ms returned sat
[2020-05-15 15:26:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:26:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-05-15 15:26:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 94 ms returned sat
[2020-05-15 15:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:55] [INFO ] [Nat]Absence check using state equation in 1692 ms returned sat
[2020-05-15 15:26:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-05-15 15:26:55] [INFO ] Deduced a trap composed of 51 places in 70 ms
[2020-05-15 15:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2020-05-15 15:26:55] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 29 ms.
[2020-05-15 15:26:58] [INFO ] Added : 210 causal constraints over 42 iterations in 3034 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-05-15 15:26:59] [INFO ] [Real]Absence check using 35 positive place invariants in 65 ms returned sat
[2020-05-15 15:26:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 15:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:26:59] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2020-05-15 15:26:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:27:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2020-05-15 15:27:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 148 ms returned sat
[2020-05-15 15:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:27:01] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2020-05-15 15:27:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 14 ms returned sat
[2020-05-15 15:27:01] [INFO ] Deduced a trap composed of 51 places in 316 ms
[2020-05-15 15:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2020-05-15 15:27:01] [INFO ] Computed and/alt/rep : 254/1215/254 causal constraints in 31 ms.
[2020-05-15 15:27:04] [INFO ] Added : 193 causal constraints over 39 iterations in 2814 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 210600 steps, including 4923 resets, run finished after 1097 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 250800 steps, including 5819 resets, run finished after 1242 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 173400 steps, including 4337 resets, run finished after 951 ms. (steps per millisecond=182 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 106000 steps, including 2234 resets, run finished after 527 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 117500 steps, including 2519 resets, run finished after 602 ms. (steps per millisecond=195 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 313 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 34 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 28 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 313 cols
[2020-05-15 15:27:08] [INFO ] Computed 60 place invariants in 12 ms
[2020-05-15 15:27:11] [INFO ] Implicit Places using invariants in 2207 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2239 ms to find 1 implicit places.
[2020-05-15 15:27:11] [INFO ] Redundant transitions in 128 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:27:11] [INFO ] Computed 59 place invariants in 35 ms
[2020-05-15 15:27:12] [INFO ] Dead Transitions using invariants and state equation in 1242 ms returned []
Starting structural reductions, iteration 1 : 312/313 places, 255/255 transitions.
Applied a total of 0 rules in 34 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2020-05-15 15:27:12] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:27:12] [INFO ] Computed 59 place invariants in 35 ms
[2020-05-15 15:27:14] [INFO ] Dead Transitions using invariants and state equation in 1454 ms returned []
Finished structural reductions, in 2 iterations. Remains : 312/313 places, 255/255 transitions.
Incomplete random walk after 1000000 steps, including 16588 resets, run finished after 4755 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3012 resets, run finished after 2073 ms. (steps per millisecond=482 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2991 resets, run finished after 2120 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3569 resets, run finished after 2065 ms. (steps per millisecond=484 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4277 resets, run finished after 2486 ms. (steps per millisecond=402 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2984 resets, run finished after 1999 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8320718 steps, run timeout after 30001 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 8320718 steps, saw 1002659 distinct states, run finished after 30001 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:27:59] [INFO ] Computed 59 place invariants in 11 ms
[2020-05-15 15:27:59] [INFO ] [Real]Absence check using 34 positive place invariants in 65 ms returned sat
[2020-05-15 15:27:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2020-05-15 15:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:00] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2020-05-15 15:28:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:28:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 15:28:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 115 ms returned sat
[2020-05-15 15:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:01] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2020-05-15 15:28:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-05-15 15:28:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2020-05-15 15:28:01] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 35 ms.
[2020-05-15 15:28:05] [INFO ] Added : 233 causal constraints over 47 iterations in 4155 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-05-15 15:28:06] [INFO ] [Real]Absence check using 34 positive place invariants in 92 ms returned sat
[2020-05-15 15:28:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 187 ms returned sat
[2020-05-15 15:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:08] [INFO ] [Real]Absence check using state equation in 1405 ms returned sat
[2020-05-15 15:28:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:28:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 15:28:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 117 ms returned sat
[2020-05-15 15:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:09] [INFO ] [Nat]Absence check using state equation in 1495 ms returned sat
[2020-05-15 15:28:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 133 ms returned sat
[2020-05-15 15:28:09] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 34 ms.
[2020-05-15 15:28:13] [INFO ] Added : 225 causal constraints over 45 iterations in 3217 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-15 15:28:13] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 15:28:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2020-05-15 15:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:14] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2020-05-15 15:28:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:28:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 72 ms returned sat
[2020-05-15 15:28:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 196 ms returned sat
[2020-05-15 15:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:16] [INFO ] [Nat]Absence check using state equation in 1491 ms returned sat
[2020-05-15 15:28:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 13 ms returned sat
[2020-05-15 15:28:16] [INFO ] Deduced a trap composed of 51 places in 207 ms
[2020-05-15 15:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2020-05-15 15:28:16] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 29 ms.
[2020-05-15 15:28:18] [INFO ] Added : 202 causal constraints over 41 iterations in 2534 ms. Result :sat
[2020-05-15 15:28:19] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-05-15 15:28:19] [INFO ] Deduced a trap composed of 19 places in 346 ms
[2020-05-15 15:28:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1128 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-15 15:28:20] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-05-15 15:28:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2020-05-15 15:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:22] [INFO ] [Real]Absence check using state equation in 2385 ms returned sat
[2020-05-15 15:28:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:28:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-05-15 15:28:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 98 ms returned sat
[2020-05-15 15:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:24] [INFO ] [Nat]Absence check using state equation in 1201 ms returned sat
[2020-05-15 15:28:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2020-05-15 15:28:24] [INFO ] Deduced a trap composed of 51 places in 85 ms
[2020-05-15 15:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2020-05-15 15:28:24] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 96 ms.
[2020-05-15 15:28:28] [INFO ] Added : 251 causal constraints over 51 iterations in 4197 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-05-15 15:28:29] [INFO ] [Real]Absence check using 34 positive place invariants in 123 ms returned sat
[2020-05-15 15:28:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 213 ms returned sat
[2020-05-15 15:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:30] [INFO ] [Real]Absence check using state equation in 1397 ms returned sat
[2020-05-15 15:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:28:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 72 ms returned sat
[2020-05-15 15:28:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 116 ms returned sat
[2020-05-15 15:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:31] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2020-05-15 15:28:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 18 ms returned sat
[2020-05-15 15:28:31] [INFO ] Deduced a trap composed of 51 places in 61 ms
[2020-05-15 15:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-05-15 15:28:32] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 33 ms.
[2020-05-15 15:28:34] [INFO ] Added : 235 causal constraints over 47 iterations in 2648 ms. Result :sat
[2020-05-15 15:28:35] [INFO ] Deduced a trap composed of 10 places in 413 ms
[2020-05-15 15:28:35] [INFO ] Deduced a trap composed of 12 places in 452 ms
[2020-05-15 15:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1087 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
Incomplete Parikh walk after 229800 steps, including 5349 resets, run finished after 1126 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 234800 steps, including 5571 resets, run finished after 1214 ms. (steps per millisecond=193 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 173500 steps, including 3987 resets, run finished after 857 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 209700 steps, including 4808 resets, run finished after 1036 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 151100 steps, including 3549 resets, run finished after 748 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 57 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 255/255 transitions.
Starting structural reductions, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 43 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:28:40] [INFO ] Computed 59 place invariants in 12 ms
[2020-05-15 15:28:42] [INFO ] Implicit Places using invariants in 1926 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:28:42] [INFO ] Computed 59 place invariants in 29 ms
[2020-05-15 15:28:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-05-15 15:28:51] [INFO ] Implicit Places using invariants and state equation in 8317 ms returned []
Implicit Place search using SMT with State Equation took 10247 ms to find 0 implicit places.
[2020-05-15 15:28:51] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:28:51] [INFO ] Computed 59 place invariants in 9 ms
[2020-05-15 15:28:52] [INFO ] Dead Transitions using invariants and state equation in 1696 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 255/255 transitions.
Incomplete random walk after 100000 steps, including 1668 resets, run finished after 535 ms. (steps per millisecond=186 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:28:53] [INFO ] Computed 59 place invariants in 7 ms
[2020-05-15 15:28:53] [INFO ] [Real]Absence check using 34 positive place invariants in 90 ms returned sat
[2020-05-15 15:28:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 89 ms returned sat
[2020-05-15 15:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:55] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2020-05-15 15:28:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:28:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 61 ms returned sat
[2020-05-15 15:28:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 196 ms returned sat
[2020-05-15 15:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:28:56] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2020-05-15 15:28:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-05-15 15:28:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 13 ms returned sat
[2020-05-15 15:28:56] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 37 ms.
[2020-05-15 15:29:00] [INFO ] Added : 233 causal constraints over 47 iterations in 4076 ms. Result :sat
[2020-05-15 15:29:01] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 15:29:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2020-05-15 15:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:01] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2020-05-15 15:29:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 15:29:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 114 ms returned sat
[2020-05-15 15:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:03] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2020-05-15 15:29:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 200 ms returned sat
[2020-05-15 15:29:03] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 30 ms.
[2020-05-15 15:29:06] [INFO ] Added : 225 causal constraints over 45 iterations in 2989 ms. Result :sat
[2020-05-15 15:29:06] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 15:29:06] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 15:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:07] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2020-05-15 15:29:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 15:29:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 113 ms returned sat
[2020-05-15 15:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:08] [INFO ] [Nat]Absence check using state equation in 1239 ms returned sat
[2020-05-15 15:29:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 14 ms returned sat
[2020-05-15 15:29:09] [INFO ] Deduced a trap composed of 51 places in 211 ms
[2020-05-15 15:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2020-05-15 15:29:09] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 36 ms.
[2020-05-15 15:29:12] [INFO ] Added : 202 causal constraints over 41 iterations in 2955 ms. Result :sat
[2020-05-15 15:29:12] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-05-15 15:29:12] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-05-15 15:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 855 ms
[2020-05-15 15:29:13] [INFO ] [Real]Absence check using 34 positive place invariants in 116 ms returned sat
[2020-05-15 15:29:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 49 ms returned sat
[2020-05-15 15:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:15] [INFO ] [Real]Absence check using state equation in 1840 ms returned sat
[2020-05-15 15:29:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 15:29:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 91 ms returned sat
[2020-05-15 15:29:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:16] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2020-05-15 15:29:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 13 ms returned sat
[2020-05-15 15:29:17] [INFO ] Deduced a trap composed of 51 places in 65 ms
[2020-05-15 15:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2020-05-15 15:29:17] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 95 ms.
[2020-05-15 15:29:20] [INFO ] Added : 251 causal constraints over 51 iterations in 3511 ms. Result :sat
[2020-05-15 15:29:20] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 15:29:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 15:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:21] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2020-05-15 15:29:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-05-15 15:29:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 96 ms returned sat
[2020-05-15 15:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:22] [INFO ] [Nat]Absence check using state equation in 1073 ms returned sat
[2020-05-15 15:29:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 46 ms returned sat
[2020-05-15 15:29:22] [INFO ] Deduced a trap composed of 51 places in 57 ms
[2020-05-15 15:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2020-05-15 15:29:23] [INFO ] Computed and/alt/rep : 254/1212/254 causal constraints in 108 ms.
[2020-05-15 15:29:25] [INFO ] Added : 235 causal constraints over 47 iterations in 3016 ms. Result :sat
[2020-05-15 15:29:26] [INFO ] Deduced a trap composed of 10 places in 186 ms
[2020-05-15 15:29:26] [INFO ] Deduced a trap composed of 12 places in 163 ms
[2020-05-15 15:29:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 255
Applied a total of 1 rules in 65 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:29:26] [INFO ] Computed 59 place invariants in 11 ms
[2020-05-15 15:29:26] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 15:29:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-15 15:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:27] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2020-05-15 15:29:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 44 ms returned sat
[2020-05-15 15:29:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 153 ms returned sat
[2020-05-15 15:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:28] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2020-05-15 15:29:28] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 32 ms.
[2020-05-15 15:29:32] [INFO ] Added : 233 causal constraints over 47 iterations in 3583 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
[2020-05-15 15:29:32] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 15:29:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2020-05-15 15:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:33] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-05-15 15:29:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-05-15 15:29:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 113 ms returned sat
[2020-05-15 15:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:34] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2020-05-15 15:29:34] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 28 ms.
[2020-05-15 15:29:38] [INFO ] Added : 204 causal constraints over 41 iterations in 3543 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-05-15 15:29:38] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 15:29:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2020-05-15 15:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:39] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2020-05-15 15:29:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 96 ms returned sat
[2020-05-15 15:29:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 184 ms returned sat
[2020-05-15 15:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:41] [INFO ] [Nat]Absence check using state equation in 1488 ms returned sat
[2020-05-15 15:29:41] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 39 ms.
[2020-05-15 15:29:43] [INFO ] Added : 208 causal constraints over 42 iterations in 2322 ms. Result :sat
[2020-05-15 15:29:43] [INFO ] Deduced a trap composed of 18 places in 141 ms
[2020-05-15 15:29:43] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2020-05-15 15:29:44] [INFO ] Deduced a trap composed of 56 places in 92 ms
[2020-05-15 15:29:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 854 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-15 15:29:44] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 15:29:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2020-05-15 15:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:46] [INFO ] [Real]Absence check using state equation in 2156 ms returned sat
[2020-05-15 15:29:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 15:29:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 131 ms returned sat
[2020-05-15 15:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:48] [INFO ] [Nat]Absence check using state equation in 1383 ms returned sat
[2020-05-15 15:29:48] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 30 ms.
[2020-05-15 15:29:52] [INFO ] Added : 251 causal constraints over 51 iterations in 3582 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-15 15:29:52] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 15:29:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2020-05-15 15:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:53] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2020-05-15 15:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 15:29:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 15:29:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2020-05-15 15:29:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 15:29:54] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2020-05-15 15:29:54] [INFO ] Computed and/alt/rep : 254/1209/254 causal constraints in 36 ms.
[2020-05-15 15:29:57] [INFO ] Added : 235 causal constraints over 47 iterations in 2931 ms. Result :sat
[2020-05-15 15:29:57] [INFO ] Deduced a trap composed of 56 places in 62 ms
[2020-05-15 15:29:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-15 15:29:58] [INFO ] Flatten gal took : 244 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 15:29:58] [INFO ] Flatten gal took : 97 ms
[2020-05-15 15:29:58] [INFO ] Applying decomposition
[2020-05-15 15:29:58] [INFO ] Flatten gal took : 153 ms
[2020-05-15 15:29:58] [INFO ] Input system was already deterministic with 255 transitions.
[2020-05-15 15:29:58] [INFO ] Input system was already deterministic with 255 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph1056638146653006862.txt, -o, /tmp/graph1056638146653006862.bin, -w, /tmp/graph1056638146653006862.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1056638146653006862.bin, -l, -1, -v, -w, /tmp/graph1056638146653006862.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 15:29:59] [INFO ] Ran tautology test, simplified 0 / 5 in 510 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-07(UNSAT) depth K=0 took 35 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-08(UNSAT) depth K=0 took 3 ms
[2020-05-15 15:29:59] [INFO ] Computed 59 place invariants in 15 ms
inv : p217 + p218 - p219 - p220 = 0
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-09(UNSAT) depth K=0 took 6 ms
inv : p0 + p273 + p274 + p289 + p290 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p257 + p258 = 1
inv : p246 - p254 + p262 - p270 - p278 + p286 = 0
inv : 2*p0 + 49*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 + 39*p40 + 40*p41 + 41*p42 + 42*p43 + 43*p44 + 44*p45 + 45*p46 + 46*p47 + 47*p48 + 48*p49 - 50*p50 - p51 - 2*p52 - 3*p53 - 4*p54 - 5*p55 - 6*p56 - 7*p57 - 8*p58 - 9*p59 - 10*p60 - 11*p61 - 12*p62 - 13*p63 - 14*p64 - 15*p65 - 16*p66 - 17*p67 - 18*p68 - 19*p69 - 20*p70 - 21*p71 - 22*p72 - 23*p73 - 24*p74 - 25*p75 - 26*p76 - 27*p77 - 28*p78 - 29*p79 - 30*p80 - 31*p81 - 32*p82 - 33*p83 - 34*p84 - 35*p85 - 36*p86 - 37*p87 - 38*p88 - 39*p89 - 40*p90 - 41*p91 - 42*p92 - 43*p93 - 44*p94 - 45*p95 - 46*p96 - 47*p97 - 48*p98 - 49*p99 - p232 + p235 - p254 - p270 + p286 + p289 - p292 - p294 - p296 - p300 + p309 + p311 = 2
inv : p0 + p309 + p312 + p313 = 1
inv : p0 + p231 + p232 = 1
inv : p250 - p254 + p266 - p270 - p282 + p286 = 0
inv : p287 + p288 - p289 - p290 = 0
inv : p0 + p281 + p282 + p289 + p290 = 1
inv : p0 + p237 + p238 = 1
inv : p248 - p254 + p264 - p270 - p280 + p286 = 0
inv : p0 + p277 + p278 + p289 + p290 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p239 + p254 - p256 + p270 + p272 - p286 = 1
inv : p0 + p283 + p284 + p289 + p290 = 1
inv : p0 - 49*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 - 39*p40 - 40*p41 - 41*p42 - 42*p43 - 43*p44 - 44*p45 - 45*p46 - 46*p47 - 47*p48 - 48*p49 + 50*p50 + p51 + 2*p52 + 3*p53 + 4*p54 + 5*p55 + 6*p56 + 7*p57 + 8*p58 + 9*p59 + 10*p60 + 11*p61 + 12*p62 + 13*p63 + 14*p64 + 15*p65 + 16*p66 + 17*p67 + 18*p68 + 19*p69 + 20*p70 + 21*p71 + 22*p72 + 23*p73 + 24*p74 + 25*p75 + 26*p76 + 27*p77 + 28*p78 + 29*p79 + 30*p80 + 31*p81 + 32*p82 + 33*p83 + 34*p84 + 35*p85 + 36*p86 + 37*p87 + 38*p88 + 39*p89 + 40*p90 + 41*p91 + 42*p92 + 43*p93 + 44*p94 + 45*p95 + 46*p96 + 47*p97 + 48*p98 + 49*p99 + p207 + p210 + p234 + p238 + p293 + p294 + p296 + p297 + p300 + p301 - p304 - p309 - p311 = 1
inv : p252 - p254 + p268 - p270 - p284 + p286 = 0
inv : p0 + 98*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 + 58*p30 + 60*p31 + 62*p32 + 64*p33 + 66*p34 + 68*p35 + 70*p36 + 72*p37 + 74*p38 + 76*p39 + 78*p40 + 80*p41 + 82*p42 + 84*p43 + 86*p44 + 88*p45 + 90*p46 + 92*p47 + 94*p48 + 96*p49 - 100*p50 - 2*p51 - 4*p52 - 6*p53 - 8*p54 - 10*p55 - 12*p56 - 14*p57 - 16*p58 - 18*p59 - 20*p60 - 22*p61 - 24*p62 - 26*p63 - 28*p64 - 30*p65 - 32*p66 - 34*p67 - 36*p68 - 38*p69 - 40*p70 - 42*p71 - 44*p72 - 46*p73 - 48*p74 - 50*p75 - 52*p76 - 54*p77 - 56*p78 - 58*p79 - 60*p80 - 62*p81 - 64*p82 - 66*p83 - 68*p84 - 70*p85 - 72*p86 - 74*p87 - 76*p88 - 78*p89 - 80*p90 - 82*p91 - 84*p92 - 86*p93 - 88*p94 - 90*p95 - 92*p96 - 94*p97 - 96*p98 - 98*p99 - p232 - p234 - p238 - p294 - p296 - p297 + p299 - p300 - p301 + p303 + p304 + p308 + 2*p309 + p311 + p313 = 1
inv : p0 + p200 + p201 = 1
inv : p0 + p293 + p294 + p295 + p296 + p297 + p300 + p301 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p304 + p305 + p306 + p308 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p214 + p215 + p216 = 1
inv : p0 + p309 + p310 + p311 = 1
inv : p0 + p245 + p254 - p262 + p270 + p278 - p286 = 1
inv : p0 + p275 + p276 + p289 + p290 = 1
inv : p0 + p271 + p272 + p289 + p290 = 1
inv : -p221 - p222 + p223 + p224 = 0
inv : p0 + p243 + p254 - p260 + p270 + p276 - p286 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p225 + p226 = 1
[2020-05-15 15:29:59] [INFO ] Decomposing Gal with order
inv : -p0 - 49*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 - 39*p40 - 40*p41 - 41*p42 - 42*p43 - 43*p44 - 44*p45 - 45*p46 - 46*p47 - 47*p48 - 48*p49 + 50*p50 + p51 + 2*p52 + 3*p53 + 4*p54 + 5*p55 + 6*p56 + 7*p57 + 8*p58 + 9*p59 + 10*p60 + 11*p61 + 12*p62 + 13*p63 + 14*p64 + 15*p65 + 16*p66 + 17*p67 + 18*p68 + 19*p69 + 20*p70 + 21*p71 + 22*p72 + 23*p73 + 24*p74 + 25*p75 + 26*p76 + 27*p77 + 28*p78 + 29*p79 + 30*p80 + 31*p81 + 32*p82 + 33*p83 + 34*p84 + 35*p85 + 36*p86 + 37*p87 + 38*p88 + 39*p89 + 40*p90 + 41*p91 + 42*p92 + 43*p93 + 44*p94 + 45*p95 + 46*p96 + 47*p97 + 48*p98 + 49*p99 + p232 + p236 + p254 + p270 - p286 - p289 + p292 + p294 + p296 + p300 - p309 - p311 = -1
inv : 2*p0 - 98*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 - 78*p40 - 80*p41 - 82*p42 - 84*p43 - 86*p44 - 88*p45 - 90*p46 - 92*p47 - 94*p48 - 96*p49 + 50*p50 + p51 + 2*p52 + 3*p53 + 4*p54 + 5*p55 + 6*p56 + 7*p57 + 8*p58 + 9*p59 + 10*p60 + 11*p61 + 12*p62 + 13*p63 + 14*p64 + 15*p65 + 16*p66 + 17*p67 + 18*p68 + 19*p69 + 20*p70 + 21*p71 + 22*p72 + 23*p73 + 24*p74 + 25*p75 + 26*p76 + 27*p77 + 28*p78 + 29*p79 + 30*p80 + 31*p81 + 32*p82 + 33*p83 + 34*p84 + 35*p85 + 36*p86 + 37*p87 + 38*p88 + 39*p89 + 40*p90 + 41*p91 + 42*p92 + 43*p93 + 44*p94 + 45*p95 + 46*p96 + 47*p97 + 48*p98 + 49*p99 + 50*p150 + p151 + 2*p152 + 3*p153 + 4*p154 + 5*p155 + 6*p156 + 7*p157 + 8*p158 + 9*p159 + 10*p160 + 11*p161 + 12*p162 + 13*p163 + 14*p164 + 15*p165 + 16*p166 + 17*p167 + 18*p168 + 19*p169 + 20*p170 + 21*p171 + 22*p172 + 23*p173 + 24*p174 + 25*p175 + 26*p176 + 27*p177 + 28*p178 + 29*p179 + 30*p180 + 31*p181 + 32*p182 + 33*p183 + 34*p184 + 35*p185 + 36*p186 + 37*p187 + 38*p188 + 39*p189 + 40*p190 + 41*p191 + 42*p192 + 43*p193 + 44*p194 + 45*p195 + 46*p196 + 47*p197 + 48*p198 + 49*p199 + p206 + p210 - p213 + p220 + p221 + p227 + p232 + p234 + p238 - p288 + p290 + p292 + p294 + p296 + p300 - p304 - p309 - p311 = 2
inv : p0 + p269 + p270 = 1
inv : p0 + p204 + p205 + p206 = 1
inv : p0 + p241 + p254 - p258 + p270 + p274 - p286 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p233 + p234 = 1
inv : p0 + p285 + p286 + p289 + p290 = 1
inv : p0 + p202 + p203 = 1
inv : p0 + p249 + p254 - p266 + p270 + p282 - p286 = 1
inv : p240 - p254 + p256 - p270 - p272 + p286 = 0
inv : p0 + p251 + p254 - p268 + p270 + p284 - p286 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p255 + p256 = 1
inv : p0 + p209 + p210 = 1
inv : p0 + p279 + p280 + p289 + p290 = 1
inv : -p0 - 98*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 - 78*p40 - 80*p41 - 82*p42 - 84*p43 - 86*p44 - 88*p45 - 90*p46 - 92*p47 - 94*p48 - 96*p49 + 100*p50 + 2*p51 + 4*p52 + 6*p53 + 8*p54 + 10*p55 + 12*p56 + 14*p57 + 16*p58 + 18*p59 + 20*p60 + 22*p61 + 24*p62 + 26*p63 + 28*p64 + 30*p65 + 32*p66 + 34*p67 + 36*p68 + 38*p69 + 40*p70 + 42*p71 + 44*p72 + 46*p73 + 48*p74 + 50*p75 + 52*p76 + 54*p77 + 56*p78 + 58*p79 + 60*p80 + 62*p81 + 64*p82 + 66*p83 + 68*p84 + 70*p85 + 72*p86 + 74*p87 + 76*p88 + 78*p89 + 80*p90 + 82*p91 + 84*p92 + 86*p93 + 88*p94 + 90*p95 + 92*p96 + 94*p97 + 96*p98 + 98*p99 + p232 + p234 + p238 + p294 + p298 + p300 + p301 - p303 - p304 - p308 - 2*p309 - p311 - p313 = -1
inv : -p300 - p301 + p302 + p303 = 0
inv : p244 - p254 + p260 - p270 - p276 + p286 = 0
inv : p0 + p227 + p228 = 1
inv : p0 + p291 + p292 = 1
inv : 49*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 + 39*p40 + 40*p41 + 41*p42 + 42*p43 + 43*p44 + 44*p45 + 45*p46 + 46*p47 + 47*p48 + 48*p49 - 50*p50 - p51 - 2*p52 - 3*p53 - 4*p54 - 5*p55 - 6*p56 - 7*p57 - 8*p58 - 9*p59 - 10*p60 - 11*p61 - 12*p62 - 13*p63 - 14*p64 - 15*p65 - 16*p66 - 17*p67 - 18*p68 - 19*p69 - 20*p70 - 21*p71 - 22*p72 - 23*p73 - 24*p74 - 25*p75 - 26*p76 - 27*p77 - 28*p78 - 29*p79 - 30*p80 - 31*p81 - 32*p82 - 33*p83 - 34*p84 - 35*p85 - 36*p86 - 37*p87 - 38*p88 - 39*p89 - 40*p90 - 41*p91 - 42*p92 - 43*p93 - 44*p94 - 45*p95 - 46*p96 - 47*p97 - 48*p98 - 49*p99 + p208 - p210 - p234 - p238 - p293 - p294 - p296 - p297 - p300 - p301 + p304 + p309 + p311 = 0
inv : p242 - p254 + p258 - p270 - p274 + p286 = 0
inv : p0 + p247 + p254 - p264 + p270 + p280 - p286 = 1
Total of 59 invariants.
[2020-05-15 15:29:59] [INFO ] Computed 59 place invariants in 24 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-11(UNSAT) depth K=0 took 6 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-13(UNSAT) depth K=0 took 8 ms
[2020-05-15 15:29:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-07(UNSAT) depth K=1 took 21 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-08(UNSAT) depth K=1 took 12 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-09(UNSAT) depth K=1 took 11 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-11(UNSAT) depth K=1 took 12 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-13(UNSAT) depth K=1 took 7 ms
[2020-05-15 15:29:59] [INFO ] Removed a total of 25 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 255 rows 312 cols
[2020-05-15 15:29:59] [INFO ] Flatten gal took : 153 ms
[2020-05-15 15:29:59] [INFO ] Computed 59 place invariants in 8 ms
inv : p217 + p218 - p219 - p220 = 0
inv : p0 + p273 + p274 + p289 + p290 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p257 + p258 = 1
inv : p246 - p254 + p262 - p270 - p278 + p286 = 0
inv : 2*p0 + 49*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 + 39*p40 + 40*p41 + 41*p42 + 42*p43 + 43*p44 + 44*p45 + 45*p46 + 46*p47 + 47*p48 + 48*p49 - 50*p50 - p51 - 2*p52 - 3*p53 - 4*p54 - 5*p55 - 6*p56 - 7*p57 - 8*p58 - 9*p59 - 10*p60 - 11*p61 - 12*p62 - 13*p63 - 14*p64 - 15*p65 - 16*p66 - 17*p67 - 18*p68 - 19*p69 - 20*p70 - 21*p71 - 22*p72 - 23*p73 - 24*p74 - 25*p75 - 26*p76 - 27*p77 - 28*p78 - 29*p79 - 30*p80 - 31*p81 - 32*p82 - 33*p83 - 34*p84 - 35*p85 - 36*p86 - 37*p87 - 38*p88 - 39*p89 - 40*p90 - 41*p91 - 42*p92 - 43*p93 - 44*p94 - 45*p95 - 46*p96 - 47*p97 - 48*p98 - 49*p99 - p232 + p235 - p254 - p270 + p286 + p289 - p292 - p294 - p296 - p300 + p309 + p311 = 2
inv : p0 + p309 + p312 + p313 = 1
inv : p0 + p231 + p232 = 1
inv : p250 - p254 + p266 - p270 - p282 + p286 = 0
inv : p287 + p288 - p289 - p290 = 0
inv : p0 + p281 + p282 + p289 + p290 = 1
inv : p0 + p237 + p238 = 1
inv : p248 - p254 + p264 - p270 - p280 + p286 = 0
inv : p0 + p277 + p278 + p289 + p290 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p239 + p254 - p256 + p270 + p272 - p286 = 1
inv : p0 + p283 + p284 + p289 + p290 = 1
inv : p0 - 49*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 - 39*p40 - 40*p41 - 41*p42 - 42*p43 - 43*p44 - 44*p45 - 45*p46 - 46*p47 - 47*p48 - 48*p49 + 50*p50 + p51 + 2*p52 + 3*p53 + 4*p54 + 5*p55 + 6*p56 + 7*p57 + 8*p58 + 9*p59 + 10*p60 + 11*p61 + 12*p62 + 13*p63 + 14*p64 + 15*p65 + 16*p66 + 17*p67 + 18*p68 + 19*p69 + 20*p70 + 21*p71 + 22*p72 + 23*p73 + 24*p74 + 25*p75 + 26*p76 + 27*p77 + 28*p78 + 29*p79 + 30*p80 + 31*p81 + 32*p82 + 33*p83 + 34*p84 + 35*p85 + 36*p86 + 37*p87 + 38*p88 + 39*p89 + 40*p90 + 41*p91 + 42*p92 + 43*p93 + 44*p94 + 45*p95 + 46*p96 + 47*p97 + 48*p98 + 49*p99 + p207 + p210 + p234 + p238 + p293 + p294 + p296 + p297 + p300 + p301 - p304 - p309 - p311 = 1
inv : p252 - p254 + p268 - p270 - p284 + p286 = 0
inv : p0 + 98*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 + 40*p21 + 42*p22 + 44*p23 + 46*p24 + 48*p25 + 50*p26 + 52*p27 + 54*p28 + 56*p29 + 58*p30 + 60*p31 + 62*p32 + 64*p33 + 66*p34 + 68*p35 + 70*p36 + 72*p37 + 74*p38 + 76*p39 + 78*p40 + 80*p41 + 82*p42 + 84*p43 + 86*p44 + 88*p45 + 90*p46 + 92*p47 + 94*p48 + 96*p49 - 100*p50 - 2*p51 - 4*p52 - 6*p53 - 8*p54 - 10*p55 - 12*p56 - 14*p57 - 16*p58 - 18*p59 - 20*p60 - 22*p61 - 24*p62 - 26*p63 - 28*p64 - 30*p65 - 32*p66 - 34*p67 - 36*p68 - 38*p69 - 40*p70 - 42*p71 - 44*p72 - 46*p73 - 48*p74 - 50*p75 - 52*p76 - 54*p77 - 56*p78 - 58*p79 - 60*p80 - 62*p81 - 64*p82 - 66*p83 - 68*p84 - 70*p85 - 72*p86 - 74*p87 - 76*p88 - 78*p89 - 80*p90 - 82*p91 - 84*p92 - 86*p93 - 88*p94 - 90*p95 - 92*p96 - 94*p97 - 96*p98 - 98*p99 - p232 - p234 - p238 - p294 - p296 - p297 + p299 - p300 - p301 + p303 + p304 + p308 + 2*p309 + p311 + p313 = 1
inv : p0 + p200 + p201 = 1
inv : p0 + p293 + p294 + p295 + p296 + p297 + p300 + p301 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p304 + p305 + p306 + p308 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p214 + p215 + p216 = 1
inv : p0 + p309 + p310 + p311 = 1
inv : p0 + p245 + p254 - p262 + p270 + p278 - p286 = 1
inv : p0 + p275 + p276 + p289 + p290 = 1
inv : p0 + p271 + p272 + p289 + p290 = 1
inv : -p221 - p222 + p223 + p224 = 0
inv : p0 + p243 + p254 - p260 + p270 + p276 - p286 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p225 + p226 = 1
inv : -p0 - 49*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 - 20*p21 - 21*p22 - 22*p23 - 23*p24 - 24*p25 - 25*p26 - 26*p27 - 27*p28 - 28*p29 - 29*p30 - 30*p31 - 31*p32 - 32*p33 - 33*p34 - 34*p35 - 35*p36 - 36*p37 - 37*p38 - 38*p39 - 39*p40 - 40*p41 - 41*p42 - 42*p43 - 43*p44 - 44*p45 - 45*p46 - 46*p47 - 47*p48 - 48*p49 + 50*p50 + p51 + 2*p52 + 3*p53 + 4*p54 + 5*p55 + 6*p56 + 7*p57 + 8*p58 + 9*p59 + 10*p60 + 11*p61 + 12*p62 + 13*p63 + 14*p64 + 15*p65 + 16*p66 + 17*p67 + 18*p68 + 19*p69 + 20*p70 + 21*p71 + 22*p72 + 23*p73 + 24*p74 + 25*p75 + 26*p76 + 27*p77 + 28*p78 + 29*p79 + 30*p80 + 31*p81 + 32*p82 + 33*p83 + 34*p84 + 35*p85 + 36*p86 + 37*p87 + 38*p88 + 39*p89 + 40*p90 + 41*p91 + 42*p92 + 43*p93 + 44*p94 + 45*p95 + 46*p96 + 47*p97 + 48*p98 + 49*p99 + p232 + p236 + p254 + p270 - p286 - p289 + p292 + p294 + p296 + p300 - p309 - p311 = -1
inv : 2*p0 - 98*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 - 78*p40 - 80*p41 - 82*p42 - 84*p43 - 86*p44 - 88*p45 - 90*p46 - 92*p47 - 94*p48 - 96*p49 + 50*p50 + p51 + 2*p52 + 3*p53 + 4*p54 + 5*p55 + 6*p56 + 7*p57 + 8*p58 + 9*p59 + 10*p60 + 11*p61 + 12*p62 + 13*p63 + 14*p64 + 15*p65 + 16*p66 + 17*p67 + 18*p68 + 19*p69 + 20*p70 + 21*p71 + 22*p72 + 23*p73 + 24*p74 + 25*p75 + 26*p76 + 27*p77 + 28*p78 + 29*p79 + 30*p80 + 31*p81 + 32*p82 + 33*p83 + 34*p84 + 35*p85 + 36*p86 + 37*p87 + 38*p88 + 39*p89 + 40*p90 + 41*p91 + 42*p92 + 43*p93 + 44*p94 + 45*p95 + 46*p96 + 47*p97 + 48*p98 + 49*p99 + 50*p150 + p151 + 2*p152 + 3*p153 + 4*p154 + 5*p155 + 6*p156 + 7*p157 + 8*p158 + 9*p159 + 10*p160 + 11*p161 + 12*p162 + 13*p163 + 14*p164 + 15*p165 + 16*p166 + 17*p167 + 18*p168 + 19*p169 + 20*p170 + 21*p171 + 22*p172 + 23*p173 + 24*p174 + 25*p175 + 26*p176 + 27*p177 + 28*p178 + 29*p179 + 30*p180 + 31*p181 + 32*p182 + 33*p183 + 34*p184 + 35*p185 + 36*p186 + 37*p187 + 38*p188 + 39*p189 + 40*p190 + 41*p191 + 42*p192 + 43*p193 + 44*p194 + 45*p195 + 46*p196 + 47*p197 + 48*p198 + 49*p199 + p206 + p210 - p213 + p220 + p221 + p227 + p232 + p234 + p238 - p288 + p290 + p292 + p294 + p296 + p300 - p304 - p309 - p311 = 2
inv : p0 + p269 + p270 = 1
inv : p0 + p204 + p205 + p206 = 1
inv : p0 + p241 + p254 - p258 + p270 + p274 - p286 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p233 + p234 = 1
inv : p0 + p285 + p286 + p289 + p290 = 1
inv : p0 + p202 + p203 = 1
inv : p0 + p249 + p254 - p266 + p270 + p282 - p286 = 1
inv : p240 - p254 + p256 - p270 - p272 + p286 = 0
inv : p0 + p251 + p254 - p268 + p270 + p284 - p286 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p255 + p256 = 1
inv : p0 + p209 + p210 = 1
inv : p0 + p279 + p280 + p289 + p290 = 1
inv : -p0 - 98*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 - 40*p21 - 42*p22 - 44*p23 - 46*p24 - 48*p25 - 50*p26 - 52*p27 - 54*p28 - 56*p29 - 58*p30 - 60*p31 - 62*p32 - 64*p33 - 66*p34 - 68*p35 - 70*p36 - 72*p37 - 74*p38 - 76*p39 - 78*p40 - 80*p41 - 82*p42 - 84*p43 - 86*p44 - 88*p45 - 90*p46 - 92*p47 - 94*p48 - 96*p49 + 100*p50 + 2*p51 + 4*p52 + 6*p53 + 8*p54 + 10*p55 + 12*p56 + 14*p57 + 16*p58 + 18*p59 + 20*p60 + 22*p61 + 24*p62 + 26*p63 + 28*p64 + 30*p65 + 32*p66 + 34*p67 + 36*p68 + 38*p69 + 40*p70 + 42*p71 + 44*p72 + 46*p73 + 48*p74 + 50*p75 + 52*p76 + 54*p77 + 56*p78 + 58*p79 + 60*p80 + 62*p81 + 64*p82 + 66*p83 + 68*p84 + 70*p85 + 72*p86 + 74*p87 + 76*p88 + 78*p89 + 80*p90 + 82*p91 + 84*p92 + 86*p93 + 88*p94 + 90*p95 + 92*p96 + 94*p97 + 96*p98 + 98*p99 + p232 + p234 + p238 + p294 + p298 + p300 + p301 - p303 - p304 - p308 - 2*p309 - p311 - p313 = -1
inv : -p300 - p301 + p302 + p303 = 0
inv : p244 - p254 + p260 - p270 - p276 + p286 = 0
inv : p0 + p227 + p228 = 1
inv : p0 + p291 + p292 = 1
inv : 49*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 + 20*p21 + 21*p22 + 22*p23 + 23*p24 + 24*p25 + 25*p26 + 26*p27 + 27*p28 + 28*p29 + 29*p30 + 30*p31 + 31*p32 + 32*p33 + 33*p34 + 34*p35 + 35*p36 + 36*p37 + 37*p38 + 38*p39 + 39*p40 + 40*p41 + 41*p42 + 42*p43 + 43*p44 + 44*p45 + 45*p46 + 46*p47 + 47*p48 + 48*p49 - 50*p50 - p51 - 2*p52 - 3*p53 - 4*p54 - 5*p55 - 6*p56 - 7*p57 - 8*p58 - 9*p59 - 10*p60 - 11*p61 - 12*p62 - 13*p63 - 14*p64 - 15*p65 - 16*p66 - 17*p67 - 18*p68 - 19*p69 - 20*p70 - 21*p71 - 22*p72 - 23*p73 - 24*p74 - 25*p75 - 26*p76 - 27*p77 - 28*p78 - 29*p79 - 30*p80 - 31*p81 - 32*p82 - 33*p83 - 34*p84 - 35*p85 - 36*p86 - 37*p87 - 38*p88 - 39*p89 - 40*p90 - 41*p91 - 42*p92 - 43*p93 - 44*p94 - 45*p95 - 46*p96 - 47*p97 - 48*p98 - 49*p99 + p208 - p210 - p234 - p238 - p293 - p294 - p296 - p297 - p300 - p301 + p304 + p309 + p311 = 0
inv : p242 - p254 + p258 - p270 - p274 + p286 = 0
inv : p0 + p247 + p254 - p264 + p270 + p280 - p286 = 1
Total of 59 invariants.
[2020-05-15 15:29:59] [INFO ] Computed 59 place invariants in 12 ms
[2020-05-15 15:29:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 27 ms.
[2020-05-15 15:29:59] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 17 ms
[2020-05-15 15:29:59] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.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.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-07(UNSAT) depth K=2 took 340 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-08(UNSAT) depth K=2 took 12 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-09(UNSAT) depth K=2 took 1 ms
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : DES-PT-50a-ReachabilityCardinality-07 with value :(((u2.p153==1)||(u13.p119==0))||(i5.u18.p242==1))
Read [invariant] property : DES-PT-50a-ReachabilityCardinality-08 with value :((u13.p122==0)||(i9.u30.p265==1))
Read [invariant] property : DES-PT-50a-ReachabilityCardinality-09 with value :((u2.p169==0)||(i0.i0.u7.p222==1))
Read [invariant] property : DES-PT-50a-ReachabilityCardinality-11 with value :((((i8.u21.p248!=0)&&(i9.u22.p250!=1))||((i6.u27.p259!=0)&&(i12.u45.p302!=1)))||((((i0.i0.u8.p220==1)||(u2.p151==0))||(i8.u29.p264==1))&&((u47.p68==0)||(u2.p183==1))))
Read [invariant] property : DES-PT-50a-ReachabilityCardinality-13 with value :((u14.p9==0)||(u13.p142==1))
built 8 ordering constraints for composite.
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-11(UNSAT) depth K=2 took 17 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-13(UNSAT) depth K=2 took 2 ms
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 17 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 26 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-07(UNSAT) depth K=3 took 144 ms
[2020-05-15 15:29:59] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-08(UNSAT) depth K=3 took 70 ms
SDD proceeding with computation, new max is 1024
Invariant property DES-PT-50a-ReachabilityCardinality-08 does not hold.
FORMULA DES-PT-50a-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-50a-ReachabilityCardinality-07 does not hold.
FORMULA DES-PT-50a-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 2048
[2020-05-15 15:30:00] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-09(UNSAT) depth K=3 took 132 ms
[2020-05-15 15:30:00] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-11(UNSAT) depth K=3 took 128 ms
SDD proceeding with computation, new max is 4096
[2020-05-15 15:30:00] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-13(UNSAT) depth K=3 took 210 ms
[2020-05-15 15:30:01] [INFO ] Proved 312 variables to be positive in 1957 ms
[2020-05-15 15:30:01] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2020-05-15 15:30:01] [INFO ] Computation of disable matrix completed :0/255 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:30:01] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:30:01] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2020-05-15 15:30:01] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 15:30:01] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-09(UNSAT) depth K=4 took 1002 ms
[2020-05-15 15:30:01] [INFO ] Proved 312 variables to be positive in 1982 ms
SDD proceeding with computation, new max is 8192
[2020-05-15 15:30:01] [INFO ] Computing symmetric co enabling matrix : 255 transitions.
[2020-05-15 15:30:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-50a-ReachabilityCardinality-09
[2020-05-15 15:30:02] [INFO ] KInduction solution for property DES-PT-50a-ReachabilityCardinality-09(SAT) depth K=0 took 1137 ms
[2020-05-15 15:30:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-50a-ReachabilityCardinality-11
[2020-05-15 15:30:03] [INFO ] KInduction solution for property DES-PT-50a-ReachabilityCardinality-11(SAT) depth K=0 took 876 ms
SDD proceeding with computation, new max is 16384
[2020-05-15 15:30:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-50a-ReachabilityCardinality-13
[2020-05-15 15:30:03] [INFO ] KInduction solution for property DES-PT-50a-ReachabilityCardinality-13(SAT) depth K=0 took 307 ms
[2020-05-15 15:30:04] [INFO ] Computation of co-enabling matrix(3/255) took 2912 ms. Total solver calls (SAT/UNSAT): 638(563/75)
[2020-05-15 15:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-50a-ReachabilityCardinality-09
[2020-05-15 15:30:06] [INFO ] KInduction solution for property DES-PT-50a-ReachabilityCardinality-09(SAT) depth K=1 took 2664 ms
[2020-05-15 15:30:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-50a-ReachabilityCardinality-11
[2020-05-15 15:30:06] [INFO ] KInduction solution for property DES-PT-50a-ReachabilityCardinality-11(SAT) depth K=1 took 153 ms
SDD proceeding with computation, new max is 32768
[2020-05-15 15:30:06] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-11(UNSAT) depth K=4 took 5600 ms
[2020-05-15 15:30:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-50a-ReachabilityCardinality-13
[2020-05-15 15:30:07] [INFO ] KInduction solution for property DES-PT-50a-ReachabilityCardinality-13(SAT) depth K=1 took 1126 ms
[2020-05-15 15:30:07] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-13(UNSAT) depth K=4 took 789 ms
[2020-05-15 15:30:08] [INFO ] Computation of co-enabling matrix(9/255) took 6416 ms. Total solver calls (SAT/UNSAT): 1457(1075/382)
[2020-05-15 15:30:11] [INFO ] Computation of co-enabling matrix(13/255) took 9825 ms. Total solver calls (SAT/UNSAT): 2127(1737/390)
Invariant property DES-PT-50a-ReachabilityCardinality-11 does not hold.
FORMULA DES-PT-50a-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-50a-ReachabilityCardinality-09 does not hold.
FORMULA DES-PT-50a-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 65536
[2020-05-15 15:30:13] [INFO ] BMC solution for property DES-PT-50a-ReachabilityCardinality-09(UNSAT) depth K=5 took 5923 ms
[2020-05-15 15:30:15] [INFO ] Computation of co-enabling matrix(17/255) took 13302 ms. Total solver calls (SAT/UNSAT): 2781(2383/398)
[2020-05-15 15:30:18] [INFO ] Computation of co-enabling matrix(21/255) took 16820 ms. Total solver calls (SAT/UNSAT): 3419(3013/406)
[2020-05-15 15:30:22] [INFO ] Computation of co-enabling matrix(25/255) took 20855 ms. Total solver calls (SAT/UNSAT): 4041(3627/414)
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.22899e+13,23.2764,364352,20061,9886,852276,36533,285,746376,464,309739,0
Total reachable state count : 32289933295993

Verifying 5 reachability properties.
Invariant property DES-PT-50a-ReachabilityCardinality-07 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-ReachabilityCardinality-07,1.66009e+07,23.375,364036,603,339,852276,36533,295,746376,469,309739,549
Invariant property DES-PT-50a-ReachabilityCardinality-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-ReachabilityCardinality-08,8.509e+06,23.3904,364036,314,296,852276,36533,302,746376,473,309739,716
Invariant property DES-PT-50a-ReachabilityCardinality-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-ReachabilityCardinality-09,41984,23.4401,364036,90,194,852276,36533,308,746376,473,309739,2981
Invariant property DES-PT-50a-ReachabilityCardinality-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-ReachabilityCardinality-11,3.23953e+11,24.2383,364036,3434,2321,852276,36533,344,746376,485,309739,76024
Invariant property DES-PT-50a-ReachabilityCardinality-13 does not hold.
FORMULA DES-PT-50a-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-ReachabilityCardinality-13,1.53894e+11,24.2556,364036,1463,1239,852276,36533,344,746376,487,309739,76878
[2020-05-15 15:30:24] [WARNING] Interrupting SMT solver.
SMT solver raised 'unknown', retrying with same input.
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-15 15:30:24] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 15:30:24] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-50a-ReachabilityCardinality-09 K-induction depth 2
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 15:30:24] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-50a-ReachabilityCardinality-13 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-15 15:30:24] [INFO ] During BMC, SMT solver timed out at depth 5
[2020-05-15 15:30:24] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2020-05-15 15:30:24] [INFO ] SMT solved 0/ 5 properties. Interrupting SMT analysis.
[2020-05-15 15:30:24] [INFO ] Computation of Finished co-enabling matrix. took 22983 ms. Total solver calls (SAT/UNSAT): 4353(3935/418)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 15:30:24] [INFO ] Built C files in 26242ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589556625132

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-50a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r051-ebro-158902546000310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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