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.r363-smll-167891814000277.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 smartxred
Input is SafeBus-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r363-smll-167891814000277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 19K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 393K Feb 26 01:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 26 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 26 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 244K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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 1.2M 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-10-UpperBounds-00
FORMULA_NAME SafeBus-PT-10-UpperBounds-01
FORMULA_NAME SafeBus-PT-10-UpperBounds-02
FORMULA_NAME SafeBus-PT-10-UpperBounds-03
FORMULA_NAME SafeBus-PT-10-UpperBounds-04
FORMULA_NAME SafeBus-PT-10-UpperBounds-05
FORMULA_NAME SafeBus-PT-10-UpperBounds-06
FORMULA_NAME SafeBus-PT-10-UpperBounds-07
FORMULA_NAME SafeBus-PT-10-UpperBounds-08
FORMULA_NAME SafeBus-PT-10-UpperBounds-09
FORMULA_NAME SafeBus-PT-10-UpperBounds-10
FORMULA_NAME SafeBus-PT-10-UpperBounds-11
FORMULA_NAME SafeBus-PT-10-UpperBounds-12
FORMULA_NAME SafeBus-PT-10-UpperBounds-13
FORMULA_NAME SafeBus-PT-10-UpperBounds-14
FORMULA_NAME SafeBus-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679093634329

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 22:53:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 22:53:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 22:53:57] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2023-03-17 22:53:57] [INFO ] Transformed 316 places.
[2023-03-17 22:53:57] [INFO ] Transformed 1631 transitions.
[2023-03-17 22:53:57] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduce places removed 10 places and 0 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 22:53:58] [INFO ] Computed 45 place invariants in 64 ms
FORMULA SafeBus-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 9) seen :20
FORMULA SafeBus-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :18
[2023-03-17 22:53:58] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 22:53:58] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-17 22:53:58] [INFO ] [Real]Absence check using 24 positive place invariants in 17 ms returned sat
[2023-03-17 22:53:58] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 26 ms returned unsat
[2023-03-17 22:53:59] [INFO ] [Real]Absence check using 24 positive place invariants in 19 ms returned sat
[2023-03-17 22:53:59] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-17 22:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:53:59] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-17 22:53:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:53:59] [INFO ] [Nat]Absence check using 24 positive place invariants in 14 ms returned sat
[2023-03-17 22:53:59] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 22:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:53:59] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-03-17 22:53:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:54:00] [INFO ] [Nat]Added 111 Read/Feed constraints in 292 ms returned sat
[2023-03-17 22:54:00] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 190 ms.
[2023-03-17 22:54:00] [INFO ] Added : 1 causal constraints over 1 iterations in 406 ms. Result :sat
Minimization took 422 ms.
[2023-03-17 22:54:01] [INFO ] [Real]Absence check using 24 positive place invariants in 24 ms returned sat
[2023-03-17 22:54:01] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 22:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:01] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-17 22:54:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:54:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-17 22:54:01] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-17 22:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:02] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-17 22:54:02] [INFO ] [Nat]Added 111 Read/Feed constraints in 435 ms returned sat
[2023-03-17 22:54:02] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 101 ms.
[2023-03-17 22:54:02] [INFO ] Added : 0 causal constraints over 0 iterations in 195 ms. Result :sat
Minimization took 1058 ms.
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 8 ms returned unsat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned sat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 7 ms returned unsat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 8 ms returned unsat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2023-03-17 22:54:04] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 10, 10, 1, 1, 1, 1] Max seen :[1, 9, 9, 1, 1, 1, 1]
FORMULA SafeBus-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 331 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 306/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 22:54:05] [INFO ] Computed 45 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7880 ms. (steps per millisecond=126 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1783 ms. (steps per millisecond=560 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2539 ms. (steps per millisecond=393 ) properties (out of 2) seen :10
[2023-03-17 22:54:17] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-17 22:54:17] [INFO ] Computed 45 place invariants in 22 ms
[2023-03-17 22:54:17] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-17 22:54:17] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 22:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:17] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-17 22:54:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:54:18] [INFO ] [Nat]Absence check using 24 positive place invariants in 15 ms returned sat
[2023-03-17 22:54:18] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 22:54:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:18] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-17 22:54:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:54:18] [INFO ] [Nat]Added 111 Read/Feed constraints in 464 ms returned sat
[2023-03-17 22:54:19] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 120 ms.
[2023-03-17 22:54:19] [INFO ] Added : 1 causal constraints over 1 iterations in 295 ms. Result :sat
Minimization took 389 ms.
[2023-03-17 22:54:19] [INFO ] [Real]Absence check using 24 positive place invariants in 18 ms returned sat
[2023-03-17 22:54:19] [INFO ] [Real]Absence check using 24 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-17 22:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:20] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2023-03-17 22:54:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:54:20] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2023-03-17 22:54:20] [INFO ] [Nat]Absence check using 24 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 22:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:20] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2023-03-17 22:54:21] [INFO ] [Nat]Added 111 Read/Feed constraints in 445 ms returned sat
[2023-03-17 22:54:21] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 109 ms.
[2023-03-17 22:54:21] [INFO ] Added : 0 causal constraints over 0 iterations in 199 ms. Result :sat
Minimization took 861 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 143 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 239 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 22:54:23] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 22:54:23] [INFO ] Invariant cache hit.
[2023-03-17 22:54:24] [INFO ] Implicit Places using invariants in 667 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 674 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 365 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1280 ms. Remains : 296/306 places, 1631/1631 transitions.
Normalized transition count is 642 out of 1631 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:54:24] [INFO ] Computed 35 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7636 ms. (steps per millisecond=130 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1691 ms. (steps per millisecond=591 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2429 ms. (steps per millisecond=411 ) properties (out of 2) seen :10
[2023-03-17 22:54:36] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:54:36] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-17 22:54:36] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:54:36] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 45 ms returned sat
[2023-03-17 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:36] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2023-03-17 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:54:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 22:54:36] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 22:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:37] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-17 22:54:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:54:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 393 ms returned sat
[2023-03-17 22:54:37] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 110 ms.
[2023-03-17 22:54:38] [INFO ] Added : 0 causal constraints over 0 iterations in 234 ms. Result :sat
Minimization took 484 ms.
[2023-03-17 22:54:38] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:54:38] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-17 22:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:38] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-17 22:54:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:54:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-17 22:54:39] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-17 22:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:39] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-17 22:54:39] [INFO ] [Nat]Added 111 Read/Feed constraints in 388 ms returned sat
[2023-03-17 22:54:39] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 103 ms.
[2023-03-17 22:54:40] [INFO ] Added : 0 causal constraints over 0 iterations in 200 ms. Result :sat
Minimization took 630 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 219 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 296/296 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 225 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-17 22:54:41] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 22:54:41] [INFO ] Invariant cache hit.
[2023-03-17 22:54:42] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-17 22:54:42] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 22:54:42] [INFO ] Invariant cache hit.
[2023-03-17 22:54:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:54:45] [INFO ] Implicit Places using invariants and state equation in 2761 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2023-03-17 22:54:45] [INFO ] Redundant transitions in 179 ms returned []
[2023-03-17 22:54:45] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-17 22:54:45] [INFO ] Invariant cache hit.
[2023-03-17 22:54:46] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 100 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 22:54:47] [INFO ] Redundant transitions in 45 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5791 ms. Remains : 296/296 places, 1531/1631 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:54:47] [INFO ] Computed 35 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7224 ms. (steps per millisecond=138 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1547 ms. (steps per millisecond=646 ) properties (out of 2) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2312 ms. (steps per millisecond=432 ) properties (out of 2) seen :10
[2023-03-17 22:54:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:54:58] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-17 22:54:58] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:54:58] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 22:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:58] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-17 22:54:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:54:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:54:58] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 8 ms returned sat
[2023-03-17 22:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:54:58] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-17 22:54:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:54:59] [INFO ] [Nat]Added 111 Read/Feed constraints in 250 ms returned sat
[2023-03-17 22:54:59] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 59 ms.
[2023-03-17 22:54:59] [INFO ] Added : 0 causal constraints over 0 iterations in 116 ms. Result :sat
Minimization took 382 ms.
[2023-03-17 22:54:59] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-17 22:54:59] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 22:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:00] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-03-17 22:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:55:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-17 22:55:00] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:00] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-17 22:55:01] [INFO ] [Nat]Added 111 Read/Feed constraints in 408 ms returned sat
[2023-03-17 22:55:01] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 65 ms.
[2023-03-17 22:55:01] [INFO ] Added : 0 causal constraints over 0 iterations in 120 ms. Result :sat
Minimization took 782 ms.
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[9, 9]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 103 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 104 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 22:55:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:02] [INFO ] Invariant cache hit.
[2023-03-17 22:55:02] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-17 22:55:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:02] [INFO ] Invariant cache hit.
[2023-03-17 22:55:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:05] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
[2023-03-17 22:55:05] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-17 22:55:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:05] [INFO ] Invariant cache hit.
[2023-03-17 22:55:06] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4128 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting property specific reduction for SafeBus-PT-10-UpperBounds-04
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:06] [INFO ] Computed 35 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :9
[2023-03-17 22:55:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:06] [INFO ] Computed 35 place invariants in 9 ms
[2023-03-17 22:55:06] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-17 22:55:06] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-17 22:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:06] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2023-03-17 22:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:55:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 22:55:07] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 22:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:07] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-17 22:55:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:07] [INFO ] [Nat]Added 111 Read/Feed constraints in 268 ms returned sat
[2023-03-17 22:55:07] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 96 ms.
[2023-03-17 22:55:07] [INFO ] Added : 0 causal constraints over 0 iterations in 181 ms. Result :sat
Minimization took 303 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 167 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:08] [INFO ] Computed 35 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6760 ms. (steps per millisecond=147 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1469 ms. (steps per millisecond=680 ) properties (out of 1) seen :9
[2023-03-17 22:55:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:16] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-17 22:55:16] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:55:16] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-17 22:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:16] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-17 22:55:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:55:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:55:17] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 22:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:17] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-17 22:55:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 250 ms returned sat
[2023-03-17 22:55:17] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 75 ms.
[2023-03-17 22:55:17] [INFO ] Added : 0 causal constraints over 0 iterations in 150 ms. Result :sat
Minimization took 479 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 133 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 159 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 22:55:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:18] [INFO ] Invariant cache hit.
[2023-03-17 22:55:19] [INFO ] Implicit Places using invariants in 948 ms returned []
[2023-03-17 22:55:19] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:19] [INFO ] Invariant cache hit.
[2023-03-17 22:55:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:21] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned []
Implicit Place search using SMT with State Equation took 3366 ms to find 0 implicit places.
[2023-03-17 22:55:21] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-17 22:55:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:21] [INFO ] Invariant cache hit.
[2023-03-17 22:55:23] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4916 ms. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-PT-10-UpperBounds-04 in 16958 ms.
Starting property specific reduction for SafeBus-PT-10-UpperBounds-06
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:23] [INFO ] Computed 35 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :9
[2023-03-17 22:55:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:23] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-17 22:55:23] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-17 22:55:23] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-17 22:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:23] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-17 22:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:55:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 22:55:23] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-17 22:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:24] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-17 22:55:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:24] [INFO ] [Nat]Added 111 Read/Feed constraints in 312 ms returned sat
[2023-03-17 22:55:24] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 93 ms.
[2023-03-17 22:55:24] [INFO ] Added : 0 causal constraints over 0 iterations in 165 ms. Result :sat
Minimization took 592 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 161 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 296/296 places, 1531/1531 transitions.
Normalized transition count is 642 out of 1531 initially.
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:25] [INFO ] Computed 35 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6913 ms. (steps per millisecond=144 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2225 ms. (steps per millisecond=449 ) properties (out of 1) seen :9
[2023-03-17 22:55:34] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-17 22:55:34] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-17 22:55:34] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-17 22:55:34] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-17 22:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:34] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-17 22:55:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 22:55:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-17 22:55:35] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 9 ms returned sat
[2023-03-17 22:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 22:55:35] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-17 22:55:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 306 ms returned sat
[2023-03-17 22:55:35] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 89 ms.
[2023-03-17 22:55:35] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 586 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[9]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 159 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 161 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-17 22:55:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:36] [INFO ] Invariant cache hit.
[2023-03-17 22:55:37] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-17 22:55:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:37] [INFO ] Invariant cache hit.
[2023-03-17 22:55:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-17 22:55:40] [INFO ] Implicit Places using invariants and state equation in 2266 ms returned []
Implicit Place search using SMT with State Equation took 3145 ms to find 0 implicit places.
[2023-03-17 22:55:40] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-17 22:55:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-17 22:55:40] [INFO ] Invariant cache hit.
[2023-03-17 22:55:41] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4880 ms. Remains : 296/296 places, 1531/1531 transitions.
Ending property specific reduction for SafeBus-PT-10-UpperBounds-06 in 18328 ms.
[2023-03-17 22:55:42] [INFO ] Flatten gal took : 278 ms
[2023-03-17 22:55:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-17 22:55:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 296 places, 1531 transitions and 10104 arcs took 15 ms.
Total runtime 104992 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SafeBus (PT), instance 10
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 296 places, 1531 transitions, 10104 arcs.
Final Score: 37754.233
Took : 45 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5167524 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16101968 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is SafeBus-PT-10, 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 r363-smll-167891814000277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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