Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.5K Apr 29 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652953436820

Running Version 202205111006
[2022-05-19 09:43:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 09:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 09:43:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 09:43:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 09:43:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2022-05-19 09:43:58] [INFO ] Detected 1 constant HL places corresponding to 50 PT places.
[2022-05-19 09:43:58] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 5606 PT places and 6520101.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-19 09:43:58] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2022-05-19 09:43:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2022-05-19 09:43:58] [INFO ] Computed 7 place invariants in 5 ms
FORMULA SafeBus-COL-50-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 17 cols
[2022-05-19 09:43:58] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-19 09:43:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 09:43:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 09:43:59] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 9 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 2 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 2 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 09:43:59] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 8 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Added 3 Read/Feed constraints in 28 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-19 09:43:59] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:43:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 09:43:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 09:43:59] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 09:43:59] [INFO ] Added : 10 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 50, 50, 3, 1, 5, 50]
Domain [It(50), It(50)] of place AMC breaks symmetries in sort It
[2022-05-19 09:44:01] [INFO ] Unfolded HLPN to a Petri net with 5606 places and 140251 transitions 1078454 arcs in 1211 ms.
[2022-05-19 09:44:01] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 50 places in 67 ms
Reduce places removed 100 places and 100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6851 ms. (steps per millisecond=1 ) properties (out of 10) seen :154
FORMULA SafeBus-COL-50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :101
FORMULA SafeBus-COL-50-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 3) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 3) seen :51
[2022-05-19 09:44:09] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:44:11] [INFO ] Computed 205 place invariants in 1131 ms
[2022-05-19 09:44:11] [INFO ] [Real]Absence check using 101 positive place invariants in 101 ms returned sat
[2022-05-19 09:44:11] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 122 ms returned unsat
[2022-05-19 09:44:12] [INFO ] [Real]Absence check using 101 positive place invariants in 114 ms returned sat
[2022-05-19 09:44:12] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 200 ms returned unsat
[2022-05-19 09:44:12] [INFO ] [Real]Absence check using 101 positive place invariants in 107 ms returned sat
[2022-05-19 09:44:13] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 184 ms returned sat
[2022-05-19 09:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:44:17] [INFO ] [Real]Absence check using state equation in 4328 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 50] Max seen :[1, 1, 49]
FORMULA SafeBus-COL-50-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 26325 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:44:45] [INFO ] Computed 205 place invariants in 1220 ms
Finished random walk after 51892 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 62589 steps, including 0 resets, run visited all 1 properties in 5002 ms. (steps per millisecond=12 )
[2022-05-19 09:45:20] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:45:21] [INFO ] Computed 205 place invariants in 961 ms
[2022-05-19 09:45:21] [INFO ] [Real]Absence check using 101 positive place invariants in 87 ms returned sat
[2022-05-19 09:45:21] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 182 ms returned sat
[2022-05-19 09:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:46:00] [INFO ] [Real]Absence check using state equation in 38761 ms returned sat
[2022-05-19 09:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:46:01] [INFO ] [Nat]Absence check using 101 positive place invariants in 85 ms returned sat
[2022-05-19 09:46:01] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 135 ms returned sat
[2022-05-19 09:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:46:24] [INFO ] [Nat]Absence check using state equation in 22800 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 25338 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 32398 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2022-05-19 09:47:22] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:47:23] [INFO ] Computed 205 place invariants in 948 ms
[2022-05-19 09:47:38] [INFO ] Implicit Places using invariants in 16559 ms returned []
Implicit Place search using SMT only with invariants took 16572 ms to find 0 implicit places.
[2022-05-19 09:47:39] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:47:39] [INFO ] Computed 205 place invariants in 952 ms
[2022-05-19 09:48:10] [INFO ] Performed 67950/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-19 09:48:39] [INFO ] Dead Transitions using invariants and state equation in 61014 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5506/5506 places, 140151/140151 transitions.
Starting property specific reduction for SafeBus-COL-50-UpperBounds-13
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:48:41] [INFO ] Computed 205 place invariants in 1004 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5319 ms. (steps per millisecond=1 ) properties (out of 1) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 1) seen :49
[2022-05-19 09:48:47] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:48:48] [INFO ] Computed 205 place invariants in 1059 ms
[2022-05-19 09:48:48] [INFO ] [Real]Absence check using 101 positive place invariants in 102 ms returned sat
[2022-05-19 09:48:48] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 175 ms returned sat
[2022-05-19 09:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:48:53] [INFO ] [Real]Absence check using state equation in 4321 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 26335 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5506/5506 places, 140151/140151 transitions.
Normalized transition count is 15202 out of 140151 initially.
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:49:20] [INFO ] Computed 205 place invariants in 992 ms
Finished random walk after 56213 steps, including 0 resets, run visited all 1 properties in 30004 ms. (steps per millisecond=1 )
Finished Best-First random walk after 67040 steps, including 0 resets, run visited all 1 properties in 5002 ms. (steps per millisecond=13 )
[2022-05-19 09:49:55] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:49:56] [INFO ] Computed 205 place invariants in 973 ms
[2022-05-19 09:49:57] [INFO ] [Real]Absence check using 101 positive place invariants in 116 ms returned sat
[2022-05-19 09:49:57] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 173 ms returned sat
[2022-05-19 09:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 09:50:36] [INFO ] [Real]Absence check using state equation in 39062 ms returned sat
[2022-05-19 09:50:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 09:50:37] [INFO ] [Nat]Absence check using 101 positive place invariants in 85 ms returned sat
[2022-05-19 09:50:37] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 136 ms returned sat
[2022-05-19 09:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 09:51:00] [INFO ] [Nat]Absence check using state equation in 23151 ms returned unknown
Current structural bounds on expressions (after SMT) : [2451] Max seen :[49]
Support contains 50 out of 5506 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 31431 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 27848 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2022-05-19 09:51:59] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:52:00] [INFO ] Computed 205 place invariants in 958 ms
[2022-05-19 09:52:16] [INFO ] Implicit Places using invariants in 17003 ms returned []
Implicit Place search using SMT only with invariants took 17006 ms to find 0 implicit places.
[2022-05-19 09:52:16] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2022-05-19 09:52:17] [INFO ] Computed 205 place invariants in 1054 ms
[2022-05-19 09:52:48] [INFO ] Performed 68722/140151 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-05-19 09:53:17] [INFO ] Dead Transitions using invariants and state equation in 60591 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5506/5506 places, 140151/140151 transitions.
Ending property specific reduction for SafeBus-COL-50-UpperBounds-13 in 277343 ms.
[2022-05-19 09:53:24] [INFO ] Flatten gal took : 6737 ms
[2022-05-19 09:53:29] [INFO ] Applying decomposition
[2022-05-19 09:53:34] [INFO ] Flatten gal took : 5617 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12212813912681189265.txt' '-o' '/tmp/graph12212813912681189265.bin' '-w' '/tmp/graph12212813912681189265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12212813912681189265.bin' '-l' '-1' '-v' '-w' '/tmp/graph12212813912681189265.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:53:50] [INFO ] Decomposing Gal with order
[2022-05-19 09:53:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:54:33] [INFO ] Removed a total of 504542 redundant transitions.
[2022-05-19 09:54:36] [INFO ] Flatten gal took : 40394 ms
[2022-05-19 09:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 16582 labels/synchronizations in 31235 ms.
[2022-05-19 09:55:13] [INFO ] Time to serialize gal into /tmp/UpperBounds6586156237148071747.gal : 449 ms
[2022-05-19 09:55:13] [INFO ] Time to serialize properties into /tmp/UpperBounds13862894393766070099.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6586156237148071747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13862894393766070099.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds13862894393766070099.prop.
Detected timeout of ITS tools.
[2022-05-19 10:18:25] [INFO ] Applying decomposition
[2022-05-19 10:18:32] [INFO ] Flatten gal took : 6456 ms
[2022-05-19 10:18:35] [INFO ] Decomposing Gal with order
[2022-05-19 10:18:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 10:19:15] [INFO ] Removed a total of 783641 redundant transitions.
[2022-05-19 10:19:17] [INFO ] Flatten gal took : 16061 ms
[2022-05-19 10:19:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 4120 ms.
[2022-05-19 10:19:24] [INFO ] Time to serialize gal into /tmp/UpperBounds1688271939264312959.gal : 832 ms
[2022-05-19 10:19:24] [INFO ] Time to serialize properties into /tmp/UpperBounds3823187818879149077.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1688271939264312959.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3823187818879149077.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds3823187818879149077.prop.
Detected timeout of ITS tools.
[2022-05-19 10:42:42] [INFO ] Flatten gal took : 6745 ms
[2022-05-19 10:42:47] [INFO ] Input system was already deterministic with 140151 transitions.
[2022-05-19 10:42:47] [INFO ] Transformed 5506 places.
[2022-05-19 10:42:48] [INFO ] Transformed 140151 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 10:43:23] [INFO ] Time to serialize gal into /tmp/UpperBounds9042260271955648421.gal : 386 ms
[2022-05-19 10:43:23] [INFO ] Time to serialize properties into /tmp/UpperBounds16834416894151606027.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9042260271955648421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16834416894151606027.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-COL-50"
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-50, 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 r204-oct2-165281599000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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