Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307352900101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 UtilityControlRoom-COL-Z4T3N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352900101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 9.8K Apr 29 17:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 17:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 17:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K 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 UtilityControlRoom-COL-Z4T3N10-UpperBounds-00
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-01
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-02
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-03
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-04
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-05
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-06
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-07
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-08
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-09
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-10
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-11
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-12
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-13
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-14
FORMULA_NAME UtilityControlRoom-COL-Z4T3N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653129475466

Running Version 202205111006
[2022-05-21 10:37:57] [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-21 10:37:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 10:37:57] [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-21 10:37:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 10:37:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 987 ms
[2022-05-21 10:37:59] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2022-05-21 10:37:59] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2022-05-21 10:37:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-21 10:37:59] [INFO ] Computed 5 place invariants in 6 ms
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 11 rows 13 cols
[2022-05-21 10:37:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-21 10:37:59] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2022-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-21 10:37:59] [INFO ] Added : 1 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 10:37:59] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 10:37:59] [INFO ] Added : 5 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:37:59] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:37:59] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-21 10:37:59] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 10:37:59] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-21 10:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:38:00] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 10:38:00] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 10:38:00] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 10:38:00] [INFO ] Added : 5 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:38:00] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 10:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2022-05-21 10:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-21 10:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-21 10:38:00] [INFO ] Computed and/alt/rep : 10/15/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-21 10:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [10, 3, 3, 10, 10, 10, 10, 3, 3, 3, 3, 10, 3, 10]
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 10:38:01] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 53 ms.
[2022-05-21 10:38:01] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 14) seen :68
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :48
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 590 rows 376 cols
[2022-05-21 10:38:01] [INFO ] Computed 23 place invariants in 33 ms
[2022-05-21 10:38:01] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-21 10:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:01] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-05-21 10:38:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 10:38:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2022-05-21 10:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 10:38:02] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2022-05-21 10:38:02] [INFO ] Computed and/alt/rep : 540/810/540 causal constraints (skipped 40 transitions) in 97 ms.
[2022-05-21 10:38:07] [INFO ] Deduced a trap composed of 8 places in 494 ms of which 8 ms to minimize.
[2022-05-21 10:38:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[8]
Support contains 40 out of 376 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 102 transition count 130
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 608 place count 91 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 628 place count 81 transition count 110
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 638 place count 81 transition count 100
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 668 place count 61 transition count 90
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 689 place count 50 transition count 80
Applied a total of 689 rules in 170 ms. Remains 50 /376 variables (removed 326) and now considering 80/590 (removed 510) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/376 places, 80/590 transitions.
// Phase 1: matrix 80 rows 50 cols
[2022-05-21 10:38:07] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2449 ms. (steps per millisecond=408 ) properties (out of 1) seen :10
FORMULA UtilityControlRoom-COL-Z4T3N10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12364 ms.

BK_STOP 1653129490150

--------------------
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="UtilityControlRoom-COL-Z4T3N10"
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 UtilityControlRoom-COL-Z4T3N10, 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 r276-smll-165307352900101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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