Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926300021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717361654614

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 20:54:17] [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]
[2024-06-02 20:54:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:17] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 20:54:17] [INFO ] Transformed 115 places.
[2024-06-02 20:54:17] [INFO ] Transformed 257 transitions.
[2024-06-02 20:54:17] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:17] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Normalized transition count is 253 out of 254 initially.
// Phase 1: matrix 253 rows 115 cols
[2024-06-02 20:54:17] [INFO ] Computed 20 invariants in 29 ms
Incomplete random walk after 10000 steps, including 763 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :8
FORMULA MedleyA-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
[2024-06-02 20:54:17] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
// Phase 1: matrix 253 rows 115 cols
[2024-06-02 20:54:17] [INFO ] Computed 20 invariants in 6 ms
[2024-06-02 20:54:18] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-02 20:54:18] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 20:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:18] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-02 20:54:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-02 20:54:18] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:54:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:18] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-02 20:54:18] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 20:54:18] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-06-02 20:54:18] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 50 ms.
[2024-06-02 20:54:19] [INFO ] Added : 33 causal constraints over 7 iterations in 332 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 20:54:19] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 20:54:19] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 20:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:19] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-02 20:54:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-02 20:54:19] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:19] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-06-02 20:54:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-06-02 20:54:19] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 37 ms.
[2024-06-02 20:54:19] [INFO ] Added : 44 causal constraints over 9 iterations in 269 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 20:54:20] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-02 20:54:20] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 15 ms returned sat
[2024-06-02 20:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:20] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-06-02 20:54:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 20:54:20] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:20] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 20:54:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 26 ms returned sat
[2024-06-02 20:54:20] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 6 ms to minimize.
[2024-06-02 20:54:20] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:54:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-06-02 20:54:20] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 33 ms.
[2024-06-02 20:54:20] [INFO ] Added : 43 causal constraints over 9 iterations in 323 ms. Result :sat
Minimization took 82 ms.
[2024-06-02 20:54:21] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:21] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-02 20:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:21] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 28 ms returned sat
[2024-06-02 20:54:21] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 20:54:21] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 29 ms.
[2024-06-02 20:54:21] [INFO ] Added : 25 causal constraints over 5 iterations in 203 ms. Result :sat
Minimization took 53 ms.
[2024-06-02 20:54:21] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:21] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-06-02 20:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:21] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-02 20:54:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 21 ms returned sat
[2024-06-02 20:54:22] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 31 ms.
[2024-06-02 20:54:22] [INFO ] Added : 42 causal constraints over 9 iterations in 276 ms. Result :sat
Minimization took 71 ms.
[2024-06-02 20:54:22] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-02 20:54:22] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:22] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 20:54:22] [INFO ] [Real]Added 94 Read/Feed constraints in 13 ms returned sat
[2024-06-02 20:54:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-02 20:54:22] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 20:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:22] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 20:54:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 59 ms returned sat
[2024-06-02 20:54:22] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 28 ms.
[2024-06-02 20:54:23] [INFO ] Added : 35 causal constraints over 7 iterations in 275 ms. Result :sat
Minimization took 57 ms.
[2024-06-02 20:54:23] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:23] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Real]Added 94 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:54:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:23] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Nat]Added 94 Read/Feed constraints in 25 ms returned sat
[2024-06-02 20:54:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-06-02 20:54:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 20:54:23] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 34 ms.
[2024-06-02 20:54:23] [INFO ] Added : 33 causal constraints over 7 iterations in 232 ms. Result :sat
Minimization took 58 ms.
[2024-06-02 20:54:23] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:23] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-02 20:54:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-02 20:54:24] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:24] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 20:54:24] [INFO ] [Nat]Added 94 Read/Feed constraints in 18 ms returned sat
[2024-06-02 20:54:24] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:54:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-06-02 20:54:24] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 25 ms.
[2024-06-02 20:54:24] [INFO ] Added : 39 causal constraints over 9 iterations in 254 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 254/254 transitions.
Graph (complete) has 458 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 114 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 250
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 22 place count 96 transition count 216
Iterating global reduction 2 with 17 rules applied. Total rules applied 39 place count 96 transition count 216
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 84 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 84 transition count 301
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 3 with 44 rules applied. Total rules applied 111 place count 84 transition count 257
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 126 place count 84 transition count 319
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 162 place count 69 transition count 298
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 69 transition count 298
Applied a total of 163 rules in 130 ms. Remains 69 /115 variables (removed 46) and now considering 298/254 (removed -44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 69/115 places, 298/254 transitions.
Successfully produced net in file /tmp/petri1000_17631204407344732615.dot
Successfully produced net in file /tmp/petri1001_8462091587708728672.dot
Successfully produced net in file /tmp/petri1002_10288847739031069080.dot
Successfully produced net in file /tmp/petri1003_2310393664900593390.dot
Successfully produced net in file /tmp/petri1004_15808280099605848336.dot
Successfully produced net in file /tmp/petri1005_715028594983433015.dot
Successfully produced net in file /tmp/petri1006_804330361388476319.dot
Successfully produced net in file /tmp/petri1007_5101220394252065846.dot
Successfully produced net in file /tmp/petri1008_74193746325900303.dot
Successfully produced net in file /tmp/petri1009_736538985372827811.dot
Successfully produced net in file /tmp/petri1010_14011054700250985970.dot
Successfully produced net in file /tmp/petri1011_6489962996387914710.dot
Successfully produced net in file /tmp/petri1012_18210675002480999611.dot
Successfully produced net in file /tmp/petri1013_2845525084130937459.dot
Successfully produced net in file /tmp/petri1014_17832198357402620142.dot
Successfully produced net in file /tmp/petri1015_4346009180107474801.dot
Successfully produced net in file /tmp/petri1016_1193158889333199710.dot
Successfully produced net in file /tmp/petri1017_1775618503595224630.dot
Successfully produced net in file /tmp/petri1018_8247218713357450745.dot
Successfully produced net in file /tmp/petri1019_17498043455408426940.dot
Successfully produced net in file /tmp/petri1020_16096951816099226917.dot
Successfully produced net in file /tmp/petri1021_6841251510195798169.dot
Successfully produced net in file /tmp/petri1022_11643857104226240686.dot
Successfully produced net in file /tmp/petri1023_13979543386224946389.dot
Successfully produced net in file /tmp/petri1024_5894896771871585649.dot
Successfully produced net in file /tmp/petri1025_1225185025646422230.dot
Successfully produced net in file /tmp/petri1026_11667621449973489429.dot
Successfully produced net in file /tmp/petri1027_6679272045058848419.dot
Successfully produced net in file /tmp/petri1028_13050714690609298409.dot
Successfully produced net in file /tmp/petri1029_11158645906821642464.dot
Drop transitions removed 30 transitions
Dominated transitions for bounds rules discarded 30 transitions
// Phase 1: matrix 268 rows 69 cols
[2024-06-02 20:54:25] [INFO ] Computed 20 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 133503 resets, run finished after 5125 ms. (steps per millisecond=195 ) properties (out of 3) seen :3
FORMULA MedleyA-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12869 ms.

BK_STOP 1717361671290

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="MedleyA-PT-05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-05, 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 r597-smll-171734926300021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-05.tgz
mv MedleyA-PT-05 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;