MCC'2023- Execution of r255-tall-167856440300022

About the Execution of 2022-gold for JoinFreeModules-PT-0020

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
661.504	37142.00	47454.00	163.50	23 22 22 22 22 21 23 22 22 22 22 22 22 21 22 21	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.5K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678747688490

Running Version 202205111006
[2023-03-13 22:48:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 22:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:48:09] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-13 22:48:09] [INFO ] Transformed 101 places.
[2023-03-13 22:48:09] [INFO ] Transformed 161 transitions.
[2023-03-13 22:48:09] [INFO ] Parsed PT model containing 101 places and 161 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2023-03-13 22:48:09] [INFO ] Computed 20 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :306
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :61
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :67
// Phase 1: matrix 161 rows 100 cols
[2023-03-13 22:48:10] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-13 22:48:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-13 22:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-13 22:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:10] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-03-13 22:48:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 22:48:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:48:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 3 ms to minimize.
[2023-03-13 22:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-13 22:48:10] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-13 22:48:11] [INFO ] Added : 43 causal constraints over 9 iterations in 208 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:48:11] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:11] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-13 22:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:11] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-13 22:48:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 19 ms returned sat
[2023-03-13 22:48:11] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-13 22:48:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2023-03-13 22:48:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:48:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:48:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2023-03-13 22:48:11] [INFO ] Added : 52 causal constraints over 11 iterations in 275 ms. Result :sat
Minimization took 54 ms.
[2023-03-13 22:48:11] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:11] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 22:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-13 22:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:11] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-13 22:48:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2023-03-13 22:48:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2023-03-13 22:48:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:48:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-13 22:48:12] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:48:12] [INFO ] Added : 39 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 30 ms.
[2023-03-13 22:48:12] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-13 22:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:12] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-13 22:48:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:48:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-13 22:48:12] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:48:12] [INFO ] Added : 47 causal constraints over 10 iterations in 134 ms. Result :sat
Minimization took 62 ms.
[2023-03-13 22:48:12] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:12] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-13 22:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:12] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-13 22:48:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:48:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-13 22:48:12] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 22:48:13] [INFO ] Added : 36 causal constraints over 8 iterations in 143 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 22:48:13] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-13 22:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:13] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:48:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:13] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-13 22:48:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:48:13] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:48:13] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:13] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-13 22:48:13] [INFO ] Added : 45 causal constraints over 10 iterations in 176 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 22:48:13] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:13] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-13 22:48:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:13] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-13 22:48:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:48:13] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:14] [INFO ] Added : 32 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 22:48:14] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:14] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-13 22:48:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:14] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-13 22:48:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 23 ms returned sat
[2023-03-13 22:48:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:48:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:48:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2023-03-13 22:48:14] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:48:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:48:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:48:14] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:48:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
[2023-03-13 22:48:14] [INFO ] Added : 55 causal constraints over 12 iterations in 283 ms. Result :sat
Minimization took 59 ms.
[2023-03-13 22:48:14] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:14] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:48:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:14] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-13 22:48:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:48:14] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-13 22:48:15] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:48:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:48:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-13 22:48:15] [INFO ] Added : 49 causal constraints over 11 iterations in 311 ms. Result :sat
Minimization took 44 ms.
[2023-03-13 22:48:15] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:15] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-13 22:48:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:15] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-13 22:48:15] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:48:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:48:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:48:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2023-03-13 22:48:15] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:48:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:48:15] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-13 22:48:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-03-13 22:48:15] [INFO ] Added : 54 causal constraints over 11 iterations in 217 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:48:15] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-13 22:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:15] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-13 22:48:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:16] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-13 22:48:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:48:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-13 22:48:16] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:48:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-13 22:48:16] [INFO ] Added : 43 causal constraints over 10 iterations in 177 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 22:48:16] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:48:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:16] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-13 22:48:16] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:48:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:48:16] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2023-03-13 22:48:16] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:48:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 22:48:16] [INFO ] Added : 43 causal constraints over 10 iterations in 195 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 22:48:16] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:17] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 22:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:17] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-13 22:48:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:48:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:48:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:48:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-13 22:48:17] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:48:17] [INFO ] Added : 51 causal constraints over 11 iterations in 134 ms. Result :sat
Minimization took 46 ms.
[2023-03-13 22:48:17] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:17] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-13 22:48:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:48:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:48:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:48:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-13 22:48:17] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-13 22:48:17] [INFO ] Added : 52 causal constraints over 12 iterations in 201 ms. Result :sat
Minimization took 29 ms.
[2023-03-13 22:48:18] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:18] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-13 22:48:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:48:18] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:48:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-13 22:48:18] [INFO ] Added : 34 causal constraints over 9 iterations in 213 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 22:48:18] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:18] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-13 22:48:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:48:18] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-13 22:48:18] [INFO ] Added : 44 causal constraints over 9 iterations in 269 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23] Max seen :[21, 19, 21, 18, 17, 21, 22, 19, 17, 14, 17, 21, 20, 21, 18, 21]
Support contains 16 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 161/161 transitions.
Graph (complete) has 240 edges and 100 vertex of which 65 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 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 65 transition count 104
Applied a total of 2 rules in 15 ms. Remains 65 /100 variables (removed 35) and now considering 104/161 (removed 57) transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 22:48:19] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-13 22:48:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/100 places, 104/161 transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 22:48:19] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1864 ms. (steps per millisecond=536 ) properties (out of 16) seen :349
FORMULA JoinFreeModules-PT-0020-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=1067 ) properties (out of 14) seen :219
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 14) seen :219
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 14) seen :213
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 14) seen :223
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 14) seen :224
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 14) seen :229
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 14) seen :218
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 14) seen :228
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 14) seen :218
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 14) seen :220
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 14) seen :221
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 913 ms. (steps per millisecond=1095 ) properties (out of 14) seen :206
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 14) seen :212
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 14) seen :211
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 22:48:34] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-13 22:48:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:34] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-13 22:48:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 22:48:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:48:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:48:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:48:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:48:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:48:35] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 22:48:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:48:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:48:35] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:48:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-13 22:48:35] [INFO ] Added : 25 causal constraints over 6 iterations in 92 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:48:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:48:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:35] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:48:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:48:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:48:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:48:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:48:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:48:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:48:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:36] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-13 22:48:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:48:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:48:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:48:37] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:37] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:48:37] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:48:37] [INFO ] Added : 23 causal constraints over 6 iterations in 69 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 22:48:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:37] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:48:37] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:48:37] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-13 22:48:37] [INFO ] Added : 23 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 22:48:37] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:48:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:37] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-13 22:48:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:48:37] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:48:37] [INFO ] Added : 23 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [22, 22, 22, 22, 23, 22, 22, 22, 22, 22, 22, 23, 23, 23] Max seen :[22, 22, 22, 22, 21, 22, 22, 22, 22, 22, 22, 21, 21, 21]
FORMULA JoinFreeModules-PT-0020-UpperBounds-12 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-11 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-10 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-09 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-08 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-07 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-04 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-03 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-02 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-01 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 20 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 20 /65 variables (removed 45) and now considering 32/104 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/65 places, 32/104 transitions.
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:48:37] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 4) seen :85
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 4) seen :77
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 4) seen :79
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 4) seen :81
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=2976 ) properties (out of 4) seen :80
// Phase 1: matrix 32 rows 20 cols
[2023-03-13 22:48:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 22:48:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 22:48:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:48:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 22:48:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:48:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:48:40] [INFO ] Added : 23 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 42 ms.
[2023-03-13 22:48:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:48:40] [INFO ] Added : 14 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 11 ms.
[2023-03-13 22:48:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:48:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:48:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:48:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:48:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:40] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:48:40] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [23, 23, 22, 23] Max seen :[21, 21, 22, 21]
FORMULA JoinFreeModules-PT-0020-UpperBounds-14 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 32/32 transitions.
Graph (complete) has 48 edges and 20 vertex of which 15 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 15 /20 variables (removed 5) and now considering 24/32 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 24/32 transitions.
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:40] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 3) seen :63
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=3676 ) properties (out of 3) seen :63
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=3802 ) properties (out of 3) seen :62
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=3597 ) properties (out of 3) seen :63
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-13 22:48:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:48:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:48:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 22:48:41] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:41] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:48:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:48:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 22:48:41] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 13 ms.
[2023-03-13 22:48:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:48:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:48:41] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:41] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:48:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 22:48:42] [INFO ] Added : 17 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 16 ms.
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:42] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:48:42] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [23, 23, 23] Max seen :[21, 21, 21]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 22:48:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-13 22:48:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 24/24 transitions.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-05
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :21
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 22:48:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 22:48:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:42] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:48:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-13 22:48:42] [INFO ] Added : 16 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:42] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=3623 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=5586 ) properties (out of 1) seen :21
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:48:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:48:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:48:42] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:48:42] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:48:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-13 22:48:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-05 in 739 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-13
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :21
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 22:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:48:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:43] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:48:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 22:48:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:43] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:48:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:48:43] [INFO ] Added : 17 causal constraints over 6 iterations in 76 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=3558 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :21
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:48:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:48:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:48:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:48:43] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:43] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:48:43] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-13 22:48:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-13 in 747 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-15
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:43] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :21
// Phase 1: matrix 24 rows 15 cols
[2023-03-13 22:48:43] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-13 22:48:43] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:48:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:43] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:48:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 22:48:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:48:43] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:48:43] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 24/24 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /15 variables (removed 10) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/15 places, 8/24 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:43] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=3389 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :21
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:48:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:48:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:48:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:48:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:48:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:48:44] [INFO ] Added : 6 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:48:44] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:48:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-13 22:48:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:48:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:48:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-15 in 723 ms.
[2023-03-13 22:48:44] [INFO ] Flatten gal took : 18 ms
[2023-03-13 22:48:44] [INFO ] Applying decomposition
[2023-03-13 22:48:44] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16027161985719196215.txt' '-o' '/tmp/graph16027161985719196215.bin' '-w' '/tmp/graph16027161985719196215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16027161985719196215.bin' '-l' '-1' '-v' '-w' '/tmp/graph16027161985719196215.weights' '-q' '0' '-e' '0.001'
[2023-03-13 22:48:44] [INFO ] Decomposing Gal with order
[2023-03-13 22:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 22:48:44] [INFO ] Flatten gal took : 31 ms
[2023-03-13 22:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-13 22:48:44] [INFO ] Time to serialize gal into /tmp/UpperBounds3358577141607380610.gal : 1 ms
[2023-03-13 22:48:44] [INFO ] Time to serialize properties into /tmp/UpperBounds17880512065734718491.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3358577141607380610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17880512065734718491.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds17880512065734718491.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,4.92168e+12,0.685017,26316,124,96,14562,17441,66,125975,44,153160,0
Total reachable state count : 4921675101000

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 21
Bounds property JoinFreeModules-PT-0020-UpperBounds-05 :0 <= i2.u4.p97 <= 21
FORMULA JoinFreeModules-PT-0020-UpperBounds-05 21 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-0020-UpperBounds-05,0,0.689128,26316,1,0,14562,17441,101,125975,75,153160,50
Min sum of variable value : 0
Maximum sum along a path : 21
Bounds property JoinFreeModules-PT-0020-UpperBounds-13 :0 <= i1.u2.p92 <= 21
FORMULA JoinFreeModules-PT-0020-UpperBounds-13 21 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-0020-UpperBounds-13,0,0.689257,26316,1,0,14562,17441,108,125975,75,153160,56
Min sum of variable value : 0
Maximum sum along a path : 21
Bounds property JoinFreeModules-PT-0020-UpperBounds-15 :0 <= i0.u1.p37 <= 21
FORMULA JoinFreeModules-PT-0020-UpperBounds-15 21 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-0020-UpperBounds-15,0,0.694663,26316,1,0,14562,17441,117,125975,75,153160,113
Total runtime 35857 ms.

BK_STOP 1678747725632

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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