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.r197-smll-162089452000211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SafeBus-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089452000211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 14:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 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 SafeBus-COL-03-UpperBounds-00
FORMULA_NAME SafeBus-COL-03-UpperBounds-01
FORMULA_NAME SafeBus-COL-03-UpperBounds-02
FORMULA_NAME SafeBus-COL-03-UpperBounds-03
FORMULA_NAME SafeBus-COL-03-UpperBounds-04
FORMULA_NAME SafeBus-COL-03-UpperBounds-05
FORMULA_NAME SafeBus-COL-03-UpperBounds-06
FORMULA_NAME SafeBus-COL-03-UpperBounds-07
FORMULA_NAME SafeBus-COL-03-UpperBounds-08
FORMULA_NAME SafeBus-COL-03-UpperBounds-09
FORMULA_NAME SafeBus-COL-03-UpperBounds-10
FORMULA_NAME SafeBus-COL-03-UpperBounds-11
FORMULA_NAME SafeBus-COL-03-UpperBounds-12
FORMULA_NAME SafeBus-COL-03-UpperBounds-13
FORMULA_NAME SafeBus-COL-03-UpperBounds-14
FORMULA_NAME SafeBus-COL-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621020768840

Running Version 0
[2021-05-14 19:32:51] [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 19:32:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:32:51] [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 19:32:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 19:32:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 907 ms
[2021-05-14 19:32:52] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2021-05-14 19:32:52] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2021-05-14 19:32:52] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions in 4 ms.
[2021-05-14 19:32:52] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_9854558520306027943.dot
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2021-05-14 19:32:52] [INFO ] Computed 7 place invariants in 6 ms
FORMULA SafeBus-COL-03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-14 19:32:52] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 13 ms.
[2021-05-14 19:32:52] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 14 rows 17 cols
[2021-05-14 19:32:52] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-14 19:32:52] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2021-05-14 19:32:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2021-05-14 19:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-14 19:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:52] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-14 19:32:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-14 19:32:52] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:52] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-14 19:32:52] [INFO ] Added : 11 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 19:32:52] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-14 19:32:52] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-14 19:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-14 19:32:53] [INFO ] Added : 10 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 8 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 10 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 19:32:53] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 19:32:53] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 12 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 19:32:53] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 19:32:53] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 19:32:53] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 17 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 19:32:53] [INFO ] Added : 10 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 19:32:53] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 19:32:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-14 19:32:53] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 19:32:54] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1, 3, 1, 1, 1, 1, 3, 3, 1, 3]
[2021-05-14 19:32:54] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 5 ms.
[2021-05-14 19:32:54] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7658561236069309009.dot
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :15
FORMULA SafeBus-COL-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :4
[2021-05-14 19:32:54] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 19:32:54] [INFO ] Computed 17 place invariants in 12 ms
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 19:32:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:32:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:32:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:32:54] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
[2021-05-14 19:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:32:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:32:54] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
[2021-05-14 19:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-14 19:32:54] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 9 ms.
[2021-05-14 19:32:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2021-05-14 19:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-14 19:32:54] [INFO ] Added : 26 causal constraints over 6 iterations in 165 ms. Result :sat
Minimization took 28 ms.
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:54] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-14 19:32:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:54] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:32:54] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:32:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2021-05-14 19:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-14 19:32:54] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 7 ms.
[2021-05-14 19:32:55] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2021-05-14 19:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-14 19:32:55] [INFO ] Added : 25 causal constraints over 5 iterations in 116 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [2, 3, 3] Max seen :[2, 2, 2]
FORMULA SafeBus-COL-03-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 8100 steps, including 739 resets, run finished after 25 ms. (steps per millisecond=324 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 16900 steps, including 992 resets, run finished after 53 ms. (steps per millisecond=318 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 17 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 19:32:55] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 2) seen :3
[2021-05-14 19:32:58] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 19:32:58] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-14 19:32:58] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:58] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-14 19:32:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:32:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:32:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:32:58] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2021-05-14 19:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-14 19:32:58] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 10 ms.
[2021-05-14 19:32:58] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-14 19:32:58] [INFO ] Added : 26 causal constraints over 6 iterations in 188 ms. Result :sat
Minimization took 36 ms.
[2021-05-14 19:32:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:32:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:32:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:32:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:32:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2021-05-14 19:32:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2021-05-14 19:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-14 19:32:58] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 15 ms.
[2021-05-14 19:32:58] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-14 19:32:58] [INFO ] Added : 25 causal constraints over 5 iterations in 170 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [3, 3] Max seen :[2, 2]
Incomplete Parikh walk after 8100 steps, including 754 resets, run finished after 56 ms. (steps per millisecond=144 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 16900 steps, including 986 resets, run finished after 52 ms. (steps per millisecond=325 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2021-05-14 19:32:59] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2021-05-14 19:32:59] [INFO ] Computed 17 place invariants in 7 ms
[2021-05-14 19:32:59] [INFO ] Implicit Places using invariants in 114 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
[2021-05-14 19:32:59] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-14 19:32:59] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 51 cols
[2021-05-14 19:32:59] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:32:59] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned [7, 10, 13, 17, 20, 23, 27, 30, 33]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions :[33, 30, 27, 23, 20, 17, 13, 10, 7]
Starting structural reductions, iteration 1 : 51/54 places, 82/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 85
Applied a total of 6 rules in 19 ms. Remains 48 /51 variables (removed 3) and now considering 85/82 (removed -3) transitions.
[2021-05-14 19:32:59] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:32:59] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:32:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2021-05-14 19:32:59] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:32:59] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:32:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:32:59] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/54 places, 85/91 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:32:59] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1760 ms. (steps per millisecond=568 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 2) seen :3
[2021-05-14 19:33:03] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:03] [INFO ] Computed 14 place invariants in 10 ms
[2021-05-14 19:33:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-14 19:33:03] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 21 ms returned sat
[2021-05-14 19:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:03] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 19:33:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:33:03] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-14 19:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:03] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-14 19:33:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:33:03] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2021-05-14 19:33:03] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 11 ms.
[2021-05-14 19:33:03] [INFO ] Added : 20 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 37 ms.
[2021-05-14 19:33:03] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-14 19:33:03] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-14 19:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:03] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 19:33:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:04] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:33:04] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 13 ms.
[2021-05-14 19:33:04] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2021-05-14 19:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2021-05-14 19:33:04] [INFO ] Added : 27 causal constraints over 6 iterations in 191 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [3, 3] Max seen :[2, 2]
Incomplete Parikh walk after 12900 steps, including 406 resets, run finished after 38 ms. (steps per millisecond=339 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 12100 steps, including 345 resets, run finished after 22 ms. (steps per millisecond=550 ) properties (out of 2) seen :4 could not realise parikh vector
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2021-05-14 19:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:04] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:33:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2021-05-14 19:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:04] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:33:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:04] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2021-05-14 19:33:04] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:04] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:33:04] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Starting property specific reduction for SafeBus-COL-03-UpperBounds-12
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:04] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
[2021-05-14 19:33:04] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:04] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:33:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:04] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:33:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-14 19:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:04] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:33:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:33:04] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2021-05-14 19:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-14 19:33:04] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 12 ms.
[2021-05-14 19:33:05] [INFO ] Added : 20 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Incomplete Parikh walk after 12100 steps, including 348 resets, run finished after 35 ms. (steps per millisecond=345 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:05] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1682 ms. (steps per millisecond=594 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 1) seen :2
[2021-05-14 19:33:07] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:07] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:33:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:33:07] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-14 19:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:07] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-14 19:33:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:33:07] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-14 19:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:07] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-14 19:33:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:33:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-14 19:33:07] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 11 ms.
[2021-05-14 19:33:07] [INFO ] Added : 20 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Incomplete Parikh walk after 12100 steps, including 349 resets, run finished after 34 ms. (steps per millisecond=355 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2021-05-14 19:33:07] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:33:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2021-05-14 19:33:07] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:33:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:08] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2021-05-14 19:33:08] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:33:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:08] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:33:08] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Ending property specific reduction for SafeBus-COL-03-UpperBounds-12 in 3500 ms.
Starting property specific reduction for SafeBus-COL-03-UpperBounds-15
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:08] [INFO ] Computed 14 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :2
[2021-05-14 19:33:08] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:08] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 19:33:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-14 19:33:08] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2021-05-14 19:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:08] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-14 19:33:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-14 19:33:08] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2021-05-14 19:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:08] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-14 19:33:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:08] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:33:08] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 12 ms.
[2021-05-14 19:33:08] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-14 19:33:08] [INFO ] Added : 27 causal constraints over 6 iterations in 179 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Incomplete Parikh walk after 12900 steps, including 394 resets, run finished after 39 ms. (steps per millisecond=330 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:08] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 1) seen :2
[2021-05-14 19:33:11] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:11] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:33:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-14 19:33:11] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-14 19:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:11] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-14 19:33:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:33:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-14 19:33:11] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-14 19:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:33:11] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-14 19:33:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:11] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2021-05-14 19:33:11] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 12 ms.
[2021-05-14 19:33:11] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2021-05-14 19:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-14 19:33:11] [INFO ] Added : 27 causal constraints over 6 iterations in 178 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Incomplete Parikh walk after 12900 steps, including 402 resets, run finished after 37 ms. (steps per millisecond=348 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2021-05-14 19:33:11] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:11] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:33:11] [INFO ] Implicit Places using invariants in 101 ms returned []
[2021-05-14 19:33:11] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:11] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-14 19:33:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-14 19:33:12] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2021-05-14 19:33:12] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:33:12] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2021-05-14 19:33:12] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-14 19:33:12] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 85/85 transitions.
Ending property specific reduction for SafeBus-COL-03-UpperBounds-15 in 3921 ms.
[2021-05-14 19:33:12] [INFO ] Flatten gal took : 79 ms
[2021-05-14 19:33:12] [INFO ] Applying decomposition
[2021-05-14 19:33:12] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9597594742162718256.txt, -o, /tmp/graph9597594742162718256.bin, -w, /tmp/graph9597594742162718256.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9597594742162718256.bin, -l, -1, -v, -w, /tmp/graph9597594742162718256.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:33:12] [INFO ] Decomposing Gal with order
[2021-05-14 19:33:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:33:12] [INFO ] Removed a total of 79 redundant transitions.
[2021-05-14 19:33:12] [INFO ] Flatten gal took : 76 ms
[2021-05-14 19:33:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 11 ms.
[2021-05-14 19:33:12] [INFO ] Time to serialize gal into /tmp/UpperBounds6222953446061041596.gal : 8 ms
[2021-05-14 19:33:12] [INFO ] Time to serialize properties into /tmp/UpperBounds11423701768998369155.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6222953446061041596.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11423701768998369155.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds6222953446061041596.gal -t CGAL -reachable-file /tmp/UpperBounds11423701768998369155.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11423701768998369155.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4182,0.469068,12228,2,3777,5,38930,6,0,294,23532,0
Total reachable state count : 4182

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property SafeBus-COL-03-UpperBounds-12 :0 <= gi2.gu3.RMC_0+gi0.gu4.RMC_1+gi0.gu0.RMC_2 <= 2
FORMULA SafeBus-COL-03-UpperBounds-12 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SafeBus-COL-03-UpperBounds-12,0,0.479195,12228,1,0,7,38930,9,1,444,23532,4
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property SafeBus-COL-03-UpperBounds-15 :0 <= gi2.gu3.wait_msg_0+gi0.gu4.wait_msg_1+gi0.gu0.wait_msg_2 <= 2
FORMULA SafeBus-COL-03-UpperBounds-15 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SafeBus-COL-03-UpperBounds-15,0,0.487446,12228,1,0,8,38930,10,1,543,23532,5

BK_STOP 1621020794606

--------------------
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="SafeBus-COL-03"
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 SafeBus-COL-03, 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 r197-smll-162089452000211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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