fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r255-tall-167856440300045
Last Updated
May 14, 2023

About the Execution of 2022-gold for LamportFastMutEx-COL-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
537.739 29209.00 41419.00 151.70 4 12 4 1 3 4 12 1 1 3 4 3 4 3 3 4 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-167856440300045.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 LamportFastMutEx-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:39 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:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 40K 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 LamportFastMutEx-COL-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678749814397

Running Version 202205111006
[2023-03-13 23:23:35] [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 23:23:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:23:35] [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.
[2023-03-13 23:23:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 23:23:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 605 ms
[2023-03-13 23:23:36] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-13 23:23:36] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2023-03-13 23:23:36] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:23:36] [INFO ] Computed 2 place invariants in 6 ms
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:23:36] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:23:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:23:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:23:36] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 23:23:36] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:23:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:36] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:23:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:23:36] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:36] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:36] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:36] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:23:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 23:23:37] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 13 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:37] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:37] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:37] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:37] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:37] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:37] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:37] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:37] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [4, 16, 4, 4, 16, 4, 4, 4, 4, 4, 4, 4]
Domain [pid(5), pid(5)] 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.
[2023-03-13 23:23:37] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 16 ms.
[2023-03-13 23:23:37] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :51
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :34
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :38
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :39
[2023-03-13 23:23:37] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2023-03-13 23:23:37] [INFO ] Computed 26 place invariants in 8 ms
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-13 23:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:23:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-13 23:23:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:23:37] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
[2023-03-13 23:23:37] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 3 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 436 ms
[2023-03-13 23:23:38] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 23:23:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-13 23:23:38] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:23:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 496 ms
[2023-03-13 23:23:38] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-13 23:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:39] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-13 23:23:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-13 23:23:39] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 348 ms
[2023-03-13 23:23:39] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 13 ms.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2023-03-13 23:23:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 141 ms
[2023-03-13 23:23:39] [INFO ] Added : 44 causal constraints over 10 iterations in 284 ms. Result :sat
Minimization took 49 ms.
[2023-03-13 23:23:39] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:39] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-13 23:23:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:39] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 23:23:39] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:23:39] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 12 ms.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 302 ms
[2023-03-13 23:23:40] [INFO ] Added : 67 causal constraints over 15 iterations in 489 ms. Result :sat
Minimization took 70 ms.
[2023-03-13 23:23:40] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:40] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 23:23:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:40] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 23:23:40] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:23:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 324 ms
[2023-03-13 23:23:40] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:41] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-13 23:23:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:41] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:41] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 362 ms
[2023-03-13 23:23:41] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:41] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 23:23:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:41] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:41] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:23:41] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 11 ms.
[2023-03-13 23:23:41] [INFO ] Added : 24 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 23:23:41] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 23:23:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:41] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:41] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 23:23:41] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:23:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 9 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 314 ms
[2023-03-13 23:23:42] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:42] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 23:23:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:42] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:42] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-13 23:23:42] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:23:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 592 ms
Current structural bounds on expressions (after SMT) : [12, 3, 16, 4, 3, 3, 4, 3, 3] Max seen :[12, 3, 11, 1, 3, 3, 3, 3, 3]
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 180/180 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 176
Applied a total of 8 rules in 35 ms. Remains 98 /102 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/102 places, 176/180 transitions.
Normalized transition count is 140 out of 176 initially.
// Phase 1: matrix 140 rows 98 cols
[2023-03-13 23:23:43] [INFO ] Computed 26 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1625 ms. (steps per millisecond=615 ) properties (out of 3) seen :17
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 2) seen :13
[2023-03-13 23:23:45] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 98 cols
[2023-03-13 23:23:45] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-13 23:23:45] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 23:23:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:45] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 23:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-13 23:23:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-13 23:23:45] [INFO ] [Nat]Added 40 Read/Feed constraints in 15 ms returned sat
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 340 ms
[2023-03-13 23:23:46] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 23:23:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:46] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 23:23:46] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:23:46] [INFO ] Computed and/alt/rep : 124/508/124 causal constraints (skipped 12 transitions) in 11 ms.
[2023-03-13 23:23:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-13 23:23:46] [INFO ] Added : 35 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [12, 4] Max seen :[12, 1]
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 176/176 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 94 transition count 172
Applied a total of 8 rules in 10 ms. Remains 94 /98 variables (removed 4) and now considering 172/176 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/98 places, 172/176 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 94 cols
[2023-03-13 23:23:46] [INFO ] Computed 26 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1333 ms. (steps per millisecond=750 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :1
[2023-03-13 23:23:48] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2023-03-13 23:23:48] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-13 23:23:48] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:48] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 23:23:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 23:23:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-13 23:23:48] [INFO ] [Nat]Added 40 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:23:48] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:23:48] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:23:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-03-13 23:23:48] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 11 ms.
[2023-03-13 23:23:48] [INFO ] Added : 28 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-13 23:23:48] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2023-03-13 23:23:49] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-13 23:23:49] [INFO ] Implicit Places using invariants in 84 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 90/94 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:49] [INFO ] Computed 22 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1246 ms. (steps per millisecond=802 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 1) seen :1
[2023-03-13 23:23:50] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:50] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-13 23:23:50] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:23:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:23:50] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-13 23:23:50] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:23:50] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 9 ms.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:23:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 379 ms
[2023-03-13 23:23:51] [INFO ] Added : 75 causal constraints over 15 iterations in 568 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-13 23:23:51] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:51] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-13 23:23:51] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-13 23:23:51] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:51] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-13 23:23:51] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-13 23:23:51] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-13 23:23:51] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 23:23:51] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:51] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-13 23:23:51] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Starting property specific reduction for LamportFastMutEx-COL-4-UpperBounds-07
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:51] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) 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
[2023-03-13 23:23:51] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:51] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-13 23:23:51] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:52] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-13 23:23:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:52] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:52] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 23:23:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-13 23:23:52] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:23:52] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:23:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 403 ms
[2023-03-13 23:23:52] [INFO ] Added : 75 causal constraints over 15 iterations in 562 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:52] [INFO ] Computed 22 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1232 ms. (steps per millisecond=811 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 1) seen :1
[2023-03-13 23:23:54] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:54] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-13 23:23:54] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-13 23:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:23:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:54] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:23:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-13 23:23:54] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:23:54] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-13 23:23:54] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:23:54] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:23:55] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:23:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:23:55] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:23:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:23:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 396 ms
[2023-03-13 23:23:55] [INFO ] Added : 75 causal constraints over 15 iterations in 558 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-13 23:23:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:55] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-13 23:23:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-13 23:23:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:55] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-13 23:23:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-13 23:23:55] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-13 23:23:55] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 23:23:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-13 23:23:55] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-13 23:23:55] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 172/172 transitions.
Ending property specific reduction for LamportFastMutEx-COL-4-UpperBounds-07 in 3677 ms.
[2023-03-13 23:23:55] [INFO ] Flatten gal took : 39 ms
[2023-03-13 23:23:55] [INFO ] Applying decomposition
[2023-03-13 23:23:55] [INFO ] Flatten gal took : 16 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/graph3151501256507105258.txt' '-o' '/tmp/graph3151501256507105258.bin' '-w' '/tmp/graph3151501256507105258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3151501256507105258.bin' '-l' '-1' '-v' '-w' '/tmp/graph3151501256507105258.weights' '-q' '0' '-e' '0.001'
[2023-03-13 23:23:55] [INFO ] Decomposing Gal with order
[2023-03-13 23:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 23:23:55] [INFO ] Removed a total of 219 redundant transitions.
[2023-03-13 23:23:55] [INFO ] Flatten gal took : 36 ms
[2023-03-13 23:23:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 6 ms.
[2023-03-13 23:23:55] [INFO ] Time to serialize gal into /tmp/UpperBounds9946321283590620041.gal : 6 ms
[2023-03-13 23:23:55] [INFO ] Time to serialize properties into /tmp/UpperBounds17937758845601251452.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/UpperBounds9946321283590620041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17937758845601251452.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...296
Loading property file /tmp/UpperBounds17937758845601251452.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,1.4985e+06,7.54724,208236,2,42326,5,864250,6,0,557,698860,0
Total reachable state count : 1498496

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-COL-4-UpperBounds-07 :0 <= gi6.gu14.P_CS_21_1+gi4.gu15.P_CS_21_2+gi5.gu16.P_CS_21_3+gi0.gu17.P_CS_21_4 <= 1
FORMULA LamportFastMutEx-COL-4-UpperBounds-07 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-4-UpperBounds-07,0,7.59431,208236,1,0,7,864250,9,1,783,698860,4
Total runtime 27946 ms.

BK_STOP 1678749843606

--------------------
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-4"
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 LamportFastMutEx-COL-4, 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-167856440300045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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