MCC'2022- Execution of r150-smll-165276998600245

About the Execution of ITS-Tools for PaceMaker-PT-none

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
407.619	312373.00	329414.00	1027.10	1 1 1 945 935 674 727 796 1 1 1 1 944 713 707 1	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998600245.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 itstools
Input is PaceMaker-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 01:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 01:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 158K 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 PaceMaker-PT-none-UpperBounds-00
FORMULA_NAME PaceMaker-PT-none-UpperBounds-01
FORMULA_NAME PaceMaker-PT-none-UpperBounds-02
FORMULA_NAME PaceMaker-PT-none-UpperBounds-03
FORMULA_NAME PaceMaker-PT-none-UpperBounds-04
FORMULA_NAME PaceMaker-PT-none-UpperBounds-05
FORMULA_NAME PaceMaker-PT-none-UpperBounds-06
FORMULA_NAME PaceMaker-PT-none-UpperBounds-07
FORMULA_NAME PaceMaker-PT-none-UpperBounds-08
FORMULA_NAME PaceMaker-PT-none-UpperBounds-09
FORMULA_NAME PaceMaker-PT-none-UpperBounds-10
FORMULA_NAME PaceMaker-PT-none-UpperBounds-11
FORMULA_NAME PaceMaker-PT-none-UpperBounds-12
FORMULA_NAME PaceMaker-PT-none-UpperBounds-13
FORMULA_NAME PaceMaker-PT-none-UpperBounds-14
FORMULA_NAME PaceMaker-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653048921965

Running Version 202205111006
[2022-05-20 12:15:23] [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-20 12:15:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:15:24] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-05-20 12:15:24] [INFO ] Transformed 70 places.
[2022-05-20 12:15:24] [INFO ] Transformed 164 transitions.
[2022-05-20 12:15:24] [INFO ] Parsed PT model containing 70 places and 164 transitions in 327 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 93 out of 164 initially.
// Phase 1: matrix 93 rows 70 cols
[2022-05-20 12:15:24] [INFO ] Computed 35 place invariants in 28 ms
FORMULA PaceMaker-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :6444
FORMULA PaceMaker-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PaceMaker-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PaceMaker-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PaceMaker-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PaceMaker-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :6439
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :6182
FORMULA PaceMaker-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :6431
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :6441
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :5881
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :6439
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :6441
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :6439
[2022-05-20 12:15:24] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2022-05-20 12:15:24] [INFO ] Computed 35 place invariants in 8 ms
[2022-05-20 12:15:24] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2022-05-20 12:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:24] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-05-20 12:15:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-20 12:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:30] [INFO ] [Nat]Absence check using state equation in 4941 ms returned unknown
[2022-05-20 12:15:30] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-20 12:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:30] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-20 12:15:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-20 12:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:33] [INFO ] [Nat]Absence check using state equation in 3440 ms returned sat
[2022-05-20 12:15:33] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:15:33] [INFO ] [Nat]Added 131 Read/Feed constraints in 42 ms returned sat
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 1 places in 45 ms of which 5 ms to minimize.
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 1 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 1 places in 42 ms of which 2 ms to minimize.
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 2 ms to minimize.
[2022-05-20 12:15:33] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 541 ms
[2022-05-20 12:15:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 541 ms
[2022-05-20 12:15:34] [INFO ] Computed and/alt/rep : 121/512/120 causal constraints (skipped 27 transitions) in 24 ms.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
[2022-05-20 12:15:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 174 ms
[2022-05-20 12:15:34] [INFO ] Added : 32 causal constraints over 7 iterations in 371 ms. Result :sat
Minimization took 335 ms.
[2022-05-20 12:15:35] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-20 12:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:35] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:15:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-20 12:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:38] [INFO ] [Nat]Absence check using state equation in 3410 ms returned sat
[2022-05-20 12:15:38] [INFO ] [Nat]Added 131 Read/Feed constraints in 31 ms returned sat
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2022-05-20 12:15:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 378 ms
[2022-05-20 12:15:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 378 ms
[2022-05-20 12:15:38] [INFO ] Computed and/alt/rep : 121/512/120 causal constraints (skipped 27 transitions) in 15 ms.
[2022-05-20 12:15:39] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
[2022-05-20 12:15:39] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2022-05-20 12:15:39] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
[2022-05-20 12:15:39] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
[2022-05-20 12:15:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 158 ms
[2022-05-20 12:15:39] [INFO ] Added : 31 causal constraints over 7 iterations in 316 ms. Result :sat
Minimization took 157 ms.
[2022-05-20 12:15:39] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-20 12:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:39] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:15:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2022-05-20 12:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:39] [INFO ] [Nat]Absence check using state equation in 148 ms returned unsat
[2022-05-20 12:15:39] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2022-05-20 12:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:39] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-20 12:15:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-20 12:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:44] [INFO ] [Nat]Absence check using state equation in 4961 ms returned unknown
[2022-05-20 12:15:44] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-20 12:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:45] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-20 12:15:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-20 12:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:48] [INFO ] [Nat]Absence check using state equation in 3498 ms returned sat
[2022-05-20 12:15:48] [INFO ] [Nat]Added 131 Read/Feed constraints in 37 ms returned sat
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 0 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 33 ms of which 0 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 0 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 0 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:15:48] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2022-05-20 12:15:49] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2022-05-20 12:15:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 450 ms
[2022-05-20 12:15:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 450 ms
[2022-05-20 12:15:49] [INFO ] Computed and/alt/rep : 121/512/120 causal constraints (skipped 27 transitions) in 18 ms.
[2022-05-20 12:15:49] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2022-05-20 12:15:49] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2022-05-20 12:15:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2022-05-20 12:15:49] [INFO ] Added : 45 causal constraints over 9 iterations in 373 ms. Result :sat
Minimization took 256 ms.
[2022-05-20 12:15:49] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-20 12:15:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:49] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-20 12:15:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-20 12:15:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:54] [INFO ] [Nat]Absence check using state equation in 4954 ms returned unknown
[2022-05-20 12:15:54] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-20 12:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:54] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-20 12:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:15:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-20 12:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:15:59] [INFO ] [Nat]Absence check using state equation in 4966 ms returned unknown
Current structural bounds on expressions (after SMT) : [951, 951, 951, 727, 951, 951, 951, 951] Max seen :[945, 935, 674, 727, 796, 944, 713, 707]
FORMULA PaceMaker-PT-none-UpperBounds-06 727 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 70 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 62 transition count 160
Applied a total of 12 rules in 44 ms. Remains 62 /70 variables (removed 8) and now considering 160/164 (removed 4) transitions.
[2022-05-20 12:16:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:16:00] [INFO ] Computed 31 place invariants in 3 ms
[2022-05-20 12:16:01] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/70 places, 160/164 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:16:01] [INFO ] Computed 31 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3526 ms. (steps per millisecond=283 ) properties (out of 7) seen :5712
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 7) seen :5456
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1161 ms. (steps per millisecond=861 ) properties (out of 7) seen :5712
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1369 ms. (steps per millisecond=730 ) properties (out of 7) seen :5712
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties (out of 7) seen :5156
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 7) seen :5708
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 7) seen :5712
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 7) seen :5710
[2022-05-20 12:16:12] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:16:12] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:16:12] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:13] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-20 12:16:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-20 12:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:20] [INFO ] [Nat]Absence check using state equation in 7278 ms returned unknown
[2022-05-20 12:16:20] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:16:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:27] [INFO ] [Nat]Absence check using state equation in 7021 ms returned unknown
[2022-05-20 12:16:27] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-20 12:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:27] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-20 12:16:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2022-05-20 12:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:34] [INFO ] [Nat]Absence check using state equation in 7013 ms returned unknown
[2022-05-20 12:16:34] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-20 12:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:34] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-20 12:16:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:35] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2022-05-20 12:16:35] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:16:36] [INFO ] [Nat]Added 131 Read/Feed constraints in 148 ms returned sat
[2022-05-20 12:16:36] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2022-05-20 12:16:36] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
[2022-05-20 12:16:36] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
[2022-05-20 12:16:36] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2022-05-20 12:16:36] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
[2022-05-20 12:16:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 171 ms
[2022-05-20 12:16:36] [INFO ] Computed and/alt/rep : 117/504/116 causal constraints (skipped 27 transitions) in 17 ms.
[2022-05-20 12:16:41] [INFO ] Added : 45 causal constraints over 9 iterations in 5685 ms. Result :sat
Minimization took 732 ms.
[2022-05-20 12:16:42] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:42] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-20 12:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:49] [INFO ] [Nat]Absence check using state equation in 7000 ms returned unknown
[2022-05-20 12:16:49] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:49] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-20 12:16:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:56] [INFO ] [Nat]Absence check using state equation in 6145 ms returned unknown
[2022-05-20 12:16:56] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:16:56] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-20 12:16:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:16:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2022-05-20 12:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:03] [INFO ] [Nat]Absence check using state equation in 7094 ms returned unknown
Current structural bounds on expressions (after SMT) : [951, 951, 951, 951, 951, 951, 951] Max seen :[945, 935, 674, 796, 944, 713, 707]
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 14 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 12 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:17:33] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:33] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:17:33] [INFO ] Implicit Places using invariants in 144 ms returned []
[2022-05-20 12:17:33] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:33] [INFO ] Computed 31 place invariants in 3 ms
[2022-05-20 12:17:33] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:17:33] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2022-05-20 12:17:33] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-20 12:17:33] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:33] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-20 12:17:34] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-03
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:34] [INFO ] Computed 31 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :945
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :689
[2022-05-20 12:17:34] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:34] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:17:34] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:34] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-20 12:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:17:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2022-05-20 12:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:39] [INFO ] [Nat]Absence check using state equation in 4972 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[945]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 12 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:17:39] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:39] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:17:39] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:39] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2872 ms. (steps per millisecond=348 ) properties (out of 1) seen :945
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 1) seen :689
[2022-05-20 12:17:43] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:43] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:17:43] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-20 12:17:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:17:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:50] [INFO ] [Nat]Absence check using state equation in 7048 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[945]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:17:50] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:50] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:17:50] [INFO ] Implicit Places using invariants in 120 ms returned []
[2022-05-20 12:17:50] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:50] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:17:50] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:17:51] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2022-05-20 12:17:51] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-20 12:17:51] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:51] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:17:51] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-03 in 17054 ms.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-04
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:51] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :933
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :933
[2022-05-20 12:17:51] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:51] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:17:51] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:51] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-20 12:17:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:17:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:17:56] [INFO ] [Nat]Absence check using state equation in 4971 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[933]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:17:56] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:56] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:17:56] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:17:56] [INFO ] Computed 31 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2582 ms. (steps per millisecond=387 ) properties (out of 1) seen :933
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :933
[2022-05-20 12:18:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:00] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:18:00] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:00] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-20 12:18:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:18:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2022-05-20 12:18:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:07] [INFO ] [Nat]Absence check using state equation in 7057 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[933]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:18:07] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:07] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:18:07] [INFO ] Implicit Places using invariants in 104 ms returned []
[2022-05-20 12:18:07] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:07] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:18:07] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:18:07] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-20 12:18:07] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-20 12:18:07] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:07] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:18:07] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-04 in 16624 ms.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-05
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:07] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :674
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :674
[2022-05-20 12:18:07] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:07] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:18:07] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:07] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-20 12:18:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:18:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:18:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:12] [INFO ] [Nat]Absence check using state equation in 4969 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[674]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 13 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:18:12] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:12] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:18:13] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:13] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3265 ms. (steps per millisecond=306 ) properties (out of 1) seen :674
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1400 ms. (steps per millisecond=714 ) properties (out of 1) seen :674
[2022-05-20 12:18:17] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:17] [INFO ] Computed 31 place invariants in 4 ms
[2022-05-20 12:18:17] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-20 12:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:17] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:18:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:18:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:24] [INFO ] [Nat]Absence check using state equation in 7048 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[674]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:18:24] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:25] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:18:25] [INFO ] Implicit Places using invariants in 110 ms returned []
[2022-05-20 12:18:25] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:25] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:18:25] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:18:25] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2022-05-20 12:18:25] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-20 12:18:25] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:25] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:18:25] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-05 in 17652 ms.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-07
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:25] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :796
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :796
[2022-05-20 12:18:25] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:18:25] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:18:25] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:25] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-20 12:18:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:18:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:18:26] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2022-05-20 12:18:26] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:18:26] [INFO ] [Nat]Added 131 Read/Feed constraints in 153 ms returned sat
[2022-05-20 12:18:26] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 0 ms to minimize.
[2022-05-20 12:18:26] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 0 ms to minimize.
[2022-05-20 12:18:26] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 2 ms to minimize.
[2022-05-20 12:18:26] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
[2022-05-20 12:18:26] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 0 ms to minimize.
[2022-05-20 12:18:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 172 ms
[2022-05-20 12:18:27] [INFO ] Computed and/alt/rep : 117/504/116 causal constraints (skipped 27 transitions) in 13 ms.
[2022-05-20 12:18:30] [INFO ] Added : 45 causal constraints over 9 iterations in 3604 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[796]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:19:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:00] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-20 12:19:00] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:00] [INFO ] Computed 31 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2894 ms. (steps per millisecond=345 ) properties (out of 1) seen :796
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=909 ) properties (out of 1) seen :796
[2022-05-20 12:19:04] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:04] [INFO ] Computed 31 place invariants in 3 ms
[2022-05-20 12:19:04] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-20 12:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:19:04] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-20 12:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:19:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-20 12:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:19:06] [INFO ] [Nat]Absence check using state equation in 1316 ms returned sat
[2022-05-20 12:19:06] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:19:06] [INFO ] [Nat]Added 131 Read/Feed constraints in 152 ms returned sat
[2022-05-20 12:19:06] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2022-05-20 12:19:06] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 0 ms to minimize.
[2022-05-20 12:19:06] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 2 ms to minimize.
[2022-05-20 12:19:06] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2022-05-20 12:19:06] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
[2022-05-20 12:19:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 199 ms
[2022-05-20 12:19:06] [INFO ] Computed and/alt/rep : 117/504/116 causal constraints (skipped 27 transitions) in 12 ms.
[2022-05-20 12:19:12] [INFO ] Added : 45 causal constraints over 9 iterations in 6218 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[796]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:19:42] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:42] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:19:42] [INFO ] Implicit Places using invariants in 131 ms returned []
[2022-05-20 12:19:42] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:43] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:19:43] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:19:43] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2022-05-20 12:19:43] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-20 12:19:43] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:43] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:19:43] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-07 in 77984 ms.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-12
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:43] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :944
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :944
[2022-05-20 12:19:43] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:43] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:19:43] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:19:43] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-20 12:19:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:19:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-20 12:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:19:48] [INFO ] [Nat]Absence check using state equation in 4958 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[944]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:19:48] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:48] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:19:48] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:48] [INFO ] Computed 31 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2974 ms. (steps per millisecond=336 ) properties (out of 1) seen :944
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 1) seen :944
[2022-05-20 12:19:52] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:19:52] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:19:52] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-20 12:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:19:52] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:19:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:19:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:00] [INFO ] [Nat]Absence check using state equation in 7146 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[944]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:20:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:00] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:00] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-20 12:20:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:00] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:00] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:20:00] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2022-05-20 12:20:00] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-20 12:20:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:00] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-12 in 17314 ms.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-13
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:00] [INFO ] Computed 31 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :713
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :713
[2022-05-20 12:20:00] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:00] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:00] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-20 12:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:00] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-20 12:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:20:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-20 12:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:04] [INFO ] [Nat]Absence check using state equation in 3550 ms returned sat
[2022-05-20 12:20:04] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:20:04] [INFO ] [Nat]Added 131 Read/Feed constraints in 49 ms returned sat
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 0 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 1 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 1 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2022-05-20 12:20:04] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
[2022-05-20 12:20:05] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
[2022-05-20 12:20:05] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
[2022-05-20 12:20:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 422 ms
[2022-05-20 12:20:05] [INFO ] Computed and/alt/rep : 117/504/116 causal constraints (skipped 27 transitions) in 18 ms.
[2022-05-20 12:20:05] [INFO ] Added : 17 causal constraints over 4 iterations in 186 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : [951] Max seen :[713]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:20:05] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:05] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:20:05] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:05] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2684 ms. (steps per millisecond=372 ) properties (out of 1) seen :713
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 1) seen :713
[2022-05-20 12:20:09] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:09] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:09] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:09] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-20 12:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:20:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:16] [INFO ] [Nat]Absence check using state equation in 6146 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[713]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:20:16] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:16] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-20 12:20:16] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:16] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:16] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:20:16] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-05-20 12:20:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-20 12:20:16] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:16] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:20:16] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-13 in 15780 ms.
Starting property specific reduction for PaceMaker-PT-none-UpperBounds-14
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:16] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :707
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :707
[2022-05-20 12:20:16] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:16] [INFO ] Computed 31 place invariants in 2 ms
[2022-05-20 12:20:16] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-20 12:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:16] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-20 12:20:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:20:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-20 12:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:21] [INFO ] [Nat]Absence check using state equation in 4970 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[707]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:20:21] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:21] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:21] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Normalized transition count is 88 out of 160 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:21] [INFO ] Computed 31 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2605 ms. (steps per millisecond=383 ) properties (out of 1) seen :707
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1124 ms. (steps per millisecond=889 ) properties (out of 1) seen :707
[2022-05-20 12:20:25] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:25] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 12:20:25] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-20 12:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:25] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-20 12:20:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:20:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-20 12:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:20:32] [INFO ] [Nat]Absence check using state equation in 7153 ms returned unknown
Current structural bounds on expressions (after SMT) : [951] Max seen :[707]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2022-05-20 12:20:32] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:32] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-20 12:20:32] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:32] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:33] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-05-20 12:20:33] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2022-05-20 12:20:33] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-20 12:20:33] [INFO ] Flow matrix only has 154 transitions (discarded 6 similar events)
Normalized transition count is 88 out of 154 initially.
// Phase 1: matrix 88 rows 62 cols
[2022-05-20 12:20:33] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 12:20:33] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 160/160 transitions.
Ending property specific reduction for PaceMaker-PT-none-UpperBounds-14 in 16752 ms.
[2022-05-20 12:20:33] [INFO ] Flatten gal took : 70 ms
[2022-05-20 12:20:33] [INFO ] Applying decomposition
[2022-05-20 12:20:33] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1458392699073153181.txt' '-o' '/tmp/graph1458392699073153181.bin' '-w' '/tmp/graph1458392699073153181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1458392699073153181.bin' '-l' '-1' '-v' '-w' '/tmp/graph1458392699073153181.weights' '-q' '0' '-e' '0.001'
[2022-05-20 12:20:33] [INFO ] Decomposing Gal with order
[2022-05-20 12:20:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 12:20:33] [INFO ] Removed a total of 105 redundant transitions.
[2022-05-20 12:20:33] [INFO ] Flatten gal took : 79 ms
[2022-05-20 12:20:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2022-05-20 12:20:33] [INFO ] Time to serialize gal into /tmp/UpperBounds15707790850868415652.gal : 10 ms
[2022-05-20 12:20:33] [INFO ] Time to serialize properties into /tmp/UpperBounds9842435135307621491.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15707790850868415652.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9842435135307621491.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9842435135307621491.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\_flat,2.30228e+16,0.279176,11784,375,204,16352,2265,515,19986,867,6373,0
Total reachable state count : 23022799788441600

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 945
Bounds property PaceMaker-PT-none-UpperBounds-03 :0 <= u13.LRI <= 945
FORMULA PaceMaker-PT-none-UpperBounds-03 945 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
PaceMaker-PT-none-UpperBounds-03,0,0.282135,11784,1,0,16352,2265,677,19986,892,6373,450
Min sum of variable value : 0
Maximum sum along a path : 935
Bounds property PaceMaker-PT-none-UpperBounds-04 :0 <= u4.VRP <= 935
FORMULA PaceMaker-PT-none-UpperBounds-04 935 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
PaceMaker-PT-none-UpperBounds-04,0,0.282818,11784,1,0,16352,2265,713,19986,900,6373,493
Min sum of variable value : 0
Maximum sum along a path : 674
Bounds property PaceMaker-PT-none-UpperBounds-05 :0 <= u5.A_VRGEctopic <= 674
FORMULA PaceMaker-PT-none-UpperBounds-05 674 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
PaceMaker-PT-none-UpperBounds-05,0,0.283471,11784,1,0,16352,2265,744,19986,907,6373,539
Min sum of variable value : 0
Maximum sum along a path : 796
Bounds property PaceMaker-PT-none-UpperBounds-07 :0 <= u23.A_RVConductor <= 796
FORMULA PaceMaker-PT-none-UpperBounds-07 796 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
PaceMaker-PT-none-UpperBounds-07,0,0.285459,11784,1,0,16352,2265,794,19986,914,6373,640
Min sum of variable value : 0
Maximum sum along a path : 944
Bounds property PaceMaker-PT-none-UpperBounds-12 :0 <= u15.A_AtrNoiseGenerator <= 944
FORMULA PaceMaker-PT-none-UpperBounds-12 944 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
PaceMaker-PT-none-UpperBounds-12,0,0.286455,11784,1,0,16352,2265,837,19986,926,6373,665
Min sum of variable value : 0
Maximum sum along a path : 713
Bounds property PaceMaker-PT-none-UpperBounds-13 :0 <= u10.RVConductor <= 713
FORMULA PaceMaker-PT-none-UpperBounds-13 713 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
PaceMaker-PT-none-UpperBounds-13,0,0.287428,11784,1,0,16352,2265,876,19986,931,6373,687
Min sum of variable value : 0
Maximum sum along a path : 707
Bounds property PaceMaker-PT-none-UpperBounds-14 :0 <= u12.SANode <= 707
FORMULA PaceMaker-PT-none-UpperBounds-14 707 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
PaceMaker-PT-none-UpperBounds-14,0,0.28834,11784,1,0,16352,2265,927,19986,935,6373,742
Total runtime 310449 ms.

BK_STOP 1653049234338

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="PaceMaker-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PaceMaker-PT-none, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998600245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PaceMaker-PT-none.tgz
mv PaceMaker-PT-none execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;