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-158902546000294.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-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 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.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 83K 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-40a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589550287501

[2020-05-15 13:44:50] [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 13:44:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 13:44:50] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2020-05-15 13:44:50] [INFO ] Transformed 274 places.
[2020-05-15 13:44:50] [INFO ] Transformed 231 transitions.
[2020-05-15 13:44:50] [INFO ] Found NUPN structural information;
[2020-05-15 13:44:50] [INFO ] Parsed PT model containing 274 places and 231 transitions in 225 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 219 resets, run finished after 169 ms. (steps per millisecond=59 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-40a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 217 rows 274 cols
[2020-05-15 13:44:51] [INFO ] Computed 59 place invariants in 42 ms
[2020-05-15 13:44:51] [INFO ] [Real]Absence check using 34 positive place invariants in 51 ms returned sat
[2020-05-15 13:44:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-05-15 13:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:44:52] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2020-05-15 13:44:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:44:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-05-15 13:44:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 99 ms returned sat
[2020-05-15 13:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:44:53] [INFO ] [Nat]Absence check using state equation in 104 ms returned unsat
[2020-05-15 13:44:53] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 13:44:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 13:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:44:53] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2020-05-15 13:44:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:44:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 13:44:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 109 ms returned sat
[2020-05-15 13:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:44:54] [INFO ] [Nat]Absence check using state equation in 943 ms returned sat
[2020-05-15 13:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 13:44:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-15 13:44:55] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 76 ms.
[2020-05-15 13:44:57] [INFO ] Added : 135 causal constraints over 27 iterations in 1968 ms. Result :sat
[2020-05-15 13:44:57] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-05-15 13:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-15 13:44:57] [INFO ] [Real]Absence check using 34 positive place invariants in 60 ms returned sat
[2020-05-15 13:44:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2020-05-15 13:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:44:58] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-05-15 13:44:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:44:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 13:44:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 130 ms returned sat
[2020-05-15 13:44:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:44:59] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2020-05-15 13:44:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 13:44:59] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 36 ms.
[2020-05-15 13:45:01] [INFO ] Added : 196 causal constraints over 40 iterations in 2466 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-05-15 13:45:01] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 13:45:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:02] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2020-05-15 13:45:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:45:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-05-15 13:45:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 55 ms returned sat
[2020-05-15 13:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:03] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2020-05-15 13:45:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:45:03] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 50 ms.
[2020-05-15 13:45:05] [INFO ] Added : 134 causal constraints over 27 iterations in 1701 ms. Result :sat
[2020-05-15 13:45:05] [INFO ] Deduced a trap composed of 12 places in 121 ms
[2020-05-15 13:45:05] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-05-15 13:45:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-05-15 13:45:05] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-05-15 13:45:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2020-05-15 13:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:06] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2020-05-15 13:45:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:45:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 13:45:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 134 ms returned sat
[2020-05-15 13:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:07] [INFO ] [Nat]Absence check using state equation in 174 ms returned unsat
[2020-05-15 13:45:07] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-05-15 13:45:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2020-05-15 13:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:09] [INFO ] [Real]Absence check using state equation in 1783 ms returned sat
[2020-05-15 13:45:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:45:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-05-15 13:45:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 230 ms returned sat
[2020-05-15 13:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:10] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2020-05-15 13:45:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 13:45:10] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 31 ms.
[2020-05-15 13:45:12] [INFO ] Added : 147 causal constraints over 30 iterations in 1598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-15 13:45:12] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 13:45:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:12] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-05-15 13:45:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:45:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-05-15 13:45:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 46 ms returned sat
[2020-05-15 13:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:13] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2020-05-15 13:45:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:45:13] [INFO ] Deduced a trap composed of 13 places in 162 ms
[2020-05-15 13:45:13] [INFO ] Deduced a trap composed of 10 places in 97 ms
[2020-05-15 13:45:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2020-05-15 13:45:14] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 30 ms.
[2020-05-15 13:45:15] [INFO ] Added : 103 causal constraints over 21 iterations in 1506 ms. Result :unsat
[2020-05-15 13:45:15] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 13:45:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-15 13:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:16] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2020-05-15 13:45:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:45:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 13:45:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 268 ms returned sat
[2020-05-15 13:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:45:17] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2020-05-15 13:45:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:45:17] [INFO ] Deduced a trap composed of 9 places in 142 ms
[2020-05-15 13:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2020-05-15 13:45:17] [INFO ] Computed and/alt/rep : 216/899/216 causal constraints in 96 ms.
[2020-05-15 13:45:19] [INFO ] Added : 213 causal constraints over 43 iterations in 2176 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
FORMULA DES-PT-40a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-40a-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-40a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 202700 steps, including 5238 resets, run finished after 1115 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 152700 steps, including 3748 resets, run finished after 744 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 108200 steps, including 2783 resets, run finished after 546 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 201600 steps, including 4721 resets, run finished after 949 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 1, 0] could not realise parikh vector
FORMULA DES-PT-40a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 101000 steps, including 2333 resets, run finished after 441 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 12 out of 274 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 274 transition count 215
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 273 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 214
Applied a total of 10 rules in 158 ms. Remains 273 /274 variables (removed 1) and now considering 214/217 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 273/274 places, 214/217 transitions.
Incomplete random walk after 1000000 steps, including 15547 resets, run finished after 4133 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3184 resets, run finished after 2025 ms. (steps per millisecond=493 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2886 resets, run finished after 2317 ms. (steps per millisecond=431 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2859 resets, run finished after 2054 ms. (steps per millisecond=486 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2827 resets, run finished after 1849 ms. (steps per millisecond=540 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 8186704 steps, run timeout after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 8186704 steps, saw 1076847 distinct states, run finished after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 214 rows 273 cols
[2020-05-15 13:46:06] [INFO ] Computed 61 place invariants in 24 ms
[2020-05-15 13:46:06] [INFO ] [Real]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-05-15 13:46:06] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 45 ms returned sat
[2020-05-15 13:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:07] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2020-05-15 13:46:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:46:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-05-15 13:46:07] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 103 ms returned sat
[2020-05-15 13:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:08] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2020-05-15 13:46:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-15 13:46:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 147 ms returned sat
[2020-05-15 13:46:08] [INFO ] Deduced a trap composed of 41 places in 57 ms
[2020-05-15 13:46:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2020-05-15 13:46:08] [INFO ] Computed and/alt/rep : 213/977/213 causal constraints in 24 ms.
[2020-05-15 13:46:10] [INFO ] Added : 149 causal constraints over 30 iterations in 1993 ms. Result :sat
[2020-05-15 13:46:11] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2020-05-15 13:46:11] [INFO ] Deduced a trap composed of 19 places in 149 ms
[2020-05-15 13:46:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-05-15 13:46:11] [INFO ] [Real]Absence check using 36 positive place invariants in 109 ms returned sat
[2020-05-15 13:46:11] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 79 ms returned sat
[2020-05-15 13:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:13] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2020-05-15 13:46:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:46:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 94 ms returned sat
[2020-05-15 13:46:13] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 87 ms returned sat
[2020-05-15 13:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:13] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2020-05-15 13:46:14] [INFO ] [Nat]Added 4 Read/Feed constraints in 18 ms returned sat
[2020-05-15 13:46:14] [INFO ] Computed and/alt/rep : 213/977/213 causal constraints in 29 ms.
[2020-05-15 13:46:15] [INFO ] Added : 194 causal constraints over 39 iterations in 1827 ms. Result :sat
[2020-05-15 13:46:15] [INFO ] Deduced a trap composed of 8 places in 102 ms
[2020-05-15 13:46:16] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-05-15 13:46:16] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-15 13:46:16] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-05-15 13:46:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-15 13:46:16] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-05-15 13:46:16] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 13:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:17] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2020-05-15 13:46:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:46:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 64 ms returned sat
[2020-05-15 13:46:19] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 2214 ms returned sat
[2020-05-15 13:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:20] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2020-05-15 13:46:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 190 ms returned sat
[2020-05-15 13:46:20] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2020-05-15 13:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2020-05-15 13:46:20] [INFO ] Computed and/alt/rep : 213/977/213 causal constraints in 31 ms.
[2020-05-15 13:46:22] [INFO ] Added : 133 causal constraints over 27 iterations in 1566 ms. Result :sat
[2020-05-15 13:46:22] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-05-15 13:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-05-15 13:46:22] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-05-15 13:46:22] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:23] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2020-05-15 13:46:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:46:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-15 13:46:23] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 78 ms returned sat
[2020-05-15 13:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:46:23] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2020-05-15 13:46:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 30 ms returned sat
[2020-05-15 13:46:24] [INFO ] Deduced a trap composed of 41 places in 54 ms
[2020-05-15 13:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2020-05-15 13:46:24] [INFO ] Computed and/alt/rep : 213/977/213 causal constraints in 30 ms.
[2020-05-15 13:46:26] [INFO ] Added : 208 causal constraints over 42 iterations in 2123 ms. Result :sat
[2020-05-15 13:46:26] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-05-15 13:46:26] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-15 13:46:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
Incomplete Parikh walk after 196800 steps, including 2247 resets, run finished after 808 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 105900 steps, including 277 resets, run finished after 393 ms. (steps per millisecond=269 ) properties seen :[1, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-40a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 197900 steps, including 2267 resets, run finished after 758 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 155700 steps, including 1994 resets, run finished after 595 ms. (steps per millisecond=261 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 214/214 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 213
Applied a total of 2 rules in 78 ms. Remains 271 /273 variables (removed 2) and now considering 213/214 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/273 places, 213/214 transitions.
Incomplete random walk after 1000000 steps, including 15770 resets, run finished after 3983 ms. (steps per millisecond=251 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2866 resets, run finished after 2076 ms. (steps per millisecond=481 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2891 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2853 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 9284520 steps, run timeout after 30001 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0]
Probabilistic random walk after 9284520 steps, saw 1228532 distinct states, run finished after 30001 ms. (steps per millisecond=309 ) properties seen :[0, 0, 0]
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:08] [INFO ] Computed 60 place invariants in 13 ms
[2020-05-15 13:47:08] [INFO ] [Real]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-05-15 13:47:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2020-05-15 13:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:10] [INFO ] [Real]Absence check using state equation in 1423 ms returned sat
[2020-05-15 13:47:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-05-15 13:47:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 130 ms returned sat
[2020-05-15 13:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:11] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2020-05-15 13:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 13:47:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2020-05-15 13:47:11] [INFO ] Computed and/alt/rep : 210/552/210 causal constraints in 23 ms.
[2020-05-15 13:47:13] [INFO ] Added : 191 causal constraints over 39 iterations in 2050 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-15 13:47:13] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-05-15 13:47:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:14] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-05-15 13:47:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-05-15 13:47:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 209 ms returned sat
[2020-05-15 13:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:15] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2020-05-15 13:47:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 181 ms returned sat
[2020-05-15 13:47:15] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2020-05-15 13:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-05-15 13:47:15] [INFO ] Computed and/alt/rep : 210/552/210 causal constraints in 28 ms.
[2020-05-15 13:47:16] [INFO ] Added : 128 causal constraints over 26 iterations in 1150 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-15 13:47:16] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2020-05-15 13:47:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:17] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2020-05-15 13:47:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-05-15 13:47:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 188 ms returned sat
[2020-05-15 13:47:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:18] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2020-05-15 13:47:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-15 13:47:18] [INFO ] Deduced a trap composed of 12 places in 150 ms
[2020-05-15 13:47:18] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2020-05-15 13:47:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2020-05-15 13:47:18] [INFO ] Computed and/alt/rep : 210/552/210 causal constraints in 18 ms.
[2020-05-15 13:47:20] [INFO ] Added : 206 causal constraints over 42 iterations in 1660 ms. Result :sat
[2020-05-15 13:47:20] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2020-05-15 13:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 193400 steps, including 2269 resets, run finished after 728 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 104800 steps, including 1097 resets, run finished after 389 ms. (steps per millisecond=269 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 110200 steps, including 1391 resets, run finished after 405 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 28 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 21 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:22] [INFO ] Computed 60 place invariants in 14 ms
[2020-05-15 13:47:24] [INFO ] Implicit Places using invariants in 2000 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:24] [INFO ] Computed 60 place invariants in 10 ms
[2020-05-15 13:47:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 13:47:28] [INFO ] Implicit Places using invariants and state equation in 3682 ms returned []
Implicit Place search using SMT with State Equation took 5695 ms to find 0 implicit places.
[2020-05-15 13:47:28] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:28] [INFO ] Computed 60 place invariants in 17 ms
[2020-05-15 13:47:28] [INFO ] Dead Transitions using invariants and state equation in 808 ms returned []
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Incomplete random walk after 100000 steps, including 1577 resets, run finished after 435 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0]
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:29] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-15 13:47:29] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-05-15 13:47:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 37 ms returned sat
[2020-05-15 13:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:30] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-05-15 13:47:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 48 ms returned sat
[2020-05-15 13:47:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 117 ms returned sat
[2020-05-15 13:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:31] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2020-05-15 13:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 13:47:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2020-05-15 13:47:31] [INFO ] Computed and/alt/rep : 210/552/210 causal constraints in 23 ms.
[2020-05-15 13:47:32] [INFO ] Added : 191 causal constraints over 39 iterations in 1802 ms. Result :sat
[2020-05-15 13:47:33] [INFO ] [Real]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-05-15 13:47:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 13:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:33] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-05-15 13:47:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-05-15 13:47:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 200 ms returned sat
[2020-05-15 13:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:34] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2020-05-15 13:47:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 141 ms returned sat
[2020-05-15 13:47:35] [INFO ] Deduced a trap composed of 5 places in 124 ms
[2020-05-15 13:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2020-05-15 13:47:35] [INFO ] Computed and/alt/rep : 210/552/210 causal constraints in 14 ms.
[2020-05-15 13:47:36] [INFO ] Added : 128 causal constraints over 26 iterations in 1273 ms. Result :sat
[2020-05-15 13:47:36] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-05-15 13:47:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 13:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:37] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2020-05-15 13:47:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-05-15 13:47:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 187 ms returned sat
[2020-05-15 13:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:38] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2020-05-15 13:47:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-05-15 13:47:38] [INFO ] Deduced a trap composed of 12 places in 159 ms
[2020-05-15 13:47:38] [INFO ] Deduced a trap composed of 5 places in 36 ms
[2020-05-15 13:47:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2020-05-15 13:47:38] [INFO ] Computed and/alt/rep : 210/552/210 causal constraints in 22 ms.
[2020-05-15 13:47:40] [INFO ] Added : 206 causal constraints over 42 iterations in 1667 ms. Result :sat
[2020-05-15 13:47:40] [INFO ] Deduced a trap composed of 12 places in 115 ms
[2020-05-15 13:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 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 271 transition count 213
Applied a total of 1 rules in 36 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:40] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-15 13:47:40] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-05-15 13:47:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 94 ms returned sat
[2020-05-15 13:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:41] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2020-05-15 13:47:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-05-15 13:47:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 110 ms returned sat
[2020-05-15 13:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:42] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2020-05-15 13:47:42] [INFO ] Computed and/alt/rep : 210/550/210 causal constraints in 22 ms.
[2020-05-15 13:47:44] [INFO ] Added : 191 causal constraints over 39 iterations in 2169 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-15 13:47:44] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2020-05-15 13:47:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2020-05-15 13:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:45] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2020-05-15 13:47:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-05-15 13:47:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 198 ms returned sat
[2020-05-15 13:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:46] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2020-05-15 13:47:46] [INFO ] Computed and/alt/rep : 210/550/210 causal constraints in 18 ms.
[2020-05-15 13:47:47] [INFO ] Added : 129 causal constraints over 26 iterations in 1378 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-05-15 13:47:47] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-05-15 13:47:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 13:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:48] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2020-05-15 13:47:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:47:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-05-15 13:47:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 187 ms returned sat
[2020-05-15 13:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:47:49] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2020-05-15 13:47:49] [INFO ] Deduced a trap composed of 6 places in 51 ms
[2020-05-15 13:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2020-05-15 13:47:49] [INFO ] Computed and/alt/rep : 210/550/210 causal constraints in 28 ms.
[2020-05-15 13:47:50] [INFO ] Added : 206 causal constraints over 42 iterations in 1552 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-15 13:47:51] [INFO ] Flatten gal took : 260 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 13:47:51] [INFO ] Applying decomposition
[2020-05-15 13:47:51] [INFO ] Flatten gal took : 99 ms
[2020-05-15 13:47:52] [INFO ] Flatten gal took : 103 ms
[2020-05-15 13:47:52] [INFO ] Input system was already deterministic with 213 transitions.
[2020-05-15 13:47:52] [INFO ] Input system was already deterministic with 213 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/graph10426640952224066737.txt, -o, /tmp/graph10426640952224066737.bin, -w, /tmp/graph10426640952224066737.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/graph10426640952224066737.bin, -l, -1, -v, -w, /tmp/graph10426640952224066737.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 13:47:52] [INFO ] Decomposing Gal with order
[2020-05-15 13:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:52] [INFO ] Computed 60 place invariants in 7 ms
inv : p179 + p180 + p183 + p184 = 1
inv : p177 + p178 - p179 - p180 = 0
inv : p231 + p232 + p249 + p250 = 1
inv : p208 - p214 + p224 - p230 - p240 + p246 = 0
inv : p191 + p192 = 1
inv : -39*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 + 40*p120 + p121 + 2*p122 + 3*p123 + 4*p124 + 5*p125 + 6*p126 + 7*p127 + 8*p128 + 9*p129 + 10*p130 + 11*p131 + 12*p132 + 13*p133 + 14*p134 + 15*p135 + 16*p136 + 17*p137 + 18*p138 + 19*p139 + 20*p140 + 21*p141 + 22*p142 + 23*p143 + 24*p144 + 25*p145 + 26*p146 + 27*p147 + 28*p148 + 29*p149 + 30*p150 + 31*p151 + 32*p152 + 33*p153 + 34*p154 + 35*p155 + 36*p156 + 37*p157 + 38*p158 + 39*p159 + p166 + p168 - p173 - p179 - p182 - p188 + p192 - p248 + p250 + p252 - p253 - p257 - p261 = 0
inv : p210 - p214 + p226 - p230 - p242 + p246 = 0
inv : p217 + p218 = 1
inv : p247 + p248 - p249 - p250 = 0
inv : p235 + p236 + p249 + p250 = 1
inv : p187 + p188 = 1
inv : p251 + p252 = 1
inv : p269 + p272 + p273 = 1
inv : p245 + p246 + p249 + p250 = 1
inv : 39*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 - 40*p120 - p121 - 2*p122 - 3*p123 - 4*p124 - 5*p125 - 6*p126 - 7*p127 - 8*p128 - 9*p129 - 10*p130 - 11*p131 - 12*p132 - 13*p133 - 14*p134 - 15*p135 - 16*p136 - 17*p137 - 18*p138 - 19*p139 - 20*p140 - 21*p141 - 22*p142 - 23*p143 - 24*p144 - 25*p145 - 26*p146 - 27*p147 - 28*p148 - 29*p149 - 30*p150 - 31*p151 - 32*p152 - 33*p153 - 34*p154 - 35*p155 - 36*p156 - 37*p157 - 38*p158 - 39*p159 - p166 + p167 + p173 + p179 + p182 + p188 - p192 + p248 - p250 - p252 + p253 + p257 + p261 = 1
inv : p212 - p214 + p228 - p230 - p244 + p246 = 0
inv : p160 + p161 = 1
inv : 78*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 - 40*p40 - p41 - 2*p42 - 3*p43 - 4*p44 - 5*p45 - 6*p46 - 7*p47 - 8*p48 - 9*p49 - 10*p50 - 11*p51 - 12*p52 - 13*p53 - 14*p54 - 15*p55 - 16*p56 - 17*p57 - 18*p58 - 19*p59 - 20*p60 - 21*p61 - 22*p62 - 23*p63 - 24*p64 - 25*p65 - 26*p66 - 27*p67 - 28*p68 - 29*p69 - 30*p70 - 31*p71 - 32*p72 - 33*p73 - 34*p74 - 35*p75 - 36*p76 - 37*p77 - 38*p78 - 39*p79 - 40*p120 - p121 - 2*p122 - 3*p123 - 4*p124 - 5*p125 - 6*p126 - 7*p127 - 8*p128 - 9*p129 - 10*p130 - 11*p131 - 12*p132 - 13*p133 - 14*p134 - 15*p135 - 16*p136 - 17*p137 - 18*p138 - 19*p139 - 20*p140 - 21*p141 - 22*p142 - 23*p143 - 24*p144 - 25*p145 - 26*p146 - 27*p147 - 28*p148 - 29*p149 - 30*p150 - 31*p151 - 32*p152 - 33*p153 - 34*p154 - 35*p155 - 36*p156 - 37*p157 - 38*p158 - 39*p159 - p166 + p169 + p173 + p179 + p182 + p188 - p192 - p194 - p198 + p248 - p250 - p252 - p254 - p256 - p260 + p264 + p269 + p271 = 1
inv : p174 + p175 + p176 = 1
inv : p241 + p242 + p249 + p250 = 1
inv : p199 + p214 - p216 + p230 + p232 - p246 = 1
inv : p239 + p240 + p249 + p250 = 1
inv : p213 + p214 = 1
inv : p172 + p173 = 1
inv : p223 + p224 = 1
inv : p203 + p214 - p220 + p230 + p236 - p246 = 1
inv : p189 + p190 = 1
inv : p201 + p214 - p218 + p230 + p234 - p246 = 1
inv : 78*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 - 80*p40 - 2*p41 - 4*p42 - 6*p43 - 8*p44 - 10*p45 - 12*p46 - 14*p47 - 16*p48 - 18*p49 - 20*p50 - 22*p51 - 24*p52 - 26*p53 - 28*p54 - 30*p55 - 32*p56 - 34*p57 - 36*p58 - 38*p59 - 40*p60 - 42*p61 - 44*p62 - 46*p63 - 48*p64 - 50*p65 - 52*p66 - 54*p67 - 56*p68 - 58*p69 - 60*p70 - 62*p71 - 64*p72 - 66*p73 - 68*p74 - 70*p75 - 72*p76 - 74*p77 - 76*p78 - 78*p79 - p192 - p194 - p198 - p254 - p256 - p257 + p259 - p260 - p261 + p263 + p264 + p268 + 2*p269 + p271 + p273 = 1
inv : p233 + p234 + p249 + p250 = 1
inv : p229 + p230 = 1
inv : p219 + p220 = 1
inv : p205 + p214 - p222 + p230 + p238 - p246 = 1
inv : p209 + p214 - p226 + p230 + p242 - p246 = 1
inv : -78*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 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + 40*p120 + p121 + 2*p122 + 3*p123 + 4*p124 + 5*p125 + 6*p126 + 7*p127 + 8*p128 + 9*p129 + 10*p130 + 11*p131 + 12*p132 + 13*p133 + 14*p134 + 15*p135 + 16*p136 + 17*p137 + 18*p138 + 19*p139 + 20*p140 + 21*p141 + 22*p142 + 23*p143 + 24*p144 + 25*p145 + 26*p146 + 27*p147 + 28*p148 + 29*p149 + 30*p150 + 31*p151 + 32*p152 + 33*p153 + 34*p154 + 35*p155 + 36*p156 + 37*p157 + 38*p158 + 39*p159 + p166 + p170 - p173 - p179 - p182 - p188 + p192 + p194 + p198 - p248 + p250 + p252 + p254 + p256 + p260 - p264 - p269 - p271 = 0
inv : -p260 - p261 + p262 + p263 = 0
inv : p200 - p214 + p216 - p230 - p232 + p246 = 0
inv : p207 + p214 - p224 + p230 + p240 - p246 = 1
inv : p225 + p226 = 1
inv : p193 + p194 = 1
inv : p185 + p186 = 1
inv : p164 + p165 + p166 = 1
inv : p202 - p214 + p218 - p230 - p234 + p246 = 0
inv : 39*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 - 40*p40 - p41 - 2*p42 - 3*p43 - 4*p44 - 5*p45 - 6*p46 - 7*p47 - 8*p48 - 9*p49 - 10*p50 - 11*p51 - 12*p52 - 13*p53 - 14*p54 - 15*p55 - 16*p56 - 17*p57 - 18*p58 - 19*p59 - 20*p60 - 21*p61 - 22*p62 - 23*p63 - 24*p64 - 25*p65 - 26*p66 - 27*p67 - 28*p68 - 29*p69 - 30*p70 - 31*p71 - 32*p72 - 33*p73 - 34*p74 - 35*p75 - 36*p76 - 37*p77 - 38*p78 - 39*p79 - p192 + p195 - p214 - p230 + p246 + p249 - p252 - p254 - p256 - p260 + p269 + p271 = 2
inv : p243 + p244 + p249 + p250 = 1
inv : p211 + p214 - p228 + p230 + p244 - p246 = 1
inv : p269 + p270 + p271 = 1
inv : -78*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 + 80*p40 + 2*p41 + 4*p42 + 6*p43 + 8*p44 + 10*p45 + 12*p46 + 14*p47 + 16*p48 + 18*p49 + 20*p50 + 22*p51 + 24*p52 + 26*p53 + 28*p54 + 30*p55 + 32*p56 + 34*p57 + 36*p58 + 38*p59 + 40*p60 + 42*p61 + 44*p62 + 46*p63 + 48*p64 + 50*p65 + 52*p66 + 54*p67 + 56*p68 + 58*p69 + 60*p70 + 62*p71 + 64*p72 + 66*p73 + 68*p74 + 70*p75 + 72*p76 + 74*p77 + 76*p78 + 78*p79 + p192 + p194 + p198 + p254 + p258 + p260 + p261 - p263 - p264 - p268 - 2*p269 - p271 - p273 = -1
inv : p264 + p265 + p266 + p268 = 1
inv : p179 + p180 + p181 + p182 = 1
inv : p204 - p214 + p220 - p230 - p236 + p246 = 0
inv : p197 + p198 = 1
inv : p253 + p254 + p255 + p256 + p257 + p260 + p261 = 1
inv : p237 + p238 + p249 + p250 = 1
inv : p162 + p163 = 1
inv : p227 + p228 = 1
inv : p221 + p222 = 1
inv : -39*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 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + p192 + p196 + p214 + p230 - p246 - p249 + p252 + p254 + p256 + p260 - p269 - p271 = -1
inv : p215 + p216 = 1
inv : p206 - p214 + p222 - p230 - p238 + p246 = 0
Total of 60 invariants.
[2020-05-15 13:47:52] [INFO ] Computed 60 place invariants in 14 ms
[2020-05-15 13:47:53] [INFO ] Ran tautology test, simplified 0 / 3 in 1069 ms.
[2020-05-15 13:47:53] [INFO ] Removed a total of 19 redundant transitions.
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=0 took 21 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-09(UNSAT) depth K=0 took 7 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-14(UNSAT) depth K=0 took 1 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=1 took 2 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-09(UNSAT) depth K=1 took 1 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-14(UNSAT) depth K=1 took 9 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=2 took 122 ms
[2020-05-15 13:47:53] [INFO ] Flatten gal took : 321 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-09(UNSAT) depth K=2 took 59 ms
[2020-05-15 13:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 105 ms.
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-14(UNSAT) depth K=2 took 101 ms
[2020-05-15 13:47:53] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 114 ms
[2020-05-15 13:47:53] [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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 213 rows 271 cols
[2020-05-15 13:47:53] [INFO ] Computed 60 place invariants in 26 ms
inv : p179 + p180 + p183 + p184 = 1
inv : p177 + p178 - p179 - p180 = 0
inv : p231 + p232 + p249 + p250 = 1
inv : p208 - p214 + p224 - p230 - p240 + p246 = 0
inv : p191 + p192 = 1
inv : -39*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 + 40*p120 + p121 + 2*p122 + 3*p123 + 4*p124 + 5*p125 + 6*p126 + 7*p127 + 8*p128 + 9*p129 + 10*p130 + 11*p131 + 12*p132 + 13*p133 + 14*p134 + 15*p135 + 16*p136 + 17*p137 + 18*p138 + 19*p139 + 20*p140 + 21*p141 + 22*p142 + 23*p143 + 24*p144 + 25*p145 + 26*p146 + 27*p147 + 28*p148 + 29*p149 + 30*p150 + 31*p151 + 32*p152 + 33*p153 + 34*p154 + 35*p155 + 36*p156 + 37*p157 + 38*p158 + 39*p159 + p166 + p168 - p173 - p179 - p182 - p188 + p192 - p248 + p250 + p252 - p253 - p257 - p261 = 0
inv : p210 - p214 + p226 - p230 - p242 + p246 = 0
inv : p217 + p218 = 1
inv : p247 + p248 - p249 - p250 = 0
inv : p235 + p236 + p249 + p250 = 1
inv : p187 + p188 = 1
inv : p251 + p252 = 1
inv : p269 + p272 + p273 = 1
inv : p245 + p246 + p249 + p250 = 1
inv : 39*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 - 40*p120 - p121 - 2*p122 - 3*p123 - 4*p124 - 5*p125 - 6*p126 - 7*p127 - 8*p128 - 9*p129 - 10*p130 - 11*p131 - 12*p132 - 13*p133 - 14*p134 - 15*p135 - 16*p136 - 17*p137 - 18*p138 - 19*p139 - 20*p140 - 21*p141 - 22*p142 - 23*p143 - 24*p144 - 25*p145 - 26*p146 - 27*p147 - 28*p148 - 29*p149 - 30*p150 - 31*p151 - 32*p152 - 33*p153 - 34*p154 - 35*p155 - 36*p156 - 37*p157 - 38*p158 - 39*p159 - p166 + p167 + p173 + p179 + p182 + p188 - p192 + p248 - p250 - p252 + p253 + p257 + p261 = 1
inv : p212 - p214 + p228 - p230 - p244 + p246 = 0
inv : p160 + p161 = 1
inv : 78*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 - 40*p40 - p41 - 2*p42 - 3*p43 - 4*p44 - 5*p45 - 6*p46 - 7*p47 - 8*p48 - 9*p49 - 10*p50 - 11*p51 - 12*p52 - 13*p53 - 14*p54 - 15*p55 - 16*p56 - 17*p57 - 18*p58 - 19*p59 - 20*p60 - 21*p61 - 22*p62 - 23*p63 - 24*p64 - 25*p65 - 26*p66 - 27*p67 - 28*p68 - 29*p69 - 30*p70 - 31*p71 - 32*p72 - 33*p73 - 34*p74 - 35*p75 - 36*p76 - 37*p77 - 38*p78 - 39*p79 - 40*p120 - p121 - 2*p122 - 3*p123 - 4*p124 - 5*p125 - 6*p126 - 7*p127 - 8*p128 - 9*p129 - 10*p130 - 11*p131 - 12*p132 - 13*p133 - 14*p134 - 15*p135 - 16*p136 - 17*p137 - 18*p138 - 19*p139 - 20*p140 - 21*p141 - 22*p142 - 23*p143 - 24*p144 - 25*p145 - 26*p146 - 27*p147 - 28*p148 - 29*p149 - 30*p150 - 31*p151 - 32*p152 - 33*p153 - 34*p154 - 35*p155 - 36*p156 - 37*p157 - 38*p158 - 39*p159 - p166 + p169 + p173 + p179 + p182 + p188 - p192 - p194 - p198 + p248 - p250 - p252 - p254 - p256 - p260 + p264 + p269 + p271 = 1
inv : p174 + p175 + p176 = 1
inv : p241 + p242 + p249 + p250 = 1
inv : p199 + p214 - p216 + p230 + p232 - p246 = 1
inv : p239 + p240 + p249 + p250 = 1
inv : p213 + p214 = 1
inv : p172 + p173 = 1
inv : p223 + p224 = 1
inv : p203 + p214 - p220 + p230 + p236 - p246 = 1
inv : p189 + p190 = 1
inv : p201 + p214 - p218 + p230 + p234 - p246 = 1
inv : 78*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 - 80*p40 - 2*p41 - 4*p42 - 6*p43 - 8*p44 - 10*p45 - 12*p46 - 14*p47 - 16*p48 - 18*p49 - 20*p50 - 22*p51 - 24*p52 - 26*p53 - 28*p54 - 30*p55 - 32*p56 - 34*p57 - 36*p58 - 38*p59 - 40*p60 - 42*p61 - 44*p62 - 46*p63 - 48*p64 - 50*p65 - 52*p66 - 54*p67 - 56*p68 - 58*p69 - 60*p70 - 62*p71 - 64*p72 - 66*p73 - 68*p74 - 70*p75 - 72*p76 - 74*p77 - 76*p78 - 78*p79 - p192 - p194 - p198 - p254 - p256 - p257 + p259 - p260 - p261 + p263 + p264 + p268 + 2*p269 + p271 + p273 = 1
inv : p233 + p234 + p249 + p250 = 1
inv : p229 + p230 = 1
inv : p219 + p220 = 1
inv : p205 + p214 - p222 + p230 + p238 - p246 = 1
inv : p209 + p214 - p226 + p230 + p242 - p246 = 1
inv : -78*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 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + 40*p120 + p121 + 2*p122 + 3*p123 + 4*p124 + 5*p125 + 6*p126 + 7*p127 + 8*p128 + 9*p129 + 10*p130 + 11*p131 + 12*p132 + 13*p133 + 14*p134 + 15*p135 + 16*p136 + 17*p137 + 18*p138 + 19*p139 + 20*p140 + 21*p141 + 22*p142 + 23*p143 + 24*p144 + 25*p145 + 26*p146 + 27*p147 + 28*p148 + 29*p149 + 30*p150 + 31*p151 + 32*p152 + 33*p153 + 34*p154 + 35*p155 + 36*p156 + 37*p157 + 38*p158 + 39*p159 + p166 + p170 - p173 - p179 - p182 - p188 + p192 + p194 + p198 - p248 + p250 + p252 + p254 + p256 + p260 - p264 - p269 - p271 = 0
inv : -p260 - p261 + p262 + p263 = 0
inv : p200 - p214 + p216 - p230 - p232 + p246 = 0
inv : p207 + p214 - p224 + p230 + p240 - p246 = 1
inv : p225 + p226 = 1
inv : p193 + p194 = 1
inv : p185 + p186 = 1
inv : p164 + p165 + p166 = 1
inv : p202 - p214 + p218 - p230 - p234 + p246 = 0
inv : 39*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 - 40*p40 - p41 - 2*p42 - 3*p43 - 4*p44 - 5*p45 - 6*p46 - 7*p47 - 8*p48 - 9*p49 - 10*p50 - 11*p51 - 12*p52 - 13*p53 - 14*p54 - 15*p55 - 16*p56 - 17*p57 - 18*p58 - 19*p59 - 20*p60 - 21*p61 - 22*p62 - 23*p63 - 24*p64 - 25*p65 - 26*p66 - 27*p67 - 28*p68 - 29*p69 - 30*p70 - 31*p71 - 32*p72 - 33*p73 - 34*p74 - 35*p75 - 36*p76 - 37*p77 - 38*p78 - 39*p79 - p192 + p195 - p214 - p230 + p246 + p249 - p252 - p254 - p256 - p260 + p269 + p271 = 2
inv : p243 + p244 + p249 + p250 = 1
inv : p211 + p214 - p228 + p230 + p244 - p246 = 1
inv : p269 + p270 + p271 = 1
inv : -78*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 + 80*p40 + 2*p41 + 4*p42 + 6*p43 + 8*p44 + 10*p45 + 12*p46 + 14*p47 + 16*p48 + 18*p49 + 20*p50 + 22*p51 + 24*p52 + 26*p53 + 28*p54 + 30*p55 + 32*p56 + 34*p57 + 36*p58 + 38*p59 + 40*p60 + 42*p61 + 44*p62 + 46*p63 + 48*p64 + 50*p65 + 52*p66 + 54*p67 + 56*p68 + 58*p69 + 60*p70 + 62*p71 + 64*p72 + 66*p73 + 68*p74 + 70*p75 + 72*p76 + 74*p77 + 76*p78 + 78*p79 + p192 + p194 + p198 + p254 + p258 + p260 + p261 - p263 - p264 - p268 - 2*p269 - p271 - p273 = -1
inv : p264 + p265 + p266 + p268 = 1
inv : p179 + p180 + p181 + p182 = 1
inv : p204 - p214 + p220 - p230 - p236 + p246 = 0
inv : p197 + p198 = 1
inv : p253 + p254 + p255 + p256 + p257 + p260 + p261 = 1
inv : p237 + p238 + p249 + p250 = 1
inv : p162 + p163 = 1
inv : p227 + p228 = 1
inv : p221 + p222 = 1
inv : -39*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 + 40*p40 + p41 + 2*p42 + 3*p43 + 4*p44 + 5*p45 + 6*p46 + 7*p47 + 8*p48 + 9*p49 + 10*p50 + 11*p51 + 12*p52 + 13*p53 + 14*p54 + 15*p55 + 16*p56 + 17*p57 + 18*p58 + 19*p59 + 20*p60 + 21*p61 + 22*p62 + 23*p63 + 24*p64 + 25*p65 + 26*p66 + 27*p67 + 28*p68 + 29*p69 + 30*p70 + 31*p71 + 32*p72 + 33*p73 + 34*p74 + 35*p75 + 36*p76 + 37*p77 + 38*p78 + 39*p79 + p192 + p196 + p214 + p230 - p246 - p249 + p252 + p254 + p256 + p260 - p269 - p271 = -1
inv : p215 + p216 = 1
inv : p206 - p214 + p222 - p230 - p238 + p246 = 0
Total of 60 invariants.
[2020-05-15 13:47:53] [INFO ] Computed 60 place invariants in 80 ms
[2020-05-15 13:47:53] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=3 took 369 ms
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : DES-PT-40a-ReachabilityCardinality-08 with value :(((u12.p98==0)||(u2.p138==1))||((u46.p65!=0)&&(u12.p86!=1)))
Read [reachable] property : DES-PT-40a-ReachabilityCardinality-09 with value :((((u46.p59!=0)&&(u12.p86!=1))&&(u12.p107!=0))&&(u2.p145!=1))
Read [invariant] property : DES-PT-40a-ReachabilityCardinality-14 with value :((u2.p123==0)||(u12.p97==1))
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 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
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-15 13:47:54] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-09(UNSAT) depth K=3 took 472 ms
SDD proceeding with computation, new max is 4096
[2020-05-15 13:47:54] [INFO ] Proved 271 variables to be positive in 1941 ms
[2020-05-15 13:47:54] [INFO ] Computing symmetric may disable matrix : 213 transitions.
[2020-05-15 13:47:54] [INFO ] Computation of disable matrix completed :0/213 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 13:47:54] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 13:47:54] [INFO ] Computing symmetric may enable matrix : 213 transitions.
[2020-05-15 13:47:54] [INFO ] Computation of Complete enable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 13:47:55] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-14(UNSAT) depth K=3 took 634 ms
Invariant property DES-PT-40a-ReachabilityCardinality-08 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 8192
[2020-05-15 13:47:55] [INFO ] Proved 271 variables to be positive in 1425 ms
[2020-05-15 13:47:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-09
[2020-05-15 13:47:55] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-09(SAT) depth K=0 took 83 ms
[2020-05-15 13:47:55] [INFO ] Computing symmetric co enabling matrix : 213 transitions.
[2020-05-15 13:47:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-14
[2020-05-15 13:47:56] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-14(SAT) depth K=0 took 775 ms
SDD proceeding with computation, new max is 16384
[2020-05-15 13:47:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-09
[2020-05-15 13:47:57] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-09(SAT) depth K=1 took 1309 ms
[2020-05-15 13:47:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-40a-ReachabilityCardinality-14
[2020-05-15 13:47:57] [INFO ] KInduction solution for property DES-PT-40a-ReachabilityCardinality-14(SAT) depth K=1 took 135 ms
[2020-05-15 13:47:58] [INFO ] Computation of co-enabling matrix(4/213) took 2951 ms. Total solver calls (SAT/UNSAT): 534(463/71)
[2020-05-15 13:48:00] [INFO ] BMC solution for property DES-PT-40a-ReachabilityCardinality-08(UNSAT) depth K=4 took 5304 ms
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,1.82241e+13,6.44775,114884,7394,6100,250286,17178,250,289214,386,105519,0
Total reachable state count : 18224093528102

Verifying 3 reachability properties.
Invariant property DES-PT-40a-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-40a-ReachabilityCardinality-08,4.48546e+11,6.63292,114884,6427,5905,250286,17178,262,289214,393,105519,6205
Reachability property DES-PT-40a-ReachabilityCardinality-09 is true.
FORMULA DES-PT-40a-ReachabilityCardinality-09 TRUE 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-40a-ReachabilityCardinality-09,120,6.63868,114884,58,134,250286,17178,271,289214,397,105519,6331
Invariant property DES-PT-40a-ReachabilityCardinality-14 does not hold.
FORMULA DES-PT-40a-ReachabilityCardinality-14 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-40a-ReachabilityCardinality-14,1.85537e+08,6.64872,114884,194,287,250286,17178,271,289214,398,105519,7166
[2020-05-15 13:48:00] [WARNING] Interrupting SMT solver.
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.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 13:48:00] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-15 13:48:00] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-40a-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 "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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
Skipping mayMatrices nes/nds SMT solver raised an exception on push().
java.lang.RuntimeException: SMT solver raised an exception on push().
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:466)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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)
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.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 13:48:00] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-40a-ReachabilityCardinality-09 SMT depth 4
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.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 "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.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 13:48:00] [INFO ] During BMC, SMT solver timed out at depth 4
[2020-05-15 13:48:00] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2020-05-15 13:48:00] [INFO ] SMT solved 0/ 3 properties. Interrupting SMT analysis.
[2020-05-15 13:48:00] [INFO ] Built C files in 8568ms 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 1589550481471

--------------------
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-40a"
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-40a, 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-158902546000294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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