Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1621007332251

Running Version 0
[2021-05-14 15:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 15:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:48:54] [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.
[2021-05-14 15:48:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:48:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2021-05-14 15:48:55] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-14 15:48:55] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 4 ms.
[2021-05-14 15:48:55] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13004304115927741283.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:48:55] [INFO ] Computed 1 place invariants in 9 ms
FORMULA Peterson-COL-2-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-14 15:48:55] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 14 ms.
[2021-05-14 15:48:55] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:48:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 4 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:48:55] [INFO ] Added : 12 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:48:55] [INFO ] Added : 12 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-14 15:48:55] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-14 15:48:55] [INFO ] Added : 12 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 4 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:48:55] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:55] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:48:55] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:48:55] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]
[2021-05-14 15:48:55] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 4 ms.
[2021-05-14 15:48:55] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_16824657124919354476.dot
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :29
FORMULA Peterson-COL-2-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :15
FORMULA Peterson-COL-2-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :9
[2021-05-14 15:48:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 15:48:56] [INFO ] Computed 11 place invariants in 9 ms
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 15:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 15:48:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 15:48:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 200 ms
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 15:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 125 ms
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:56] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:56] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 15:48:56] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 0 ms to minimize.
[2021-05-14 15:48:56] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 37 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 22 places in 16 ms of which 1 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 349 ms
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:48:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 40 places in 20 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 30 places in 16 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 26 places in 16 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 37 places in 21 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 311 ms
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 15:48:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:48:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 142 ms
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 15:48:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:48:57] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-14 15:48:57] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 15:48:57] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 5 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 8 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 261 ms
[2021-05-14 15:48:58] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 7 ms.
[2021-05-14 15:48:58] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2021-05-14 15:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-14 15:48:58] [INFO ] Added : 74 causal constraints over 15 iterations in 160 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [2, 2, 1, 1, 2, 3] Max seen :[2, 2, 1, 1, 2, 2]
FORMULA Peterson-COL-2-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 22900 steps, including 382 resets, run finished after 89 ms. (steps per millisecond=257 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions, 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 19 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/102 places, 90/126 transitions.
Normalized transition count is 84 out of 90 initially.
// Phase 1: matrix 84 rows 66 cols
[2021-05-14 15:48:58] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1978 ms. (steps per millisecond=505 ) 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.

BK_STOP 1621007341417

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r140-tall-162089128100555"
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 ;