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-171683761600686.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 ShieldPPPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 955K 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 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717025032188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 23:23:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 23:23:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:23:53] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-05-29 23:23:53] [INFO ] Transformed 3903 places.
[2024-05-29 23:23:53] [INFO ] Transformed 3553 transitions.
[2024-05-29 23:23:53] [INFO ] Found NUPN structural information;
[2024-05-29 23:23:53] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2418 ms. (16 steps per ms) remains 7/11 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 23:23:54] [INFO ] Flatten gal took : 424 ms
BEST_FIRST walk for 40003 steps (8 resets) in 646 ms. (61 steps per ms) remains 7/7 properties
[2024-05-29 23:23:55] [INFO ] Flatten gal took : 207 ms
BEST_FIRST walk for 40003 steps (8 resets) in 1029 ms. (38 steps per ms) remains 7/7 properties
[2024-05-29 23:23:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6213750462316836925.gal : 139 ms
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
[2024-05-29 23:23:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16994661811120198789.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/ReachabilityCardinality6213750462316836925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16994661811120198789.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 7/7 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
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
// Phase 1: matrix 3553 rows 3903 cols
[2024-05-29 23:23:55] [INFO ] Computed 551 invariants in 43 ms
Loading property file /tmp/ReachabilityCardinality16994661811120198789.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2925/3077 variables, 421/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3077 variables, 2925/3498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3077 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 826/3903 variables, 130/3628 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3903 variables, 826/4454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3903 variables, 0/4454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 3553/7456 variables, 3903/8357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7456 variables, 0/8357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/7456 variables, 0/8357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7456/7456 variables, and 8357 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4696 ms.
Refiners :[Domain max(s): 3903/3903 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3903/3903 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2925/3077 variables, 421/573 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3077 variables, 2925/3498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 23:24:01] [INFO ] Deduced a trap composed of 34 places in 625 ms of which 72 ms to minimize.
[2024-05-29 23:24:02] [INFO ] Deduced a trap composed of 23 places in 568 ms of which 10 ms to minimize.
[2024-05-29 23:24:03] [INFO ] Deduced a trap composed of 22 places in 516 ms of which 9 ms to minimize.
[2024-05-29 23:24:03] [INFO ] Deduced a trap composed of 18 places in 506 ms of which 9 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 58
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :58 after 691
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :691 after 17563
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :17563 after 2.501e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :2.501e+08 after 4.01557e+14
[2024-05-29 23:24:04] [INFO ] Deduced a trap composed of 43 places in 496 ms of which 8 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :4.01557e+14 after 1.44949e+30
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.44949e+30 after 1.24739e+70
[2024-05-29 23:24:04] [INFO ] Deduced a trap composed of 43 places in 481 ms of which 8 ms to minimize.
Invariant property ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12 does not hold.
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-05-29 23:24:05] [INFO ] Deduced a trap composed of 42 places in 481 ms of which 16 ms to minimize.
[2024-05-29 23:24:05] [INFO ] Deduced a trap composed of 45 places in 458 ms of which 8 ms to minimize.
SMT process timed out in 10114ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 151 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 844 transitions
Trivial Post-agglo rules discarded 844 transitions
Performed 844 trivial Post agglomeration. Transition count delta: 844
Iterating post reduction 0 with 844 rules applied. Total rules applied 844 place count 3903 transition count 2709
Reduce places removed 844 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 846 rules applied. Total rules applied 1690 place count 3059 transition count 2707
Reduce places removed 1 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 41 rules applied. Total rules applied 1731 place count 3058 transition count 2667
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1771 place count 3018 transition count 2667
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1771 place count 3018 transition count 2468
Deduced a syphon composed of 199 places in 7 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 2169 place count 2819 transition count 2468
Discarding 330 places :
Symmetric choice reduction at 4 with 330 rule applications. Total rules 2499 place count 2489 transition count 2138
Iterating global reduction 4 with 330 rules applied. Total rules applied 2829 place count 2489 transition count 2138
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 129 Pre rules applied. Total rules applied 2829 place count 2489 transition count 2009
Deduced a syphon composed of 129 places in 15 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 3087 place count 2360 transition count 2009
Performed 781 Post agglomeration using F-continuation condition.Transition count delta: 781
Deduced a syphon composed of 781 places in 3 ms
Reduce places removed 781 places and 0 transitions.
Iterating global reduction 4 with 1562 rules applied. Total rules applied 4649 place count 1579 transition count 1228
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4851 place count 1478 transition count 1228
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 4893 place count 1457 transition count 1228
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4903 place count 1457 transition count 1218
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 4913 place count 1447 transition count 1218
Partial Free-agglomeration rule applied 128 times.
Drop transitions (Partial Free agglomeration) removed 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 5041 place count 1447 transition count 1218
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 5043 place count 1447 transition count 1218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5044 place count 1446 transition count 1217
Applied a total of 5044 rules in 1356 ms. Remains 1446 /3903 variables (removed 2457) and now considering 1217/3553 (removed 2336) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1370 ms. Remains : 1446/3903 places, 1217/3553 transitions.
RANDOM walk for 40000 steps (8 resets) in 850 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 401 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 5/6 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1217 rows 1446 cols
[2024-05-29 23:24:08] [INFO ] Computed 551 invariants in 5 ms
[2024-05-29 23:24:08] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 468/593 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 687/1280 variables, 299/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1119/2399 variables, 1280/1759 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2399 variables, 215/1974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2399 variables, 0/1974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 129/2528 variables, 80/2054 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2528 variables, 29/2083 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2528 variables, 2/2085 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2528 variables, 0/2085 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 7/2535 variables, 9/2094 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2535 variables, 7/2101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2535 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 23/2558 variables, 10/2111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2558 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 82/2640 variables, 60/2171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2640 variables, 11/2182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2640 variables, 2/2184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2640 variables, 0/2184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 5/2645 variables, 6/2190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2645 variables, 3/2193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2645 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 2/2647 variables, 1/2194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2647 variables, 0/2194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 16/2663 variables, 16/2210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2663 variables, 6/2216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2663 variables, 0/2216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 0/2663 variables, 0/2216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2663/2663 variables, and 2216 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4068 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1446/1446 constraints, ReadFeed: 219/219 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/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 468/593 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:12] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:24:12] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-29 23:24:12] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 23:24:12] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:24:12] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-29 23:24:12] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-29 23:24:13] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 17/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 687/1280 variables, 299/496 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 5 ms to minimize.
[2024-05-29 23:24:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1280 variables, 19/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:15] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-29 23:24:16] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1280 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:16] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1280 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1280 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1119/2399 variables, 1280/1798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2399 variables, 215/2013 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2399 variables, 1/2014 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:17] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 4 ms to minimize.
[2024-05-29 23:24:17] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:24:17] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:24:18] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-29 23:24:18] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:24:18] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:24:18] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:24:19] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-05-29 23:24:19] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 12 ms to minimize.
[2024-05-29 23:24:19] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-29 23:24:19] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2399 variables, 11/2025 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:20] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:24:20] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2399 variables, 2/2027 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:21] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2399 variables, 1/2028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2399 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 129/2528 variables, 80/2108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2528 variables, 29/2137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2528 variables, 2/2139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2528 variables, 4/2143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:23] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 4 ms to minimize.
[2024-05-29 23:24:23] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:24:24] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 3 ms to minimize.
[2024-05-29 23:24:24] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 3 ms to minimize.
[2024-05-29 23:24:24] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 4 ms to minimize.
[2024-05-29 23:24:24] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:24:25] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:24:25] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2528 variables, 8/2151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2528 variables, 0/2151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 7/2535 variables, 9/2160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2535 variables, 7/2167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2535 variables, 0/2167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 23/2558 variables, 10/2177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:27] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2558 variables, 1/2178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2558 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 82/2640 variables, 60/2238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2640 variables, 11/2249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2640 variables, 2/2251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2640 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 5/2645 variables, 6/2257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2645 variables, 3/2260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2645 variables, 0/2260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 2/2647 variables, 1/2261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2647 variables, 0/2261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 16/2663 variables, 16/2277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2663 variables, 6/2283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:30] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 5 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2663 variables, 1/2284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2663 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:31] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
At refinement iteration 41 (OVERLAPS) 0/2663 variables, 1/2285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2663 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:33] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
At refinement iteration 43 (OVERLAPS) 0/2663 variables, 1/2286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2663 variables, 0/2286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 0/2663 variables, 0/2286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2663/2663 variables, and 2286 constraints, problems are : Problem set: 0 solved, 5 unsolved in 22949 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1446/1446 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 65/65 constraints]
After SMT, in 27079ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2963 ms.
Support contains 125 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1446 transition count 1212
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 1441 transition count 1209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 1438 transition count 1209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 1438 transition count 1205
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 1434 transition count 1205
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 58 place count 1417 transition count 1188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 1416 transition count 1188
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 1416 transition count 1188
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 1413 transition count 1185
Applied a total of 67 rules in 206 ms. Remains 1413 /1446 variables (removed 33) and now considering 1185/1217 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 1413/1446 places, 1185/1217 transitions.
RANDOM walk for 40000 steps (8 resets) in 713 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 486 ms. (82 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 111294 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 5
Probabilistic random walk after 111294 steps, saw 67351 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 1185 rows 1413 cols
[2024-05-29 23:24:42] [INFO ] Computed 551 invariants in 4 ms
[2024-05-29 23:24:42] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 454/579 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 655/1234 variables, 291/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1234 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1079/2313 variables, 1234/1705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2313 variables, 220/1925 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2313 variables, 0/1925 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 127/2440 variables, 80/2005 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2440 variables, 32/2037 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2440 variables, 1/2038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2440 variables, 0/2038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/2446 variables, 6/2044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2446 variables, 6/2050 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2446 variables, 0/2050 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/2458 variables, 6/2056 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2458 variables, 0/2056 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 92/2550 variables, 59/2115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2550 variables, 15/2130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2550 variables, 0/2130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 5/2555 variables, 7/2137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2555 variables, 5/2142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2555 variables, 0/2142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 6/2561 variables, 3/2145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2561 variables, 0/2145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 26/2587 variables, 22/2167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2587 variables, 7/2174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2587 variables, 0/2174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 1/2588 variables, 1/2175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2588 variables, 1/2176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2588 variables, 0/2176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 2/2590 variables, 1/2177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2590 variables, 0/2177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 8/2598 variables, 6/2183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2598 variables, 2/2185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2598 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 0/2598 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2598/2598 variables, and 2185 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4602 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1413/1413 constraints, ReadFeed: 221/221 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/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 454/579 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 23:24:47] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 15/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 655/1234 variables, 291/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 23:24:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 16/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-29 23:24:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1234 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1079/2313 variables, 1234/1739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2313 variables, 220/1959 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2313 variables, 1/1960 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:51] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 6 ms to minimize.
[2024-05-29 23:24:51] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 11 ms to minimize.
[2024-05-29 23:24:52] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 6 ms to minimize.
[2024-05-29 23:24:52] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 7 ms to minimize.
[2024-05-29 23:24:52] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 6 ms to minimize.
[2024-05-29 23:24:53] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 9 ms to minimize.
[2024-05-29 23:24:53] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 9 ms to minimize.
[2024-05-29 23:24:54] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 6 ms to minimize.
[2024-05-29 23:24:54] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 5 ms to minimize.
[2024-05-29 23:24:54] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 7 ms to minimize.
[2024-05-29 23:24:55] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 6 ms to minimize.
[2024-05-29 23:24:55] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2313 variables, 12/1972 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2313 variables, 0/1972 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 127/2440 variables, 80/2052 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2440 variables, 32/2084 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2440 variables, 1/2085 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2440 variables, 4/2089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:24:58] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 3 ms to minimize.
[2024-05-29 23:24:58] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 6 ms to minimize.
[2024-05-29 23:24:59] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 6 ms to minimize.
[2024-05-29 23:24:59] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 4 ms to minimize.
[2024-05-29 23:24:59] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2440 variables, 5/2094 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2440 variables, 0/2094 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 6/2446 variables, 6/2100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2446 variables, 6/2106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2446 variables, 0/2106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 12/2458 variables, 6/2112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2458 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 92/2550 variables, 59/2171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2550 variables, 15/2186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2550 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 5/2555 variables, 7/2193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2555 variables, 5/2198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2555 variables, 0/2198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 6/2561 variables, 3/2201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2561 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 26/2587 variables, 22/2223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2587 variables, 7/2230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:05] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 7 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2587 variables, 1/2231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2587 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 1/2588 variables, 1/2232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2588 variables, 1/2233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2588 variables, 0/2233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 2/2590 variables, 1/2234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2590 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 8/2598 variables, 6/2240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2598 variables, 2/2242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2598 variables, 0/2242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:18] [INFO ] Deduced a trap composed of 4 places in 7967 ms of which 3 ms to minimize.
At refinement iteration 44 (OVERLAPS) 0/2598 variables, 1/2243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2598 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 0/2598 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2598/2598 variables, and 2243 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33630 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 1413/1413 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 53/53 constraints]
After SMT, in 38297ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4112 ms.
Support contains 125 out of 1413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1413/1413 places, 1185/1185 transitions.
Applied a total of 0 rules in 36 ms. Remains 1413 /1413 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1413/1413 places, 1185/1185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1413/1413 places, 1185/1185 transitions.
Applied a total of 0 rules in 35 ms. Remains 1413 /1413 variables (removed 0) and now considering 1185/1185 (removed 0) transitions.
[2024-05-29 23:25:24] [INFO ] Invariant cache hit.
[2024-05-29 23:25:25] [INFO ] Implicit Places using invariants in 815 ms returned [1402]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 842 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1412/1413 places, 1185/1185 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1412 transition count 1183
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1410 transition count 1183
Applied a total of 4 rules in 45 ms. Remains 1410 /1412 variables (removed 2) and now considering 1183/1185 (removed 2) transitions.
// Phase 1: matrix 1183 rows 1410 cols
[2024-05-29 23:25:25] [INFO ] Computed 550 invariants in 3 ms
[2024-05-29 23:25:26] [INFO ] Implicit Places using invariants in 777 ms returned [1389, 1393]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 791 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1408/1413 places, 1183/1185 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1407 transition count 1182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1407 transition count 1182
Applied a total of 2 rules in 107 ms. Remains 1407 /1408 variables (removed 1) and now considering 1182/1183 (removed 1) transitions.
// Phase 1: matrix 1182 rows 1407 cols
[2024-05-29 23:25:26] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 23:25:27] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2024-05-29 23:25:27] [INFO ] Invariant cache hit.
[2024-05-29 23:25:28] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-05-29 23:25:32] [INFO ] Implicit Places using invariants and state equation in 5128 ms returned []
Implicit Place search using SMT with State Equation took 6248 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1407/1413 places, 1182/1185 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8073 ms. Remains : 1407/1413 places, 1182/1185 transitions.
RANDOM walk for 40000 steps (8 resets) in 762 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 560 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 569 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 474 ms. (84 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 54404 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 5
Probabilistic random walk after 54404 steps, saw 32780 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-29 23:25:36] [INFO ] Invariant cache hit.
[2024-05-29 23:25:36] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 452/577 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/577 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 651/1228 variables, 289/468 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1228 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1076/2304 variables, 1228/1696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2304 variables, 218/1914 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2304 variables, 0/1914 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 127/2431 variables, 80/1994 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2431 variables, 32/2026 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2431 variables, 1/2027 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2431 variables, 0/2027 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/2437 variables, 6/2033 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 6/2039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 0/2039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/2449 variables, 6/2045 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2449 variables, 0/2045 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 92/2541 variables, 59/2104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2541 variables, 15/2119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2541 variables, 0/2119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 5/2546 variables, 7/2126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2546 variables, 5/2131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2546 variables, 0/2131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 6/2552 variables, 3/2134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2552 variables, 0/2134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 26/2578 variables, 22/2156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2578 variables, 7/2163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2578 variables, 0/2163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 1/2579 variables, 1/2164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2579 variables, 1/2165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2579 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 2/2581 variables, 1/2166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2581 variables, 0/2166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 8/2589 variables, 6/2172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2589 variables, 2/2174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2589 variables, 0/2174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 0/2589 variables, 0/2174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2589/2589 variables, and 2174 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5448 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1407/1407 constraints, ReadFeed: 219/219 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/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 452/577 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 23:25:42] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/577 variables, 17/196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-29 23:25:43] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 651/1228 variables, 289/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-29 23:25:44] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 23:25:45] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1228 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1228 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:46] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1228 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:47] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 23:25:47] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1228 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:47] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1228 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:47] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 23:25:47] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1228 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:47] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1228 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1228 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1076/2304 variables, 1228/1747 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2304 variables, 218/1965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2304 variables, 1/1966 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:49] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 23:25:49] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:25:49] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:25:49] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 2 ms to minimize.
[2024-05-29 23:25:49] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2304 variables, 5/1971 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:50] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:25:50] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-05-29 23:25:50] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2304 variables, 3/1974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2304 variables, 0/1974 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 127/2431 variables, 80/2054 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2431 variables, 32/2086 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2431 variables, 1/2087 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2431 variables, 4/2091 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:53] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 2 ms to minimize.
[2024-05-29 23:25:53] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-29 23:25:53] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-29 23:25:53] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-29 23:25:54] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2431 variables, 5/2096 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2431 variables, 0/2096 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 6/2437 variables, 6/2102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2437 variables, 6/2108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:55] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2437 variables, 1/2109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2437 variables, 0/2109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 12/2449 variables, 6/2115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2449 variables, 0/2115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 92/2541 variables, 59/2174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2541 variables, 15/2189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 23:25:58] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2541 variables, 1/2190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2541 variables, 0/2190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 5/2546 variables, 7/2197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2546 variables, 5/2202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2546 variables, 0/2202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 6/2552 variables, 3/2205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2552 variables, 0/2205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 26/2578 variables, 22/2227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2578 variables, 7/2234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2578 variables, 0/2234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 1/2579 variables, 1/2235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2579 variables, 1/2236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2579 variables, 0/2236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 2/2581 variables, 1/2237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2581 variables, 0/2237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (OVERLAPS) 8/2589 variables, 6/2243 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2589 variables, 2/2245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2589 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 0/2589 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2589/2589 variables, and 2245 constraints, problems are : Problem set: 0 solved, 5 unsolved in 21947 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1407/1407 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 66/66 constraints]
After SMT, in 27441ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5693 ms.
Support contains 125 out of 1407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1407/1407 places, 1182/1182 transitions.
Applied a total of 0 rules in 59 ms. Remains 1407 /1407 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1407/1407 places, 1182/1182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1407/1407 places, 1182/1182 transitions.
Applied a total of 0 rules in 52 ms. Remains 1407 /1407 variables (removed 0) and now considering 1182/1182 (removed 0) transitions.
[2024-05-29 23:26:09] [INFO ] Invariant cache hit.
[2024-05-29 23:26:10] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-29 23:26:10] [INFO ] Invariant cache hit.
[2024-05-29 23:26:11] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-05-29 23:26:14] [INFO ] Implicit Places using invariants and state equation in 4116 ms returned []
Implicit Place search using SMT with State Equation took 4777 ms to find 0 implicit places.
[2024-05-29 23:26:14] [INFO ] Redundant transitions in 63 ms returned []
Running 1172 sub problems to find dead transitions.
[2024-05-29 23:26:14] [INFO ] Invariant cache hit.
[2024-05-29 23:26:14] [INFO ] State equation strengthened by 219 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1397 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 1172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1397/2589 variables, and 102 constraints, problems are : Problem set: 0 solved, 1172 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 102/548 constraints, State Equation: 0/1407 constraints, ReadFeed: 0/219 constraints, PredecessorRefiner: 1172/1172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1397 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 1172 unsolved
[2024-05-29 23:27:05] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-29 23:27:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1397 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1397/2589 variables, and 104 constraints, problems are : Problem set: 0 solved, 1172 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 102/548 constraints, State Equation: 0/1407 constraints, ReadFeed: 0/219 constraints, PredecessorRefiner: 0/1172 constraints, Known Traps: 2/2 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 1172 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65331 ms. Remains : 1407/1407 places, 1182/1182 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 255 times.
Drop transitions (Partial Free agglomeration) removed 255 transitions
Iterating global reduction 0 with 255 rules applied. Total rules applied 255 place count 1407 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 256 place count 1407 transition count 1181
Applied a total of 256 rules in 115 ms. Remains 1407 /1407 variables (removed 0) and now considering 1181/1182 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1181 rows 1407 cols
[2024-05-29 23:27:15] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 23:27:15] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 23:27:15] [INFO ] [Nat]Absence check using 548 positive place invariants in 86 ms returned sat
[2024-05-29 23:27:16] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 23:27:16] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-05-29 23:27:18] [INFO ] After 1504ms SMT Verify possible using 217 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-29 23:27:18] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2024-05-29 23:27:18] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 3 ms to minimize.
[2024-05-29 23:27:19] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 3 ms to minimize.
[2024-05-29 23:27:19] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:27:19] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:27:19] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 4 ms to minimize.
[2024-05-29 23:27:20] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:27:20] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:27:20] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:27:20] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-05-29 23:27:20] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 4 ms to minimize.
[2024-05-29 23:27:21] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:27:21] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-05-29 23:27:21] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:27:21] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:27:22] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:27:22] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:27:22] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-05-29 23:27:22] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:27:22] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:27:23] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:27:23] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:27:23] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:27:23] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:27:23] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:27:24] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:27:24] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:27:24] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-05-29 23:27:24] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:27:24] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 2 ms to minimize.
[2024-05-29 23:27:25] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:27:25] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-29 23:27:25] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6868 ms
[2024-05-29 23:27:25] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-29 23:27:26] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 3 ms to minimize.
[2024-05-29 23:27:26] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 4 ms to minimize.
[2024-05-29 23:27:26] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 3 ms to minimize.
[2024-05-29 23:27:26] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 3 ms to minimize.
[2024-05-29 23:27:26] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 4 ms to minimize.
[2024-05-29 23:27:27] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 4 ms to minimize.
[2024-05-29 23:27:27] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:27:27] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:27:27] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:27:27] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:27:28] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-29 23:27:28] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:27:28] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:27:28] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:27:29] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:27:29] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:27:29] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
[2024-05-29 23:27:29] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 3 ms to minimize.
[2024-05-29 23:27:29] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 4 ms to minimize.
[2024-05-29 23:27:30] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-29 23:27:30] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 4 ms to minimize.
[2024-05-29 23:27:30] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-05-29 23:27:30] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:27:30] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5301 ms
[2024-05-29 23:27:32] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 5 ms to minimize.
[2024-05-29 23:27:32] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 3 ms to minimize.
[2024-05-29 23:27:32] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:27:32] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:27:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1088 ms
[2024-05-29 23:27:33] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-05-29 23:27:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-05-29 23:27:33] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 6 ms to minimize.
[2024-05-29 23:27:33] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 3 ms to minimize.
[2024-05-29 23:27:34] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 3 ms to minimize.
[2024-05-29 23:27:34] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:27:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 978 ms
TRAPS : Iteration 1
[2024-05-29 23:27:34] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-05-29 23:27:35] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:27:35] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:27:35] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 3 ms to minimize.
[2024-05-29 23:27:35] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-05-29 23:27:36] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 4 ms to minimize.
[2024-05-29 23:27:36] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 4 ms to minimize.
[2024-05-29 23:27:36] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-05-29 23:27:36] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:27:37] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 3 ms to minimize.
[2024-05-29 23:27:37] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:27:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2837 ms
[2024-05-29 23:27:37] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-05-29 23:27:38] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 3 ms to minimize.
[2024-05-29 23:27:38] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:27:38] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 4 ms to minimize.
[2024-05-29 23:27:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1075 ms
[2024-05-29 23:27:39] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:27:39] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2024-05-29 23:27:40] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 3 ms to minimize.
[2024-05-29 23:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
TRAPS : Iteration 2
[2024-05-29 23:27:40] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 3 ms to minimize.
[2024-05-29 23:27:41] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 4 ms to minimize.
[2024-05-29 23:27:41] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 3 ms to minimize.
[2024-05-29 23:27:41] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 4 ms to minimize.
[2024-05-29 23:27:42] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 4 ms to minimize.
[2024-05-29 23:27:42] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 4 ms to minimize.
[2024-05-29 23:27:42] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2024-05-29 23:27:42] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 4 ms to minimize.
[2024-05-29 23:27:43] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:27:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2399 ms
[2024-05-29 23:27:43] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 3 ms to minimize.
[2024-05-29 23:27:43] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 3 ms to minimize.
[2024-05-29 23:27:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 580 ms
[2024-05-29 23:27:45] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:27:45] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:27:45] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:27:46] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 4 ms to minimize.
[2024-05-29 23:27:46] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 3 ms to minimize.
[2024-05-29 23:27:46] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:27:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1688 ms
[2024-05-29 23:27:46] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-05-29 23:27:47] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
[2024-05-29 23:27:47] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:27:47] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 4 ms to minimize.
[2024-05-29 23:27:47] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 3 ms to minimize.
[2024-05-29 23:27:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1255 ms
[2024-05-29 23:27:48] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
TRAPS : Iteration 3
[2024-05-29 23:27:48] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:27:49] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:27:49] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-05-29 23:27:49] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 3 ms to minimize.
[2024-05-29 23:27:50] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 4 ms to minimize.
[2024-05-29 23:27:50] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 4 ms to minimize.
[2024-05-29 23:27:50] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 4 ms to minimize.
[2024-05-29 23:27:50] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:27:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2201 ms
[2024-05-29 23:27:51] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 4 ms to minimize.
[2024-05-29 23:27:51] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-29 23:27:51] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:27:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 798 ms
[2024-05-29 23:27:52] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:27:53] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:27:53] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 2 ms to minimize.
[2024-05-29 23:27:53] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 4 ms to minimize.
[2024-05-29 23:27:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1251 ms
[2024-05-29 23:27:54] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:27:54] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:27:54] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 3 ms to minimize.
[2024-05-29 23:27:54] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
[2024-05-29 23:27:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 915 ms
TRAPS : Iteration 4
[2024-05-29 23:27:55] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 4 ms to minimize.
[2024-05-29 23:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2024-05-29 23:27:56] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-05-29 23:27:56] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:27:56] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:27:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 736 ms
[2024-05-29 23:27:57] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-29 23:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
TRAPS : Iteration 5
[2024-05-29 23:27:58] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 4 ms to minimize.
[2024-05-29 23:27:58] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 4 ms to minimize.
[2024-05-29 23:27:58] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 4 ms to minimize.
[2024-05-29 23:27:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 776 ms
[2024-05-29 23:27:59] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-29 23:27:59] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 4 ms to minimize.
[2024-05-29 23:27:59] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:28:00] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 4 ms to minimize.
[2024-05-29 23:28:00] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-29 23:28:00] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-29 23:28:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1454 ms
[2024-05-29 23:28:02] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 4 ms to minimize.
[2024-05-29 23:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2024-05-29 23:28:02] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 3 ms to minimize.
[2024-05-29 23:28:02] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:28:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 558 ms
[2024-05-29 23:28:03] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
TRAPS : Iteration 6
[2024-05-29 23:28:03] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:28:03] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 4 ms to minimize.
[2024-05-29 23:28:04] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 4 ms to minimize.
[2024-05-29 23:28:04] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:28:04] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 4 ms to minimize.
[2024-05-29 23:28:04] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 3 ms to minimize.
[2024-05-29 23:28:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1660 ms
[2024-05-29 23:28:05] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 4 ms to minimize.
[2024-05-29 23:28:05] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 5 ms to minimize.
[2024-05-29 23:28:06] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 4 ms to minimize.
[2024-05-29 23:28:06] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 4 ms to minimize.
[2024-05-29 23:28:06] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 5 ms to minimize.
[2024-05-29 23:28:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1541 ms
[2024-05-29 23:28:08] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 3 ms to minimize.
[2024-05-29 23:28:08] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 3 ms to minimize.
[2024-05-29 23:28:08] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:28:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 865 ms
[2024-05-29 23:28:09] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 3 ms to minimize.
[2024-05-29 23:28:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-05-29 23:28:09] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-29 23:28:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
TRAPS : Iteration 7
[2024-05-29 23:28:10] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 5 ms to minimize.
[2024-05-29 23:28:10] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 5 ms to minimize.
[2024-05-29 23:28:11] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 5 ms to minimize.
[2024-05-29 23:28:11] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 4 ms to minimize.
[2024-05-29 23:28:11] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 4 ms to minimize.
[2024-05-29 23:28:12] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 5 ms to minimize.
[2024-05-29 23:28:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2010 ms
[2024-05-29 23:28:12] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 4 ms to minimize.
[2024-05-29 23:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2024-05-29 23:28:14] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 3 ms to minimize.
[2024-05-29 23:28:14] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 3 ms to minimize.
[2024-05-29 23:28:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 571 ms
TRAPS : Iteration 8
[2024-05-29 23:28:15] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:28:15] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 3 ms to minimize.
[2024-05-29 23:28:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 591 ms
[2024-05-29 23:28:16] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 3 ms to minimize.
[2024-05-29 23:28:16] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 4 ms to minimize.
[2024-05-29 23:28:16] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:28:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 887 ms
[2024-05-29 23:28:19] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 3 ms to minimize.
[2024-05-29 23:28:19] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:28:19] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 4 ms to minimize.
[2024-05-29 23:28:19] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 4 ms to minimize.
[2024-05-29 23:28:20] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 3 ms to minimize.
[2024-05-29 23:28:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1360 ms
TRAPS : Iteration 9
[2024-05-29 23:28:21] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:28:21] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 4 ms to minimize.
[2024-05-29 23:28:21] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-05-29 23:28:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 869 ms
[2024-05-29 23:28:22] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 3 ms to minimize.
[2024-05-29 23:28:23] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 4 ms to minimize.
[2024-05-29 23:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 570 ms
TRAPS : Iteration 10
[2024-05-29 23:28:24] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 4 ms to minimize.
[2024-05-29 23:28:25] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 4 ms to minimize.
[2024-05-29 23:28:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 659 ms
[2024-05-29 23:28:28] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 4 ms to minimize.
[2024-05-29 23:28:28] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 4 ms to minimize.
[2024-05-29 23:28:28] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 4 ms to minimize.
[2024-05-29 23:28:28] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 4 ms to minimize.
[2024-05-29 23:28:29] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:28:29] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 3 ms to minimize.
[2024-05-29 23:28:29] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-29 23:28:29] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-29 23:28:30] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 4 ms to minimize.
[2024-05-29 23:28:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2423 ms
[2024-05-29 23:28:30] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:28:30] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:28:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2024-05-29 23:28:31] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 3 ms to minimize.
[2024-05-29 23:28:31] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-05-29 23:28:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
TRAPS : Iteration 11
[2024-05-29 23:28:32] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 4 ms to minimize.
[2024-05-29 23:28:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2024-05-29 23:28:32] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 4 ms to minimize.
[2024-05-29 23:28:33] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:28:33] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 4 ms to minimize.
[2024-05-29 23:28:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 851 ms
[2024-05-29 23:28:35] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:28:35] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-05-29 23:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2024-05-29 23:28:36] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 4 ms to minimize.
[2024-05-29 23:28:36] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 4 ms to minimize.
[2024-05-29 23:28:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
TRAPS : Iteration 12
[2024-05-29 23:28:37] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 3 ms to minimize.
[2024-05-29 23:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2024-05-29 23:28:37] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:28:38] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 4 ms to minimize.
[2024-05-29 23:28:38] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:28:38] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 4 ms to minimize.
[2024-05-29 23:28:38] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:28:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1310 ms
[2024-05-29 23:28:40] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-05-29 23:28:41] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 4 ms to minimize.
[2024-05-29 23:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
TRAPS : Iteration 13
[2024-05-29 23:28:42] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 5 ms to minimize.
[2024-05-29 23:28:42] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 4 ms to minimize.
[2024-05-29 23:28:43] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 4 ms to minimize.
[2024-05-29 23:28:43] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 4 ms to minimize.
[2024-05-29 23:28:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1319 ms
[2024-05-29 23:28:46] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-05-29 23:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2024-05-29 23:28:46] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
TRAPS : Iteration 14
[2024-05-29 23:28:47] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 4 ms to minimize.
[2024-05-29 23:28:47] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 4 ms to minimize.
[2024-05-29 23:28:47] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 4 ms to minimize.
[2024-05-29 23:28:48] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 4 ms to minimize.
[2024-05-29 23:28:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1136 ms
[2024-05-29 23:28:52] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 4 ms to minimize.
[2024-05-29 23:28:52] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:28:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 646 ms
TRAPS : Iteration 15
[2024-05-29 23:28:53] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:28:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2024-05-29 23:28:54] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 4 ms to minimize.
[2024-05-29 23:28:55] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 4 ms to minimize.
[2024-05-29 23:28:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 577 ms
TRAPS : Iteration 16
[2024-05-29 23:28:57] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 5 ms to minimize.
[2024-05-29 23:28:57] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 5 ms to minimize.
[2024-05-29 23:28:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 688 ms
[2024-05-29 23:28:58] [INFO ] Deduced a trap composed of 16 places in 271 ms of which 5 ms to minimize.
[2024-05-29 23:28:58] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 5 ms to minimize.
[2024-05-29 23:28:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 737 ms
TRAPS : Iteration 17
[2024-05-29 23:29:00] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:29:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2024-05-29 23:29:00] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 4 ms to minimize.
[2024-05-29 23:29:01] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 6 ms to minimize.
[2024-05-29 23:29:01] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 3 ms to minimize.
[2024-05-29 23:29:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 837 ms
TRAPS : Iteration 18
[2024-05-29 23:29:04] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-29 23:29:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-05-29 23:29:07] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-05-29 23:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-05-29 23:29:07] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 3 ms to minimize.
[2024-05-29 23:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
TRAPS : Iteration 19
[2024-05-29 23:29:09] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 4 ms to minimize.
[2024-05-29 23:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2024-05-29 23:29:11] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 4 ms to minimize.
[2024-05-29 23:29:11] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 4 ms to minimize.
[2024-05-29 23:29:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 561 ms
[2024-05-29 23:29:12] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
TRAPS : Iteration 20
[2024-05-29 23:29:12] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 4 ms to minimize.
[2024-05-29 23:29:13] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:29:13] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 3 ms to minimize.
[2024-05-29 23:29:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 944 ms
[2024-05-29 23:29:14] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 4 ms to minimize.
[2024-05-29 23:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2024-05-29 23:29:17] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 32 ms to minimize.
[2024-05-29 23:29:17] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 8 ms to minimize.
[2024-05-29 23:29:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 990 ms
TRAPS : Iteration 21
[2024-05-29 23:29:18] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 3 ms to minimize.
[2024-05-29 23:29:19] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 3 ms to minimize.
[2024-05-29 23:29:19] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 3 ms to minimize.
[2024-05-29 23:29:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 972 ms
[2024-05-29 23:29:20] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 3 ms to minimize.
[2024-05-29 23:29:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2024-05-29 23:29:21] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 3 ms to minimize.
[2024-05-29 23:29:21] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 3 ms to minimize.
[2024-05-29 23:29:21] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-29 23:29:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 761 ms
TRAPS : Iteration 22
[2024-05-29 23:29:24] [INFO ] After 127810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-29 23:29:27] [INFO ] After 132073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-29 23:29:27] [INFO ] Flatten gal took : 75 ms
[2024-05-29 23:29:27] [INFO ] Flatten gal took : 61 ms
[2024-05-29 23:29:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12729742430259772782.gal : 11 ms
[2024-05-29 23:29:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality707893510079042240.prop : 0 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/ReachabilityCardinality12729742430259772782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality707893510079042240.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/ReachabilityCardinality707893510079042240.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 109
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :109 after 973
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :973 after 78733
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :78733 after 3.82638e+08
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.82638e+08 after 1.2676e+14
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.2676e+14 after 1.26761e+14
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.26761e+14 after 1.26761e+14
Detected timeout of ITS tools.
[2024-05-29 23:29:42] [INFO ] Flatten gal took : 61 ms
[2024-05-29 23:29:42] [INFO ] Applying decomposition
[2024-05-29 23:29:43] [INFO ] Flatten gal took : 51 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/graph2442579078223633285.txt' '-o' '/tmp/graph2442579078223633285.bin' '-w' '/tmp/graph2442579078223633285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2442579078223633285.bin' '-l' '-1' '-v' '-w' '/tmp/graph2442579078223633285.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:29:43] [INFO ] Decomposing Gal with order
[2024-05-29 23:29:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:29:43] [INFO ] Removed a total of 290 redundant transitions.
[2024-05-29 23:29:43] [INFO ] Flatten gal took : 165 ms
[2024-05-29 23:29:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 79 ms.
[2024-05-29 23:29:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7018423031502217847.gal : 32 ms
[2024-05-29 23:29:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12473950531449027297.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/ReachabilityCardinality7018423031502217847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12473950531449027297.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/ReachabilityCardinality12473950531449027297.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 3
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 37
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :37 after 325
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :325 after 973
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :973 after 2917
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2917 after 26245
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :26245 after 1.53055e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 163719 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 23:29:59] [INFO ] Flatten gal took : 78 ms
[2024-05-29 23:29:59] [INFO ] Applying decomposition
[2024-05-29 23:29:59] [INFO ] Flatten gal took : 77 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/graph10258041175561809539.txt' '-o' '/tmp/graph10258041175561809539.bin' '-w' '/tmp/graph10258041175561809539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10258041175561809539.bin' '-l' '-1' '-v' '-w' '/tmp/graph10258041175561809539.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:29:59] [INFO ] Decomposing Gal with order
[2024-05-29 23:29:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:30:00] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 23:30:00] [INFO ] Flatten gal took : 180 ms
[2024-05-29 23:30:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 23:30:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality95992181018157096.gal : 35 ms
[2024-05-29 23:30:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2353673207392411092.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/ReachabilityCardinality95992181018157096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2353673207392411092.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 ...305
Loading property file /tmp/ReachabilityCardinality2353673207392411092.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 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 66174
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :66174 after 5.70883e+66
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :5.70883e+66 after 1.49096e+149
ITS-tools command line returned an error code 137
[2024-05-29 23:40:39] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6873867753001897673
[2024-05-29 23:40:39] [INFO ] Applying decomposition
[2024-05-29 23:40:39] [INFO ] Computing symmetric may disable matrix : 1182 transitions.
[2024-05-29 23:40:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:40:39] [INFO ] Computing symmetric may enable matrix : 1182 transitions.
[2024-05-29 23:40:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:40:39] [INFO ] Flatten gal took : 63 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/graph14901360617822436724.txt' '-o' '/tmp/graph14901360617822436724.bin' '-w' '/tmp/graph14901360617822436724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14901360617822436724.bin' '-l' '-1' '-v' '-w' '/tmp/graph14901360617822436724.weights' '-q' '0' '-e' '0.001'
[2024-05-29 23:40:39] [INFO ] Decomposing Gal with order
[2024-05-29 23:40:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 23:40:39] [INFO ] Removed a total of 606 redundant transitions.
[2024-05-29 23:40:39] [INFO ] Flatten gal took : 58 ms
[2024-05-29 23:40:39] [INFO ] Computing Do-Not-Accords matrix : 1182 transitions.
[2024-05-29 23:40:39] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 23:40:40] [INFO ] Built C files in 368ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6873867753001897673
Running compilation step : cd /tmp/ltsmin6873867753001897673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 23:40:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 35 ms.
[2024-05-29 23:40:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11677034443604389007.gal : 18 ms
[2024-05-29 23:40:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12814853635720370733.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/ReachabilityCardinality11677034443604389007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12814853635720370733.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/ReachabilityCardinality12814853635720370733.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 48
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :48 after 336
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :336 after 3900
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :3900 after 3900
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3900 after 2.83436e+06
Compilation finished in 4788 ms.
Running link step : cd /tmp/ltsmin6873867753001897673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202400==true'
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :6.1327e+22 after 1.02983e+51
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202410==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202400==true'
Detected timeout of ITS tools.
[2024-05-30 00:06:16] [INFO ] Applying decomposition
[2024-05-30 00:06:16] [INFO ] Flatten gal took : 87 ms
[2024-05-30 00:06:16] [INFO ] Decomposing Gal with order
[2024-05-30 00:06:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:06:16] [INFO ] Removed a total of 591 redundant transitions.
[2024-05-30 00:06:16] [INFO ] Flatten gal took : 131 ms
[2024-05-30 00:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 129 ms.
[2024-05-30 00:06:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1381394751221879685.gal : 11 ms
[2024-05-30 00:06:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality687276657846684554.prop : 0 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/ReachabilityCardinality1381394751221879685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality687276657846684554.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 ...306
Loading property file /tmp/ReachabilityCardinality687276657846684554.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 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 37
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :37 after 973
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :973 after 2917
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2917 after 78733
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :78733 after 1.27546e+08
Reachability property ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.71744e+20 after 2.02962e+73
WARNING : LTSmin timed out (>1152 s) on command cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin6873867753001897673;'/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' 'ShieldPPPtPT050BReachabilityCardinality202403==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-050B, examination is ReachabilityCardinality"
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-171683761600686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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