Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 30 02:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 30 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 16K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652739451035

Running Version 0
[2022-05-16 22:17:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 22:17:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:17:32] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2022-05-16 22:17:32] [INFO ] Transformed 26 places.
[2022-05-16 22:17:32] [INFO ] Transformed 41 transitions.
[2022-05-16 22:17:32] [INFO ] Parsed PT model containing 26 places and 41 transitions in 137 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-0005-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 41 rows 25 cols
[2022-05-16 22:17:32] [INFO ] Computed 5 place invariants in 10 ms
Incomplete random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :76
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :77
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :76
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :75
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :78
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :76
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :77
// Phase 1: matrix 41 rows 25 cols
[2022-05-16 22:17:32] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-16 22:17:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:17:33] [INFO ] Added : 16 causal constraints over 4 iterations in 121 ms. Result :sat
Minimization took 18 ms.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-16 22:17:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:17:33] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 5 ms to minimize.
[2022-05-16 22:17:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-16 22:17:33] [INFO ] Added : 18 causal constraints over 4 iterations in 227 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 22:17:33] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 2 ms to minimize.
[2022-05-16 22:17:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:17:33] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:17:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 9 ms
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:17:33] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:17:33] [INFO ] Added : 18 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 18 ms.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-16 22:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:17:34] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 2 ms to minimize.
[2022-05-16 22:17:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:17:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:17:34] [INFO ] Added : 18 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-16 22:17:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:17:34] [INFO ] Added : 16 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-16 22:17:34] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:17:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:34] [INFO ] Added : 22 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 22:17:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:17:34] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:17:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2022-05-16 22:17:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:34] [INFO ] Added : 20 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:17:34] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:17:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:34] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:17:34] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:35] [INFO ] Added : 18 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 22:17:35] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2022-05-16 22:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:17:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:35] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:17:35] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2022-05-16 22:17:35] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:35] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:17:35] [INFO ] Added : 18 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 25 ms.
[2022-05-16 22:17:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:17:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:35] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:17:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:17:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
Current structural bounds on expressions (after SMT) : [8, 8, 7, 7, 8, 7, 8, 8, 7, 8, 8, 7, 8, 8, 7] Max seen :[5, 6, 7, 7, 6, 7, 5, 6, 7, 5, 6, 7, 6, 5, 7]
FORMULA JoinFreeModules-PT-0005-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 4900 steps, including 131 resets, run finished after 10 ms. (steps per millisecond=490 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 3800 steps, including 124 resets, run finished after 7 ms. (steps per millisecond=542 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 138 resets, run finished after 9 ms. (steps per millisecond=511 ) properties (out of 9) seen :38 could not realise parikh vector
Incomplete Parikh walk after 5200 steps, including 147 resets, run finished after 10 ms. (steps per millisecond=520 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 3700 steps, including 156 resets, run finished after 12 ms. (steps per millisecond=308 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 144 resets, run finished after 9 ms. (steps per millisecond=477 ) properties (out of 9) seen :32 could not realise parikh vector
Incomplete Parikh walk after 5200 steps, including 162 resets, run finished after 10 ms. (steps per millisecond=520 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4700 steps, including 165 resets, run finished after 8 ms. (steps per millisecond=587 ) properties (out of 9) seen :33 could not realise parikh vector
Incomplete Parikh walk after 3900 steps, including 148 resets, run finished after 6 ms. (steps per millisecond=650 ) properties (out of 9) seen :32 could not realise parikh vector
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 41/41 transitions.
Graph (complete) has 60 edges and 25 vertex of which 20 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 15 ms. Remains 20 /25 variables (removed 5) and now considering 32/41 (removed 9) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 22:17:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/25 places, 32/41 transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:35] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 1132 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 9) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=3134 ) properties (out of 9) seen :44
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 9) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=3215 ) properties (out of 9) seen :50
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 9) seen :44
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 9) seen :46
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:39] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:17:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:17:39] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:17:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2022-05-16 22:17:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:39] [INFO ] Added : 16 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 22:17:39] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-16 22:17:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:39] [INFO ] Added : 16 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:39] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:17:39] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:17:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 28 ms
[2022-05-16 22:17:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:39] [INFO ] Added : 16 causal constraints over 4 iterations in 67 ms. Result :sat
Minimization took 17 ms.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:39] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:17:39] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-16 22:17:39] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:17:40] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 35 ms
[2022-05-16 22:17:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:40] [INFO ] Added : 14 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 7 ms.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-16 22:17:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:40] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2022-05-16 22:17:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:40] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:17:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:40] [INFO ] Added : 15 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 41 ms
[2022-05-16 22:17:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:40] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 8, 8, 8] Max seen :[5, 6, 6, 5, 6, 5, 6, 6, 5]
Incomplete Parikh walk after 3200 steps, including 157 resets, run finished after 13 ms. (steps per millisecond=246 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4000 steps, including 145 resets, run finished after 6 ms. (steps per millisecond=666 ) properties (out of 9) seen :38 could not realise parikh vector
Incomplete Parikh walk after 2000 steps, including 129 resets, run finished after 3 ms. (steps per millisecond=666 ) properties (out of 9) seen :28 could not realise parikh vector
Incomplete Parikh walk after 2600 steps, including 137 resets, run finished after 3 ms. (steps per millisecond=866 ) properties (out of 9) seen :26 could not realise parikh vector
Incomplete Parikh walk after 10400 steps, including 125 resets, run finished after 12 ms. (steps per millisecond=866 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 3000 steps, including 148 resets, run finished after 4 ms. (steps per millisecond=750 ) properties (out of 9) seen :40 could not realise parikh vector
Incomplete Parikh walk after 7300 steps, including 198 resets, run finished after 9 ms. (steps per millisecond=811 ) properties (out of 9) seen :37 could not realise parikh vector
Incomplete Parikh walk after 11400 steps, including 138 resets, run finished after 13 ms. (steps per millisecond=876 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 3100 steps, including 173 resets, run finished after 4 ms. (steps per millisecond=775 ) properties (out of 9) seen :35 could not realise parikh vector
Support contains 9 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 22:17:40] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 22:17:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 22:17:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 22:17:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-00
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:40] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:17:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 28 ms
[2022-05-16 22:17:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:40] [INFO ] Added : 16 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 177 resets, run finished after 10 ms. (steps per millisecond=310 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:40] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:40] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4433 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:41] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:17:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:41] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 143 resets, run finished after 1 ms. (steps per millisecond=1200 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:41] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:41] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2022-05-16 22:17:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-00 in 842 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-01
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:41] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:41] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-16 22:17:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:17:41] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:17:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-16 22:17:41] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:41] [INFO ] Added : 16 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 11400 steps, including 138 resets, run finished after 9 ms. (steps per millisecond=1266 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:41] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:41] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 4440 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=4739 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:42] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1400 steps, including 192 resets, run finished after 2 ms. (steps per millisecond=700 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:42] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:42] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2022-05-16 22:17:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:42] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-01 in 839 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-04
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:42] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:42] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 22:17:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:42] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:17:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:17:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 35 ms
[2022-05-16 22:17:42] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:42] [INFO ] Added : 16 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 7300 steps, including 199 resets, run finished after 8 ms. (steps per millisecond=912 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:42] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4444 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=4566 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:43] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1400 steps, including 192 resets, run finished after 2 ms. (steps per millisecond=700 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:43] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:43] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2022-05-16 22:17:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-04 in 909 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-06
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:43] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 22:17:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:17:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:17:43] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:43] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:43] [INFO ] Added : 16 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 3000 steps, including 147 resets, run finished after 4 ms. (steps per millisecond=750 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:43] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 4436 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6329 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 22:17:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:44] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:17:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:44] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:44] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:44] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2022-05-16 22:17:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:44] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-06 in 806 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-07
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:44] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 22:17:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:44] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:17:44] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:17:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 27 ms
[2022-05-16 22:17:44] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:44] [INFO ] Added : 14 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 10400 steps, including 123 resets, run finished after 13 ms. (steps per millisecond=800 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:44] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4412 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=6024 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:44] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2022-05-16 22:17:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:44] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 100 resets, run finished after 2 ms. (steps per millisecond=800 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:44] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 22:17:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:44] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-07 in 810 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-09
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:44] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:44] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 22:17:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:17:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 22:17:45] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:45] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 2600 steps, including 137 resets, run finished after 5 ms. (steps per millisecond=520 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:45] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4431 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:45] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 22:17:45] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:17:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:45] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 1 ms. (steps per millisecond=1200 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:45] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:45] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2022-05-16 22:17:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:45] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-09 in 787 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-11
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:45] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 22:17:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:45] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:17:45] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:17:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:45] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:45] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 2000 steps, including 130 resets, run finished after 3 ms. (steps per millisecond=666 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:45] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:45] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 4443 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=6289 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:46] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:17:46] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 99 resets, run finished after 2 ms. (steps per millisecond=800 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:46] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:46] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2022-05-16 22:17:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:46] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-11 in 750 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-13
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 22:17:46] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:17:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-16 22:17:46] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:46] [INFO ] Added : 15 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 4000 steps, including 143 resets, run finished after 8 ms. (steps per millisecond=500 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:46] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:46] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4544 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=5917 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:17:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:17:47] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 100 resets, run finished after 2 ms. (steps per millisecond=800 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:47] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 22:17:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:47] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 22:17:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:47] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-13 in 847 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-14
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:47] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2022-05-16 22:17:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 22:17:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:47] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:17:47] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:17:47] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:17:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 39 ms
[2022-05-16 22:17:47] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:47] [INFO ] Added : 15 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 3200 steps, including 157 resets, run finished after 9 ms. (steps per millisecond=355 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:47] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:47] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4378 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6410 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:48] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:48] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-16 22:17:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:48] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:48] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:48] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2022-05-16 22:17:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-14 in 850 ms.
[2022-05-16 22:17:48] [INFO ] Flatten gal took : 21 ms
[2022-05-16 22:17:48] [INFO ] Applying decomposition
[2022-05-16 22:17:48] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph165638766707045282.txt, -o, /tmp/graph165638766707045282.bin, -w, /tmp/graph165638766707045282.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph165638766707045282.bin, -l, -1, -v, -w, /tmp/graph165638766707045282.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:17:48] [INFO ] Decomposing Gal with order
[2022-05-16 22:17:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:17:48] [INFO ] Flatten gal took : 22 ms
[2022-05-16 22:17:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 22:17:48] [INFO ] Time to serialize gal into /tmp/UpperBounds1327119639436611596.gal : 1 ms
[2022-05-16 22:17:48] [INFO ] Time to serialize properties into /tmp/UpperBounds17479801146790544076.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds1327119639436611596.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17479801146790544076.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds1327119639436611596.gal -t CGAL -reachable-file /tmp/UpperBounds17479801146790544076.prop --nowitness
Loading property file /tmp/UpperBounds17479801146790544076.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.12551e+08,0.018126,3928,47,49,471,407,75,735,45,1052,0
Total reachable state count : 112550881

Verifying 9 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-00 :0 <= i3.u7.p23 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-00 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-00,0,0.019024,3928,1,0,471,407,116,735,59,1052,72
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-01 :0 <= i3.u6.p25 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-01 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-01,0,0.019134,3928,1,0,471,407,127,735,68,1052,79
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-04 :0 <= i2.u4.p20 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-04 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-04,0,0.019211,3928,1,0,471,407,136,735,68,1052,85
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-06 :0 <= i2.u5.p18 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-06 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-06,0,0.019282,3928,1,0,471,407,144,735,68,1052,90
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-07 :0 <= i3.u7.p22 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-07 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-07,0,0.019776,3928,1,0,471,407,155,735,79,1052,109
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-09 :0 <= i1.u2.p13 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-09 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-09,0,0.019877,3928,1,0,471,407,167,735,79,1052,120
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-11 :0 <= i0.u0.p2 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-11 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-11,0,0.019999,3928,1,0,471,407,177,735,79,1052,131
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-13 :0 <= i2.u5.p17 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-13 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-13,0,0.020074,3928,1,0,471,407,185,735,79,1052,136
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-14 :0 <= i0.u0.p3 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-14 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-14,0,0.020147,3928,1,0,471,407,190,735,79,1052,143

BK_STOP 1652739469581

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-0005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is JoinFreeModules-PT-0005, 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 r143-tall-165271830100058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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