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.r571-tall-171734910100041.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 CO4-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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.5K 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 152K 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 CO4-PT-09-UpperBounds-00
FORMULA_NAME CO4-PT-09-UpperBounds-01
FORMULA_NAME CO4-PT-09-UpperBounds-02
FORMULA_NAME CO4-PT-09-UpperBounds-03
FORMULA_NAME CO4-PT-09-UpperBounds-04
FORMULA_NAME CO4-PT-09-UpperBounds-05
FORMULA_NAME CO4-PT-09-UpperBounds-06
FORMULA_NAME CO4-PT-09-UpperBounds-07
FORMULA_NAME CO4-PT-09-UpperBounds-08
FORMULA_NAME CO4-PT-09-UpperBounds-09
FORMULA_NAME CO4-PT-09-UpperBounds-10
FORMULA_NAME CO4-PT-09-UpperBounds-11
FORMULA_NAME CO4-PT-09-UpperBounds-12
FORMULA_NAME CO4-PT-09-UpperBounds-13
FORMULA_NAME CO4-PT-09-UpperBounds-14
FORMULA_NAME CO4-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368649814

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=CO4-PT-09
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:50:51] [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 22:50:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:51] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-06-02 22:50:51] [INFO ] Transformed 467 places.
[2024-06-02 22:50:51] [INFO ] Transformed 634 transitions.
[2024-06-02 22:50:51] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:51] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 108 places in 5 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 471 rows 359 cols
[2024-06-02 22:50:51] [INFO ] Computed 9 invariants in 26 ms
Incomplete random walk after 10000 steps, including 36 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :3
FORMULA CO4-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :2
FORMULA CO4-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :1
FORMULA CO4-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
[2024-06-02 22:50:51] [INFO ] Invariant cache hit.
[2024-06-02 22:50:52] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 22:50:52] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:52] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-02 22:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:52] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:52] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-06-02 22:50:52] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 31 ms.
[2024-06-02 22:50:53] [INFO ] Added : 76 causal constraints over 16 iterations in 510 ms. Result :sat
Minimization took 64 ms.
[2024-06-02 22:50:53] [INFO ] [Real]Absence check using 7 positive place invariants in 62 ms returned sat
[2024-06-02 22:50:53] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 8 ms returned sat
[2024-06-02 22:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:53] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-06-02 22:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:53] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:53] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-06-02 22:50:53] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 29 ms.
[2024-06-02 22:50:54] [INFO ] Added : 67 causal constraints over 14 iterations in 431 ms. Result :sat
Minimization took 66 ms.
[2024-06-02 22:50:54] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:54] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:54] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-02 22:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:54] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:54] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 22:50:54] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 37 ms.
[2024-06-02 22:50:55] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
[2024-06-02 22:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-02 22:50:55] [INFO ] Added : 78 causal constraints over 17 iterations in 612 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 22:50:55] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:55] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 22:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:55] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:50:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2024-06-02 22:50:55] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:55] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 22:50:55] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 27 ms.
[2024-06-02 22:50:56] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:50:56] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 1 ms to minimize.
[2024-06-02 22:50:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:50:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2024-06-02 22:50:56] [INFO ] Added : 86 causal constraints over 18 iterations in 887 ms. Result :sat
Minimization took 60 ms.
[2024-06-02 22:50:56] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:56] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:57] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-02 22:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:57] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:57] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-06-02 22:50:57] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 26 ms.
[2024-06-02 22:50:57] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 0 ms to minimize.
[2024-06-02 22:50:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-02 22:50:57] [INFO ] Added : 84 causal constraints over 18 iterations in 640 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA CO4-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 471/471 transitions.
Graph (trivial) has 358 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 757 edges and 358 vertex of which 323 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 323 transition count 270
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 176 rules applied. Total rules applied 360 place count 163 transition count 254
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 14 rules applied. Total rules applied 374 place count 156 transition count 247
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 3 rules applied. Total rules applied 377 place count 155 transition count 245
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 380 place count 154 transition count 243
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 385 place count 153 transition count 239
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 389 place count 150 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 389 place count 150 transition count 237
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 391 place count 149 transition count 237
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 417 place count 123 transition count 211
Iterating global reduction 7 with 26 rules applied. Total rules applied 443 place count 123 transition count 211
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 443 place count 123 transition count 205
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 455 place count 117 transition count 205
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 472 place count 100 transition count 163
Iterating global reduction 7 with 17 rules applied. Total rules applied 489 place count 100 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 491 place count 100 transition count 161
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 493 place count 98 transition count 159
Iterating global reduction 8 with 2 rules applied. Total rules applied 495 place count 98 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 497 place count 98 transition count 157
Performed 36 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 9 with 72 rules applied. Total rules applied 569 place count 62 transition count 116
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 571 place count 62 transition count 114
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 603 place count 46 transition count 131
Drop transitions removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 24 rules applied. Total rules applied 627 place count 46 transition count 107
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 638 place count 35 transition count 74
Iterating global reduction 11 with 11 rules applied. Total rules applied 649 place count 35 transition count 74
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 657 place count 35 transition count 66
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 660 place count 32 transition count 51
Iterating global reduction 12 with 3 rules applied. Total rules applied 663 place count 32 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 665 place count 32 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 667 place count 32 transition count 47
Free-agglomeration rule applied 9 times.
Iterating global reduction 13 with 9 rules applied. Total rules applied 676 place count 32 transition count 38
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 686 place count 23 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 687 place count 22 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 689 place count 20 transition count 36
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 692 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 693 place count 19 transition count 31
Iterating global reduction 15 with 1 rules applied. Total rules applied 694 place count 19 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 695 place count 19 transition count 30
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 697 place count 19 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 699 place count 17 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 701 place count 17 transition count 26
Applied a total of 701 rules in 86 ms. Remains 17 /359 variables (removed 342) and now considering 26/471 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 17/359 places, 26/471 transitions.
Successfully produced net in file /tmp/petri1000_10105729571898152677.dot
Successfully produced net in file /tmp/petri1001_15426630166528471405.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 24 rows 17 cols
[2024-06-02 22:50:58] [INFO ] Computed 6 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 3) seen :3
FORMULA CO4-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7469 ms.

BK_STOP 1717368660116

--------------------
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="CO4-PT-09"
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 CO4-PT-09, 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 r571-tall-171734910100041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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