Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440300019.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r255-tall-167856440300019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 1678747585422

Running Version 202205111006
[2023-03-13 22:46:26] [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]
[2023-03-13 22:46:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:46:26] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-13 22:46:26] [INFO ] Transformed 21 places.
[2023-03-13 22:46:26] [INFO ] Transformed 33 transitions.
[2023-03-13 22:46:26] [INFO ] Parsed PT model containing 21 places and 33 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 33 rows 20 cols
[2023-03-13 22:46:26] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :80
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :72
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :70
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :72
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :70
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :69
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :68
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :61
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :70
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :73
// Phase 1: matrix 33 rows 20 cols
[2023-03-13 22:46:27] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:46:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:46:27] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:46:27] [INFO ] Added : 13 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 12 ms.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:46:27] [INFO ] Added : 5 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:46:27] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:46:27] [INFO ] Added : 17 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:27] [INFO ] Added : 10 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 7 ms to minimize.
[2023-03-13 22:46:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:27] [INFO ] Added : 15 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 14 ms.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:28] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:46:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:28] [INFO ] Added : 21 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 11 ms.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:46:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:46:28] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:46:28] [INFO ] Added : 17 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 19 ms.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 22:46:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:28] [INFO ] Added : 15 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:46:28] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:28] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:46:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [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 10
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)
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:33] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:33] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:46:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:46:33] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:46:33] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 18 ms.
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:46:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:33] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:33] [INFO ] Added : 16 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7, 7, 6, 7, 7] Max seen :[6, 4, 6, 5, 6, 5, 6, 6, 4, 4, 6, 4, 6, 6, 6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-05 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 10 ms. Remains 20 /20 variables (removed 0) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:34] [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
[2023-03-13 22:46:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 3594 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 13) seen :68
Incomplete Best-First random walk after 1000001 steps, including 538 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 13) seen :60
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=3105 ) properties (out of 13) seen :57
Incomplete Best-First random walk after 1000001 steps, including 541 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 13) seen :56
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=3076 ) properties (out of 13) seen :52
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=3436 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000001 steps, including 551 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 13) seen :60
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 13) seen :51
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=3333 ) properties (out of 13) seen :59
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=3105 ) properties (out of 13) seen :49
Incomplete Best-First random walk after 1000001 steps, including 529 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 13) seen :60
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=3333 ) properties (out of 13) seen :57
Incomplete Best-First random walk after 1000001 steps, including 536 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 13) seen :60
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 13) seen :62
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:39] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:46:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:39] [INFO ] Added : 15 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 24 ms.
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:39] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:46:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:39] [INFO ] Added : 10 causal constraints over 2 iterations in 42 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:39] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 22:46:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:40] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-13 22:46:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:46:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 48 ms
[2023-03-13 22:46:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:40] [INFO ] Added : 19 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 50 ms.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:40] [INFO ] Added : 12 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 19 ms.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-13 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:40] [INFO ] Added : 15 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 7 ms.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:40] [INFO ] Added : 13 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:46:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:41] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:46:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:46:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:41] [INFO ] Added : 5 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:41] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:41] [INFO ] Added : 16 causal constraints over 5 iterations in 20 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 7, 7, 7] Max seen :[6, 4, 6, 5, 5, 6, 6, 4, 4, 6, 4, 6, 6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-11 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
[2023-03-13 22:46:41] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 3603 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 12) seen :62
Incomplete Best-First random walk after 1000001 steps, including 511 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 12) seen :51
Incomplete Best-First random walk after 1000001 steps, including 549 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 12) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=3389 ) properties (out of 12) seen :55
Incomplete Best-First random walk after 1000001 steps, including 547 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=3278 ) properties (out of 12) seen :55
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 12) seen :50
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=3289 ) properties (out of 12) seen :48
Incomplete Best-First random walk after 1000001 steps, including 564 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 12) seen :58
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 12) seen :52
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:46] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:46:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:46:46] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:46] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2023-03-13 22:46:46] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:46] [INFO ] Added : 10 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:46] [INFO ] Added : 16 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:46] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:47] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2023-03-13 22:46:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:47] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:46:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:46:47] [INFO ] Added : 19 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 49 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:47] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:47] [INFO ] Added : 15 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 7 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:47] [INFO ] Added : 13 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:47] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:47] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:47] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-13 22:46:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:47] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 22:46:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:48] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:48] [INFO ] Added : 16 causal constraints over 5 iterations in 18 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7] Max seen :[6, 4, 6, 5, 5, 6, 6, 4, 4, 4, 6, 6]
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 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:48] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-13 22:46:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:48] [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-01
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:48] [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 :5
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
[2023-03-13 22:46:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 22:46:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:46:48] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:48] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 12 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.4 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 6 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:48] [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
[2023-03-13 22:46:48] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14030 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 245 ms. (steps per millisecond=4081 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:49] [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 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:49] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-13 22:46:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:49] [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.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 14336 resets, run finished after 313 ms. (steps per millisecond=3194 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 166 ms. (steps per millisecond=6024 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:46:49] [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
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:49] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:49] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:46:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:49] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-13 22:46:49] [INFO ] Dead Transitions using invariants and state equation in 26 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-01 in 1564 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-02
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:49] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 28 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:49] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:46:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 18 ms returned sat
[2023-03-13 22:46:49] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:49] [INFO ] Added : 10 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 9 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 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14113 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:50] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:50] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:46:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:50] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:50] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 10 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
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:50] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 22:46:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:50] [INFO ] Dead Transitions using invariants and state equation in 20 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-02 in 807 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-03
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:50] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :6
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
[2023-03-13 22:46:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 22:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:50] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:46:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:50] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:50] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:46:50] [INFO ] Added : 16 causal constraints over 4 iterations in 33 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
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:50] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 14222 resets, run finished after 307 ms. (steps per millisecond=3257 ) 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
[2023-03-13 22:46:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:51] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[6]
FORMULA JoinFreeModules-PT-0004-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-03 in 735 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-04
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:51] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10001 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 10000 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
[2023-03-13 22:46:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:51] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:46:51] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:51] [INFO ] Added : 5 causal constraints over 2 iterations in 13 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
[2023-03-13 22:46:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:51] [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
[2023-03-13 22:46:51] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14229 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:46:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:52] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:52] [INFO ] Added : 5 causal constraints over 2 iterations in 6 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
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:52] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-13 22:46:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:52] [INFO ] Dead Transitions using invariants and state equation in 23 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-04 in 762 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-06
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:52] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=1111 ) 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
[2023-03-13 22:46:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:52] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-13 22:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:46:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:46:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:46:52] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:46:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 40 ms
[2023-03-13 22:46:52] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:52] [INFO ] Added : 19 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 52 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
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:52] [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
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 14550 resets, run finished after 312 ms. (steps per millisecond=3205 ) 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
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:52] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:52] [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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:52] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:52] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-13 22:46:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:53] [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-06 in 879 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-07
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:53] [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 :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 22:46:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-13 22:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:53] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-13 22:46:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:46:53] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:46:53] [INFO ] Added : 12 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 14 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
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:53] [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
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14146 resets, run finished after 314 ms. (steps per millisecond=3184 ) 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
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:53] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:46:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:53] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:46:53] [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 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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:53] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-13 22:46:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:53] [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-07 in 959 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-08
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:53] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:54] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 22:46:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:46:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:54] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 22:46:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:54] [INFO ] Added : 15 causal constraints over 5 iterations in 62 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 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:54] [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
[2023-03-13 22:46:54] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14071 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=5714 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:54] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:54] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:46:54] [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-08 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-08 in 782 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-09
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:54] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=1428 ) 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
[2023-03-13 22:46:54] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:46:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:54] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:46:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:54] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:54] [INFO ] Added : 13 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 11 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
[2023-03-13 22:46:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:54] [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
[2023-03-13 22:46:54] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 13955 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=5319 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:55] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:46:55] [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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-13 22:46:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:55] [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-09 in 866 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-10
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:55] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 35 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
[2023-03-13 22:46:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:55] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:46:55] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:46:55] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 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
[2023-03-13 22:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:55] [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
[2023-03-13 22:46:55] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 14149 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:56] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:56] [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 :[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
[2023-03-13 22:46:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:56] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:56] [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.
[2023-03-13 22:46:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:56] [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-10 in 833 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-12
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:56] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=1428 ) 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
[2023-03-13 22:46:56] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:56] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:56] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:46:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:56] [INFO ] [Nat]Added 4 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:46:56] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:56] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 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 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:56] [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
[2023-03-13 22:46:56] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14161 resets, run finished after 350 ms. (steps per millisecond=2857 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=5847 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:46:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:46:57] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 16 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 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
[2023-03-13 22:46:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:57] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:46:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:57] [INFO ] Dead Transitions using invariants and state equation in 21 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-12 in 851 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-14
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:57] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) 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
[2023-03-13 22:46:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:57] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 22:46:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:57] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:46:57] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:57] [INFO ] Added : 16 causal constraints over 4 iterations in 18 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
[2023-03-13 22:46:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46: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
[2023-03-13 22:46:57] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13941 resets, run finished after 336 ms. (steps per millisecond=2976 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 142857 resets, run finished after 164 ms. (steps per millisecond=6097 ) properties (out of 1) seen :2
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:58] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:46:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:46:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:46:58] [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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:46:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-13 22:46:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:58] [INFO ] Dead Transitions using invariants and state equation in 26 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 864 ms.
Starting property specific reduction for JoinFreeModules-PT-0004-UpperBounds-15
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:58] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 33 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 3 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :4
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:46:58] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-13 22:46:58] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:58] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:46:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:46:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:58] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:46:58] [INFO ] Added : 16 causal constraints over 5 iterations in 20 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
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:58] [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
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 14003 resets, run finished after 303 ms. (steps per millisecond=3300 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=5586 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:46:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:46:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:46:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:46:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:46:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:46:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:46:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:46:58] [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-15 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0004-UpperBounds-15 in 751 ms.
[2023-03-13 22:46:59] [INFO ] Flatten gal took : 26 ms
[2023-03-13 22:46:59] [INFO ] Applying decomposition
[2023-03-13 22:46:59] [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/graph4827875760582530868.txt' '-o' '/tmp/graph4827875760582530868.bin' '-w' '/tmp/graph4827875760582530868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4827875760582530868.bin' '-l' '-1' '-v' '-w' '/tmp/graph4827875760582530868.weights' '-q' '0' '-e' '0.001'
[2023-03-13 22:46:59] [INFO ] Decomposing Gal with order
[2023-03-13 22:46:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 22:46:59] [INFO ] Flatten gal took : 31 ms
[2023-03-13 22:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-13 22:46:59] [INFO ] Time to serialize gal into /tmp/UpperBounds6304261609431550051.gal : 1 ms
[2023-03-13 22:46:59] [INFO ] Time to serialize properties into /tmp/UpperBounds17609806470104726386.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/UpperBounds6304261609431550051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17609806470104726386.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...275
Loading property file /tmp/UpperBounds17609806470104726386.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.038696,3676,43,40,326,281,73,474,45,712,0
Total reachable state count : 14776336

Verifying 9 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0004-UpperBounds-01 :0 <= i2.u4.p15 <= 6
FORMULA JoinFreeModules-PT-0004-UpperBounds-01 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-01,0,0.039118,3676,1,0,326,281,114,474,59,712,59
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0004-UpperBounds-02 :0 <= i2.u5.p13 <= 4
FORMULA JoinFreeModules-PT-0004-UpperBounds-02 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-02,0,0.039299,3676,1,0,326,281,126,474,67,712,79
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0004-UpperBounds-04 :0 <= i3.u6.p17 <= 5
FORMULA JoinFreeModules-PT-0004-UpperBounds-04 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-04,0,0.039404,3676,1,0,326,281,139,474,77,712,89
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0004-UpperBounds-06 :0 <= i0.u1.p2 <= 5
FORMULA JoinFreeModules-PT-0004-UpperBounds-06 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-06,0,0.039705,3676,1,0,326,281,151,474,77,712,111
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0004-UpperBounds-07 :0 <= i0.u0.p5 <= 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.039803,3676,1,0,326,281,156,474,77,712,118
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0004-UpperBounds-09 :0 <= i1.u2.p8 <= 4
FORMULA JoinFreeModules-PT-0004-UpperBounds-09 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-09,0,0.039882,3676,1,0,326,281,166,474,77,712,129
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0004-UpperBounds-10 :0 <= i3.u6.p18 <= 4
FORMULA JoinFreeModules-PT-0004-UpperBounds-10 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-10,0,0.039943,3676,1,0,326,281,173,474,77,712,132
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0004-UpperBounds-12 :0 <= i0.u1.p3 <= 4
FORMULA JoinFreeModules-PT-0004-UpperBounds-12 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-12,0,0.040002,3676,1,0,326,281,178,474,77,712,139
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0004-UpperBounds-14 :0 <= i1.u3.p10 <= 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.040201,3676,1,0,326,281,188,474,77,712,163
Total runtime 32706 ms.

BK_STOP 1678747619442

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r255-tall-167856440300019"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;