Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700058.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 DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748730949215

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:35:50] [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:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:35:50] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2025-05-31 22:35:50] [INFO ] Transformed 57 places.
[2025-05-31 22:35:50] [INFO ] Transformed 48 transitions.
[2025-05-31 22:35:50] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 48 rows 57 cols
[2025-05-31 22:35:50] [INFO ] Computed 9 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 16, 1, 1, 1, 1, 1, 1, +inf, 1, 6, 1, 1, 2, 1, 1]
FORMULA DoubleExponent-PT-001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (326 resets) in 33 ms. (294 steps per ms)
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30000 steps (862 resets) in 60 ms. (491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 1] Max Struct:[16, +inf, 6]
[2025-05-31 22:35:50] [INFO ] Invariant cache hit.
[2025-05-31 22:35:50] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2025-05-31 22:35:50] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 16 ms returned unsat
[2025-05-31 22:35:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-31 22:35:50] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:35:50] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:35:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:35:51] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 19 ms returned sat
[2025-05-31 22:35:51] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:35:51] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 5 ms.
[2025-05-31 22:35:51] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 11 ms to minimize.
[2025-05-31 22:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-05-31 22:35:51] [INFO ] Added : 44 causal constraints over 9 iterations in 228 ms. Result :sat
Minimization took 44 ms.
[2025-05-31 22:35:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:35:51] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 1] Max Struct:[1, +inf, 1]
FORMULA DoubleExponent-PT-001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 52 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 51 transition count 34
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 28 place count 39 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 28 place count 39 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 36 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 35 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 35 transition count 30
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 23 transition count 18
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 21 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 20 transition count 15
Applied a total of 68 rules in 40 ms. Remains 20 /57 variables (removed 37) and now considering 15/48 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 20/57 places, 15/48 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1147 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
// Phase 1: matrix 15 rows 20 cols
[2025-05-31 22:35:51] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (115577 resets) in 604 ms. (1652 steps per ms)
BEST_FIRST walk for 1000001 steps (79143 resets) in 384 ms. (2597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:35:52] [INFO ] Invariant cache hit.
[2025-05-31 22:35:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:35:52] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:35:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-05-31 22:35:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:35:52] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 22:35:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-05-31 22:35:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 22:35:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-05-31 22:35:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-31 22:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2025-05-31 22:35:52] [INFO ] Computed and/alt/rep : 14/43/14 causal constraints (skipped 0 transitions) in 1 ms.
[2025-05-31 22:35:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2025-05-31 22:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2025-05-31 22:35:52] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-05-31 22:35:52] [INFO ] Invariant cache hit.
[2025-05-31 22:35:52] [INFO ] Implicit Places using invariants in 35 ms returned [6, 11]
[2025-05-31 22:35:52] [INFO ] Actually due to overlaps returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 19/20 places, 15/15 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 18 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 14
Applied a total of 2 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 18 cols
[2025-05-31 22:35:52] [INFO ] Computed 4 invariants in 0 ms
[2025-05-31 22:35:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 22:35:52] [INFO ] Invariant cache hit.
[2025-05-31 22:35:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 22:35:52] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 18/20 places, 14/15 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 122 ms. Remains : 18/20 places, 14/15 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1158 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:35:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (115663 resets) in 441 ms. (2262 steps per ms)
BEST_FIRST walk for 1000000 steps (79101 resets) in 322 ms. (3095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:35:53] [INFO ] Invariant cache hit.
[2025-05-31 22:35:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:35:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-05-31 22:35:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:35:53] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-05-31 22:35:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 22:35:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-05-31 22:35:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-31 22:35:53] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2025-05-31 22:35:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2025-05-31 22:35:53] [INFO ] Computed and/alt/rep : 13/33/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 22:35:53] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2025-05-31 22:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2025-05-31 22:35:53] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2025-05-31 22:35:53] [INFO ] Invariant cache hit.
[2025-05-31 22:35:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-31 22:35:53] [INFO ] Invariant cache hit.
[2025-05-31 22:35:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-31 22:35:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2025-05-31 22:35:53] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2025-05-31 22:35:53] [INFO ] Invariant cache hit.
[2025-05-31 22:35:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-31 22:35:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 25 constraints, problems are : Problem set: 0 solved, 13 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/31 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/32 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 38 constraints, problems are : Problem set: 0 solved, 13 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 18/18 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 2=1, 3=1, 4=1, 6=1, 7=1, 8=1, 9=1, 11=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1157 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40000 steps (4588 resets) in 398 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3208 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Probably explored full state space saw : 45 states, properties seen :0
Probabilistic random walk after 89 steps, saw 45 distinct states, run finished after 8 ms. (steps per millisecond=11 ) properties seen :0
Explored full state space saw : 45 states, properties seen :0
Exhaustive walk after 89 steps, saw 45 distinct states, run finished after 1 ms. (steps per millisecond=89 ) properties seen :0
[2025-05-31 22:35:54] [INFO ] Flatten gal took : 20 ms
[2025-05-31 22:35:54] [INFO ] Flatten gal took : 3 ms
[2025-05-31 22:35:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3504188333288917999.gal : 3 ms
[2025-05-31 22:35:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8863384561684684820.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3504188333288917999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8863384561684684820.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DoubleExponent-PT-001-UpperBounds-08 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4390 ms.

BK_STOP 1748730954812

--------------------
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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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-174860079700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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