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.r266-smll-167863541100557.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 marciexred
Input is Peterson-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541100557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 22:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 21:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 21:59 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:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 22:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:23 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 Peterson-COL-2-UpperBounds-00
FORMULA_NAME Peterson-COL-2-UpperBounds-01
FORMULA_NAME Peterson-COL-2-UpperBounds-02
FORMULA_NAME Peterson-COL-2-UpperBounds-03
FORMULA_NAME Peterson-COL-2-UpperBounds-04
FORMULA_NAME Peterson-COL-2-UpperBounds-05
FORMULA_NAME Peterson-COL-2-UpperBounds-06
FORMULA_NAME Peterson-COL-2-UpperBounds-07
FORMULA_NAME Peterson-COL-2-UpperBounds-08
FORMULA_NAME Peterson-COL-2-UpperBounds-09
FORMULA_NAME Peterson-COL-2-UpperBounds-10
FORMULA_NAME Peterson-COL-2-UpperBounds-11
FORMULA_NAME Peterson-COL-2-UpperBounds-12
FORMULA_NAME Peterson-COL-2-UpperBounds-13
FORMULA_NAME Peterson-COL-2-UpperBounds-14
FORMULA_NAME Peterson-COL-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679143099926

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 12:38:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 12:38:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:38:23] [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-18 12:38:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 12:38:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 958 ms
[2023-03-18 12:38:24] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
[2023-03-18 12:38:24] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2023-03-18 12:38:24] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-18 12:38:24] [INFO ] Computed 1 place invariants in 5 ms
FORMULA Peterson-COL-2-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-18 12:38:24] [INFO ] Invariant cache hit.
[2023-03-18 12:38:24] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-18 12:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:24] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-18 12:38:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 12:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-18 12:38:24] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-18 12:38:24] [INFO ] Added : 12 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 16 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 12:38:25] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 12:38:25] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 12:38:25] [INFO ] Added : 12 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 12:38:25] [INFO ] Added : 11 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 10 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 12:38:25] [INFO ] Added : 12 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 12:38:25] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Minimization took 6 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 12:38:25] [INFO ] Added : 11 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 9 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 12:38:25] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-18 12:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-18 12:38:25] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 12:38:26] [INFO ] Added : 12 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 9 ms.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-18 12:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-18 12:38:26] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 12:38:26] [INFO ] Added : 12 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-18 12:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-18 12:38:26] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 12:38:26] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-18 12:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-18 12:38:26] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 12:38:26] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-18 12:38:26] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 12:38:26] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2023-03-18 12:38:26] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 38 ms.
[2023-03-18 12:38:26] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :31
FORMULA Peterson-COL-2-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :1
[2023-03-18 12:38:26] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-18 12:38:26] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-18 12:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:26] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-18 12:38:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-18 12:38:26] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2023-03-18 12:38:26] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 5 ms to minimize.
[2023-03-18 12:38:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2023-03-18 12:38:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1058 ms
[2023-03-18 12:38:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 12:38:27] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 12:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:28] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-18 12:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 12:38:28] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:28] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-18 12:38:28] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-18 12:38:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1096 ms
[2023-03-18 12:38:29] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 12:38:29] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 12:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:29] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-18 12:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 12:38:29] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-18 12:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-18 12:38:29] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
[2023-03-18 12:38:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1058 ms
[2023-03-18 12:38:30] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-18 12:38:30] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:30] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-18 12:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 12:38:30] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:30] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-18 12:38:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-18 12:38:30] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2023-03-18 12:38:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 980 ms
[2023-03-18 12:38:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 12:38:31] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 12:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:31] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-18 12:38:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 12:38:31] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 12:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:31] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-18 12:38:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2023-03-18 12:38:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 6 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2023-03-18 12:38:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1016 ms
[2023-03-18 12:38:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 12:38:32] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:33] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-18 12:38:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 12:38:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 12:38:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 12:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 12:38:33] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-18 12:38:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2023-03-18 12:38:33] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2023-03-18 12:38:33] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-03-18 12:38:33] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-18 12:38:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2023-03-18 12:38:33] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-18 12:38:33] [INFO ] Added : 75 causal constraints over 15 iterations in 222 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 3] Max seen :[1, 1, 1, 1, 1, 2]
FORMULA Peterson-COL-2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 114
Reduce places removed 12 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 90 transition count 102
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 48 place count 78 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 47 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 66/102 places, 90/126 transitions.
Normalized transition count is 84 out of 90 initially.
// Phase 1: matrix 84 rows 66 cols
[2023-03-18 12:38:33] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1333 ms. (steps per millisecond=750 ) properties (out of 1) seen :3
FORMULA Peterson-COL-2-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11916 ms.
ITS solved all properties within timeout

BK_STOP 1679143116073

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="Peterson-COL-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Peterson-COL-2, 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 r266-smll-167863541100557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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