About the Execution of 2023-gold for StigmergyCommit-PT-08b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1478.023 | 117305.00 | 144728.00 | 666.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r417-tall-171690555800121.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 StigmergyCommit-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555800121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 38M May 18 16:43 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 StigmergyCommit-PT-08b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-08b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717118224026
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=StigmergyCommit-PT-08b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 01:17:05] [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-05-31 01:17:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:17:07] [INFO ] Load time of PNML (sax parser for PT used): 1517 ms
[2024-05-31 01:17:07] [INFO ] Transformed 2746 places.
[2024-05-31 01:17:07] [INFO ] Transformed 42776 transitions.
[2024-05-31 01:17:07] [INFO ] Found NUPN structural information;
[2024-05-31 01:17:07] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 2289 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 42776 rows 2746 cols
[2024-05-31 01:17:09] [INFO ] Computed 10 invariants in 1156 ms
Incomplete random walk after 10000 steps, including 61 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 16) seen :2
FORMULA StigmergyCommit-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
[2024-05-31 01:17:10] [INFO ] Invariant cache hit.
[2024-05-31 01:17:11] [INFO ] [Real]Absence check using 10 positive place invariants in 58 ms returned sat
[2024-05-31 01:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:15] [INFO ] [Real]Absence check using state equation in 4447 ms returned unknown
[2024-05-31 01:17:15] [INFO ] [Real]Absence check using 10 positive place invariants in 54 ms returned sat
[2024-05-31 01:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:20] [INFO ] [Real]Absence check using state equation in 4609 ms returned unknown
[2024-05-31 01:17:20] [INFO ] [Real]Absence check using 10 positive place invariants in 47 ms returned sat
[2024-05-31 01:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:25] [INFO ] [Real]Absence check using state equation in 4608 ms returned unknown
[2024-05-31 01:17:25] [INFO ] [Real]Absence check using 10 positive place invariants in 46 ms returned sat
[2024-05-31 01:17:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:30] [INFO ] [Real]Absence check using state equation in 4593 ms returned unknown
[2024-05-31 01:17:30] [INFO ] [Real]Absence check using 10 positive place invariants in 49 ms returned sat
[2024-05-31 01:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:35] [INFO ] [Real]Absence check using state equation in 4606 ms returned unknown
[2024-05-31 01:17:35] [INFO ] [Real]Absence check using 10 positive place invariants in 45 ms returned sat
[2024-05-31 01:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:40] [INFO ] [Real]Absence check using state equation in 4616 ms returned unknown
[2024-05-31 01:17:40] [INFO ] [Real]Absence check using 10 positive place invariants in 48 ms returned sat
[2024-05-31 01:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:45] [INFO ] [Real]Absence check using state equation in 4622 ms returned unknown
[2024-05-31 01:17:45] [INFO ] [Real]Absence check using 10 positive place invariants in 47 ms returned sat
[2024-05-31 01:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:50] [INFO ] [Real]Absence check using state equation in 4610 ms returned unknown
[2024-05-31 01:17:51] [INFO ] [Real]Absence check using 10 positive place invariants in 45 ms returned sat
[2024-05-31 01:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:17:55] [INFO ] [Real]Absence check using state equation in 4622 ms returned unknown
[2024-05-31 01:17:56] [INFO ] [Real]Absence check using 10 positive place invariants in 52 ms returned sat
[2024-05-31 01:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:00] [INFO ] [Real]Absence check using state equation in 4610 ms returned unknown
[2024-05-31 01:18:01] [INFO ] [Real]Absence check using 10 positive place invariants in 44 ms returned sat
[2024-05-31 01:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:05] [INFO ] [Real]Absence check using state equation in 4620 ms returned unknown
[2024-05-31 01:18:06] [INFO ] [Real]Absence check using 10 positive place invariants in 46 ms returned sat
[2024-05-31 01:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:10] [INFO ] [Real]Absence check using state equation in 4617 ms returned unknown
[2024-05-31 01:18:11] [INFO ] [Real]Absence check using 10 positive place invariants in 44 ms returned sat
[2024-05-31 01:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:15] [INFO ] [Real]Absence check using state equation in 4621 ms returned unknown
[2024-05-31 01:18:16] [INFO ] [Real]Absence check using 10 positive place invariants in 45 ms returned sat
[2024-05-31 01:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:20] [INFO ] [Real]Absence check using state equation in 4618 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2702 edges and 2746 vertex of which 177 / 2746 are part of one of the 26 SCC in 21 ms
Free SCC test removed 151 places
Drop transitions removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Graph (complete) has 4679 edges and 2595 vertex of which 2577 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.145 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2051 transitions
Trivial Post-agglo rules discarded 2051 transitions
Performed 2051 trivial Post agglomeration. Transition count delta: 2051
Iterating post reduction 0 with 2060 rules applied. Total rules applied 2062 place count 2577 transition count 40514
Reduce places removed 2051 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 2112 rules applied. Total rules applied 4174 place count 526 transition count 40453
Reduce places removed 22 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 32 rules applied. Total rules applied 4206 place count 504 transition count 40443
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 4218 place count 494 transition count 40441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4219 place count 493 transition count 40441
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 96 Pre rules applied. Total rules applied 4219 place count 493 transition count 40345
Deduced a syphon composed of 96 places in 51 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 4411 place count 397 transition count 40345
Discarding 104 places :
Symmetric choice reduction at 5 with 104 rule applications. Total rules 4515 place count 293 transition count 40241
Iterating global reduction 5 with 104 rules applied. Total rules applied 4619 place count 293 transition count 40241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4619 place count 293 transition count 40240
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4621 place count 292 transition count 40240
Discarding 55 places :
Symmetric choice reduction at 5 with 55 rule applications. Total rules 4676 place count 237 transition count 1844
Iterating global reduction 5 with 55 rules applied. Total rules applied 4731 place count 237 transition count 1844
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 4758 place count 237 transition count 1817
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 4772 place count 223 transition count 1803
Iterating global reduction 6 with 14 rules applied. Total rules applied 4786 place count 223 transition count 1803
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 4800 place count 209 transition count 1789
Iterating global reduction 6 with 14 rules applied. Total rules applied 4814 place count 209 transition count 1789
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 4828 place count 209 transition count 1775
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 4890 place count 178 transition count 1744
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4891 place count 178 transition count 1743
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4900 place count 169 transition count 1734
Iterating global reduction 8 with 9 rules applied. Total rules applied 4909 place count 169 transition count 1734
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4918 place count 160 transition count 1725
Iterating global reduction 8 with 9 rules applied. Total rules applied 4927 place count 160 transition count 1725
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4936 place count 151 transition count 1716
Iterating global reduction 8 with 9 rules applied. Total rules applied 4945 place count 151 transition count 1716
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 4951 place count 148 transition count 1724
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 4954 place count 148 transition count 1721
Free-agglomeration rule applied 52 times.
Iterating global reduction 8 with 52 rules applied. Total rules applied 5006 place count 148 transition count 1669
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 85 rules applied. Total rules applied 5091 place count 96 transition count 1636
Renaming transitions due to excessive name length > 1024 char.
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 5098 place count 89 transition count 1629
Iterating global reduction 9 with 7 rules applied. Total rules applied 5105 place count 89 transition count 1629
Drop transitions removed 517 transitions
Redundant transition composition rules discarded 517 transitions
Iterating global reduction 9 with 517 rules applied. Total rules applied 5622 place count 89 transition count 1112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5624 place count 88 transition count 1111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 5628 place count 86 transition count 1129
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 5633 place count 86 transition count 1124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 5638 place count 81 transition count 1124
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 5645 place count 81 transition count 1124
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 5651 place count 81 transition count 1118
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 5653 place count 79 transition count 1114
Iterating global reduction 10 with 2 rules applied. Total rules applied 5655 place count 79 transition count 1114
Applied a total of 5655 rules in 7577 ms. Remains 79 /2746 variables (removed 2667) and now considering 1114/42776 (removed 41662) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7578 ms. Remains : 79/2746 places, 1114/42776 transitions.
// Phase 1: matrix 1114 rows 79 cols
[2024-05-31 01:18:28] [INFO ] Computed 10 invariants in 12 ms
Interrupted random walk after 537192 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 13
FORMULA StigmergyCommit-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 1) seen :0
[2024-05-31 01:18:59] [INFO ] Invariant cache hit.
[2024-05-31 01:18:59] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 01:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:59] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 01:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:18:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 01:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:18:59] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 01:18:59] [INFO ] State equation strengthened by 1053 read => feed constraints.
[2024-05-31 01:18:59] [INFO ] [Nat]Added 1053 Read/Feed constraints in 103 ms returned sat
[2024-05-31 01:19:00] [INFO ] Computed and/alt/rep : 24/28/24 causal constraints (skipped 1074 transitions) in 207 ms.
[2024-05-31 01:19:00] [INFO ] Added : 1 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA StigmergyCommit-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 114929 ms.
BK_STOP 1717118341331
--------------------
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="StigmergyCommit-PT-08b"
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 StigmergyCommit-PT-08b, 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 r417-tall-171690555800121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08b.tgz
mv StigmergyCommit-PT-08b 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 '
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 ;