About the Execution of ITS-Tools for JoinFreeModules-PT-0004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 498.995 | 33377.00 | 44542.00 | 110.50 | 5 6 6 6 6 5 4 6 4 6 6 6 6 6 6 5 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820500149.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-0004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820500149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 9.3K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652746472718
Running Version 202205111006
[2022-05-17 00:14:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:14:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:14:34] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2022-05-17 00:14:34] [INFO ] Transformed 21 places.
[2022-05-17 00:14:34] [INFO ] Transformed 33 transitions.
[2022-05-17 00:14:34] [INFO ] Parsed PT model containing 21 places and 33 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:34] [INFO ] Computed 4 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 33 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :89
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :76
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :77
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :78
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :77
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :79
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :76
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :72
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :72
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :74
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :77
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :72
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :70
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :77
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 16) seen :81
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:34] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 00:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-17 00:14:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:34] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:34] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 00:14:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 4 ms to minimize.
[2022-05-17 00:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-17 00:14:34] [INFO ] Added : 11 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 00:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:35] [INFO ] Added : 21 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:35] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 12 ms.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2022-05-17 00:14:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:35] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:35] [INFO ] Added : 13 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 00:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:14:35] [INFO ] Added : 5 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:35] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:14:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 4 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 00:14:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 00:14:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 00:14:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 00:14:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:40] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:40] [INFO ] Added : 16 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:40] [INFO ] Added : 15 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:14:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:40] [INFO ] Added : 14 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 00:14:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:41] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:14:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:41] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 00:14:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:41] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7] Max seen :[5, 6, 6, 6, 6, 5, 4, 6, 4, 6, 6, 6, 6, 6, 6, 5]
FORMULA JoinFreeModules-PT-0004-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 33/33 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 32
Applied a total of 1 rules in 9 ms. Remains 20 /20 variables (removed 0) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:41] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:14:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/33 transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:41] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 3587 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 13) seen :71
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 13) seen :58
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 13) seen :57
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 13) seen :61
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=3401 ) properties (out of 13) seen :65
Incomplete Best-First random walk after 1000001 steps, including 530 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 13) seen :55
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=3236 ) properties (out of 13) seen :56
Incomplete Best-First random walk after 1000001 steps, including 560 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000001 steps, including 525 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 13) seen :60
Incomplete Best-First random walk after 1000001 steps, including 538 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 13) seen :55
Incomplete Best-First random walk after 1000001 steps, including 537 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000001 steps, including 554 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 13) seen :67
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 13) seen :64
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:14:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 00:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:46] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:46] [INFO ] Added : 9 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:14:47] [INFO ] Added : 15 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:14:47] [INFO ] Added : 5 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 11 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:47] [INFO ] Added : 5 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:47] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:47] [INFO ] Added : 10 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 00:14:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:47] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 16 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:47] [INFO ] Added : 16 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 64 ms returned sat
[2022-05-17 00:14:48] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:14:48] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 15 ms.
[2022-05-17 00:14:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:48] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:48] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:48] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 00:14:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:48] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2022-05-17 00:14:48] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:48] [INFO ] Added : 12 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 00:14:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:48] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:48] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7] Max seen :[5, 6, 5, 4, 6, 4, 6, 6, 6, 6, 6, 6, 5]
FORMULA JoinFreeModules-PT-0004-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:48] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 3531 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 12) seen :65
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=2898 ) properties (out of 12) seen :48
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 12) seen :56
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=3105 ) properties (out of 12) seen :58
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=3344 ) properties (out of 12) seen :58
Incomplete Best-First random walk after 1000001 steps, including 532 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 12) seen :49
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=3267 ) properties (out of 12) seen :49
Incomplete Best-First random walk after 1000001 steps, including 553 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 12) seen :53
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 361 ms. (steps per millisecond=2770 ) properties (out of 12) seen :53
Incomplete Best-First random walk after 1000001 steps, including 540 resets, run finished after 372 ms. (steps per millisecond=2688 ) properties (out of 12) seen :49
Incomplete Best-First random walk after 1000001 steps, including 530 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 12) seen :57
Incomplete Best-First random walk after 1000001 steps, including 556 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 12) seen :61
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 12) seen :58
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:53] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 00:14:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:14:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:53] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:53] [INFO ] Added : 9 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 18 ms.
[2022-05-17 00:14:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:14:53] [INFO ] Added : 15 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 00:14:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:53] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:53] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:54] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:54] [INFO ] Added : 15 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:54] [INFO ] Added : 10 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 9 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:54] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 8 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:54] [INFO ] Added : 16 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 63 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:54] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 15 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:54] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:55] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-05-17 00:14:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 11 ms returned sat
[2022-05-17 00:14:55] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 00:14:55] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 00:14:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:14:55] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:55] [INFO ] Added : 5 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7] Max seen :[5, 6, 5, 4, 6, 4, 6, 6, 6, 6, 6, 5]
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:55] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:55] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-17 00:14:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-00
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:55] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:55] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:14:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:55] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:14:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:55] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:14:55] [INFO ] Added : 9 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 5 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:55] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:55] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14120 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=4901 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:14:56] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:56] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:56] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-17 00:14:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-00 in 1119 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-04
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:56] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:56] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-17 00:14:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:56] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:56] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:56] [INFO ] Added : 15 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:56] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 14568 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=5235 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:57] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-17 00:14:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-04 in 756 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-05
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:57] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 00:14:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:57] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:57] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:57] [INFO ] Added : 5 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14081 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:14:57] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:57] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 00:14:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-05 in 705 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-06
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:57] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 32 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:14:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:58] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:58] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 14369 resets, run finished after 333 ms. (steps per millisecond=3003 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:14:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:58] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:14:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:14:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:14:58] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:58] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-17 00:14:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-06 in 772 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-07
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:58] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 29 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:58] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 00:14:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 00:14:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2022-05-17 00:14:58] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:14:58] [INFO ] Added : 9 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:58] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:58] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14188 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 157 ms. (steps per millisecond=6369 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:59] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 00:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:14:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 00:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:14:59] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:14:59] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:14:59] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:14:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-17 00:14:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-07 in 840 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-08
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:59] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:14:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:59] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 00:14:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:14:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:14:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:14:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2022-05-17 00:14:59] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:14:59] [INFO ] Added : 10 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:14:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:14:59] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14159 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:15:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 00:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:15:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:15:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:15:00] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:00] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 00:15:00] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:00] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-17 00:15:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-08 in 793 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-10
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:00] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 30 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:15:00] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:00] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:15:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:00] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 00:15:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:15:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:15:00] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:15:00] [INFO ] Added : 16 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:00] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14004 resets, run finished after 326 ms. (steps per millisecond=3067 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 157 ms. (steps per millisecond=6369 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:15:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 00:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-17 00:15:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 00:15:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-10 in 740 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-11
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:01] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:15:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:15:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:15:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:15:01] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:15:01] [INFO ] Added : 16 causal constraints over 5 iterations in 17 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:01] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 13955 resets, run finished after 325 ms. (steps per millisecond=3076 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=5681 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:15:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:15:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 00:15:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-11 in 729 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-12
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:01] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:15:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:15:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:15:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 64 ms returned sat
[2022-05-17 00:15:01] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:15:02] [INFO ] Added : 15 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:02] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:02] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14232 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:15:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:02] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 00:15:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-17 00:15:02] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 00:15:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-12 in 788 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-13
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:02] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:15:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:15:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:02] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-17 00:15:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:15:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-17 00:15:02] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:15:02] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:02] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 14313 resets, run finished after 335 ms. (steps per millisecond=2985 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 00:15:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 00:15:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 00:15:03] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:15:03] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:03] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:03] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 00:15:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-13 in 824 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-14
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:03] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:15:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 00:15:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-17 00:15:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:15:03] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:15:03] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:15:03] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:03] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:03] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 14149 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 168 ms. (steps per millisecond=5952 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:15:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:15:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:15:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:15:04] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:04] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 00:15:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 14316 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 171 ms. (steps per millisecond=5847 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:15:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:04] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 00:15:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:15:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:15:04] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:04] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-17 00:15:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:04] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-14 in 1454 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-15
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:04] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 30 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 00:15:04] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:15:04] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 00:15:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 00:15:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:15:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2022-05-17 00:15:04] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:15:05] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:05] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13820 resets, run finished after 330 ms. (steps per millisecond=3030 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:15:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:05] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:15:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:15:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 00:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:15:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 00:15:05] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:15:05] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:05] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:15:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-17 00:15:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 00:15:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:15:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-15 in 750 ms.
[2022-05-17 00:15:05] [INFO ] Flatten gal took : 21 ms
[2022-05-17 00:15:05] [INFO ] Applying decomposition
[2022-05-17 00:15:05] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3815853420356477330.txt' '-o' '/tmp/graph3815853420356477330.bin' '-w' '/tmp/graph3815853420356477330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3815853420356477330.bin' '-l' '-1' '-v' '-w' '/tmp/graph3815853420356477330.weights' '-q' '0' '-e' '0.001'
[2022-05-17 00:15:05] [INFO ] Decomposing Gal with order
[2022-05-17 00:15:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 00:15:05] [INFO ] Flatten gal took : 31 ms
[2022-05-17 00:15:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 00:15:05] [INFO ] Time to serialize gal into /tmp/UpperBounds17251715009819546625.gal : 2 ms
[2022-05-17 00:15:05] [INFO ] Time to serialize properties into /tmp/UpperBounds13477179043969072110.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17251715009819546625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13477179043969072110.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds13477179043969072110.prop.
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.47763e+07,0.018751,3648,43,40,347,290,73,495,45,732,0
Total reachable state count : 14776336
Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0004-UpperBounds-00 :0 <= i2.u5.p12 <= 5
FORMULA JoinFreeModules-PT-0004-UpperBounds-00 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-00,0,0.019434,3648,1,0,347,290,114,495,60,732,72
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0004-UpperBounds-05 :0 <= i1.u3.p7 <= 5
FORMULA JoinFreeModules-PT-0004-UpperBounds-05 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-05,0,0.019517,3648,1,0,347,290,124,495,60,732,80
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0004-UpperBounds-06 :0 <= i0.u0.p3 <= 4
FORMULA JoinFreeModules-PT-0004-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-06,0,0.019601,3648,1,0,347,290,135,495,68,732,91
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0004-UpperBounds-07 :0 <= i2.u4.p15 <= 6
FORMULA JoinFreeModules-PT-0004-UpperBounds-07 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-07,0,0.019687,3648,1,0,347,290,147,495,77,732,100
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0004-UpperBounds-08 :0 <= i2.u5.p13 <= 4
FORMULA JoinFreeModules-PT-0004-UpperBounds-08 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-08,0,0.019966,3648,1,0,347,290,158,495,77,732,118
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0004-UpperBounds-13 :0 <= i1.u2.p10 <= 6
FORMULA JoinFreeModules-PT-0004-UpperBounds-13 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-13,0,0.020071,3648,1,0,347,290,165,495,77,732,125
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0004-UpperBounds-14 :0 <= i0.u1.p5 <= 6
FORMULA JoinFreeModules-PT-0004-UpperBounds-14 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-14,0,0.020372,3648,1,0,347,290,173,495,77,732,149
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0004-UpperBounds-15 :0 <= i3.u7.p17 <= 5
FORMULA JoinFreeModules-PT-0004-UpperBounds-15 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL 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
JoinFreeModules-PT-0004-UpperBounds-15,0,0.020446,3648,1,0,347,290,181,495,77,732,154
Total runtime 32158 ms.
BK_STOP 1652746506095
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="JoinFreeModules-PT-0004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820500149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;