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.r167-tall-167838852600133.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 lolaxred
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 r167-tall-167838852600133
=====================================================================

--------------------
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 1678445400999

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 10:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 10:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:50:02] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2023-03-10 10:50:02] [INFO ] Transformed 157 places.
[2023-03-10 10:50:02] [INFO ] Transformed 4430 transitions.
[2023-03-10 10:50:02] [INFO ] Found NUPN structural information;
[2023-03-10 10:50:02] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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-10 10:50:03] [INFO ] Computed 23 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 15) seen :11
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-05 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 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) 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 4) seen :0
[2023-03-10 10:50:03] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2023-03-10 10:50:03] [INFO ] Computed 23 place invariants in 12 ms
[2023-03-10 10:50:03] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-10 10:50:03] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 10:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:03] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-10 10:50:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-10 10:50:03] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 10:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:03] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-10 10:50:04] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-03-10 10:50:04] [INFO ] [Nat]Added 463 Read/Feed constraints in 52 ms returned sat
[2023-03-10 10:50:04] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 147 ms.
[2023-03-10 10:50:05] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 6 ms to minimize.
[2023-03-10 10:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-10 10:50:05] [INFO ] Added : 113 causal constraints over 23 iterations in 1217 ms. Result :sat
Minimization took 105 ms.
[2023-03-10 10:50:05] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-10 10:50:05] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 10:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:05] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-10 10:50:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-10 10:50:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 10:50:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:05] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-10 10:50:05] [INFO ] [Nat]Added 463 Read/Feed constraints in 58 ms returned sat
[2023-03-10 10:50:06] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-10 10:50:06] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 97 ms.
[2023-03-10 10:50:06] [INFO ] Added : 87 causal constraints over 18 iterations in 862 ms. Result :sat
Minimization took 126 ms.
[2023-03-10 10:50:07] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-10 10:50:07] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-10 10:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:07] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-10 10:50:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-10 10:50:07] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-10 10:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:07] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-10 10:50:07] [INFO ] [Nat]Added 463 Read/Feed constraints in 68 ms returned sat
[2023-03-10 10:50:07] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-10 10:50:07] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2023-03-10 10:50:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2023-03-10 10:50:07] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 86 ms.
[2023-03-10 10:50:08] [INFO ] Added : 78 causal constraints over 16 iterations in 804 ms. Result :sat
Minimization took 111 ms.
[2023-03-10 10:50:08] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-10 10:50:08] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-10 10:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:08] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-10 10:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-10 10:50:08] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-10 10:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:09] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-10 10:50:09] [INFO ] [Nat]Added 463 Read/Feed constraints in 58 ms returned sat
[2023-03-10 10:50:09] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 0 ms to minimize.
[2023-03-10 10:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-10 10:50:09] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 81 ms.
[2023-03-10 10:50:10] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-10 10:50:11] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-10 10:50:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 563 ms
[2023-03-10 10:50:11] [INFO ] Added : 125 causal constraints over 25 iterations in 1813 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 133 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 0 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 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 54 place count 104 transition count 524
Iterating global reduction 2 with 21 rules applied. Total rules applied 75 place count 104 transition count 524
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 105 place count 104 transition count 494
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 121 place count 96 transition count 486
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 148 place count 96 transition count 459
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 95 transition count 457
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 95 transition count 457
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 166 place count 87 transition count 482
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 174 place count 87 transition count 474
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 215 place count 87 transition count 433
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 215 place count 87 transition count 428
Deduced a syphon composed of 5 places in 1 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 229 place count 78 transition count 428
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 243 place count 71 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 23 edges and 71 vertex of which 2 / 71 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 245 place count 70 transition count 420
Drop transitions removed 2 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 6 with 170 rules applied. Total rules applied 415 place count 70 transition count 250
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 416 place count 69 transition count 250
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 431 place count 69 transition count 235
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 439 place count 69 transition count 227
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 447 place count 61 transition count 227
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 61 transition count 237
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 455 place count 60 transition count 231
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 461 place count 60 transition count 225
Applied a total of 461 rules in 229 ms. Remains 60 /153 variables (removed 93) and now considering 225/1913 (removed 1688) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 60/153 places, 225/1913 transitions.
Normalized transition count is 138 out of 225 initially.
// Phase 1: matrix 138 rows 60 cols
[2023-03-10 10:50:12] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 4) seen :3
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-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 1) seen :0
[2023-03-10 10:50:14] [INFO ] Flow matrix only has 138 transitions (discarded 87 similar events)
// Phase 1: matrix 138 rows 60 cols
[2023-03-10 10:50:14] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-10 10:50:14] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-10 10:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-10 10:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-10 10:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:14] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-10 10:50:14] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-10 10:50:14] [INFO ] [Nat]Added 99 Read/Feed constraints in 12 ms returned sat
[2023-03-10 10:50:14] [INFO ] Computed and/alt/rep : 45/202/43 causal constraints (skipped 93 transitions) in 12 ms.
[2023-03-10 10:50:14] [INFO ] Added : 17 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 225/225 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 223
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 221
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 219
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 57 transition count 217
Applied a total of 10 rules in 32 ms. Remains 57 /60 variables (removed 3) and now considering 217/225 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 57/60 places, 217/225 transitions.
Normalized transition count is 113 out of 217 initially.
// Phase 1: matrix 113 rows 57 cols
[2023-03-10 10:50:14] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 1) seen :0
[2023-03-10 10:50:16] [INFO ] Flow matrix only has 113 transitions (discarded 104 similar events)
// Phase 1: matrix 113 rows 57 cols
[2023-03-10 10:50:16] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-10 10:50:16] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-10 10:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-10 10:50:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-10 10:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-10 10:50:16] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-10 10:50:16] [INFO ] [Nat]Added 79 Read/Feed constraints in 10 ms returned sat
[2023-03-10 10:50:16] [INFO ] Computed and/alt/rep : 39/169/39 causal constraints (skipped 72 transitions) in 9 ms.
[2023-03-10 10:50:16] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2023-03-10 10:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-10 10:50:16] [INFO ] Added : 22 causal constraints over 6 iterations in 93 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 57/57 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 217/217 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2023-03-10 10:50:16] [INFO ] Flow matrix only has 113 transitions (discarded 104 similar events)
[2023-03-10 10:50:16] [INFO ] Invariant cache hit.
[2023-03-10 10:50:16] [INFO ] Implicit Places using invariants in 167 ms returned [3, 4, 5, 19, 45]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 171 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/57 places, 217/217 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 215
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 215
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 45 transition count 210
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 2 with 37 rules applied. Total rules applied 51 place count 45 transition count 173
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 45 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 43 transition count 171
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 43 transition count 171
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 43 transition count 167
Applied a total of 65 rules in 28 ms. Remains 43 /52 variables (removed 9) and now considering 167/217 (removed 50) transitions.
[2023-03-10 10:50:16] [INFO ] Flow matrix only has 81 transitions (discarded 86 similar events)
// Phase 1: matrix 81 rows 43 cols
[2023-03-10 10:50:16] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-10 10:50:16] [INFO ] Implicit Places using invariants in 77 ms returned [28, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/57 places, 167/217 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 38 transition count 164
Applied a total of 6 rules in 4 ms. Remains 38 /41 variables (removed 3) and now considering 164/167 (removed 3) transitions.
[2023-03-10 10:50:16] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 38 cols
[2023-03-10 10:50:16] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 10:50:16] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 10:50:16] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
[2023-03-10 10:50:16] [INFO ] Invariant cache hit.
[2023-03-10 10:50:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-10 10:50:16] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [7, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 101 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 36/57 places, 164/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 36 /36 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 399 ms. Remains : 36/57 places, 164/217 transitions.
Normalized transition count is 78 out of 164 initially.
// Phase 1: matrix 78 rows 36 cols
[2023-03-10 10:50:16] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=3021 ) properties (out of 1) seen :0
[2023-03-10 10:50:18] [INFO ] Flow matrix only has 78 transitions (discarded 86 similar events)
// Phase 1: matrix 78 rows 36 cols
[2023-03-10 10:50:18] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 10:50:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 10:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-10 10:50:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 10:50:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 10:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 10:50:18] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-10 10:50:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-10 10:50:18] [INFO ] [Nat]Added 39 Read/Feed constraints in 5 ms returned sat
[2023-03-10 10:50:18] [INFO ] Computed and/alt/rep : 38/209/38 causal constraints (skipped 38 transitions) in 5 ms.
[2023-03-10 10:50:18] [INFO ] Added : 23 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 16 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 16020 ms.
ITS solved all properties within timeout

BK_STOP 1678445419677

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="lolaxred"
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 lolaxred"
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 r167-tall-167838852600133"
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 ;