Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761200495.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761200495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 13 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 708K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716987000174

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 12:50:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:50:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:50:01] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-29 12:50:01] [INFO ] Transformed 2723 places.
[2024-05-29 12:50:01] [INFO ] Transformed 2523 transitions.
[2024-05-29 12:50:01] [INFO ] Found NUPN structural information;
[2024-05-29 12:50:01] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2036 ms. (19 steps per ms) remains 6/16 properties
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 6/6 properties
[2024-05-29 12:50:02] [INFO ] Flatten gal took : 422 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1158 ms. (34 steps per ms) remains 6/6 properties
[2024-05-29 12:50:03] [INFO ] Flatten gal took : 319 ms
BEST_FIRST walk for 40004 steps (8 resets) in 929 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
[2024-05-29 12:50:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7278955831826853124.gal : 115 ms
[2024-05-29 12:50:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4372835426839359644.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7278955831826853124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4372835426839359644.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 2523 rows 2723 cols
[2024-05-29 12:50:03] [INFO ] Computed 441 invariants in 30 ms
Loading property file /tmp/ReachabilityCardinality4372835426839359644.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1319/1504 variables, 198/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1504 variables, 1319/1702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1219/2723 variables, 243/1945 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2723 variables, 1219/3164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2723 variables, 0/3164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2523/5246 variables, 2723/5887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5246 variables, 0/5887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/5246 variables, 0/5887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5246/5246 variables, and 5887 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3212 ms.
Refiners :[Domain max(s): 2723/2723 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 2723/2723 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1319/1504 variables, 198/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1504 variables, 1319/1702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 32 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 11 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 108
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :108 after 422
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :422 after 606
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :606 after 1.18742e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.18742e+08 after 2.07157e+16
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2.07157e+16 after 1.08284e+33
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.08284e+33 after 5.69741e+70
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 3 ms to minimize.
Problem ShieldPPPs-PT-040B-ReachabilityFireability-2024-04 is UNSAT
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1504 variables, 13/1715 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1504 variables, 1/1716 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1504 variables, 0/1716 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1219/2723 variables, 243/1959 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2723 variables, 1219/3178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-29 12:50:10] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 6 ms to minimize.
[2024-05-29 12:50:10] [INFO ] Deduced a trap composed of 37 places in 339 ms of which 6 ms to minimize.
[2024-05-29 12:50:10] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 6 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 5 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 6 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 34 places in 304 ms of which 6 ms to minimize.
SMT process timed out in 8555ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 166 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 2723 transition count 2286
Reduce places removed 237 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 253 rules applied. Total rules applied 490 place count 2486 transition count 2270
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 506 place count 2470 transition count 2270
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 506 place count 2470 transition count 2071
Deduced a syphon composed of 199 places in 5 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 904 place count 2271 transition count 2071
Discarding 245 places :
Symmetric choice reduction at 3 with 245 rule applications. Total rules 1149 place count 2026 transition count 1826
Iterating global reduction 3 with 245 rules applied. Total rules applied 1394 place count 2026 transition count 1826
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 1394 place count 2026 transition count 1738
Deduced a syphon composed of 88 places in 41 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1570 place count 1938 transition count 1738
Performed 553 Post agglomeration using F-continuation condition.Transition count delta: 553
Deduced a syphon composed of 553 places in 3 ms
Reduce places removed 553 places and 0 transitions.
Iterating global reduction 3 with 1106 rules applied. Total rules applied 2676 place count 1385 transition count 1185
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 303 times.
Drop transitions (Partial Free agglomeration) removed 303 transitions
Iterating global reduction 3 with 303 rules applied. Total rules applied 2979 place count 1385 transition count 1185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2980 place count 1384 transition count 1184
Applied a total of 2980 rules in 946 ms. Remains 1384 /2723 variables (removed 1339) and now considering 1184/2523 (removed 1339) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 955 ms. Remains : 1384/2723 places, 1184/2523 transitions.
RANDOM walk for 40000 steps (8 resets) in 1139 ms. (35 steps per ms) remains 3/5 properties
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1153 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 439 ms. (90 steps per ms) remains 3/3 properties
// Phase 1: matrix 1184 rows 1384 cols
[2024-05-29 12:50:13] [INFO ] Computed 441 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 406/533 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 186/719 variables, 73/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/719 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/731 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 813/1544 variables, 731/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 614/2158 variables, 360/1304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2158 variables, 87/1391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2158 variables, 2/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2158 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 43/2201 variables, 40/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2201 variables, 28/1461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2201 variables, 0/1461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 45/2246 variables, 22/1483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2246 variables, 14/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2246 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/2252 variables, 3/1500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2252 variables, 6/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2252 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 241/2493 variables, 178/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2493 variables, 36/1720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2493 variables, 1/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2493 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 12/2505 variables, 14/1735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2505 variables, 12/1747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2505 variables, 0/1747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 10/2515 variables, 5/1752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2515 variables, 6/1758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2515 variables, 0/1758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 6/2521 variables, 3/1761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2521 variables, 6/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2521 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 1/2522 variables, 1/1768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2522 variables, 1/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2522 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 46/2568 variables, 42/1811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2568 variables, 14/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2568 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 0/2568 variables, 0/1825 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2568/2568 variables, and 1825 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2219 ms.
Refiners :[Positive P Invariants (semi-flows): 426/426 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1384/1384 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 406/533 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 186/719 variables, 73/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/719 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/719 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/731 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 813/1544 variables, 731/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:17] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1544 variables, 1/955 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1544 variables, 1/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:17] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1544 variables, 1/957 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:17] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1544 variables, 1/958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1544 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 614/2158 variables, 360/1318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2158 variables, 87/1405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2158 variables, 2/1407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2158 variables, 3/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:18] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 4 ms to minimize.
[2024-05-29 12:50:18] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 3 ms to minimize.
[2024-05-29 12:50:19] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 5 ms to minimize.
[2024-05-29 12:50:19] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:50:19] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:50:19] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 3 ms to minimize.
[2024-05-29 12:50:20] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-29 12:50:20] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:50:20] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-05-29 12:50:20] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
[2024-05-29 12:50:20] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:50:20] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
[2024-05-29 12:50:21] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:50:21] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
[2024-05-29 12:50:21] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:50:21] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2024-05-29 12:50:21] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 5 ms to minimize.
[2024-05-29 12:50:22] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-29 12:50:22] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-29 12:50:22] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2158 variables, 20/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:22] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-29 12:50:22] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 9 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-29 12:50:23] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 12:50:24] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2158 variables, 10/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2158 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 43/2201 variables, 40/1480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2201 variables, 28/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:24] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:50:24] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-05-29 12:50:25] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 12:50:25] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2201 variables, 4/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2201 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 45/2246 variables, 22/1534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2246 variables, 14/1548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:25] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/2246 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/2246 variables, 1/1550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2246 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 6/2252 variables, 3/1553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2252 variables, 6/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2252 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 241/2493 variables, 178/1737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2493 variables, 36/1773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2493 variables, 1/1774 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:27] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-29 12:50:27] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 3 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 3 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 5 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-29 12:50:28] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-29 12:50:29] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-05-29 12:50:29] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-29 12:50:29] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/2493 variables, 11/1785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:29] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-29 12:50:30] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2493 variables, 2/1787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2493 variables, 0/1787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 12/2505 variables, 14/1801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2505 variables, 12/1813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:30] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-05-29 12:50:30] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-05-29 12:50:31] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/2505 variables, 3/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2505 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 10/2515 variables, 5/1821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2515 variables, 6/1827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:32] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/2515 variables, 1/1828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:32] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 3 ms to minimize.
[2024-05-29 12:50:32] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-29 12:50:32] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/2515 variables, 3/1831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2515 variables, 0/1831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 6/2521 variables, 3/1834 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2521 variables, 6/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2521 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 1/2522 variables, 1/1841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2522 variables, 1/1842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2522 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 46/2568 variables, 42/1884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2568 variables, 14/1898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:34] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-29 12:50:34] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-05-29 12:50:34] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/2568 variables, 3/1901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2568 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 0/2568 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2568/2568 variables, and 1901 constraints, problems are : Problem set: 0 solved, 3 unsolved in 19518 ms.
Refiners :[Positive P Invariants (semi-flows): 426/426 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1384/1384 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 73/73 constraints]
After SMT, in 21839ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2170 ms.
Support contains 127 out of 1384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1384/1384 places, 1184/1184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1384 transition count 1180
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1380 transition count 1179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1379 transition count 1179
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 10 place count 1379 transition count 1173
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 1373 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 1372 transition count 1172
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 1372 transition count 1172
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 60 place count 1354 transition count 1154
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 1354 transition count 1154
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 1348 transition count 1148
Applied a total of 70 rules in 195 ms. Remains 1348 /1384 variables (removed 36) and now considering 1148/1184 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 1348/1384 places, 1148/1184 transitions.
RANDOM walk for 40000 steps (8 resets) in 714 ms. (55 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 107055 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 3
Probabilistic random walk after 107055 steps, saw 76808 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1148 rows 1348 cols
[2024-05-29 12:50:41] [INFO ] Computed 441 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 393/520 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 128/648 variables, 54/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/654 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/654 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 760/1414 variables, 654/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 646/2060 variables, 385/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2060 variables, 100/1331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2060 variables, 3/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2060 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 30/2090 variables, 35/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2090 variables, 30/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2090 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 38/2128 variables, 19/1418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2128 variables, 12/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2128 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/2136 variables, 4/1434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2136 variables, 6/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2136 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1/2137 variables, 1/1441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2137 variables, 1/1442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2137 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 263/2400 variables, 179/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2400 variables, 43/1664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2400 variables, 1/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2400 variables, 0/1665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 12/2412 variables, 15/1680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2412 variables, 12/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2412 variables, 0/1692 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 12/2424 variables, 6/1698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2424 variables, 6/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2424 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 6/2430 variables, 3/1707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2430 variables, 6/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2430 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 1/2431 variables, 1/1714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2431 variables, 1/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2431 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 65/2496 variables, 56/1771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2496 variables, 18/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2496 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 0/2496 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2496/2496 variables, and 1789 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2177 ms.
Refiners :[Positive P Invariants (semi-flows): 427/427 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1348/1348 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 393/520 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 128/648 variables, 54/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:50:44] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/654 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:45] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 760/1414 variables, 654/860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:46] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1414 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1414 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 646/2060 variables, 385/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2060 variables, 100/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2060 variables, 3/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2060 variables, 3/1352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:46] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-29 12:50:47] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-05-29 12:50:47] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:50:47] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:50:47] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 3 ms to minimize.
[2024-05-29 12:50:47] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 2 ms to minimize.
[2024-05-29 12:50:48] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 3 ms to minimize.
[2024-05-29 12:50:48] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:50:48] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2024-05-29 12:50:48] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 2 ms to minimize.
[2024-05-29 12:50:48] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-29 12:50:48] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 3 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 12:50:49] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 3 ms to minimize.
[2024-05-29 12:50:50] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 3 ms to minimize.
[2024-05-29 12:50:50] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2060 variables, 20/1372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:50] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-05-29 12:50:50] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-29 12:50:50] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 12:50:51] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 12:50:52] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-29 12:50:53] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 12:50:53] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2060 variables, 18/1390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:53] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2060 variables, 1/1391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:53] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2060 variables, 1/1392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2060 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 30/2090 variables, 35/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2090 variables, 30/1457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:54] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-29 12:50:54] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2090 variables, 2/1459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2090 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 38/2128 variables, 19/1478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2128 variables, 12/1490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:55] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-29 12:50:55] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2128 variables, 2/1492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2128 variables, 0/1492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 8/2136 variables, 4/1496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2136 variables, 6/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2136 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 1/2137 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2137 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:56] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2137 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2137 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 263/2400 variables, 179/1684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2400 variables, 43/1727 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2400 variables, 1/1728 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:57] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-29 12:50:57] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2400 variables, 2/1730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2400 variables, 0/1730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 12/2412 variables, 15/1745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2412 variables, 12/1757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:50:58] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-29 12:50:58] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 12:50:58] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/2412 variables, 3/1760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2412 variables, 0/1760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 12/2424 variables, 6/1766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2424 variables, 6/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2424 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 6/2430 variables, 3/1775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2430 variables, 6/1781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2430 variables, 0/1781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 1/2431 variables, 1/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2431 variables, 1/1783 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:51:00] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/2431 variables, 1/1784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2431 variables, 0/1784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 65/2496 variables, 56/1840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2496 variables, 18/1858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 12:51:01] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-29 12:51:01] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/2496 variables, 2/1860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2496 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 0/2496 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2496/2496 variables, and 1860 constraints, problems are : Problem set: 0 solved, 3 unsolved in 18438 ms.
Refiners :[Positive P Invariants (semi-flows): 427/427 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1348/1348 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 68/68 constraints]
After SMT, in 20682ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2436 ms.
Support contains 127 out of 1348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1348/1348 places, 1148/1148 transitions.
Applied a total of 0 rules in 45 ms. Remains 1348 /1348 variables (removed 0) and now considering 1148/1148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1348/1348 places, 1148/1148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1348/1348 places, 1148/1148 transitions.
Applied a total of 0 rules in 36 ms. Remains 1348 /1348 variables (removed 0) and now considering 1148/1148 (removed 0) transitions.
[2024-05-29 12:51:04] [INFO ] Invariant cache hit.
[2024-05-29 12:51:05] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-29 12:51:05] [INFO ] Invariant cache hit.
[2024-05-29 12:51:06] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2024-05-29 12:51:06] [INFO ] Redundant transitions in 61 ms returned []
Running 1117 sub problems to find dead transitions.
[2024-05-29 12:51:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1317 variables, 314/314 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1317 variables, 14/328 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 12:51:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:51:29] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:51:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1317 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:51:32] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-05-29 12:51:33] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
[2024-05-29 12:51:33] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:51:33] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:51:33] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1317/2496 variables, and 365 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 314/427 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/1348 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1317 variables, 314/314 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1317 variables, 14/328 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1317 variables, 37/365 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:38] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 4 ms to minimize.
[2024-05-29 12:51:38] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 4 ms to minimize.
[2024-05-29 12:51:38] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 5 ms to minimize.
[2024-05-29 12:51:39] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 5 ms to minimize.
[2024-05-29 12:51:39] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 4 ms to minimize.
[2024-05-29 12:51:39] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 4 ms to minimize.
[2024-05-29 12:51:40] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 5 ms to minimize.
[2024-05-29 12:51:40] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 4 ms to minimize.
[2024-05-29 12:51:40] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 4 ms to minimize.
[2024-05-29 12:51:40] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 4 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 4 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 4 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 4 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 5 ms to minimize.
[2024-05-29 12:51:42] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 4 ms to minimize.
[2024-05-29 12:51:42] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 4 ms to minimize.
[2024-05-29 12:51:42] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 5 ms to minimize.
[2024-05-29 12:51:42] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 4 ms to minimize.
[2024-05-29 12:51:43] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 4 ms to minimize.
[2024-05-29 12:51:43] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1317 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:43] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 4 ms to minimize.
[2024-05-29 12:51:44] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 4 ms to minimize.
[2024-05-29 12:51:44] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 4 ms to minimize.
[2024-05-29 12:51:44] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 4 ms to minimize.
[2024-05-29 12:51:44] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 4 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 4 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 4 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 4 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-05-29 12:51:46] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:51:46] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 4 ms to minimize.
[2024-05-29 12:51:46] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 4 ms to minimize.
[2024-05-29 12:51:46] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 5 ms to minimize.
[2024-05-29 12:51:47] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 4 ms to minimize.
[2024-05-29 12:51:47] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 3 ms to minimize.
[2024-05-29 12:51:47] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:51:47] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 4 ms to minimize.
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1317 variables, 20/405 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 4 ms to minimize.
[2024-05-29 12:51:49] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:51:49] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 4 ms to minimize.
[2024-05-29 12:51:49] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 4 ms to minimize.
[2024-05-29 12:51:49] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 4 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 4 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 4 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 4 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 3 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 5 ms to minimize.
[2024-05-29 12:51:51] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 4 ms to minimize.
[2024-05-29 12:51:51] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 4 ms to minimize.
[2024-05-29 12:51:51] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 3 ms to minimize.
[2024-05-29 12:51:51] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 3 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 4 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 4 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 7 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1317 variables, 20/425 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:53] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-05-29 12:51:53] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-05-29 12:51:53] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 3 ms to minimize.
[2024-05-29 12:51:53] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 4 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 4 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 3 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 3 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 3 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 4 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 3 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1317 variables, 20/445 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 3 ms to minimize.
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 3 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 4 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 3 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 3 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1317 variables, 20/465 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 4 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:52:02] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-05-29 12:52:02] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:52:02] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-05-29 12:52:02] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-05-29 12:52:02] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-29 12:52:02] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 3 ms to minimize.
[2024-05-29 12:52:03] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-05-29 12:52:04] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1317 variables, 20/485 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
[2024-05-29 12:52:04] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-29 12:52:04] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-05-29 12:52:04] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-05-29 12:52:04] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-05-29 12:52:04] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 3 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 3 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-05-29 12:52:05] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-29 12:52:06] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-29 12:52:06] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-29 12:52:06] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 3 ms to minimize.
[2024-05-29 12:52:06] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-29 12:52:06] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 3 ms to minimize.
[2024-05-29 12:52:06] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-29 12:52:07] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/2496 variables, and 504 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 314/427 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/1348 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 176/176 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62399 ms. Remains : 1348/1348 places, 1148/1148 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 12:52:07] [INFO ] Flatten gal took : 89 ms
[2024-05-29 12:52:07] [INFO ] Applying decomposition
[2024-05-29 12:52:07] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3177072071301941212.txt' '-o' '/tmp/graph3177072071301941212.bin' '-w' '/tmp/graph3177072071301941212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3177072071301941212.bin' '-l' '-1' '-v' '-w' '/tmp/graph3177072071301941212.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:52:07] [INFO ] Decomposing Gal with order
[2024-05-29 12:52:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:52:08] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-29 12:52:08] [INFO ] Flatten gal took : 183 ms
[2024-05-29 12:52:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2024-05-29 12:52:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2298113835079496249.gal : 33 ms
[2024-05-29 12:52:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13499263154339720969.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2298113835079496249.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13499263154339720969.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality13499263154339720969.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :3 after 1.05278e+18
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.73409e+111 after 9.34478e+111
Invariant property ShieldPPPs-PT-040B-ReachabilityFireability-2024-14 does not hold.
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9.34478e+111 after 1.15369e+113
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.15369e+113 after 2.44269e+116
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.44269e+116 after 2.44269e+116
ITS-tools command line returned an error code 137
[2024-05-29 13:15:26] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10251899870532930054
[2024-05-29 13:15:26] [INFO ] Computing symmetric may disable matrix : 1148 transitions.
[2024-05-29 13:15:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:26] [INFO ] Computing symmetric may enable matrix : 1148 transitions.
[2024-05-29 13:15:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:26] [INFO ] Applying decomposition
[2024-05-29 13:15:26] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1256540355902845611.txt' '-o' '/tmp/graph1256540355902845611.bin' '-w' '/tmp/graph1256540355902845611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1256540355902845611.bin' '-l' '-1' '-v' '-w' '/tmp/graph1256540355902845611.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:15:27] [INFO ] Decomposing Gal with order
[2024-05-29 13:15:27] [INFO ] Computing Do-Not-Accords matrix : 1148 transitions.
[2024-05-29 13:15:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:15:27] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:15:27] [INFO ] Built C files in 418ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10251899870532930054
Running compilation step : cd /tmp/ltsmin10251899870532930054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 13:15:27] [INFO ] Removed a total of 516 redundant transitions.
[2024-05-29 13:15:27] [INFO ] Flatten gal took : 105 ms
[2024-05-29 13:15:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 771 labels/synchronizations in 85 ms.
[2024-05-29 13:15:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability491037596728635838.gal : 37 ms
[2024-05-29 13:15:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14326424368283674133.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability491037596728635838.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14326424368283674133.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability14326424368283674133.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 270
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :270 after 87480
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :87480 after 1.67962e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.57767e+17 after 3.52075e+25
Compilation finished in 4955 ms.
Running link step : cd /tmp/ltsmin10251899870532930054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin10251899870532930054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT040BReachabilityFireability202405==true'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin10251899870532930054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT040BReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin10251899870532930054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT040BReachabilityFireability202415==true'
ITS-tools command line returned an error code 137
[2024-05-29 13:33:30] [INFO ] Applying decomposition
[2024-05-29 13:33:30] [INFO ] Flatten gal took : 174 ms
[2024-05-29 13:33:30] [INFO ] Decomposing Gal with order
[2024-05-29 13:33:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:33:30] [INFO ] Removed a total of 778 redundant transitions.
[2024-05-29 13:33:30] [INFO ] Flatten gal took : 217 ms
[2024-05-29 13:33:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1187 labels/synchronizations in 306 ms.
[2024-05-29 13:33:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3233071263166725588.gal : 61 ms
[2024-05-29 13:33:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15958627799079766010.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3233071263166725588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15958627799079766010.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability15958627799079766010.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 14580
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14580 after 1.56728e+13
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin10251899870532930054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT040BReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10251899870532930054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT040BReachabilityFireability202405==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761200495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;