Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is DoubleLock-PT-p1s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.4M May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748731795271

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:49:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 22:49:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:49:56] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2025-05-31 22:49:56] [INFO ] Transformed 570 places.
[2025-05-31 22:49:56] [INFO ] Transformed 7600 transitions.
[2025-05-31 22:49:56] [INFO ] Parsed PT model containing 570 places and 7600 transitions and 30784 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 132 places in 33 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:49:57] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
// Phase 1: matrix 5003 rows 438 cols
[2025-05-31 22:49:57] [INFO ] Computed 4 invariants in 85 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 10, 1, 1, +inf, 1, 10, 1, 1]
FORMULA DoubleLock-PT-p1s2-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10001 steps (85 resets) in 96 ms. (103 steps per ms)
FORMULA DoubleLock-PT-p1s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (50 resets) in 106 ms. (373 steps per ms)
FORMULA DoubleLock-PT-p1s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3, 4] Max Struct:[1, +inf, 10]
[2025-05-31 22:49:57] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
[2025-05-31 22:49:57] [INFO ] Invariant cache hit.
[2025-05-31 22:49:57] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-05-31 22:49:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 22:49:58] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2025-05-31 22:49:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:49:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-05-31 22:49:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:49:59] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2025-05-31 22:50:00] [INFO ] State equation strengthened by 400 read => feed constraints.
[2025-05-31 22:50:00] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:01] [INFO ] [Nat]Added 400 Read/Feed constraints in 1066 ms returned unknown
[2025-05-31 22:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:50:01] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 22:50:01] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2025-05-31 22:50:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:02] [INFO ] [Real]Added 400 Read/Feed constraints in 867 ms returned sat
[2025-05-31 22:50:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:50:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:50:03] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2025-05-31 22:50:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:04] [INFO ] [Nat]Added 400 Read/Feed constraints in 1073 ms returned unknown
[2025-05-31 22:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 22:50:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:50:05] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2025-05-31 22:50:05] [INFO ] [Real]Added 400 Read/Feed constraints in 320 ms returned sat
[2025-05-31 22:50:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-05-31 22:50:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-05-31 22:50:06] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2025-05-31 22:50:07] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:07] [INFO ] [Nat]Added 400 Read/Feed constraints in 1067 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3, 4] Max Struct:[1, +inf, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3, 4] Max Struct:[1, +inf, 10]
Support contains 3 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 7344/7344 transitions.
Graph (complete) has 12357 edges and 438 vertex of which 434 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.17 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 434 transition count 7280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 433 transition count 7152
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 433 transition count 7152
Applied a total of 67 rules in 449 ms. Remains 433 /438 variables (removed 5) and now considering 7152/7344 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 433/438 places, 7152/7344 transitions.
[2025-05-31 22:50:08] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 115 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :[0, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 3, 4] Max Struct:[1, +inf, 10]
[2025-05-31 22:50:17] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
// Phase 1: matrix 4811 rows 433 cols
[2025-05-31 22:50:17] [INFO ] Computed 2 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 4] Max Struct:[1, +inf, 10]
RANDOM walk for 1000005 steps (8724 resets) in 3453 ms. (289 steps per ms)
FORMULA DoubleLock-PT-p1s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (2756 resets) in 1875 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 5] Max Struct:[+inf, 10]
[2025-05-31 22:50:22] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:50:22] [INFO ] Invariant cache hit.
[2025-05-31 22:50:22] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:50:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:50:23] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2025-05-31 22:50:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:50:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:50:24] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2025-05-31 22:50:24] [INFO ] State equation strengthened by 400 read => feed constraints.
[2025-05-31 22:50:29] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:33] [INFO ] [Nat]Added 400 Read/Feed constraints in 9065 ms returned unknown
[2025-05-31 22:50:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:50:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:50:34] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2025-05-31 22:50:36] [INFO ] [Real]Added 400 Read/Feed constraints in 1919 ms returned sat
[2025-05-31 22:50:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:50:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 22:50:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:50:37] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2025-05-31 22:50:41] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:50:46] [INFO ] [Nat]Added 400 Read/Feed constraints in 9054 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3, 5] Max Struct:[+inf, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 5] Max Struct:[+inf, 10]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 221 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 433/433 places, 7152/7152 transitions.
[2025-05-31 22:50:46] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 124 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :[1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 5] Max Struct:[+inf, 10]
[2025-05-31 22:50:55] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:50:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 5] Max Struct:[+inf, 10]
RANDOM walk for 1000004 steps (8681 resets) in 3162 ms. (316 steps per ms)
BEST_FIRST walk for 2000002 steps (2738 resets) in 1833 ms. (1090 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5] Max Struct:[+inf, 10]
[2025-05-31 22:51:00] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:51:00] [INFO ] Invariant cache hit.
[2025-05-31 22:51:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:51:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:51:01] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2025-05-31 22:51:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:51:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-31 22:51:02] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2025-05-31 22:51:02] [INFO ] State equation strengthened by 400 read => feed constraints.
[2025-05-31 22:51:06] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:51:11] [INFO ] [Nat]Added 400 Read/Feed constraints in 9050 ms returned unknown
[2025-05-31 22:51:11] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:51:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:51:11] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2025-05-31 22:51:13] [INFO ] [Real]Added 400 Read/Feed constraints in 1924 ms returned sat
[2025-05-31 22:51:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:51:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:51:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:51:14] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2025-05-31 22:51:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:51:22] [INFO ] [Nat]Added 400 Read/Feed constraints in 7927 ms returned sat
[2025-05-31 22:51:23] [INFO ] Computed and/alt/rep : 580/4548/580 causal constraints (skipped 4229 transitions) in 707 ms.
[2025-05-31 22:51:23] [INFO ] Added : 1 causal constraints over 1 iterations in 1134 ms. Result :sat
Minimization took 5167 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5] Max Struct:[+inf, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5] Max Struct:[+inf, 10]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 250 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 433/433 places, 7152/7152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 157 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
[2025-05-31 22:51:29] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:51:29] [INFO ] Invariant cache hit.
[2025-05-31 22:51:29] [INFO ] Implicit Places using invariants in 480 ms returned []
[2025-05-31 22:51:29] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:51:29] [INFO ] Invariant cache hit.
[2025-05-31 22:51:30] [INFO ] State equation strengthened by 400 read => feed constraints.
[2025-05-31 22:52:03] [INFO ] Performed 28/433 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2025-05-31 22:52:33] [INFO ] Performed 422/433 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2025-05-31 22:52:37] [INFO ] Implicit Places using invariants and state equation in 67794 ms returned []
Implicit Place search using SMT with State Equation took 68277 ms to find 0 implicit places.
[2025-05-31 22:52:38] [INFO ] Redundant transitions in 805 ms returned []
Running 7150 sub problems to find dead transitions.
[2025-05-31 22:52:38] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:52:38] [INFO ] Invariant cache hit.
[2025-05-31 22:52:38] [INFO ] State equation strengthened by 400 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7150 unsolved
SMT process timed out in 59963ms, After SMT, problems are : Problem set: 0 solved, 7150 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129338 ms. Remains : 433/433 places, 7152/7152 transitions.
[2025-05-31 22:53:38] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {16=2, 23=1, 40=1, 2890=1, 2891=1, 4565=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {23=1, 40=1, 2903=1, 3121=1, 4579=1, 4798=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 126 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :[2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 5] Max Struct:[+inf, 10]
[2025-05-31 22:53:47] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:53:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5] Max Struct:[+inf, 10]
RANDOM walk for 1000003 steps (8715 resets) in 3358 ms. (297 steps per ms)
BEST_FIRST walk for 2000002 steps (2769 resets) in 1851 ms. (1079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[+inf, 10]
[2025-05-31 22:53:52] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:53:52] [INFO ] Invariant cache hit.
[2025-05-31 22:53:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:53:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-31 22:53:53] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2025-05-31 22:53:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:53:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:53:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 22:53:54] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2025-05-31 22:53:54] [INFO ] State equation strengthened by 400 read => feed constraints.
[2025-05-31 22:53:59] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:54:03] [INFO ] [Nat]Added 400 Read/Feed constraints in 9062 ms returned unknown
[2025-05-31 22:54:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:54:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:54:04] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2025-05-31 22:54:06] [INFO ] [Real]Added 400 Read/Feed constraints in 2012 ms returned sat
[2025-05-31 22:54:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:54:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 22:54:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 22:54:07] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2025-05-31 22:54:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:54:15] [INFO ] [Nat]Added 400 Read/Feed constraints in 8435 ms returned sat
[2025-05-31 22:54:16] [INFO ] Computed and/alt/rep : 580/4548/580 causal constraints (skipped 4229 transitions) in 1139 ms.
[2025-05-31 22:54:17] [INFO ] Added : 1 causal constraints over 1 iterations in 1599 ms. Result :sat
Minimization took 5125 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[+inf, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[+inf, 10]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 173 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 433/433 places, 7152/7152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7152/7152 transitions.
Applied a total of 0 rules in 154 ms. Remains 433 /433 variables (removed 0) and now considering 7152/7152 (removed 0) transitions.
[2025-05-31 22:54:22] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:54:22] [INFO ] Invariant cache hit.
[2025-05-31 22:54:23] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-05-31 22:54:23] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:54:23] [INFO ] Invariant cache hit.
[2025-05-31 22:54:24] [INFO ] State equation strengthened by 400 read => feed constraints.
[2025-05-31 22:54:57] [INFO ] Performed 28/433 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2025-05-31 22:55:28] [INFO ] Performed 424/433 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2025-05-31 22:55:31] [INFO ] Implicit Places using invariants and state equation in 68181 ms returned []
Implicit Place search using SMT with State Equation took 68622 ms to find 0 implicit places.
[2025-05-31 22:55:32] [INFO ] Redundant transitions in 662 ms returned []
Running 7150 sub problems to find dead transitions.
[2025-05-31 22:55:32] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)
[2025-05-31 22:55:32] [INFO ] Invariant cache hit.
[2025-05-31 22:55:32] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7150 unsolved
SMT process timed out in 60585ms, After SMT, problems are : Problem set: 0 solved, 7150 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130104 ms. Remains : 433/433 places, 7152/7152 transitions.
[2025-05-31 22:56:32] [INFO ] Flow matrix only has 4811 transitions (discarded 2341 similar events)

BK_STOP 1748732194754

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DoubleLock-PT-p1s2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DoubleLock-PT-p1s2, 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 r083-tall-174860079700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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