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.r362-smll-167891812500261.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 SafeBus-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812500261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 222K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 158K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 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 SafeBus-PT-03-UpperBounds-00
FORMULA_NAME SafeBus-PT-03-UpperBounds-01
FORMULA_NAME SafeBus-PT-03-UpperBounds-02
FORMULA_NAME SafeBus-PT-03-UpperBounds-03
FORMULA_NAME SafeBus-PT-03-UpperBounds-04
FORMULA_NAME SafeBus-PT-03-UpperBounds-05
FORMULA_NAME SafeBus-PT-03-UpperBounds-06
FORMULA_NAME SafeBus-PT-03-UpperBounds-07
FORMULA_NAME SafeBus-PT-03-UpperBounds-08
FORMULA_NAME SafeBus-PT-03-UpperBounds-09
FORMULA_NAME SafeBus-PT-03-UpperBounds-10
FORMULA_NAME SafeBus-PT-03-UpperBounds-11
FORMULA_NAME SafeBus-PT-03-UpperBounds-12
FORMULA_NAME SafeBus-PT-03-UpperBounds-13
FORMULA_NAME SafeBus-PT-03-UpperBounds-14
FORMULA_NAME SafeBus-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679078844816

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=SafeBus-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 18:47:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 18:47:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 18:47:28] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2023-03-17 18:47:28] [INFO ] Transformed 57 places.
[2023-03-17 18:47:28] [INFO ] Transformed 91 transitions.
[2023-03-17 18:47:28] [INFO ] Found NUPN structural information;
[2023-03-17 18:47:28] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 18:47:28] [INFO ] Computed 17 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :9
FORMULA SafeBus-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :3
[2023-03-17 18:47:28] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 18:47:28] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-17 18:47:28] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2023-03-17 18:47:28] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-17 18:47:28] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-17 18:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:28] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-17 18:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:47:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-17 18:47:29] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-17 18:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:29] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-17 18:47:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:29] [INFO ] [Nat]Added 13 Read/Feed constraints in 18 ms returned sat
[2023-03-17 18:47:29] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 22 ms.
[2023-03-17 18:47:29] [INFO ] Added : 21 causal constraints over 5 iterations in 121 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1, 7] Max seen :[1, 2]
FORMULA SafeBus-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 22 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 54/54 places, 91/91 transitions.
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 18:47:29] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1429 ms. (steps per millisecond=699 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties (out of 1) seen :2
[2023-03-17 18:47:31] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 18:47:31] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-17 18:47:31] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-17 18:47:31] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-17 18:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-17 18:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:47:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-17 18:47:31] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-17 18:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:31] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-17 18:47:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 14 ms returned sat
[2023-03-17 18:47:31] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 13 ms.
[2023-03-17 18:47:31] [INFO ] Added : 21 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-17 18:47:31] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2023-03-17 18:47:31] [INFO ] Invariant cache hit.
[2023-03-17 18:47:32] [INFO ] Implicit Places using invariants in 141 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 144 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/54 places, 91/91 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 48 transition count 94
Applied a total of 6 rules in 18 ms. Remains 48 /51 variables (removed 3) and now considering 94/91 (removed -3) transitions.
[2023-03-17 18:47:32] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:32] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 18:47:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-17 18:47:32] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 18:47:32] [INFO ] Invariant cache hit.
[2023-03-17 18:47:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/54 places, 94/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 398 ms. Remains : 48/54 places, 94/91 transitions.
Normalized transition count is 71 out of 94 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:32] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1395 ms. (steps per millisecond=716 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 1) seen :2
[2023-03-17 18:47:34] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:34] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 18:47:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 18:47:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-17 18:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-17 18:47:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:47:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 18:47:34] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-17 18:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:34] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-17 18:47:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 13 ms returned sat
[2023-03-17 18:47:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
[2023-03-17 18:47:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-17 18:47:34] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 13 ms.
[2023-03-17 18:47:34] [INFO ] Added : 16 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 10 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 48/48 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 9 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-17 18:47:34] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 18:47:34] [INFO ] Invariant cache hit.
[2023-03-17 18:47:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-17 18:47:34] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 18:47:34] [INFO ] Invariant cache hit.
[2023-03-17 18:47:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-17 18:47:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 18:47:35] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 18:47:35] [INFO ] Invariant cache hit.
[2023-03-17 18:47:35] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 9 transitions.
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/48 places, 85/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 18:47:35] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 475 ms. Remains : 48/48 places, 85/94 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:35] [INFO ] Computed 14 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1327 ms. (steps per millisecond=753 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :2
[2023-03-17 18:47:37] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:37] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-17 18:47:37] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-17 18:47:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 18:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:37] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-17 18:47:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:47:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-17 18:47:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-17 18:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-17 18:47:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2023-03-17 18:47:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-17 18:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-17 18:47:37] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 9 ms.
[2023-03-17 18:47:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
[2023-03-17 18:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-17 18:47:37] [INFO ] Added : 25 causal constraints over 5 iterations in 143 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 18:47:37] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 18:47:37] [INFO ] Invariant cache hit.
[2023-03-17 18:47:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-17 18:47:37] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 18:47:37] [INFO ] Invariant cache hit.
[2023-03-17 18:47:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-17 18:47:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 18:47:37] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 18:47:37] [INFO ] Invariant cache hit.
[2023-03-17 18:47:37] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 48/48 places, 85/85 transitions.
Starting property specific reduction for SafeBus-PT-03-UpperBounds-02
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:37] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
[2023-03-17 18:47:38] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:38] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 18:47:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 18:47:38] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 14 ms returned sat
[2023-03-17 18:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-17 18:47:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:47:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 18:47:38] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-17 18:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:38] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-17 18:47:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:38] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2023-03-17 18:47:38] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
[2023-03-17 18:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-17 18:47:38] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 11 ms.
[2023-03-17 18:47:38] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-17 18:47:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-17 18:47:38] [INFO ] Added : 25 causal constraints over 5 iterations in 151 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 48/48 places, 85/85 transitions.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:38] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 1) seen :2
[2023-03-17 18:47:40] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 18:47:40] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 18:47:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 18:47:40] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2023-03-17 18:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:40] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-17 18:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:47:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 18:47:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-17 18:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:47:40] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-17 18:47:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:40] [INFO ] [Nat]Added 13 Read/Feed constraints in 15 ms returned sat
[2023-03-17 18:47:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-17 18:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-17 18:47:40] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 7 ms.
[2023-03-17 18:47:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-17 18:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-17 18:47:40] [INFO ] Added : 25 causal constraints over 5 iterations in 147 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[2]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 18:47:40] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 18:47:40] [INFO ] Invariant cache hit.
[2023-03-17 18:47:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-17 18:47:40] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 18:47:40] [INFO ] Invariant cache hit.
[2023-03-17 18:47:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 18:47:41] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-17 18:47:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 18:47:41] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 18:47:41] [INFO ] Invariant cache hit.
[2023-03-17 18:47:41] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 48/48 places, 85/85 transitions.
Ending property specific reduction for SafeBus-PT-03-UpperBounds-02 in 3222 ms.
[2023-03-17 18:47:41] [INFO ] Flatten gal took : 58 ms
[2023-03-17 18:47:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-17 18:47:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 85 transitions and 502 arcs took 3 ms.
Total runtime 13617 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SafeBus_PT_03
(NrP: 48 NrTr: 85 NrArc: 502)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.760sec


RS generation: 0m 0.163sec


-> reachability set: #nodes 2686 (2.7e+03) #states 4,182 (3)



starting MCC model checker
--------------------------

checking: place_bound(p39,p40,p41)
normalized: place_bound(p39,p40,p41)

-> the formula is 2

FORMULA SafeBus-PT-03-UpperBounds-02 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 24606 (2.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 110942 462135 573077
used/not used/entry size/cache size: 473758 66635106 16 1024MB
basic ops cache: hits/miss/sum: 596 3122 3718
used/not used/entry size/cache size: 7093 16770123 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 556 2686 3242
used/not used/entry size/cache size: 2686 8385922 32 256MB
max state cache: hits/miss/sum: 556 2686 3242
used/not used/entry size/cache size: 2686 8385922 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67084599
1 23927
2 335
3 3
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.984sec


BK_STOP 1679078868672

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:12315 (144), effective:589 (6)

initing FirstDep: 0m 0.000sec

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="SafeBus-PT-03"
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 SafeBus-PT-03, 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 r362-smll-167891812500261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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