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.r026-smll-171620167000119.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 AutoFlight-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167000119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 AutoFlight-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716257656512

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 02:14:18] [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-21 02:14:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:14:18] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-21 02:14:18] [INFO ] Transformed 390 places.
[2024-05-21 02:14:18] [INFO ] Transformed 388 transitions.
[2024-05-21 02:14:18] [INFO ] Found NUPN structural information;
[2024-05-21 02:14:18] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (196 resets) in 2101 ms. (19 steps per ms) remains 9/16 properties
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 316 ms. (126 steps per ms) remains 9/9 properties
[2024-05-21 02:14:19] [INFO ] Flatten gal took : 267 ms
BEST_FIRST walk for 40004 steps (25 resets) in 1596 ms. (25 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (17 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (24 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
[2024-05-21 02:14:20] [INFO ] Flatten gal took : 135 ms
BEST_FIRST walk for 40004 steps (18 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
[2024-05-21 02:14:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15631785887374152942.gal : 44 ms
BEST_FIRST walk for 40004 steps (16 resets) in 213 ms. (186 steps per ms) remains 8/9 properties
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 02:14:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2026089355191054038.prop : 6 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/ReachabilityCardinality15631785887374152942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2026089355191054038.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (19 resets) in 157 ms. (253 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2026089355191054038.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :29 after 471
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :471 after 198981
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :198981 after 3.86947e+10
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.86947e+10 after 1.99419e+17
BEST_FIRST walk for 40003 steps (18 resets) in 1354 ms. (29 steps per ms) remains 8/8 properties
// Phase 1: matrix 388 rows 390 cols
[2024-05-21 02:14:20] [INFO ] Computed 28 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 140/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 233/373 variables, 27/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 233/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 17/390 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 17/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 388/778 variables, 390/808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/778 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 778/778 variables, and 808 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1422 ms.
Refiners :[Domain max(s): 390/390 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 140/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutoFlight-PT-04b-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 233/373 variables, 27/167 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 233/400 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:22] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 23 ms to minimize.
[2024-05-21 02:14:22] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 4 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-21 02:14:23] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 5 ms to minimize.
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 14/414 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 4/418 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 02:14:24] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 2/420 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:25] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 1/421 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:25] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 02:14:25] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 2/423 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/423 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 17/390 variables, 1/424 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 17/441 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:25] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-05-21 02:14:25] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:14:26] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-21 02:14:26] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-05-21 02:14:26] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 5/446 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 02:14:26] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 3 ms to minimize.
[2024-05-21 02:14:26] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-05-21 02:14:26] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 3/449 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 388/778 variables, 390/839 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/778 variables, 7/846 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/778 variables, and 846 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5010 ms.
Refiners :[Domain max(s): 390/390 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 31/31 constraints]
After SMT, in 6612ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 126 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 390 transition count 341
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 53 rules applied. Total rules applied 100 place count 343 transition count 335
Reduce places removed 2 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 341 transition count 305
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 164 place count 311 transition count 303
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 164 place count 311 transition count 277
Deduced a syphon composed of 26 places in 10 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 216 place count 285 transition count 277
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 231 place count 270 transition count 262
Iterating global reduction 4 with 15 rules applied. Total rules applied 246 place count 270 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 246 place count 270 transition count 261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 269 transition count 261
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 302 place count 242 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 310 place count 242 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 241 transition count 225
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 241 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 240 transition count 224
Applied a total of 314 rules in 244 ms. Remains 240 /390 variables (removed 150) and now considering 224/388 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 240/390 places, 224/388 transitions.
RANDOM walk for 40000 steps (317 resets) in 597 ms. (66 steps per ms) remains 6/7 properties
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (32 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (30 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
// Phase 1: matrix 224 rows 240 cols
[2024-05-21 02:14:28] [INFO ] Computed 28 invariants in 9 ms
[2024-05-21 02:14:28] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 104/228 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/240 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 224/464 variables, 240/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/464 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 272 constraints, problems are : Problem set: 0 solved, 6 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, ReadFeed: 4/4 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 104/228 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:28] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:29] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 12/240 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 02:14:30] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:31] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:31] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 224/464 variables, 240/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:31] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-21 02:14:31] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-21 02:14:31] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:32] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 2 ms to minimize.
[2024-05-21 02:14:32] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:32] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/464 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/464 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/464 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 312 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4640 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 34/34 constraints]
After SMT, in 5257ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3786 ms.
Support contains 124 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 224/224 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 240 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 239 transition count 222
Applied a total of 3 rules in 21 ms. Remains 239 /240 variables (removed 1) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 239/240 places, 222/224 transitions.
RANDOM walk for 40000 steps (319 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (33 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 655364 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 6
Probabilistic random walk after 655364 steps, saw 96569 distinct states, run finished after 3007 ms. (steps per millisecond=217 ) properties seen :0
// Phase 1: matrix 222 rows 239 cols
[2024-05-21 02:14:40] [INFO ] Computed 28 invariants in 12 ms
[2024-05-21 02:14:40] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 103/227 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 222/461 variables, 239/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 271 constraints, problems are : Problem set: 0 solved, 6 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 103/227 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 02:14:41] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 2 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 12/239 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-05-21 02:14:42] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 222/461 variables, 239/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:43] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:43] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 02:14:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 02:14:43] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-21 02:14:44] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-21 02:14:44] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/461 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 305 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 4241ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3342 ms.
Support contains 124 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 239/239 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 222/222 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-21 02:14:48] [INFO ] Invariant cache hit.
[2024-05-21 02:14:48] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 02:14:48] [INFO ] Invariant cache hit.
[2024-05-21 02:14:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 02:14:48] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-21 02:14:48] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-21 02:14:48] [INFO ] Invariant cache hit.
[2024-05-21 02:14:48] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:14:51] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 2 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 3 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-21 02:14:52] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 3 ms to minimize.
[2024-05-21 02:14:53] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
[2024-05-21 02:14:53] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
[2024-05-21 02:14:53] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 4 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 2 ms to minimize.
[2024-05-21 02:14:55] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 3 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 7 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-05-21 02:14:56] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:14:57] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-21 02:14:57] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-21 02:14:57] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-21 02:14:57] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 3 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 02:14:58] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 02:14:59] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:00] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 02:15:00] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:15:00] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-21 02:15:01] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-21 02:15:02] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:03] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-21 02:15:04] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:06] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 222/461 variables, 239/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 0/461 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 348 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27263 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 77/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:17] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/461 variables, 239/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 221/570 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:22] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-21 02:15:23] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-21 02:15:23] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 02:15:24] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 02:15:25] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 2 ms to minimize.
[2024-05-21 02:15:25] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:15:26] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-21 02:15:26] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 02:15:26] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 02:15:26] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-21 02:15:26] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-21 02:15:26] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-21 02:15:27] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 13/583 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:30] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-21 02:15:33] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 02:15:33] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-21 02:15:33] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 02:15:37] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-21 02:15:37] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 589 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 97/97 constraints]
After SMT, in 57339ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 57344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57742 ms. Remains : 239/239 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 382 edges and 239 vertex of which 236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 236 transition count 219
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 7 place count 233 transition count 219
Applied a total of 7 rules in 26 ms. Remains 233 /239 variables (removed 6) and now considering 219/222 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 219 rows 233 cols
[2024-05-21 02:15:45] [INFO ] Computed 25 invariants in 3 ms
[2024-05-21 02:15:46] [INFO ] [Real]Absence check using 24 positive place invariants in 21 ms returned sat
[2024-05-21 02:15:46] [INFO ] [Real]Absence check using 24 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 02:15:46] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 02:15:46] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2024-05-21 02:15:46] [INFO ] [Nat]Absence check using 24 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 02:15:46] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 02:15:46] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 02:15:46] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-21 02:15:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 612 ms
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-21 02:15:47] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 439 ms
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
TRAPS : Iteration 1
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
TRAPS : Iteration 2
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 3 ms to minimize.
[2024-05-21 02:15:48] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 593 ms
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
TRAPS : Iteration 3
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2024-05-21 02:15:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
TRAPS : Iteration 4
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 5
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 02:15:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
TRAPS : Iteration 6
[2024-05-21 02:15:51] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-21 02:15:51] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
[2024-05-21 02:15:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
TRAPS : Iteration 7
[2024-05-21 02:15:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 02:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 8
[2024-05-21 02:15:51] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-21 02:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 9
[2024-05-21 02:15:52] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 02:15:52] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 02:15:52] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 15 ms to minimize.
[2024-05-21 02:15:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2024-05-21 02:15:52] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-21 02:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 10
[2024-05-21 02:15:52] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-21 02:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 11
[2024-05-21 02:15:53] [INFO ] After 6670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 02:15:53] [INFO ] After 7032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-21 02:15:53] [INFO ] Flatten gal took : 24 ms
[2024-05-21 02:15:53] [INFO ] Flatten gal took : 24 ms
[2024-05-21 02:15:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1040580447410623146.gal : 5 ms
[2024-05-21 02:15:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9701065285049006846.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/ReachabilityCardinality1040580447410623146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9701065285049006846.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/ReachabilityCardinality9701065285049006846.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :16 after 37
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :37 after 5471
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :5471 after 8.02767e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :8.02767e+07 after 1.98251e+12
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.37878e+16 after 1.37885e+16
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.37885e+16 after 1.37895e+16
Detected timeout of ITS tools.
[2024-05-21 02:16:08] [INFO ] Flatten gal took : 18 ms
[2024-05-21 02:16:08] [INFO ] Applying decomposition
[2024-05-21 02:16:08] [INFO ] Flatten gal took : 25 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/graph15220810831016602147.txt' '-o' '/tmp/graph15220810831016602147.bin' '-w' '/tmp/graph15220810831016602147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15220810831016602147.bin' '-l' '-1' '-v' '-w' '/tmp/graph15220810831016602147.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:16:08] [INFO ] Decomposing Gal with order
[2024-05-21 02:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:16:08] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-21 02:16:08] [INFO ] Flatten gal took : 83 ms
[2024-05-21 02:16:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-21 02:16:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10846086248557887864.gal : 8 ms
[2024-05-21 02:16:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9972828648839953754.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/ReachabilityCardinality10846086248557887864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9972828648839953754.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/ReachabilityCardinality9972828648839953754.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1.76015e+06 after 2.94695e+06
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2.94695e+06 after 2.79145e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.06014e+18,1.60362,43448,5085,38,72892,410,813,156755,76,840,0
Total reachable state count : 1060139022887143228

Verifying 6 reachability properties.
Reachability property AutoFlight-PT-04b-ReachabilityFireability-2024-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-00,6.4012e+11,1.61445,43448,133,24,72892,410,818,156755,79,840,9
Invariant property AutoFlight-PT-04b-ReachabilityFireability-2024-04 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-04,1.11755e+11,1.97991,43448,313,27,72892,410,913,156755,86,840,80269
Reachability property AutoFlight-PT-04b-ReachabilityFireability-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-08,7.83821e+08,1.98099,43448,120,21,72892,410,919,156755,86,840,80287
Invariant property AutoFlight-PT-04b-ReachabilityFireability-2024-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-12,8.63042e+15,2.1572,43448,1167,25,80259,410,973,156755,88,840,120615
Invariant property AutoFlight-PT-04b-ReachabilityFireability-2024-14 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-14,5.22547e+08,2.15767,43448,117,21,80269,410,974,156755,88,840,120615
Reachability property AutoFlight-PT-04b-ReachabilityFireability-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-15,3.38688e+07,2.19482,43448,122,21,84216,410,1055,156755,88,840,129549
Over-approximation ignoring read arcs solved 0 properties in 25105 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 02:16:11] [INFO ] Flatten gal took : 31 ms
[2024-05-21 02:16:11] [INFO ] Applying decomposition
[2024-05-21 02:16:11] [INFO ] Flatten gal took : 18 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/graph9938461936821904497.txt' '-o' '/tmp/graph9938461936821904497.bin' '-w' '/tmp/graph9938461936821904497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9938461936821904497.bin' '-l' '-1' '-v' '-w' '/tmp/graph9938461936821904497.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:16:11] [INFO ] Decomposing Gal with order
[2024-05-21 02:16:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:16:11] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-21 02:16:11] [INFO ] Flatten gal took : 46 ms
[2024-05-21 02:16:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2024-05-21 02:16:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16233219487833933814.gal : 10 ms
[2024-05-21 02:16:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11910476881128327724.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/ReachabilityCardinality16233219487833933814.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11910476881128327724.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/ReachabilityCardinality11910476881128327724.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1109
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1109 after 3.79459e+18
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.04653e+23,21.8365,457112,21348,21,730647,330,1027,1.83197e+06,46,843,0
Total reachable state count : 904652973199236196007936

Verifying 6 reachability properties.
Reachability property AutoFlight-PT-04b-ReachabilityFireability-2024-00 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-00,1.60663e+12,21.9362,457112,156,17,730647,330,1028,1.83197e+06,49,843,70
Invariant property AutoFlight-PT-04b-ReachabilityFireability-2024-04 does not hold.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-04,9.06712e+15,22.8046,457112,561,20,730647,330,1124,1.83197e+06,54,843,273259
Reachability property AutoFlight-PT-04b-ReachabilityFireability-2024-08 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-08,3.60635e+11,22.8055,457112,171,21,730647,330,1130,1.83197e+06,54,843,273292
Invariant property AutoFlight-PT-04b-ReachabilityFireability-2024-12 does not hold.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-12,2.71774e+21,23.456,457112,6465,22,730647,330,1186,1.83197e+06,55,843,410285
Invariant property AutoFlight-PT-04b-ReachabilityFireability-2024-14 does not hold.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-14,3.17359e+13,23.457,457112,165,20,730647,330,1188,1.83197e+06,55,843,410285
Reachability property AutoFlight-PT-04b-ReachabilityFireability-2024-15 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-04b-ReachabilityFireability-2024-15,1.96301e+14,23.8124,457112,165,18,730647,330,1270,1.83197e+06,55,843,510709
All properties solved without resorting to model-checking.
Total runtime 136990 ms.

BK_STOP 1716257795320

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r026-smll-171620167000119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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