Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838856800133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is EnergyBus-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 5 18:22 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 EnergyBus-PT-none-UpperBounds-00
FORMULA_NAME EnergyBus-PT-none-UpperBounds-01
FORMULA_NAME EnergyBus-PT-none-UpperBounds-02
FORMULA_NAME EnergyBus-PT-none-UpperBounds-03
FORMULA_NAME EnergyBus-PT-none-UpperBounds-04
FORMULA_NAME EnergyBus-PT-none-UpperBounds-05
FORMULA_NAME EnergyBus-PT-none-UpperBounds-06
FORMULA_NAME EnergyBus-PT-none-UpperBounds-07
FORMULA_NAME EnergyBus-PT-none-UpperBounds-08
FORMULA_NAME EnergyBus-PT-none-UpperBounds-09
FORMULA_NAME EnergyBus-PT-none-UpperBounds-10
FORMULA_NAME EnergyBus-PT-none-UpperBounds-11
FORMULA_NAME EnergyBus-PT-none-UpperBounds-12
FORMULA_NAME EnergyBus-PT-none-UpperBounds-13
FORMULA_NAME EnergyBus-PT-none-UpperBounds-14
FORMULA_NAME EnergyBus-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678492877104

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:01:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 00:01:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:01:18] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2023-03-11 00:01:18] [INFO ] Transformed 157 places.
[2023-03-11 00:01:19] [INFO ] Transformed 4430 transitions.
[2023-03-11 00:01:19] [INFO ] Found NUPN structural information;
[2023-03-11 00:01:19] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 4 places in 20 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 647 out of 1913 initially.
// Phase 1: matrix 647 rows 153 cols
[2023-03-11 00:01:19] [INFO ] Computed 23 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 15) seen :10
FORMULA EnergyBus-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
[2023-03-11 00:01:19] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2023-03-11 00:01:19] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-11 00:01:19] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-11 00:01:19] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:19] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-11 00:01:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:01:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-11 00:01:19] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 00:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:20] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-11 00:01:20] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-03-11 00:01:20] [INFO ] [Nat]Added 463 Read/Feed constraints in 51 ms returned sat
[2023-03-11 00:01:20] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 157 ms.
[2023-03-11 00:01:21] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
[2023-03-11 00:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-11 00:01:21] [INFO ] Added : 113 causal constraints over 23 iterations in 1311 ms. Result :sat
Minimization took 116 ms.
[2023-03-11 00:01:21] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 00:01:21] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:21] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-11 00:01:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:01:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-11 00:01:22] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 00:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:22] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-11 00:01:22] [INFO ] [Nat]Added 463 Read/Feed constraints in 55 ms returned sat
[2023-03-11 00:01:22] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2023-03-11 00:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-11 00:01:22] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 290 ms.
[2023-03-11 00:01:23] [INFO ] Added : 87 causal constraints over 18 iterations in 1005 ms. Result :sat
Minimization took 132 ms.
[2023-03-11 00:01:23] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-11 00:01:23] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:23] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-11 00:01:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:01:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 00:01:23] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:24] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-11 00:01:24] [INFO ] [Nat]Added 463 Read/Feed constraints in 61 ms returned sat
[2023-03-11 00:01:24] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 1 ms to minimize.
[2023-03-11 00:01:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-11 00:01:24] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 85 ms.
[2023-03-11 00:01:25] [INFO ] Added : 109 causal constraints over 22 iterations in 884 ms. Result :sat
Minimization took 100 ms.
[2023-03-11 00:01:25] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 00:01:25] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:25] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-11 00:01:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:01:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 00:01:25] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:25] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-11 00:01:25] [INFO ] [Nat]Added 463 Read/Feed constraints in 65 ms returned sat
[2023-03-11 00:01:26] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-11 00:01:26] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2023-03-11 00:01:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2023-03-11 00:01:26] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 85 ms.
[2023-03-11 00:01:26] [INFO ] Added : 78 causal constraints over 16 iterations in 749 ms. Result :sat
Minimization took 121 ms.
[2023-03-11 00:01:27] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-11 00:01:27] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-11 00:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:27] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-11 00:01:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:01:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-11 00:01:27] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 00:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:27] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-11 00:01:27] [INFO ] [Nat]Added 463 Read/Feed constraints in 58 ms returned sat
[2023-03-11 00:01:27] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 0 ms to minimize.
[2023-03-11 00:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-11 00:01:27] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 84 ms.
[2023-03-11 00:01:29] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
[2023-03-11 00:01:29] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-11 00:01:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 517 ms
[2023-03-11 00:01:29] [INFO ] Added : 125 causal constraints over 25 iterations in 1741 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 132 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions removed 29 transitions
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1067 transitions.
Graph (complete) has 751 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 138 transition count 837
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 134 transition count 834
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 134 transition count 825
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 125 transition count 825
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 53 place count 105 transition count 572
Iterating global reduction 2 with 20 rules applied. Total rules applied 73 place count 105 transition count 572
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 103 place count 105 transition count 542
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 119 place count 97 transition count 534
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 146 place count 97 transition count 507
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 96 transition count 505
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 96 transition count 505
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 164 place count 88 transition count 530
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 172 place count 88 transition count 522
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 213 place count 88 transition count 481
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 213 place count 88 transition count 476
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 227 place count 79 transition count 476
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 241 place count 72 transition count 469
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 22 edges and 72 vertex of which 2 / 72 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 243 place count 71 transition count 468
Drop transitions removed 2 transitions
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 6 with 194 rules applied. Total rules applied 437 place count 71 transition count 274
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 70 transition count 274
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 453 place count 70 transition count 259
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 461 place count 70 transition count 251
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 469 place count 62 transition count 251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 470 place count 62 transition count 261
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 477 place count 61 transition count 255
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 483 place count 61 transition count 249
Applied a total of 483 rules in 258 ms. Remains 61 /153 variables (removed 92) and now considering 249/1913 (removed 1664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 61/153 places, 249/1913 transitions.
Normalized transition count is 150 out of 249 initially.
// Phase 1: matrix 150 rows 61 cols
[2023-03-11 00:01:31] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1236 ms. (steps per millisecond=809 ) properties (out of 5) seen :4
FORMULA EnergyBus-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 1) seen :0
[2023-03-11 00:01:32] [INFO ] Flow matrix only has 150 transitions (discarded 99 similar events)
// Phase 1: matrix 150 rows 61 cols
[2023-03-11 00:01:32] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-11 00:01:32] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-11 00:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-11 00:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 00:01:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-11 00:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 00:01:33] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-11 00:01:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-11 00:01:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 19 ms returned sat
[2023-03-11 00:01:33] [INFO ] Computed and/alt/rep : 45/202/43 causal constraints (skipped 105 transitions) in 14 ms.
[2023-03-11 00:01:33] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2023-03-11 00:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-11 00:01:33] [INFO ] Added : 25 causal constraints over 7 iterations in 131 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA EnergyBus-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 14805 ms.
ITS solved all properties within timeout

BK_STOP 1678492894267

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="EnergyBus-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is EnergyBus-PT-none, 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 r170-tall-167838856800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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