fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r215-oct2-165281605800100
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for SafeBus-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3411.907 184269.00 207271.00 130.10 6 1 6 1 1 1 5 6 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281605800100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SafeBus-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281605800100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 18K Apr 29 11:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 29 11:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 221K Apr 29 11:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 303K May 10 09:34 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-06-UpperBounds-00
FORMULA_NAME SafeBus-PT-06-UpperBounds-01
FORMULA_NAME SafeBus-PT-06-UpperBounds-02
FORMULA_NAME SafeBus-PT-06-UpperBounds-03
FORMULA_NAME SafeBus-PT-06-UpperBounds-04
FORMULA_NAME SafeBus-PT-06-UpperBounds-05
FORMULA_NAME SafeBus-PT-06-UpperBounds-06
FORMULA_NAME SafeBus-PT-06-UpperBounds-07
FORMULA_NAME SafeBus-PT-06-UpperBounds-08
FORMULA_NAME SafeBus-PT-06-UpperBounds-09
FORMULA_NAME SafeBus-PT-06-UpperBounds-10
FORMULA_NAME SafeBus-PT-06-UpperBounds-11
FORMULA_NAME SafeBus-PT-06-UpperBounds-12
FORMULA_NAME SafeBus-PT-06-UpperBounds-13
FORMULA_NAME SafeBus-PT-06-UpperBounds-14
FORMULA_NAME SafeBus-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653209102573

Running Version 0
[2022-05-22 08:45:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 08:45:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 08:45:05] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-05-22 08:45:05] [INFO ] Transformed 144 places.
[2022-05-22 08:45:05] [INFO ] Transformed 451 transitions.
[2022-05-22 08:45:05] [INFO ] Parsed PT model containing 144 places and 451 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 242 out of 451 initially.
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 08:45:05] [INFO ] Computed 29 place invariants in 37 ms
FORMULA SafeBus-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :25
FORMULA SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :19
[2022-05-22 08:45:05] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 08:45:05] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 2 ms returned unsat
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 7 ms returned unsat
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 14 positive place invariants in 34 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:05] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2022-05-22 08:45:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-22 08:45:06] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:06] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-05-22 08:45:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:06] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2022-05-22 08:45:06] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 2 ms to minimize.
[2022-05-22 08:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2022-05-22 08:45:06] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 38 ms.
[2022-05-22 08:45:06] [INFO ] Added : 22 causal constraints over 5 iterations in 159 ms. Result :sat
Minimization took 43 ms.
[2022-05-22 08:45:06] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-22 08:45:06] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 26 ms returned unsat
[2022-05-22 08:45:06] [INFO ] [Real]Absence check using 14 positive place invariants in 74 ms returned sat
[2022-05-22 08:45:06] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, 1, 31, 6, 1] Max seen :[6, 1, 5, 6, 1]
FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-06-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 31500 steps, including 1000 resets, run finished after 110 ms. (steps per millisecond=286 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 32 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Normalized transition count is 242 out of 451 initially.
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 08:45:07] [INFO ] Computed 29 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1925 ms. (steps per millisecond=519 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :5
[2022-05-22 08:45:09] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 08:45:09] [INFO ] Computed 29 place invariants in 7 ms
[2022-05-22 08:45:09] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-22 08:45:09] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:09] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-22 08:45:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-22 08:45:10] [INFO ] [Nat]Absence check using 14 positive and 15 generalized place invariants in 7 ms returned sat
[2022-05-22 08:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:10] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-22 08:45:10] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:10] [INFO ] [Nat]Added 43 Read/Feed constraints in 27 ms returned sat
[2022-05-22 08:45:10] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2022-05-22 08:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-22 08:45:10] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 26 ms.
[2022-05-22 08:45:10] [INFO ] Added : 22 causal constraints over 5 iterations in 137 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [31] Max seen :[5]
Incomplete Parikh walk after 31500 steps, including 1000 resets, run finished after 69 ms. (steps per millisecond=456 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 29 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2022-05-22 08:45:10] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2022-05-22 08:45:10] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-22 08:45:10] [INFO ] Implicit Places using invariants in 171 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 173 ms to find 6 implicit places.
[2022-05-22 08:45:10] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-22 08:45:10] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 132 cols
[2022-05-22 08:45:10] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-22 08:45:11] [INFO ] Dead Transitions using invariants and state equation in 314 ms returned [31, 38, 45, 52, 59, 66, 67, 74, 81, 88, 95, 102, 103, 110, 117, 124, 131, 138, 139, 146, 153, 160, 167, 174, 175, 182, 189, 196, 203, 210, 211, 218, 225, 232, 239, 246]
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions :[246, 239, 232, 225, 218, 211, 210, 203, 196, 189, 182, 175, 174, 167, 160, 153, 146, 139, 138, 131, 124, 117, 110, 103, 102, 95, 88, 81, 74, 67, 66, 59, 52, 45, 38, 31]
Starting structural reductions, iteration 1 : 132/138 places, 415/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 529
Applied a total of 12 rules in 41 ms. Remains 126 /132 variables (removed 6) and now considering 529/415 (removed -114) transitions.
[2022-05-22 08:45:11] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:11] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-22 08:45:11] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-05-22 08:45:11] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:11] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-22 08:45:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:12] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 126/138 places, 529/451 transitions.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:12] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2342 ms. (steps per millisecond=426 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 1) seen :5
[2022-05-22 08:45:15] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:15] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-22 08:45:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-22 08:45:15] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:15] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-22 08:45:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2022-05-22 08:45:15] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 7 ms returned sat
[2022-05-22 08:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:15] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-22 08:45:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 51 ms returned sat
[2022-05-22 08:45:15] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-05-22 08:45:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-22 08:45:15] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 36 ms.
[2022-05-22 08:45:16] [INFO ] Added : 42 causal constraints over 9 iterations in 246 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Incomplete Parikh walk after 134400 steps, including 1000 resets, run finished after 349 ms. (steps per millisecond=385 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 34 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 30 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2022-05-22 08:45:16] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:16] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-22 08:45:16] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-22 08:45:16] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:16] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-22 08:45:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:17] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2022-05-22 08:45:17] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-22 08:45:17] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:17] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-22 08:45:17] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Starting property specific reduction for SafeBus-PT-06-UpperBounds-06
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:17] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :5
[2022-05-22 08:45:17] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:17] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-22 08:45:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:17] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-22 08:45:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 15 ms returned sat
[2022-05-22 08:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:17] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-22 08:45:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:17] [INFO ] [Nat]Added 43 Read/Feed constraints in 51 ms returned sat
[2022-05-22 08:45:18] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2022-05-22 08:45:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-22 08:45:18] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 34 ms.
[2022-05-22 08:45:18] [INFO ] Added : 42 causal constraints over 9 iterations in 208 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Incomplete Parikh walk after 134400 steps, including 1000 resets, run finished after 408 ms. (steps per millisecond=329 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Normalized transition count is 356 out of 529 initially.
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:18] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2423 ms. (steps per millisecond=412 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 1) seen :5
[2022-05-22 08:45:22] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:22] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-22 08:45:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-22 08:45:22] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-22 08:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:22] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-22 08:45:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 08:45:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-22 08:45:22] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-22 08:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 08:45:22] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-22 08:45:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:22] [INFO ] [Nat]Added 43 Read/Feed constraints in 50 ms returned sat
[2022-05-22 08:45:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-22 08:45:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-22 08:45:22] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 23 ms.
[2022-05-22 08:45:22] [INFO ] Added : 42 causal constraints over 9 iterations in 251 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[5]
Incomplete Parikh walk after 134400 steps, including 1000 resets, run finished after 364 ms. (steps per millisecond=369 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2022-05-22 08:45:23] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-22 08:45:23] [INFO ] Implicit Places using invariants in 243 ms returned []
[2022-05-22 08:45:23] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:23] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-22 08:45:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-05-22 08:45:24] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2022-05-22 08:45:24] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-22 08:45:24] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2022-05-22 08:45:24] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-22 08:45:24] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Ending property specific reduction for SafeBus-PT-06-UpperBounds-06 in 6670 ms.
[2022-05-22 08:45:24] [INFO ] Flatten gal took : 171 ms
[2022-05-22 08:45:24] [INFO ] Applying decomposition
[2022-05-22 08:45:24] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15953827812942354322.txt, -o, /tmp/graph15953827812942354322.bin, -w, /tmp/graph15953827812942354322.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15953827812942354322.bin, -l, -1, -v, -w, /tmp/graph15953827812942354322.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 08:45:25] [INFO ] Decomposing Gal with order
[2022-05-22 08:45:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 08:45:25] [INFO ] Removed a total of 1228 redundant transitions.
[2022-05-22 08:45:25] [INFO ] Flatten gal took : 403 ms
[2022-05-22 08:45:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 23 ms.
[2022-05-22 08:45:25] [INFO ] Time to serialize gal into /tmp/UpperBounds8880121276590547130.gal : 4 ms
[2022-05-22 08:45:25] [INFO ] Time to serialize properties into /tmp/UpperBounds17790167274475690886.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8880121276590547130.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17790167274475690886.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8880121276590547130.gal -t CGAL -reachable-file /tmp/UpperBounds17790167274475690886.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds17790167274475690886.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,6.44639e+06,160.287,2685428,2,201798,5,8.07927e+06,6,0,833,6.52602e+06,0
Total reachable state count : 6446388

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property SafeBus-PT-06-UpperBounds-06 :0 <= gi1.gu7.wait_msg_1+gi1.gu7.wait_msg_2+gi1.gu7.wait_msg_3+gi1.gu7.wait_msg_4+gi1.gu7.wait_msg_5+gi1.gu7.wait_msg_6 <= 5
FORMULA SafeBus-PT-06-UpperBounds-06 5 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-06-UpperBounds-06,0,160.495,2685672,1,0,7,8.07927e+06,9,1,1197,6.52602e+06,4

BK_STOP 1653209286842

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is SafeBus-PT-06, 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 r215-oct2-165281605800100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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