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-165271830100052.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-0003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830100052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K 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 9.4K 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-0003-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652739420874

Running Version 0
[2022-05-16 22:17:02] [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:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:17:02] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2022-05-16 22:17:02] [INFO ] Transformed 16 places.
[2022-05-16 22:17:02] [INFO ] Transformed 25 transitions.
[2022-05-16 22:17:02] [INFO ] Parsed PT model containing 16 places and 25 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0003-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:17:02] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :38
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :45
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :50
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :49
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :36
// Phase 1: matrix 25 rows 15 cols
[2022-05-16 22:17:02] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-16 22:17:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-16 22:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:17:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:02] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:17:02] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:17:02] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:03] [INFO ] Added : 6 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:17:03] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2022-05-16 22:17:03] [INFO ] Added : 12 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:03] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 10 ms
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:03] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:03] [INFO ] Added : 12 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2022-05-16 22:17:03] [INFO ] Added : 12 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:03] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:17:03] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:03] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6, 5, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6] Max seen :[5, 5, 3, 5, 3, 3, 5, 5, 5, 4, 4, 4]
FORMULA JoinFreeModules-PT-0003-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 1800 steps, including 115 resets, run finished after 5 ms. (steps per millisecond=360 ) properties (out of 9) seen :23 could not realise parikh vector
Incomplete Parikh walk after 7600 steps, including 371 resets, run finished after 18 ms. (steps per millisecond=422 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 114 resets, run finished after 5 ms. (steps per millisecond=480 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 334 resets, run finished after 19 ms. (steps per millisecond=705 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 5400 steps, including 294 resets, run finished after 8 ms. (steps per millisecond=675 ) properties (out of 9) seen :22 could not realise parikh vector
Incomplete Parikh walk after 2800 steps, including 138 resets, run finished after 5 ms. (steps per millisecond=560 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 2800 steps, including 139 resets, run finished after 4 ms. (steps per millisecond=700 ) properties (out of 9) seen :33 could not realise parikh vector
Incomplete Parikh walk after 1700 steps, including 129 resets, run finished after 3 ms. (steps per millisecond=566 ) properties (out of 9) seen :23 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 336 resets, run finished after 14 ms. (steps per millisecond=957 ) properties (out of 9) seen :36 could not realise parikh vector
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 25/25 transitions.
Graph (complete) has 36 edges and 15 vertex of which 10 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 10 transition count 16
Applied a total of 2 rules in 15 ms. Remains 10 /15 variables (removed 5) and now considering 16/25 (removed 9) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:04] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 22:17:04] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 16/25 transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:04] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 9) seen :36
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=4651 ) properties (out of 9) seen :34
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=4807 ) properties (out of 9) seen :24
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=4901 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=4807 ) properties (out of 9) seen :23
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=4975 ) properties (out of 9) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=5025 ) properties (out of 9) seen :34
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=4926 ) properties (out of 9) seen :26
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=4950 ) properties (out of 9) seen :30
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=4926 ) properties (out of 9) seen :27
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:06] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 4 ms to minimize.
[2022-05-16 22:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2022-05-16 22:17:06] [INFO ] Added : 12 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 5 ms.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:06] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:17:06] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:17:06] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:06] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2022-05-16 22:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2022-05-16 22:17:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:06] [INFO ] Added : 12 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 5 ms.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:06] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-16 22:17:06] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:07] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:07] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:07] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:07] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:17:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:07] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:07] [INFO ] Added : 10 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 15 ms.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:07] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2022-05-16 22:17:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:07] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 6, 6, 6, 6, 6] Max seen :[5, 3, 3, 3, 5, 5, 4, 4, 4]
Incomplete Parikh walk after 1800 steps, including 105 resets, run finished after 3 ms. (steps per millisecond=600 ) properties (out of 9) seen :23 could not realise parikh vector
Incomplete Parikh walk after 11200 steps, including 127 resets, run finished after 14 ms. (steps per millisecond=800 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 3900 steps, including 133 resets, run finished after 4 ms. (steps per millisecond=975 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 259 resets, run finished after 5 ms. (steps per millisecond=920 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 12600 steps, including 491 resets, run finished after 11 ms. (steps per millisecond=1145 ) properties (out of 9) seen :36 could not realise parikh vector
Incomplete Parikh walk after 2100 steps, including 137 resets, run finished after 2 ms. (steps per millisecond=1050 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 2100 steps, including 135 resets, run finished after 3 ms. (steps per millisecond=700 ) properties (out of 9) seen :34 could not realise parikh vector
Incomplete Parikh walk after 1500 steps, including 133 resets, run finished after 2 ms. (steps per millisecond=750 ) properties (out of 9) seen :23 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 257 resets, run finished after 5 ms. (steps per millisecond=920 ) properties (out of 9) seen :36 could not realise parikh vector
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 16/16 transitions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:07] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:07] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2022-05-16 22:17:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:07] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 16/16 transitions.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-00
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:07] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) 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 16 rows 10 cols
[2022-05-16 22:17:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-16 22:17:07] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 4600 steps, including 254 resets, run finished after 4 ms. (steps per millisecond=1150 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:07] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:07] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:07] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=3533 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:17:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:08] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 348 resets, run finished after 4 ms. (steps per millisecond=775 ) 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 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:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:08] [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:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [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-0003-UpperBounds-00 in 784 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-03
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:08] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :3
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:08] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:08] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1500 steps, including 135 resets, run finished after 2 ms. (steps per millisecond=750 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=3355 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:17:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:17:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:08] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :3 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:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:17:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [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-0003-UpperBounds-03 in 627 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-07
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:08] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :3
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 :3
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:17:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-16 22:17:08] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:08] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 2100 steps, including 134 resets, run finished after 3 ms. (steps per millisecond=700 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:08] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:09] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:09] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2022-05-16 22:17:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2022-05-16 22:17:09] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:17:09] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :3 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:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:09] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:09] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:17:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:09] [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-0003-UpperBounds-07 in 623 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-08
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:09] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :3
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 22:17:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:17:09] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:17:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2022-05-16 22:17:09] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:09] [INFO ] Added : 12 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 2100 steps, including 134 resets, run finished after 3 ms. (steps per millisecond=700 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:09] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:09] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=3333 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :3
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:17:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:10] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:17:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:10] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[3]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :3 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:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:10] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:10] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2022-05-16 22:17:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:10] [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-0003-UpperBounds-08 in 667 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-09
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:10] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :5
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:10] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:17:10] [INFO ] Added : 12 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 12600 steps, including 481 resets, run finished after 14 ms. (steps per millisecond=900 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=3333 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=5434 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:17:10] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 343 resets, run finished after 3 ms. (steps per millisecond=1033 ) 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 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:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:10] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:10] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2022-05-16 22:17:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0003-UpperBounds-09 in 672 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-11
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:10] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :5
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 22:17:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:17:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 22:17:10] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:10] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:17:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:17:10] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 4600 steps, including 257 resets, run finished after 4 ms. (steps per millisecond=1150 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:10] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=5464 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:17:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:11] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 345 resets, run finished after 4 ms. (steps per millisecond=775 ) 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:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:11] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:11] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2022-05-16 22:17:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:11] [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-0003-UpperBounds-11 in 652 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-13
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:11] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :4
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:11] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:17:11] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2022-05-16 22:17:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2022-05-16 22:17:11] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:11] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 3900 steps, including 135 resets, run finished after 5 ms. (steps per millisecond=780 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:11] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=3367 ) properties (out of 1) seen :4
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 :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:11] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:11] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:17:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-16 22:17:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:17:11] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 1600 steps, including 105 resets, run finished after 2 ms. (steps per millisecond=800 ) properties (out of 1) seen :4 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:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:12] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:12] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 22:17:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:12] [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-0003-UpperBounds-13 in 627 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-14
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:12] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :4
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 22:17:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:17:12] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:12] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:17:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2022-05-16 22:17:12] [INFO ] Added : 10 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 11200 steps, including 127 resets, run finished after 11 ms. (steps per millisecond=1018 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:12] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=5235 ) properties (out of 1) seen :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:17:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:12] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 2800 steps, including 146 resets, run finished after 3 ms. (steps per millisecond=933 ) properties (out of 1) seen :4 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:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:12] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:12] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:17:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:17:12] [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-0003-UpperBounds-14 in 725 ms.
Starting property specific reduction for JoinFreeModules-PT-0003-UpperBounds-15
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:12] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :4
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 22:17:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 22:17:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:17:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 22:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:17:12] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2022-05-16 22:17:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:17:12] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:17:12] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 1800 steps, including 104 resets, run finished after 2 ms. (steps per millisecond=900 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10/10 places, 16/16 transitions.
Graph (complete) has 24 edges and 10 vertex of which 5 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 8/16 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:12] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 1) seen :4
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 :4
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:17:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:17:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:17:13] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:17:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2022-05-16 22:17:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:17:13] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Incomplete Parikh walk after 1600 steps, including 106 resets, run finished after 3 ms. (steps per millisecond=533 ) properties (out of 1) seen :4 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:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:13] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:13] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 22:17:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:17:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:17:13] [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-0003-UpperBounds-15 in 630 ms.
[2022-05-16 22:17:13] [INFO ] Flatten gal took : 19 ms
[2022-05-16 22:17:13] [INFO ] Applying decomposition
[2022-05-16 22:17:13] [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/graph10168440703235014368.txt, -o, /tmp/graph10168440703235014368.bin, -w, /tmp/graph10168440703235014368.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/graph10168440703235014368.bin, -l, -1, -v, -w, /tmp/graph10168440703235014368.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:17:13] [INFO ] Decomposing Gal with order
[2022-05-16 22:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:17:13] [INFO ] Flatten gal took : 19 ms
[2022-05-16 22:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 22:17:13] [INFO ] Time to serialize gal into /tmp/UpperBounds10756688226348036733.gal : 2 ms
[2022-05-16 22:17:13] [INFO ] Time to serialize properties into /tmp/UpperBounds15054956452848806065.prop : 0 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/UpperBounds10756688226348036733.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15054956452848806065.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/UpperBounds10756688226348036733.gal -t CGAL -reachable-file /tmp/UpperBounds15054956452848806065.prop --nowitness
Loading property file /tmp/UpperBounds15054956452848806065.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,1089,0.011317,3788,22,27,108,146,46,107,44,220,0
Total reachable state count : 1089

Verifying 9 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0003-UpperBounds-00 :0 <= i1.u3.p15 <= 5
FORMULA JoinFreeModules-PT-0003-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-0003-UpperBounds-00,0,0.011743,3788,1,0,108,146,69,107,55,220,39
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-03 :0 <= i0.u0.p3 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-03 3 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-0003-UpperBounds-03,0,0.011848,3788,1,0,108,146,77,107,62,220,47
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-07 :0 <= i1.u2.p13 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-07 3 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-0003-UpperBounds-07,0,0.011918,3788,1,0,108,146,80,107,62,220,50
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property JoinFreeModules-PT-0003-UpperBounds-08 :0 <= i1.u2.p13 <= 3
FORMULA JoinFreeModules-PT-0003-UpperBounds-08 3 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-0003-UpperBounds-08,0,0.011978,3788,1,0,108,146,80,107,62,220,50
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0003-UpperBounds-09 :0 <= i0.u1.p5 <= 5
FORMULA JoinFreeModules-PT-0003-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-0003-UpperBounds-09,0,0.012043,3788,1,0,108,146,83,107,62,220,53
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0003-UpperBounds-11 :0 <= i1.u3.p15 <= 5
FORMULA JoinFreeModules-PT-0003-UpperBounds-11 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-0003-UpperBounds-11,0,0.012101,3788,1,0,108,146,83,107,62,220,53
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-13 :0 <= i1.u2.p12 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-13,0,0.012226,3788,1,0,108,146,90,107,71,220,60
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-14 :0 <= i0.u1.p4 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-14 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-14,0,0.012496,3788,1,0,114,146,97,107,74,220,73
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property JoinFreeModules-PT-0003-UpperBounds-15 :0 <= i0.u0.p2 <= 4
FORMULA JoinFreeModules-PT-0003-UpperBounds-15 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0003-UpperBounds-15,0,0.012567,3788,1,0,116,146,100,107,74,220,76

BK_STOP 1652739434780

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

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