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.r357-smll-167891806100261.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 itstools
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 r357-smll-167891806100261
=====================================================================

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

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-03
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-17 17:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 17:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 17:04:24] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-17 17:04:24] [INFO ] Transformed 57 places.
[2023-03-17 17:04:24] [INFO ] Transformed 91 transitions.
[2023-03-17 17:04:24] [INFO ] Found NUPN structural information;
[2023-03-17 17:04:24] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 17:04:24] [INFO ] Computed 17 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) 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 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :3
[2023-03-17 17:04:24] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 17:04:24] [INFO ] Computed 17 place invariants in 14 ms
[2023-03-17 17:04:24] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2023-03-17 17:04:24] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-17 17:04:24] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-17 17:04:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 17:04:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-17 17:04:24] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-17 17:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:24] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-17 17:04:24] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 18 ms returned sat
[2023-03-17 17:04:25] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 21 ms.
[2023-03-17 17:04:25] [INFO ] Added : 21 causal constraints over 5 iterations in 119 ms. Result :sat
Minimization took 31 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 18 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 19 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 17:04:25] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1402 ms. (steps per millisecond=713 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 1) seen :2
[2023-03-17 17:04:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-17 17:04:27] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-17 17:04:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-17 17:04:27] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-17 17:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-17 17:04:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 17:04:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-17 17:04:27] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-17 17:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:27] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-17 17:04:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 13 ms returned sat
[2023-03-17 17:04:27] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 12 ms.
[2023-03-17 17:04:27] [INFO ] Added : 21 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 44 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 7 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 7 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 17:04:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2023-03-17 17:04:27] [INFO ] Invariant cache hit.
[2023-03-17 17:04:27] [INFO ] Implicit Places using invariants in 145 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 148 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 14 ms. Remains 48 /51 variables (removed 3) and now considering 94/91 (removed -3) transitions.
[2023-03-17 17:04:27] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 17:04:27] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 17:04:27] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-17 17:04:27] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 17:04:27] [INFO ] Invariant cache hit.
[2023-03-17 17:04:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:28] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 265 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 433 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 17:04:28] [INFO ] Computed 14 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :2
[2023-03-17 17:04:30] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 17:04:30] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 17:04:30] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 17:04:30] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 13 ms returned sat
[2023-03-17 17:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-17 17:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 17:04:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-17 17:04:30] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-17 17:04:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2023-03-17 17:04:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
[2023-03-17 17:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-17 17:04:30] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 12 ms.
[2023-03-17 17:04:30] [INFO ] Added : 16 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 35 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 6 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 6 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 6 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-17 17:04:30] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 17:04:30] [INFO ] Invariant cache hit.
[2023-03-17 17:04:30] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-17 17:04:30] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 17:04:30] [INFO ] Invariant cache hit.
[2023-03-17 17:04:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:30] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-17 17:04:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 17:04:30] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2023-03-17 17:04:30] [INFO ] Invariant cache hit.
[2023-03-17 17:04:30] [INFO ] Dead Transitions using invariants and state equation in 103 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 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 17:04:30] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 366 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 17:04:30] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1332 ms. (steps per millisecond=750 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 1) seen :2
[2023-03-17 17:04:32] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 17:04:32] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 17:04:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 17:04:32] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-17 17:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 17:04:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-17 17:04:32] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-17 17:04:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2023-03-17 17:04:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
[2023-03-17 17:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-17 17:04:32] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 9 ms.
[2023-03-17 17:04:33] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-17 17:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-17 17:04:33] [INFO ] Added : 25 causal constraints over 5 iterations in 123 ms. Result :sat
Minimization took 29 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 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 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 17:04:33] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 17:04:33] [INFO ] Invariant cache hit.
[2023-03-17 17:04:33] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-17 17:04:33] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 17:04:33] [INFO ] Invariant cache hit.
[2023-03-17 17:04:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:33] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-17 17:04:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 17:04:33] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 17:04:33] [INFO ] Invariant cache hit.
[2023-03-17 17:04:33] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 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 17:04:33] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 17:04:33] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 17:04:33] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-17 17:04:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 17:04:33] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-17 17:04:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 17:04:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-17 17:04:33] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-17 17:04:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 10 ms returned sat
[2023-03-17 17:04:33] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-17 17:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-17 17:04:33] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 7 ms.
[2023-03-17 17:04:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-17 17:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-17 17:04:33] [INFO ] Added : 25 causal constraints over 5 iterations in 120 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 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.
Normalized transition count is 71 out of 85 initially.
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 17:04:33] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1278 ms. (steps per millisecond=782 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 1) seen :2
[2023-03-17 17:04:35] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2023-03-17 17:04:35] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 17:04:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 17:04:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-17 17:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:35] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-17 17:04:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 17:04:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-17 17:04:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-17 17:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 17:04:35] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-17 17:04:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 9 ms returned sat
[2023-03-17 17:04:35] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-17 17:04:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-17 17:04:36] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 8 ms.
[2023-03-17 17:04:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-17 17:04:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-17 17:04:36] [INFO ] Added : 25 causal constraints over 5 iterations in 118 ms. Result :sat
Minimization took 29 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 4 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 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-03-17 17:04:36] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 17:04:36] [INFO ] Invariant cache hit.
[2023-03-17 17:04:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-17 17:04:36] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 17:04:36] [INFO ] Invariant cache hit.
[2023-03-17 17:04:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-17 17:04:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-17 17:04:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 17:04:36] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2023-03-17 17:04:36] [INFO ] Invariant cache hit.
[2023-03-17 17:04:36] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 48/48 places, 85/85 transitions.
Ending property specific reduction for SafeBus-PT-03-UpperBounds-02 in 3041 ms.
[2023-03-17 17:04:36] [INFO ] Flatten gal took : 51 ms
[2023-03-17 17:04:36] [INFO ] Applying decomposition
[2023-03-17 17:04:36] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9799716024281778149.txt' '-o' '/tmp/graph9799716024281778149.bin' '-w' '/tmp/graph9799716024281778149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9799716024281778149.bin' '-l' '-1' '-v' '-w' '/tmp/graph9799716024281778149.weights' '-q' '0' '-e' '0.001'
[2023-03-17 17:04:36] [INFO ] Decomposing Gal with order
[2023-03-17 17:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 17:04:36] [INFO ] Removed a total of 69 redundant transitions.
[2023-03-17 17:04:37] [INFO ] Flatten gal took : 60 ms
[2023-03-17 17:04:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 9 ms.
[2023-03-17 17:04:37] [INFO ] Time to serialize gal into /tmp/UpperBounds17746338409676104211.gal : 4 ms
[2023-03-17 17:04:37] [INFO ] Time to serialize properties into /tmp/UpperBounds16020978566621507359.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17746338409676104211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16020978566621507359.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds16020978566621507359.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,4182,0.110419,6336,2,1389,5,10443,6,0,306,11470,0
Total reachable state count : 4182

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property SafeBus-PT-03-UpperBounds-02 :0 <= gi1.gu3.wait_msg_1+gi1.gu2.wait_msg_2+gi1.gu2.wait_msg_3 <= 2
FORMULA SafeBus-PT-03-UpperBounds-02 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SafeBus-PT-03-UpperBounds-02,0,0.113608,6336,1,0,7,10443,9,1,423,11470,4
Total runtime 13192 ms.

BK_STOP 1679072678117

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
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 r357-smll-167891806100261"
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 ;