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.r323-tall-165472293100391.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 gold2021
Input is Szymanski-PT-b04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293100391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 7 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Jun 7 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M Jun 6 12:11 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 Szymanski-PT-b04-UpperBounds-00
FORMULA_NAME Szymanski-PT-b04-UpperBounds-01
FORMULA_NAME Szymanski-PT-b04-UpperBounds-02
FORMULA_NAME Szymanski-PT-b04-UpperBounds-03
FORMULA_NAME Szymanski-PT-b04-UpperBounds-04
FORMULA_NAME Szymanski-PT-b04-UpperBounds-05
FORMULA_NAME Szymanski-PT-b04-UpperBounds-06
FORMULA_NAME Szymanski-PT-b04-UpperBounds-07
FORMULA_NAME Szymanski-PT-b04-UpperBounds-08
FORMULA_NAME Szymanski-PT-b04-UpperBounds-09
FORMULA_NAME Szymanski-PT-b04-UpperBounds-10
FORMULA_NAME Szymanski-PT-b04-UpperBounds-11
FORMULA_NAME Szymanski-PT-b04-UpperBounds-12
FORMULA_NAME Szymanski-PT-b04-UpperBounds-13
FORMULA_NAME Szymanski-PT-b04-UpperBounds-14
FORMULA_NAME Szymanski-PT-b04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654797170865

Running Version 0
[2022-06-09 17:52:52] [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-06-09 17:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:52:52] [INFO ] Load time of PNML (sax parser for PT used): 477 ms
[2022-06-09 17:52:52] [INFO ] Transformed 568 places.
[2022-06-09 17:52:52] [INFO ] Transformed 8320 transitions.
[2022-06-09 17:52:52] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 563 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2022-06-09 17:52:53] [INFO ] Computed 3 place invariants in 70 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :13
FORMULA Szymanski-PT-b04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :5
[2022-06-09 17:52:53] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2022-06-09 17:52:53] [INFO ] Computed 3 place invariants in 31 ms
[2022-06-09 17:52:53] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-09 17:52:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:52:54] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2022-06-09 17:52:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:52:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 17:52:54] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:52:54] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2022-06-09 17:52:55] [INFO ] State equation strengthened by 189 read => feed constraints.
[2022-06-09 17:52:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:52:59] [INFO ] [Nat]Added 189 Read/Feed constraints in 4220 ms returned unknown
[2022-06-09 17:52:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 17:52:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:52:59] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-09 17:52:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:52:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 17:52:59] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:00] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2022-06-09 17:53:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:53:04] [INFO ] [Nat]Added 189 Read/Feed constraints in 4384 ms returned unknown
[2022-06-09 17:53:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 17:53:04] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:05] [INFO ] [Real]Absence check using state equation in 544 ms returned unsat
[2022-06-09 17:53:05] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 17:53:05] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:06] [INFO ] [Real]Absence check using state equation in 554 ms returned unsat
[2022-06-09 17:53:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 17:53:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:06] [INFO ] [Real]Absence check using state equation in 528 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 4, 4] Max seen :[0, 0, 4, 4, 4]
FORMULA Szymanski-PT-b04-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b04-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 306 transition count 7938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 305 transition count 7810
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 305 transition count 7810
Applied a total of 129 rules in 518 ms. Remains 305 /308 variables (removed 3) and now considering 7810/8064 (removed 254) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/308 places, 7810/8064 transitions.
Normalized transition count is 2606 out of 7810 initially.
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:07] [INFO ] Computed 1 place invariants in 27 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1822 ms. (steps per millisecond=548 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 2) seen :0
[2022-06-09 17:53:11] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:11] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-09 17:53:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:11] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2022-06-09 17:53:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:53:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 8 ms returned sat
[2022-06-09 17:53:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:12] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2022-06-09 17:53:12] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:53:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:53:18] [INFO ] [Nat]Added 188 Read/Feed constraints in 6265 ms returned unknown
[2022-06-09 17:53:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:19] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2022-06-09 17:53:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:53:19] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:19] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2022-06-09 17:53:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:53:26] [INFO ] [Nat]Added 188 Read/Feed constraints in 6257 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 244 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 290 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-09 17:53:26] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:26] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-09 17:53:27] [INFO ] Implicit Places using invariants in 534 ms returned []
[2022-06-09 17:53:27] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:27] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-09 17:53:27] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:53:28] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2022-06-09 17:53:29] [INFO ] Redundant transitions in 945 ms returned []
[2022-06-09 17:53:29] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:29] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-09 17:53:31] [INFO ] Dead Transitions using invariants and state equation in 2001 ms returned []
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-00
Normalized transition count is 2606 out of 7810 initially.
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:31] [INFO ] Computed 1 place invariants in 19 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2022-06-09 17:53:31] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:31] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-09 17:53:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:31] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2022-06-09 17:53:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:53:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:32] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2022-06-09 17:53:32] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:53:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:53:36] [INFO ] [Nat]Added 188 Read/Feed constraints in 4399 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 214 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Normalized transition count is 2606 out of 7810 initially.
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:37] [INFO ] Computed 1 place invariants in 12 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 1) seen :0
[2022-06-09 17:53:39] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:39] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-09 17:53:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 11 ms returned sat
[2022-06-09 17:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:40] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-06-09 17:53:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:53:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:53:40] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2022-06-09 17:53:40] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:53:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:53:47] [INFO ] [Nat]Added 188 Read/Feed constraints in 6259 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-09 17:53:47] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:47] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-09 17:53:47] [INFO ] Implicit Places using invariants in 466 ms returned []
[2022-06-09 17:53:47] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:47] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-09 17:53:48] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:53:57] [INFO ] Implicit Places using invariants and state equation in 9874 ms returned []
Implicit Place search using SMT with State Equation took 10357 ms to find 0 implicit places.
[2022-06-09 17:53:58] [INFO ] Redundant transitions in 849 ms returned []
[2022-06-09 17:53:58] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:53:58] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-09 17:54:00] [INFO ] Dead Transitions using invariants and state equation in 1858 ms returned []
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-00 in 29391 ms.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-01
Normalized transition count is 2606 out of 7810 initially.
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:54:00] [INFO ] Computed 1 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2022-06-09 17:54:00] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-09 17:54:00] [INFO ] Computed 1 place invariants in 10 ms
[2022-06-09 17:54:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:54:01] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2022-06-09 17:54:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:54:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 17:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:54:01] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-06-09 17:54:01] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:54:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:54:06] [INFO ] [Nat]Added 188 Read/Feed constraints in 4403 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 7810/7810 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7808
Applied a total of 2 rules in 209 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7810 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7810 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2022-06-09 17:54:06] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1575 ms. (steps per millisecond=634 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 1) seen :0
[2022-06-09 17:54:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-09 17:54:08] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-09 17:54:08] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-09 17:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:54:09] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2022-06-09 17:54:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:54:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 17:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:54:09] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2022-06-09 17:54:09] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:54:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 17:54:16] [INFO ] [Nat]Added 188 Read/Feed constraints in 6261 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 233 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2022-06-09 17:54:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-09 17:54:16] [INFO ] Computed 3 place invariants in 21 ms
[2022-06-09 17:54:17] [INFO ] Implicit Places using invariants in 534 ms returned []
[2022-06-09 17:54:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-09 17:54:17] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 17:54:17] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-06-09 17:54:17] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2022-06-09 17:54:18] [INFO ] Redundant transitions in 637 ms returned []
[2022-06-09 17:54:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2022-06-09 17:54:18] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-09 17:54:20] [INFO ] Dead Transitions using invariants and state equation in 2239 ms returned []
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-01 in 20368 ms.
[2022-06-09 17:54:21] [INFO ] Flatten gal took : 519 ms
[2022-06-09 17:54:21] [INFO ] Applying decomposition
[2022-06-09 17:54:22] [INFO ] Flatten gal took : 329 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/graph16085607642937908547.txt, -o, /tmp/graph16085607642937908547.bin, -w, /tmp/graph16085607642937908547.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/graph16085607642937908547.bin, -l, -1, -v, -w, /tmp/graph16085607642937908547.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:54:22] [INFO ] Decomposing Gal with order
[2022-06-09 17:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:54:23] [INFO ] Removed a total of 17890 redundant transitions.
[2022-06-09 17:54:24] [INFO ] Flatten gal took : 953 ms
[2022-06-09 17:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1110 labels/synchronizations in 334 ms.
[2022-06-09 17:54:24] [INFO ] Time to serialize gal into /tmp/UpperBounds7813968483697530269.gal : 41 ms
[2022-06-09 17:54:24] [INFO ] Time to serialize properties into /tmp/UpperBounds980061796833970511.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/UpperBounds7813968483697530269.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds980061796833970511.prop, --nowitness], 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/UpperBounds7813968483697530269.gal -t CGAL -reachable-file /tmp/UpperBounds980061796833970511.prop --nowitness
Loading property file /tmp/UpperBounds980061796833970511.prop.
Detected timeout of ITS tools.
[2022-06-09 18:14:57] [INFO ] Flatten gal took : 1223 ms
[2022-06-09 18:14:57] [INFO ] Time to serialize gal into /tmp/UpperBounds5939248813355922242.gal : 86 ms
[2022-06-09 18:14:57] [INFO ] Time to serialize properties into /tmp/UpperBounds68062099289942715.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/UpperBounds5939248813355922242.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds68062099289942715.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/UpperBounds5939248813355922242.gal -t CGAL -reachable-file /tmp/UpperBounds68062099289942715.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds68062099289942715.prop.
Detected timeout of ITS tools.
[2022-06-09 18:35:30] [INFO ] Flatten gal took : 1256 ms
[2022-06-09 18:35:34] [INFO ] Input system was already deterministic with 7810 transitions.
[2022-06-09 18:35:34] [INFO ] Transformed 305 places.
[2022-06-09 18:35:34] [INFO ] Transformed 7810 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 18:35:35] [INFO ] Time to serialize gal into /tmp/UpperBounds15969165398688976168.gal : 18 ms
[2022-06-09 18:35:35] [INFO ] Time to serialize properties into /tmp/UpperBounds7625774374745977092.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/UpperBounds15969165398688976168.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7625774374745977092.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/UpperBounds15969165398688976168.gal -t CGAL -reachable-file /tmp/UpperBounds7625774374745977092.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7625774374745977092.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="Szymanski-PT-b04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Szymanski-PT-b04, 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 r323-tall-165472293100391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 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 ;