Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 6.7K Apr 29 19:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 19:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 19:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 19:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 39K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652776240948

Running Version 202205111006
[2022-05-17 08:30:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 08:30:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:30:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 08:30:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 08:30:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2022-05-17 08:30:42] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2022-05-17 08:30:42] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 6 ms.
[2022-05-17 08:30:42] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2022-05-17 08:30:42] [INFO ] Computed 2 place invariants in 7 ms
FORMULA LamportFastMutEx-COL-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 17 rows 15 cols
[2022-05-17 08:30:42] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-17 08:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-17 08:30:43] [INFO ] Added : 11 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:43] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:43] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-17 08:30:43] [INFO ] Added : 5 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 08:30:43] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:43] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 08:30:43] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 08:30:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-17 08:30:43] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:43] [INFO ] Added : 5 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 10 ms.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 08:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 08:30:44] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 08:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 08:30:44] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:44] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 08:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:44] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 08:30:44] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:30:44] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 9, 9, 3, 3, 3, 3, 3]
Domain [pid(4), pid(4)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 08:30:44] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 16 ms.
[2022-05-17 08:30:44] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :35
FORMULA LamportFastMutEx-COL-3-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :13
[2022-05-17 08:30:44] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2022-05-17 08:30:44] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-17 08:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-17 08:30:44] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-17 08:30:44] [INFO ] [Nat]Added 27 Read/Feed constraints in 11 ms returned sat
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2022-05-17 08:30:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 335 ms
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:44] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 08:30:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:45] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 444 ms
[2022-05-17 08:30:45] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 08:30:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-17 08:30:45] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2022-05-17 08:30:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 418 ms
[2022-05-17 08:30:46] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 08:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 08:30:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 08:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 08:30:46] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 5 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 290 ms
[2022-05-17 08:30:46] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:46] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 3 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2022-05-17 08:30:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 509 ms
[2022-05-17 08:30:47] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 219 ms
[2022-05-17 08:30:47] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 08:30:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:47] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2022-05-17 08:30:47] [INFO ] Computed and/alt/rep : 93/306/87 causal constraints (skipped 6 transitions) in 8 ms.
[2022-05-17 08:30:47] [INFO ] Added : 34 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 32 ms.
[2022-05-17 08:30:47] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 08:30:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:47] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2022-05-17 08:30:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 236 ms
Current structural bounds on expressions (after SMT) : [2, 2, 2, 6, 6, 2, 3, 2] Max seen :[2, 2, 2, 6, 6, 2, 1, 2]
FORMULA LamportFastMutEx-COL-3-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-3-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 71/71 places, 114/114 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 111
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 108
Applied a total of 12 rules in 26 ms. Remains 65 /71 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/71 places, 108/114 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 65 cols
[2022-05-17 08:30:47] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 1) seen :1
[2022-05-17 08:30:49] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 65 cols
[2022-05-17 08:30:49] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 08:30:49] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 08:30:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:49] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 08:30:49] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-05-17 08:30:49] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2022-05-17 08:30:49] [INFO ] Computed and/alt/rep : 78/291/78 causal constraints (skipped 9 transitions) in 7 ms.
[2022-05-17 08:30:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-17 08:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-17 08:30:49] [INFO ] Added : 30 causal constraints over 7 iterations in 110 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2022-05-17 08:30:49] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 65 cols
[2022-05-17 08:30:49] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 08:30:49] [INFO ] Implicit Places using invariants in 64 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 62/65 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/65 places, 108/108 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:49] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 1) seen :1
[2022-05-17 08:30:51] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 08:30:51] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:51] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 08:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-17 08:30:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-17 08:30:51] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-05-17 08:30:51] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 6 ms.
[2022-05-17 08:30:51] [INFO ] Added : 25 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2022-05-17 08:30:51] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 08:30:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-17 08:30:51] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 08:30:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-17 08:30:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2022-05-17 08:30:51] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 08:30:51] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 08:30:51] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 108/108 transitions.
Starting property specific reduction for LamportFastMutEx-COL-3-UpperBounds-13
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2022-05-17 08:30:51] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 08:30:51] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 08:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 08:30:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-17 08:30:51] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-05-17 08:30:51] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 5 ms.
[2022-05-17 08:30:51] [INFO ] Added : 25 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 108/108 transitions.
Normalized transition count is 90 out of 108 initially.
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:51] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :1
[2022-05-17 08:30:53] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:53] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 08:30:53] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 08:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 08:30:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:30:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 08:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:30:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-17 08:30:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-17 08:30:53] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2022-05-17 08:30:53] [INFO ] Computed and/alt/rep : 78/267/78 causal constraints (skipped 9 transitions) in 6 ms.
[2022-05-17 08:30:53] [INFO ] Added : 25 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[1]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 108/108 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2022-05-17 08:30:53] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:53] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-17 08:30:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2022-05-17 08:30:53] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:53] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 08:30:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-17 08:30:53] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-05-17 08:30:53] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 08:30:53] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2022-05-17 08:30:53] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 08:30:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 108/108 transitions.
Ending property specific reduction for LamportFastMutEx-COL-3-UpperBounds-13 in 2038 ms.
[2022-05-17 08:30:53] [INFO ] Flatten gal took : 33 ms
[2022-05-17 08:30:53] [INFO ] Applying decomposition
[2022-05-17 08:30:53] [INFO ] Flatten gal took : 13 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/graph2984710452074467309.txt' '-o' '/tmp/graph2984710452074467309.bin' '-w' '/tmp/graph2984710452074467309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2984710452074467309.bin' '-l' '-1' '-v' '-w' '/tmp/graph2984710452074467309.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:30:53] [INFO ] Decomposing Gal with order
[2022-05-17 08:30:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:30:54] [INFO ] Removed a total of 103 redundant transitions.
[2022-05-17 08:30:54] [INFO ] Flatten gal took : 53 ms
[2022-05-17 08:30:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 9 ms.
[2022-05-17 08:30:54] [INFO ] Time to serialize gal into /tmp/UpperBounds12265333939333565768.gal : 15 ms
[2022-05-17 08:30:54] [INFO ] Time to serialize properties into /tmp/UpperBounds10436722105929854745.prop : 0 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/UpperBounds12265333939333565768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10436722105929854745.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...297
Loading property file /tmp/UpperBounds10436722105929854745.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\_flatf,15512,0.278959,15024,2,4415,5,46015,6,0,384,41018,0
Total reachable state count : 15512

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-COL-3-UpperBounds-13 :0 <= gi5.gu10.P_CS_21_1+gi5.gu11.P_CS_21_2+gi4.gu12.P_CS_21_3 <= 1
FORMULA LamportFastMutEx-COL-3-UpperBounds-13 1 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
LamportFastMutEx-COL-3-UpperBounds-13,0,0.282796,15024,1,0,7,46015,9,1,553,41018,4
Total runtime 12338 ms.

BK_STOP 1652776254485

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-3, 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 r132-tall-165271820800349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 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 ;