Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610500029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-0010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610500029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:42 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-0010-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716497808150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 20:56:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 20:56:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:56:49] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-23 20:56:49] [INFO ] Transformed 51 places.
[2024-05-23 20:56:49] [INFO ] Transformed 81 transitions.
[2024-05-23 20:56:49] [INFO ] Parsed PT model containing 51 places and 81 transitions and 232 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0010-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 10, 1, 10, 2, 1, 10, 1, 2, 0, 0, 0, 0, 10, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 10, 1, 10, 2, 1, 10, 1, 2, 0, 0, 0, 0, 10, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 81 rows 50 cols
[2024-05-23 20:56:49] [INFO ] Computed 10 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 10, 1, 10, 2, 1, 10, 1, 2, 0, 0, 0, 0, 10, 0] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
RANDOM walk for 10000 steps (2 resets) in 45 ms. (217 steps per ms)
BEST_FIRST walk for 150015 steps (30 resets) in 168 ms. (887 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 10, 11, 10, 12, 11, 10, 11, 10, 11, 12, 11, 12, 10, 9] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
[2024-05-23 20:56:49] [INFO ] Invariant cache hit.
[2024-05-23 20:56:49] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-23 20:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-23 20:56:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 20:56:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:56:50] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 20:56:50] [INFO ] Added : 37 causal constraints over 10 iterations in 114 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 20:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 101 ms returned sat
[2024-05-23 20:56:50] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 20:56:50] [INFO ] Added : 11 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:56:50] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 20:56:50] [INFO ] Added : 33 causal constraints over 7 iterations in 121 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 20:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 20:56:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 53 ms returned sat
[2024-05-23 20:56:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 20:56:51] [INFO ] Added : 22 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 20:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-23 20:56:51] [INFO ] Added : 35 causal constraints over 8 iterations in 62 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 20:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:56:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:56:51] [INFO ] Added : 41 causal constraints over 9 iterations in 67 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 20:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:56:51] [INFO ] Added : 14 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:56:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:56:51] [INFO ] Added : 41 causal constraints over 10 iterations in 62 ms. Result :sat
Minimization took 23 ms.
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 20:56:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:56:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 20:56:52] [INFO ] Added : 33 causal constraints over 8 iterations in 53 ms. Result :sat
Minimization took 15 ms.
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 20:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 23 ms returned sat
[2024-05-23 20:56:52] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:56:52] [INFO ] Added : 30 causal constraints over 7 iterations in 40 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 20:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 68 ms returned sat
[2024-05-23 20:56:52] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 20:56:52] [INFO ] Added : 45 causal constraints over 10 iterations in 92 ms. Result :sat
Minimization took 17 ms.
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 20:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 26 ms returned sat
[2024-05-23 20:56:52] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:56:52] [INFO ] Added : 26 causal constraints over 6 iterations in 33 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 10 ms to minimize.
[2024-05-23 20:56:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 20:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 20:56:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 34 ms returned sat
[2024-05-23 20:56:52] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-23 20:56:53] [INFO ] Added : 32 causal constraints over 7 iterations in 84 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 20:56:53] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 20:56:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:56:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 20:56:53] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 20:56:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-05-23 20:56:53] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:56:53] [INFO ] Added : 35 causal constraints over 8 iterations in 52 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 10, 11, 10, 12, 11, 10, 11, 10, 11, 12, 11, 12, 10, 9] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 13, 13]
FORMULA JoinFreeModules-PT-0010-UpperBounds-13 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 10, 11, 10, 12, 11, 10, 11, 12, 12, 12, 11, 10, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
Support contains 14 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 81/81 transitions.
Graph (complete) has 120 edges and 50 vertex of which 35 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 35 transition count 56
Applied a total of 2 rules in 17 ms. Remains 35 /50 variables (removed 15) and now considering 56/81 (removed 25) transitions.
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:56:53] [INFO ] Computed 7 invariants in 3 ms
[2024-05-23 20:56:53] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 20:56:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 20:56:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 20:56:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-23 20:56:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 95 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 4/4 constraints]
After SMT, in 1846ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1886 ms. Remains : 35/50 places, 56/81 transitions.
[2024-05-23 20:56:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12, 10, 11, 10, 12, 11, 10, 11, 12, 12, 12, 11, 10, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
RANDOM walk for 1000001 steps (2 resets) in 1463 ms. (683 steps per ms)
FORMULA JoinFreeModules-PT-0010-UpperBounds-11 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-10 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 12000011 steps (24 resets) in 6802 ms. (1763 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 10, 11, 10, 12, 11, 10, 11, 12, 12, 10, 12] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
[2024-05-23 20:57:04] [INFO ] Invariant cache hit.
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 20:57:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 42 ms returned sat
[2024-05-23 20:57:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:57:04] [INFO ] Added : 28 causal constraints over 8 iterations in 40 ms. Result :sat
Minimization took 17 ms.
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:04] [INFO ] Added : 26 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 17 ms.
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 19 ms returned sat
[2024-05-23 20:57:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 20:57:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 20:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-23 20:57:04] [INFO ] Added : 29 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:57:04] [INFO ] Added : 22 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 20:57:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:57:04] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:05] [INFO ] Added : 33 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:05] [INFO ] Added : 28 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 15 ms.
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 20:57:05] [INFO ] Added : 33 causal constraints over 10 iterations in 75 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 20:57:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 20:57:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 43 ms
Minimization took 7 ms.
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 20:57:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
Minimization took 14 ms.
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 14 ms returned sat
[2024-05-23 20:57:05] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:57:05] [INFO ] Added : 23 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 20:57:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
Current structural bounds on expressions (after SMT) : Max Seen:[12, 10, 11, 10, 12, 11, 10, 11, 12, 12, 10, 12] Max Struct:[12, 13, 13, 13, 13, 13, 13, 13, 12, 12, 13, 12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-15 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-12 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-09 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 11, 10, 12, 11, 10, 11, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13]
Support contains 8 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
[2024-05-23 20:57:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 11, 10, 12, 11, 10, 11, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13]
RANDOM walk for 1000000 steps (2 resets) in 1354 ms. (738 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4471 ms. (1788 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 11, 10, 12, 11, 10, 11, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13]
[2024-05-23 20:57:11] [INFO ] Invariant cache hit.
[2024-05-23 20:57:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 20:57:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 43 ms returned sat
[2024-05-23 20:57:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:12] [INFO ] Added : 28 causal constraints over 8 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-23 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:57:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:12] [INFO ] Added : 26 causal constraints over 6 iterations in 41 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 18 ms returned sat
[2024-05-23 20:57:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:57:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 20:57:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-23 20:57:12] [INFO ] Added : 29 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:12] [INFO ] Added : 22 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 14 ms.
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:12] [INFO ] Added : 33 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-23 20:57:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 20:57:12] [INFO ] Added : 28 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 15 ms.
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 20:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 20:57:13] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:13] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:57:13] [INFO ] Added : 33 causal constraints over 10 iterations in 88 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 20:57:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:13] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 20:57:13] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:13] [INFO ] Added : 23 causal constraints over 6 iterations in 39 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 11, 10, 12, 11, 10, 11, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 11, 10, 12, 11, 10, 11, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13]
Support contains 8 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-23 20:57:13] [INFO ] Invariant cache hit.
[2024-05-23 20:57:13] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 20:57:13] [INFO ] Invariant cache hit.
[2024-05-23 20:57:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-23 20:57:13] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-23 20:57:13] [INFO ] Invariant cache hit.
[2024-05-23 20:57:13] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2046ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2130 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40000 steps (8 resets) in 1703 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 202105 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 16
Probabilistic random walk after 202105 steps, saw 172714 distinct states, run finished after 3011 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-23 20:57:19] [INFO ] Invariant cache hit.
[2024-05-23 20:57:19] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 20:57:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MIN3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 9 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/56 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 56 constraints, problems are : Problem set: 9 solved, 7 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 9 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 6/12 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/42 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/48 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 7/55 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/55 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/55 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/91 variables, and 55 constraints, problems are : Problem set: 9 solved, 7 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 30/35 constraints, ReadFeed: 6/7 constraints, PredecessorRefiner: 7/16 constraints, Known Traps: 6/7 constraints]
After SMT, in 701ms problems are : Problem set: 9 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2527 ms.
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 5 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Running 36 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-05-23 20:57:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:57:22] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1023 ms. Remains : 30/35 places, 48/56 transitions.
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 292373 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 7
Probabilistic random walk after 292373 steps, saw 241963 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-23 20:57:26] [INFO ] Invariant cache hit.
[2024-05-23 20:57:26] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 7 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 20:57:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 20:57:27] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 20:57:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 52 constraints, problems are : Problem set: 0 solved, 7 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1026 ms.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-23 20:57:28] [INFO ] Invariant cache hit.
[2024-05-23 20:57:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 20:57:28] [INFO ] Invariant cache hit.
[2024-05-23 20:57:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 20:57:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-23 20:57:28] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-23 20:57:28] [INFO ] Invariant cache hit.
[2024-05-23 20:57:28] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1053ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1150 ms. Remains : 30/30 places, 48/48 transitions.
FORMULA JoinFreeModules-PT-0010-UpperBounds-05 12 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[10, 11, 10, 11, 10, 11, 10] Max Struct:[13, 13, 13, 13, 13, 13, 13]
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[10] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:29] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:29] [INFO ] Invariant cache hit.
[2024-05-23 20:57:29] [INFO ] [Real]Absence check using 7 positive place invariants in 47 ms returned sat
[2024-05-23 20:57:29] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 20:57:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:29] [INFO ] [Nat]Added 7 Read/Feed constraints in 43 ms returned sat
[2024-05-23 20:57:29] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 20:57:29] [INFO ] Added : 28 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:30] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 1000001 steps (2 resets) in 383 ms. (2604 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:30] [INFO ] Invariant cache hit.
[2024-05-23 20:57:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:30] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:30] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 20:57:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:30] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:30] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 20:57:30] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:30] [INFO ] Invariant cache hit.
[2024-05-23 20:57:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 20:57:30] [INFO ] Invariant cache hit.
[2024-05-23 20:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 20:57:30] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:30] [INFO ] Invariant cache hit.
[2024-05-23 20:57:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40006 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 20 ms. (steps per millisecond=480 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 10 ms. (steps per millisecond=961 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-01 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-01 in 1482 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:31] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[13]
RANDOM walk for 10002 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[13]
[2024-05-23 20:57:31] [INFO ] Invariant cache hit.
[2024-05-23 20:57:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:31] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:31] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:31] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 20:57:31] [INFO ] Added : 26 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:57:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[13]
RANDOM walk for 1000000 steps (2 resets) in 374 ms. (2666 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 185 ms. (5376 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[13]
[2024-05-23 20:57:31] [INFO ] Invariant cache hit.
[2024-05-23 20:57:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 20:57:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 20:57:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:31] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 20:57:31] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:32] [INFO ] Invariant cache hit.
[2024-05-23 20:57:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 20:57:32] [INFO ] Invariant cache hit.
[2024-05-23 20:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-23 20:57:32] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:32] [INFO ] Invariant cache hit.
[2024-05-23 20:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 19 ms. (steps per millisecond=505 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 13 ms. (steps per millisecond=739 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-03 11 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-03 in 1157 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[10] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:32] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:32] [INFO ] Invariant cache hit.
[2024-05-23 20:57:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 20:57:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:32] [INFO ] [Nat]Added 7 Read/Feed constraints in 17 ms returned sat
[2024-05-23 20:57:32] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-23 20:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-23 20:57:32] [INFO ] Added : 29 causal constraints over 7 iterations in 69 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 1000000 steps (2 resets) in 380 ms. (2624 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 156 ms. (6369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:33] [INFO ] Invariant cache hit.
[2024-05-23 20:57:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:33] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 20:57:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 20:57:33] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 20:57:33] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 20:57:33] [INFO ] Added : 5 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:33] [INFO ] Invariant cache hit.
[2024-05-23 20:57:33] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 20:57:33] [INFO ] Invariant cache hit.
[2024-05-23 20:57:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:33] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-23 20:57:33] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:33] [INFO ] Invariant cache hit.
[2024-05-23 20:57:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 17 ms. (steps per millisecond=565 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 10 ms. (steps per millisecond=961 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-04 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04 in 1200 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:33] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[13]
RANDOM walk for 10002 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[13]
[2024-05-23 20:57:33] [INFO ] Invariant cache hit.
[2024-05-23 20:57:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:33] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:57:33] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:33] [INFO ] Added : 33 causal constraints over 7 iterations in 49 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:33] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:57:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[13]
RANDOM walk for 1000000 steps (2 resets) in 391 ms. (2551 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 150 ms. (6622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[13]
[2024-05-23 20:57:34] [INFO ] Invariant cache hit.
[2024-05-23 20:57:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 20:57:34] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 20:57:34] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:34] [INFO ] Invariant cache hit.
[2024-05-23 20:57:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 20:57:34] [INFO ] Invariant cache hit.
[2024-05-23 20:57:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 20:57:34] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:34] [INFO ] Invariant cache hit.
[2024-05-23 20:57:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 14 ms. (steps per millisecond=686 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 7 ms. (steps per millisecond=1372 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-06 11 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-06 in 1155 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[10] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:34] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:34] [INFO ] Invariant cache hit.
[2024-05-23 20:57:34] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:34] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 20:57:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:34] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-23 20:57:34] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:34] [INFO ] Added : 28 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:34] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:57:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 1000000 steps (2 resets) in 377 ms. (2645 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 153 ms. (6493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:35] [INFO ] Invariant cache hit.
[2024-05-23 20:57:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 20:57:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:35] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 20:57:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:57:35] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 20:57:35] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:35] [INFO ] Invariant cache hit.
[2024-05-23 20:57:35] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 20:57:35] [INFO ] Invariant cache hit.
[2024-05-23 20:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-23 20:57:35] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:35] [INFO ] Invariant cache hit.
[2024-05-23 20:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40006 steps (8 resets) in 44 ms. (889 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 18 ms. (steps per millisecond=533 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 8 ms. (steps per millisecond=1201 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-07 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-07 in 1235 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:35] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[13]
RANDOM walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[13]
[2024-05-23 20:57:35] [INFO ] Invariant cache hit.
[2024-05-23 20:57:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-23 20:57:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:35] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-05-23 20:57:35] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:36] [INFO ] Added : 33 causal constraints over 10 iterations in 73 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 20:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[13]
RANDOM walk for 1000000 steps (2 resets) in 378 ms. (2638 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 151 ms. (6578 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[13]
[2024-05-23 20:57:36] [INFO ] Invariant cache hit.
[2024-05-23 20:57:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:36] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 20:57:36] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 20:57:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 20:57:36] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:36] [INFO ] Invariant cache hit.
[2024-05-23 20:57:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 20:57:36] [INFO ] Invariant cache hit.
[2024-05-23 20:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:36] [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.
[2024-05-23 20:57:36] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:36] [INFO ] Invariant cache hit.
[2024-05-23 20:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 19 ms. (steps per millisecond=505 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 13 ms. (steps per millisecond=739 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-08 11 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-08 in 1186 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[10] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (Before main loop) : Max Seen:[10] Max Struct:[13]
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 20:57:37] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:37] [INFO ] Invariant cache hit.
[2024-05-23 20:57:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 20:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 20:57:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 20:57:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 20:57:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2024-05-23 20:57:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 20:57:37] [INFO ] Added : 23 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 20:57:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 20:57:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 5/35 places, 8/56 transitions.
[2024-05-23 20:57:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[13]
RANDOM walk for 1000000 steps (2 resets) in 373 ms. (2673 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[13]
[2024-05-23 20:57:37] [INFO ] Invariant cache hit.
[2024-05-23 20:57:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:37] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:57:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:37] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 20:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:57:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 20:57:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 20:57:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 20:57:37] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 20:57:37] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[13]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 20:57:37] [INFO ] Invariant cache hit.
[2024-05-23 20:57:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 20:57:37] [INFO ] Invariant cache hit.
[2024-05-23 20:57:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:57:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 20:57:37] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 20:57:37] [INFO ] Invariant cache hit.
[2024-05-23 20:57:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (8 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2090 states, properties seen :0
Probabilistic random walk after 9610 steps, saw 2090 distinct states, run finished after 24 ms. (steps per millisecond=400 ) properties seen :0
Explored full state space saw : 2090 states, properties seen :0
Exhaustive walk after 9610 steps, saw 2090 distinct states, run finished after 13 ms. (steps per millisecond=739 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-14 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-14 in 1096 ms.
[2024-05-23 20:57:38] [INFO ] Flatten gal took : 165 ms
Total runtime 48926 ms.
ITS solved all properties within timeout

BK_STOP 1716497858353

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-0010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is JoinFreeModules-PT-0010, 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 r223-tall-171649610500029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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