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-171683760800287.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 ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760800287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 338K 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 ShieldIIPt-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716934059207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 22:07:40] [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-28 22:07:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:07:40] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-28 22:07:40] [INFO ] Transformed 1403 places.
[2024-05-28 22:07:40] [INFO ] Transformed 1303 transitions.
[2024-05-28 22:07:40] [INFO ] Found NUPN structural information;
[2024-05-28 22:07:40] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 22:07:41] [INFO ] Flatten gal took : 208 ms
RANDOM walk for 40000 steps (8 resets) in 2098 ms. (19 steps per ms) remains 8/16 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 22:07:41] [INFO ] Flatten gal took : 130 ms
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 8/8 properties
[2024-05-28 22:07:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2546512595859626783.gal : 58 ms
[2024-05-28 22:07:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6670204042650066023.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/ReachabilityCardinality2546512595859626783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6670204042650066023.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6670204042650066023.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 807 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
// Phase 1: matrix 1303 rows 1403 cols
[2024-05-28 22:07:42] [INFO ] Computed 181 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 213/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
At refinement iteration 2 (OVERLAPS) 1151/1364 variables, 174/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :19 after 28
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :28 after 277
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :277 after 733
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :733 after 88423
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :88423 after 5.78704e+08
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :5.78704e+08 after 6.90677e+16
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 1151/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :6.90677e+16 after 2.30752e+34
At refinement iteration 4 (INCLUDED_ONLY) 0/1364 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 39/1403 variables, 7/1545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 39/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1584 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2706 variables, 1403/2987 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 2987 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2085 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1152/1364 variables, 174/386 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 1152/1538 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-28 22:07:45] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 35 ms to minimize.
[2024-05-28 22:07:45] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 4 ms to minimize.
[2024-05-28 22:07:45] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 4 ms to minimize.
[2024-05-28 22:07:45] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 4 ms to minimize.
[2024-05-28 22:07:46] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 4 ms to minimize.
[2024-05-28 22:07:46] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 4 ms to minimize.
[2024-05-28 22:07:46] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 4 ms to minimize.
[2024-05-28 22:07:46] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-05-28 22:07:46] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 3 ms to minimize.
[2024-05-28 22:07:47] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 4 ms to minimize.
[2024-05-28 22:07:47] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 4 ms to minimize.
[2024-05-28 22:07:47] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 4 ms to minimize.
[2024-05-28 22:07:47] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-28 22:07:47] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-28 22:07:47] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 4 ms to minimize.
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1364 variables, 20/1558 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-28 22:07:48] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-28 22:07:49] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-28 22:07:49] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-05-28 22:07:49] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
SMT process timed out in 7267ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1403 transition count 1107
Reduce places removed 196 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 251 rules applied. Total rules applied 447 place count 1207 transition count 1052
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 503 place count 1152 transition count 1051
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 503 place count 1152 transition count 969
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 667 place count 1070 transition count 969
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 764 place count 973 transition count 872
Iterating global reduction 3 with 97 rules applied. Total rules applied 861 place count 973 transition count 872
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 861 place count 973 transition count 848
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 909 place count 949 transition count 848
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1413 place count 697 transition count 596
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1465 place count 671 transition count 600
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1471 place count 671 transition count 594
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1477 place count 665 transition count 594
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1495 place count 665 transition count 594
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1496 place count 664 transition count 593
Applied a total of 1496 rules in 415 ms. Remains 664 /1403 variables (removed 739) and now considering 593/1303 (removed 710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 664/1403 places, 593/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 544 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
// Phase 1: matrix 593 rows 664 cols
[2024-05-28 22:07:50] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 22:07:50] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 448/646 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/646 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/660 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/660 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 593/1253 variables, 660/839 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 45/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/1257 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1257 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1257 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1257 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1257/1257 variables, and 890 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 664/664 constraints, ReadFeed: 45/45 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/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 448/646 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:07:51] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:07:51] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 5 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-28 22:07:52] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/646 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:07:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:07:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:07:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:07:54] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 8 ms to minimize.
[2024-05-28 22:07:54] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:07:54] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/646 variables, 13/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/646 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 14/660 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 593/1253 variables, 660/872 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 45/917 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1253 variables, 6/923 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:07:55] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:07:55] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:07:55] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:07:55] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-28 22:07:55] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:07:56] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1253 variables, 12/935 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:07:58] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-28 22:07:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-28 22:07:58] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-28 22:07:58] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:07:58] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-28 22:07:58] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:07:59] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:07:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:07:59] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1253 variables, 9/944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1253 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 4/1257 variables, 4/948 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1257 variables, 2/950 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:01] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:08:01] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:08:01] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:08:01] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:08:01] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1257 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1257 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1257 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1257/1257 variables, and 955 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12278 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 664/664 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 59/59 constraints]
After SMT, in 13408ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 14529 ms.
Support contains 198 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 593/593 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 664 transition count 589
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 660 transition count 589
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 30 place count 649 transition count 578
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 646 transition count 580
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 646 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 645 transition count 579
Applied a total of 38 rules in 85 ms. Remains 645 /664 variables (removed 19) and now considering 579/593 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 645/664 places, 579/593 transitions.
RANDOM walk for 40000 steps (8 resets) in 571 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 198158 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 6
Probabilistic random walk after 198158 steps, saw 95432 distinct states, run finished after 3010 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 579 rows 645 cols
[2024-05-28 22:08:22] [INFO ] Computed 181 invariants in 3 ms
[2024-05-28 22:08:22] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 429/627 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/641 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 579/1220 variables, 641/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 54/874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/1224 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1224 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1224 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1224/1224 variables, and 880 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 645/645 constraints, ReadFeed: 54/54 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/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 429/627 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:23] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-28 22:08:23] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-28 22:08:24] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:08:25] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 22:08:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-28 22:08:27] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-28 22:08:28] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 14/641 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:28] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 579/1220 variables, 641/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 54/923 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1220 variables, 6/929 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:29] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:08:29] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:08:30] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-28 22:08:30] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-28 22:08:30] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-28 22:08:30] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:08:30] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 22:08:31] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1220 variables, 8/937 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:08:31] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1220 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1220 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/1224 variables, 4/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1224 variables, 2/944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1224 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1224 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1224/1224 variables, and 944 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10515 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 645/645 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 58/58 constraints]
After SMT, in 11825ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 8469 ms.
Support contains 198 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 579/579 transitions.
Applied a total of 0 rules in 31 ms. Remains 645 /645 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 645/645 places, 579/579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 579/579 transitions.
Applied a total of 0 rules in 20 ms. Remains 645 /645 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-28 22:08:42] [INFO ] Invariant cache hit.
[2024-05-28 22:08:42] [INFO ] Implicit Places using invariants in 246 ms returned [629]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 254 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 644/645 places, 579/579 transitions.
Applied a total of 0 rules in 15 ms. Remains 644 /644 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 289 ms. Remains : 644/645 places, 579/579 transitions.
RANDOM walk for 40000 steps (8 resets) in 367 ms. (108 steps per ms) remains 5/6 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
// Phase 1: matrix 579 rows 644 cols
[2024-05-28 22:08:43] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 22:08:43] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 439/618 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/640 variables, 9/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 579/1219 variables, 640/818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1219 variables, 53/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1219 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/1223 variables, 4/875 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1223 variables, 2/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1223 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1223 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1223/1223 variables, and 877 constraints, problems are : Problem set: 0 solved, 5 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 644/644 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 439/618 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:08:44] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:08:44] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:08:44] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:08:44] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:08:44] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 22:08:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:08:45] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-28 22:08:46] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 13/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 22/640 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:08:47] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 579/1219 variables, 640/858 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1219 variables, 53/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1219 variables, 5/916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:08:48] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 22:08:48] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:08:49] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 22:08:49] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-28 22:08:49] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:08:49] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-28 22:08:49] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:08:49] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1219 variables, 8/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1219 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 4/1223 variables, 4/928 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1223 variables, 2/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1223 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1223 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1223/1223 variables, and 930 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8751 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 644/644 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 48/48 constraints]
After SMT, in 9703ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 13477 ms.
Support contains 179 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 579/579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 644 transition count 577
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 642 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 641 transition count 576
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 641 transition count 573
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 638 transition count 573
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 40 place count 624 transition count 559
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 623 transition count 560
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 623 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 622 transition count 559
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 620 transition count 557
Applied a total of 46 rules in 69 ms. Remains 620 /644 variables (removed 24) and now considering 557/579 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 620/644 places, 557/579 transitions.
RANDOM walk for 40000 steps (8 resets) in 368 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 232635 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 5
Probabilistic random walk after 232635 steps, saw 114493 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 557 rows 620 cols
[2024-05-28 22:09:10] [INFO ] Computed 180 invariants in 5 ms
[2024-05-28 22:09:10] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 417/596 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/614 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 557/1171 variables, 614/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1171 variables, 55/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1171 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/1177 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1177 variables, 3/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1177 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1177 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1177/1177 variables, and 855 constraints, problems are : Problem set: 0 solved, 5 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 620/620 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 417/596 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:09:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:09:12] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:09:13] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 18/614 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 557/1171 variables, 614/825 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1171 variables, 55/880 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1171 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:09:14] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:09:14] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 22:09:14] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-28 22:09:15] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:09:15] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 22:09:15] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:09:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:09:15] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-28 22:09:16] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 22:09:16] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 22:09:16] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1171 variables, 11/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1171 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/1177 variables, 6/901 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1177 variables, 3/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1177 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1177 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:09:18] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/1177 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1177 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1177 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1177/1177 variables, and 906 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8428 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 620/620 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 46/46 constraints]
After SMT, in 9412ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4346 ms.
Support contains 179 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 557/557 transitions.
Applied a total of 0 rules in 35 ms. Remains 620 /620 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 620/620 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 557/557 transitions.
Applied a total of 0 rules in 11 ms. Remains 620 /620 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-28 22:09:23] [INFO ] Invariant cache hit.
[2024-05-28 22:09:24] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-28 22:09:24] [INFO ] Invariant cache hit.
[2024-05-28 22:09:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-28 22:09:24] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2024-05-28 22:09:24] [INFO ] Redundant transitions in 31 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-28 22:09:25] [INFO ] Invariant cache hit.
[2024-05-28 22:09:25] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 6/620 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 5 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:09:35] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:36] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/620 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:09:41] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 22:09:42] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 22:09:43] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:09:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:09:43] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-28 22:09:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:09:44] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:09:44] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:09:44] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-28 22:09:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-28 22:09:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 22:09:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:09:45] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-28 22:09:46] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:09:46] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 22:09:46] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 22:09:46] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 22:09:46] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:09:46] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-28 22:09:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 22:09:47] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-28 22:09:49] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:09:49] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-28 22:09:49] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:09:50] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:09:50] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:09:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:09:50] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-28 22:09:50] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:09:51] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:09:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:09:51] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:09:51] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:09:53] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 22:09:53] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 16/256 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1177 variables, and 256 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/620 constraints, ReadFeed: 0/55 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 6/620 variables, 169/184 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 72/256 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-28 22:10:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:10:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:10:03] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-28 22:10:04] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 22:10:05] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-28 22:10:05] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:10:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:10:05] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-05-28 22:10:05] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:10:05] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-28 22:10:10] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:10:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (OVERLAPS) 557/1177 variables, 620/894 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1177 variables, 55/949 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1177 variables, 549/1498 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/1177 variables, and 1498 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 620/620 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 94/94 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61234 ms. Remains : 620/620 places, 557/557 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 620 transition count 557
Applied a total of 22 rules in 22 ms. Remains 620 /620 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 557 rows 620 cols
[2024-05-28 22:10:25] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 22:10:25] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 22:10:25] [INFO ] [Nat]Absence check using 180 positive place invariants in 25 ms returned sat
[2024-05-28 22:10:26] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 22:10:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 22:10:26] [INFO ] After 417ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-28 22:10:26] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-28 22:10:26] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 3 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-28 22:10:27] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1385 ms
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:10:28] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1377 ms
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:10:29] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 461 ms
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
TRAPS : Iteration 1
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:10:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2024-05-28 22:10:31] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-28 22:10:31] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:10:31] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-28 22:10:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:10:31] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 22:10:31] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 3 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1248 ms
[2024-05-28 22:10:32] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-05-28 22:10:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:10:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:10:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
TRAPS : Iteration 2
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-28 22:10:33] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 429 ms
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-28 22:10:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
TRAPS : Iteration 3
[2024-05-28 22:10:35] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-28 22:10:35] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-28 22:10:35] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-05-28 22:10:35] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-28 22:10:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
TRAPS : Iteration 4
[2024-05-28 22:10:36] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 3 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2024-05-28 22:10:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-05-28 22:10:36] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 5
[2024-05-28 22:10:37] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-28 22:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-28 22:10:37] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-28 22:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2024-05-28 22:10:38] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-28 22:10:38] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-28 22:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 6
[2024-05-28 22:10:38] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-28 22:10:38] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-28 22:10:38] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-28 22:10:39] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-28 22:10:39] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-28 22:10:39] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 22:10:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 451 ms
[2024-05-28 22:10:39] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:10:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 7
[2024-05-28 22:10:39] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:10:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-28 22:10:40] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:10:40] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:10:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
TRAPS : Iteration 8
[2024-05-28 22:10:40] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:10:40] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:10:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2024-05-28 22:10:41] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
TRAPS : Iteration 9
[2024-05-28 22:10:41] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:10:41] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:10:42] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-28 22:10:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2024-05-28 22:10:42] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-28 22:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 10
[2024-05-28 22:10:42] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 22:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-28 22:10:43] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
TRAPS : Iteration 11
[2024-05-28 22:10:43] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 22:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
TRAPS : Iteration 12
[2024-05-28 22:10:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-28 22:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
TRAPS : Iteration 13
[2024-05-28 22:10:45] [INFO ] After 19036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-28 22:10:45] [INFO ] After 20284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-28 22:10:45] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:10:45] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:10:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1005398855061587853.gal : 14 ms
[2024-05-28 22:10:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16876153030656299848.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/ReachabilityCardinality1005398855061587853.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16876153030656299848.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16876153030656299848.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 600
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :600 after 28518
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :28518 after 5.70251e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :5.70251e+06 after 5.51821e+12
Detected timeout of ITS tools.
[2024-05-28 22:11:00] [INFO ] Flatten gal took : 39 ms
[2024-05-28 22:11:00] [INFO ] Applying decomposition
[2024-05-28 22:11:00] [INFO ] Flatten gal took : 38 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/graph3777195211114176795.txt' '-o' '/tmp/graph3777195211114176795.bin' '-w' '/tmp/graph3777195211114176795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3777195211114176795.bin' '-l' '-1' '-v' '-w' '/tmp/graph3777195211114176795.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:11:01] [INFO ] Decomposing Gal with order
[2024-05-28 22:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:11:01] [INFO ] Removed a total of 167 redundant transitions.
[2024-05-28 22:11:01] [INFO ] Flatten gal took : 104 ms
[2024-05-28 22:11:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 26 ms.
[2024-05-28 22:11:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12205138256855631161.gal : 27 ms
[2024-05-28 22:11:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14127221349846037125.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/ReachabilityCardinality12205138256855631161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14127221349846037125.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 ...309
Loading property file /tmp/ReachabilityCardinality14127221349846037125.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :7 after 5587
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :5587 after 1.79029e+06
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.79029e+06 after 1.54173e+08
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.27169e+20 after 1.39886e+21
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-15 is true.
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-09 is true.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 51320 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 22:11:16] [INFO ] Flatten gal took : 39 ms
[2024-05-28 22:11:16] [INFO ] Applying decomposition
[2024-05-28 22:11:16] [INFO ] Flatten gal took : 35 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/graph6592915981799378986.txt' '-o' '/tmp/graph6592915981799378986.bin' '-w' '/tmp/graph6592915981799378986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6592915981799378986.bin' '-l' '-1' '-v' '-w' '/tmp/graph6592915981799378986.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:11:16] [INFO ] Decomposing Gal with order
[2024-05-28 22:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:11:16] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-28 22:11:16] [INFO ] Flatten gal took : 68 ms
[2024-05-28 22:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-28 22:11:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14403738691659293757.gal : 13 ms
[2024-05-28 22:11:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5016658307599387767.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/ReachabilityCardinality14403738691659293757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5016658307599387767.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/ReachabilityCardinality5016658307599387767.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1669
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1669 after 1.92709e+12
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1.92709e+12 after 1.29189e+44
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :8.57008e+60 after 1.52263e+61
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-15 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-09 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-08 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-020B-ReachabilityFireability-2024-04 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.52263e+61 after 2.17475e+79
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.17475e+79 after 2.17493e+79
ITS-tools command line returned an error code 137
[2024-05-28 22:31:39] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3727487001203799131
[2024-05-28 22:31:39] [INFO ] Applying decomposition
[2024-05-28 22:31:39] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2024-05-28 22:31:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:31:39] [INFO ] Flatten gal took : 17 ms
[2024-05-28 22:31:39] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2024-05-28 22:31:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph12451752992516191808.txt' '-o' '/tmp/graph12451752992516191808.bin' '-w' '/tmp/graph12451752992516191808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12451752992516191808.bin' '-l' '-1' '-v' '-w' '/tmp/graph12451752992516191808.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:31:39] [INFO ] Decomposing Gal with order
[2024-05-28 22:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:31:39] [INFO ] Removed a total of 198 redundant transitions.
[2024-05-28 22:31:39] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2024-05-28 22:31:39] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:31:39] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 15 ms.
[2024-05-28 22:31:39] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8349698909895449980.gal : 9 ms
[2024-05-28 22:31:39] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15123037941090928899.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/ReachabilityFireability8349698909895449980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15123037941090928899.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
[2024-05-28 22:31:39] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3727487001203799131
Running compilation step : cd /tmp/ltsmin3727487001203799131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Loading property file /tmp/ReachabilityFireability15123037941090928899.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 187
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :187 after 1.07191e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.07191e+06 after 1.02646e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.27169e+20 after 1.50552e+34
Compilation finished in 1684 ms.
Running link step : cd /tmp/ltsmin3727487001203799131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3727487001203799131;'/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' 'ShieldIIPtPT020BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin3727487001203799131;'/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' 'ShieldIIPtPT020BReachabilityFireability202400==true'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin3727487001203799131;'/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' 'ShieldIIPtPT020BReachabilityFireability202400==true'
Detected timeout of ITS tools.
[2024-05-28 22:59:39] [INFO ] Applying decomposition
[2024-05-28 22:59:39] [INFO ] Flatten gal took : 86 ms
[2024-05-28 22:59:39] [INFO ] Decomposing Gal with order
[2024-05-28 22:59:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:59:39] [INFO ] Removed a total of 215 redundant transitions.
[2024-05-28 22:59:39] [INFO ] Flatten gal took : 83 ms
[2024-05-28 22:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 19 ms.
[2024-05-28 22:59:39] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10598600702928917029.gal : 25 ms
[2024-05-28 22:59:39] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4410971965318351414.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/ReachabilityFireability10598600702928917029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4410971965318351414.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/ReachabilityFireability4410971965318351414.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 5587
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5587 after 1.79029e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.79029e+06 after 2.0529e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.27169e+20 after 1.21147e+29
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.21147e+29 after 1.17354e+52

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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-171683760800287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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