Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 29K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620841340722

Running Version 0
[2021-05-12 17:42:22] [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]
[2021-05-12 17:42:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:42:22] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-12 17:42:22] [INFO ] Transformed 26 places.
[2021-05-12 17:42:22] [INFO ] Transformed 41 transitions.
[2021-05-12 17:42:22] [INFO ] Parsed PT model containing 26 places and 41 transitions in 70 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-0005-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 41 rows 25 cols
[2021-05-12 17:42:22] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :94
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :76
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :73
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :82
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :73
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :77
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :74
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :79
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :76
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :76
// Phase 1: matrix 41 rows 25 cols
[2021-05-12 17:42:22] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-12 17:42:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-12 17:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:42:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-12 17:42:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
[2021-05-12 17:42:22] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:42:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2021-05-12 17:42:22] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:42:22] [INFO ] Added : 20 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:42:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:42:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:42:23] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:42:23] [INFO ] Added : 18 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 23 ms.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 11 ms
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 11 ms
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:42:23] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 17:42:23] [INFO ] Added : 24 causal constraints over 5 iterations in 65 ms. Result :sat
Minimization took 16 ms.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2021-05-12 17:42:23] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:42:23] [INFO ] Added : 20 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 8 ms.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 10 ms
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:42:23] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:23] [INFO ] Added : 18 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 25 ms.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:42:23] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:42:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:42:24] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:42:24] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 17:42:24] [INFO ] Added : 16 causal constraints over 4 iterations in 248 ms. Result :sat
Minimization took 30 ms.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-12 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:42:24] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:42:24] [INFO ] Added : 18 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 12 ms.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:42:24] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:24] [INFO ] Added : 18 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 24 ms.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-12 17:42:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 17:42:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:42:24] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 8 ms
Current structural bounds on expressions (after SMT) : [8, 8, 7, 7, 7, 8, 8, 7, 8, 7, 8, 8, 8, 7, 7] Max seen :[6, 5, 7, 7, 7, 6, 6, 7, 5, 7, 6, 6, 5, 7, 7]
FORMULA JoinFreeModules-PT-0005-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0005-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 4300 steps, including 145 resets, run finished after 18 ms. (steps per millisecond=238 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 3800 steps, including 125 resets, run finished after 17 ms. (steps per millisecond=223 ) properties (out of 8) seen :30 could not realise parikh vector
Incomplete Parikh walk after 10700 steps, including 114 resets, run finished after 39 ms. (steps per millisecond=274 ) properties (out of 8) seen :28 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 145 resets, run finished after 18 ms. (steps per millisecond=238 ) properties (out of 8) seen :25 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 138 resets, run finished after 15 ms. (steps per millisecond=306 ) properties (out of 8) seen :34 could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 387 resets, run finished after 37 ms. (steps per millisecond=310 ) properties (out of 8) seen :34 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 145 resets, run finished after 10 ms. (steps per millisecond=430 ) properties (out of 8) seen :27 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 139 resets, run finished after 12 ms. (steps per millisecond=383 ) properties (out of 8) seen :33 could not realise parikh vector
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 41/41 transitions.
Graph (complete) has 60 edges and 25 vertex of which 20 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 12 ms. Remains 20 /25 variables (removed 5) and now considering 32/41 (removed 9) transitions.
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/25 places, 32/41 transitions.
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:24] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 1153 resets, run finished after 1918 ms. (steps per millisecond=521 ) properties (out of 8) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 8) seen :45
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 8) seen :41
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 8) seen :45
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 8) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 597 ms. (steps per millisecond=1675 ) properties (out of 8) seen :41
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 8) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=1545 ) properties (out of 8) seen :45
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 8) seen :41
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:42:32] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 17 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:32] [INFO ] Added : 16 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 10 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 19 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:32] [INFO ] Added : 16 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 20 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:32] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 17 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:32] [INFO ] Added : 16 causal constraints over 4 iterations in 70 ms. Result :sat
Minimization took 11 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 17 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:42:32] [INFO ] Added : 15 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 6 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 18 ms
[2021-05-12 17:42:32] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:32] [INFO ] Added : 14 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 17:42:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2021-05-12 17:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:42:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:42:33] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 16 ms
[2021-05-12 17:42:33] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:33] [INFO ] Added : 16 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 8, 8] Max seen :[6, 5, 6, 6, 5, 6, 6, 5]
Incomplete Parikh walk after 3100 steps, including 175 resets, run finished after 23 ms. (steps per millisecond=134 ) properties (out of 8) seen :27 could not realise parikh vector
Incomplete Parikh walk after 10400 steps, including 125 resets, run finished after 37 ms. (steps per millisecond=281 ) properties (out of 8) seen :30 could not realise parikh vector
Incomplete Parikh walk after 5100 steps, including 145 resets, run finished after 13 ms. (steps per millisecond=392 ) properties (out of 8) seen :30 could not realise parikh vector
Incomplete Parikh walk after 3100 steps, including 174 resets, run finished after 8 ms. (steps per millisecond=387 ) properties (out of 8) seen :28 could not realise parikh vector
Incomplete Parikh walk after 2000 steps, including 125 resets, run finished after 5 ms. (steps per millisecond=400 ) properties (out of 8) seen :29 could not realise parikh vector
Incomplete Parikh walk after 7300 steps, including 198 resets, run finished after 17 ms. (steps per millisecond=429 ) properties (out of 8) seen :29 could not realise parikh vector
Incomplete Parikh walk after 3100 steps, including 175 resets, run finished after 8 ms. (steps per millisecond=387 ) properties (out of 8) seen :26 could not realise parikh vector
Incomplete Parikh walk after 2000 steps, including 130 resets, run finished after 5 ms. (steps per millisecond=400 ) properties (out of 8) seen :29 could not realise parikh vector
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:33] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:42:33] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:33] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-12 17:42:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 32/32 transitions.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-00
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:33] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:33] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 17:42:33] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 17:42:33] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:42:33] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 2000 steps, including 131 resets, run finished after 5 ms. (steps per millisecond=400 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:33] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:33] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 4436 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 17:42:34] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:42:34] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 100 resets, run finished after 4 ms. (steps per millisecond=400 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:34] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:34] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-12 17:42:35] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-12 17:42:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:35] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-00 in 1750 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-01
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:35] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:42:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:42:35] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:35] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 16 ms
[2021-05-12 17:42:35] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:35] [INFO ] Added : 16 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 175 resets, run finished after 7 ms. (steps per millisecond=442 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:35] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:35] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 4490 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:36] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 17:42:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:36] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:36] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 17:42:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:42:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:42:36] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 3 ms. (steps per millisecond=400 ) 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
[2021-05-12 17:42:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:36] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:36] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-12 17:42:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-01 in 1774 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-05
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:36] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:36] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:36] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:42:36] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:36] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 17 ms
[2021-05-12 17:42:36] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:42:36] [INFO ] Added : 16 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 7300 steps, including 200 resets, run finished after 40 ms. (steps per millisecond=182 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:36] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:36] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 4473 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:38] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:42:38] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:42:38] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1400 steps, including 192 resets, run finished after 2 ms. (steps per millisecond=700 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:38] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:38] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-12 17:42:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:38] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-05 in 1947 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-06
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:38] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:42:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:38] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 17:42:38] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-12 17:42:38] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:38] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 2000 steps, including 131 resets, run finished after 4 ms. (steps per millisecond=500 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:38] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:38] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 4543 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 17:42:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:40] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:42:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:42:40] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 100 resets, run finished after 3 ms. (steps per millisecond=533 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:40] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:40] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-12 17:42:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:40] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-06 in 1734 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-08
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:40] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:42:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:42:40] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 4 ms to minimize.
[2021-05-12 17:42:40] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 22 ms
[2021-05-12 17:42:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:42:40] [INFO ] Added : 16 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 174 resets, run finished after 7 ms. (steps per millisecond=442 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:40] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:40] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4543 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:42] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:42] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-12 17:42:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:42:42] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 144 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:42] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:42] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 17:42:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:42] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-08 in 1729 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-10
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:42] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:42] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:42:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:42] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-12 17:42:42] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:42:42] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 17 ms
[2021-05-12 17:42:42] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:42] [INFO ] Added : 15 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 5100 steps, including 145 resets, run finished after 11 ms. (steps per millisecond=463 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:42] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:42] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4527 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:43] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 17:42:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:42:43] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 99 resets, run finished after 3 ms. (steps per millisecond=533 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:43] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:43] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 17:42:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:43] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-10 in 1764 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-11
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:43] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :6
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 17:42:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:42:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:44] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:42:44] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:44] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 18 ms
[2021-05-12 17:42:44] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:44] [INFO ] Added : 14 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 10400 steps, including 124 resets, run finished after 18 ms. (steps per millisecond=577 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:44] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4419 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 1) seen :6
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:42:45] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Incomplete Parikh walk after 1600 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=400 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:45] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:45] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-12 17:42:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:45] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-11 in 1760 ms.
Starting property specific reduction for JoinFreeModules-PT-0005-UpperBounds-12
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:45] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
// Phase 1: matrix 32 rows 20 cols
[2021-05-12 17:42:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 17:42:45] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 17:42:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:42:45] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:45] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:42:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 33 ms
[2021-05-12 17:42:45] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:42:45] [INFO ] Added : 16 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 3100 steps, including 174 resets, run finished after 7 ms. (steps per millisecond=442 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 5 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /20 variables (removed 15) and now considering 8/32 (removed 24) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:45] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:42:45] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/20 places, 8/32 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:45] [INFO ] Computed 1 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 4502 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :5
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:47] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 17:42:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:42:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:42:47] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:42:47] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:42:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:42:47] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[5]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:47] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:47] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-12 17:42:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:42:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:42:47] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0005-UpperBounds-12 in 1748 ms.
[2021-05-12 17:42:47] [INFO ] Flatten gal took : 22 ms
[2021-05-12 17:42:47] [INFO ] Applying decomposition
[2021-05-12 17:42:47] [INFO ] Flatten gal took : 6 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/graph15646266737361093021.txt, -o, /tmp/graph15646266737361093021.bin, -w, /tmp/graph15646266737361093021.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/graph15646266737361093021.bin, -l, -1, -v, -w, /tmp/graph15646266737361093021.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 17:42:47] [INFO ] Decomposing Gal with order
[2021-05-12 17:42:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 17:42:47] [INFO ] Flatten gal took : 132 ms
[2021-05-12 17:42:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 17:42:47] [INFO ] Time to serialize gal into /tmp/UpperBounds4413732927396359648.gal : 2 ms
[2021-05-12 17:42:47] [INFO ] Time to serialize properties into /tmp/UpperBounds205663055483184955.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4413732927396359648.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds205663055483184955.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/UpperBounds4413732927396359648.gal -t CGAL -reachable-file /tmp/UpperBounds205663055483184955.prop --nowitness
Loading property file /tmp/UpperBounds205663055483184955.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.12551e+08,0.015152,3924,47,49,432,407,75,689,45,1044,0
Total reachable state count : 112550881

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-00 :0 <= i0.u1.p2 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-00 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-00,0,0.016065,3924,1,0,432,407,116,689,61,1044,74
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-01 :0 <= i3.u6.p18 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-01 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-01,0,0.016172,3924,1,0,432,407,130,689,70,1044,86
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-05 :0 <= i2.u4.p15 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-05 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-05,0,0.016263,3924,1,0,432,407,142,689,79,1044,95
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-06 :0 <= i0.u1.p2 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-06 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-06,0,0.016321,3924,1,0,432,407,142,689,79,1044,95
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-08 :0 <= i3.u6.p18 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-08 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-08,0,0.016374,3924,1,0,432,407,142,689,79,1044,95
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-10 :0 <= i1.u2.p7 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-10 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-10,0,0.01651,3924,1,0,432,407,152,689,79,1044,106
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property JoinFreeModules-PT-0005-UpperBounds-11 :0 <= i3.u6.p17 <= 6
FORMULA JoinFreeModules-PT-0005-UpperBounds-11 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-11,0,0.016574,3924,1,0,432,407,159,689,79,1044,109
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property JoinFreeModules-PT-0005-UpperBounds-12 :0 <= i3.u6.p18 <= 5
FORMULA JoinFreeModules-PT-0005-UpperBounds-12 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0005-UpperBounds-12,0,0.016626,3924,1,0,432,407,159,689,79,1044,109

BK_STOP 1620841368770

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0005, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406900403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0005.tgz
mv JoinFreeModules-PT-0005 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;