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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 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 762K 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-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717020585192

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-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 22:09:46] [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 22:09:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:09:46] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-29 22:09:46] [INFO ] Transformed 3123 places.
[2024-05-29 22:09:46] [INFO ] Transformed 2843 transitions.
[2024-05-29 22:09:46] [INFO ] Found NUPN structural information;
[2024-05-29 22:09:46] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2102 ms. (19 steps per ms) remains 7/13 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
[2024-05-29 22:09:47] [INFO ] Flatten gal took : 337 ms
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
[2024-05-29 22:09:47] [INFO ] Flatten gal took : 177 ms
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 7/7 properties
[2024-05-29 22:09:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7842686245204429330.gal : 110 ms
[2024-05-29 22:09:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1259295386260075497.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/ReachabilityCardinality7842686245204429330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1259295386260075497.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 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 ...328
// Phase 1: matrix 2843 rows 3123 cols
[2024-05-29 22:09:48] [INFO ] Computed 441 invariants in 40 ms
Loading property file /tmp/ReachabilityCardinality1259295386260075497.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2051/2100 variables, 289/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2100 variables, 2051/2389 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2100 variables, 0/2389 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1023/3123 variables, 152/2541 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3123 variables, 1023/3564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3123 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2843/5966 variables, 3123/6687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5966/5966 variables, and 6687 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3588 ms.
Refiners :[Domain max(s): 3123/3123 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 3123/3123 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/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2051/2100 variables, 289/338 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2100 variables, 2051/2389 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 22:09:53] [INFO ] Deduced a trap composed of 35 places in 478 ms of which 52 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 873
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :873 after 303615
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :303615 after 5.34242e+08
[2024-05-29 22:09:53] [INFO ] Deduced a trap composed of 51 places in 460 ms of which 8 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :5.34242e+08 after 1.12436e+16
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1.12436e+16 after 8.77745e+31
[2024-05-29 22:09:53] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 4 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :8.77745e+31 after 1.24739e+70
[2024-05-29 22:09:54] [INFO ] Deduced a trap composed of 37 places in 367 ms of which 24 ms to minimize.
[2024-05-29 22:09:54] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 4 ms to minimize.
[2024-05-29 22:09:55] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 4 ms to minimize.
[2024-05-29 22:09:55] [INFO ] Deduced a trap composed of 45 places in 529 ms of which 32 ms to minimize.
[2024-05-29 22:09:55] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2024-05-29 22:09:56] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 4 ms to minimize.
[2024-05-29 22:09:56] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-05-29 22:09:56] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 5 ms to minimize.
[2024-05-29 22:09:56] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 4 ms to minimize.
[2024-05-29 22:09:57] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2100/5966 variables, and 2402 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5027 ms.
Refiners :[Domain max(s): 2100/3123 constraints, Positive P Invariants (semi-flows): 289/441 constraints, State Equation: 0/3123 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 13/13 constraints]
After SMT, in 8749ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 728 transitions
Trivial Post-agglo rules discarded 728 transitions
Performed 728 trivial Post agglomeration. Transition count delta: 728
Iterating post reduction 0 with 728 rules applied. Total rules applied 728 place count 3123 transition count 2115
Reduce places removed 728 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 730 rules applied. Total rules applied 1458 place count 2395 transition count 2113
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 1468 place count 2394 transition count 2104
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1477 place count 2385 transition count 2104
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 168 Pre rules applied. Total rules applied 1477 place count 2385 transition count 1936
Deduced a syphon composed of 168 places in 6 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 4 with 336 rules applied. Total rules applied 1813 place count 2217 transition count 1936
Discarding 267 places :
Symmetric choice reduction at 4 with 267 rule applications. Total rules 2080 place count 1950 transition count 1669
Iterating global reduction 4 with 267 rules applied. Total rules applied 2347 place count 1950 transition count 1669
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 113 Pre rules applied. Total rules applied 2347 place count 1950 transition count 1556
Deduced a syphon composed of 113 places in 4 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 2573 place count 1837 transition count 1556
Performed 654 Post agglomeration using F-continuation condition.Transition count delta: 654
Deduced a syphon composed of 654 places in 6 ms
Reduce places removed 654 places and 0 transitions.
Iterating global reduction 4 with 1308 rules applied. Total rules applied 3881 place count 1183 transition count 902
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 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4083 place count 1082 transition count 902
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 4111 place count 1068 transition count 902
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4112 place count 1068 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4113 place count 1067 transition count 901
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 5 with 117 rules applied. Total rules applied 4230 place count 1067 transition count 901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4231 place count 1066 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4232 place count 1065 transition count 900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4232 place count 1065 transition count 898
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4236 place count 1063 transition count 898
Applied a total of 4236 rules in 1199 ms. Remains 1063 /3123 variables (removed 2060) and now considering 898/2843 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1216 ms. Remains : 1063/3123 places, 898/2843 transitions.
RANDOM walk for 40000 steps (8 resets) in 746 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/7 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 6/6 properties
// Phase 1: matrix 898 rows 1063 cols
[2024-05-29 22:09:59] [INFO ] Computed 440 invariants in 5 ms
[2024-05-29 22:09:59] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 652/680 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 77/757 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 679/1436 variables, 757/1064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1436 variables, 167/1231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1436 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 171/1607 variables, 96/1327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1607 variables, 34/1361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1607 variables, 2/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1607 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/1619 variables, 10/1373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1619 variables, 8/1381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1619 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1633 variables, 7/1388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1633 variables, 0/1388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 152/1785 variables, 88/1476 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1785 variables, 24/1500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1785 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1785 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 9/1794 variables, 10/1512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1794 variables, 7/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1794 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 10/1804 variables, 5/1524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1804 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 115/1919 variables, 79/1603 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1919 variables, 26/1629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1919 variables, 0/1629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 3/1922 variables, 5/1634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1922 variables, 3/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1922 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 26/1948 variables, 16/1653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1948 variables, 6/1659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1948 variables, 0/1659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1949 variables, 2/1661 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1949 variables, 1/1662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1949 variables, 0/1662 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 12/1961 variables, 8/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1961 variables, 4/1674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1961 variables, 0/1674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1961 variables, 0/1674 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 1674 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3722 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1063/1063 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 652/680 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-05-29 22:10:03] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 3 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 3 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 22:10:04] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 2 ms to minimize.
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
[2024-05-29 22:10:05] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 2 ms to minimize.
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 77/757 variables, 32/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:06] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 22:10:07] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-29 22:10:07] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 679/1436 variables, 757/1096 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1436 variables, 167/1263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1436 variables, 4/1267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:07] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-05-29 22:10:08] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1436 variables, 2/1269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:08] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1436 variables, 1/1270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1436 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 171/1607 variables, 96/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1607 variables, 34/1400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1607 variables, 2/1402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1607 variables, 2/1404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:09] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 22:10:09] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-29 22:10:09] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-29 22:10:09] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-29 22:10:09] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:10:09] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-29 22:10:10] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1607 variables, 7/1411 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:10] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1607 variables, 1/1412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1607 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 12/1619 variables, 10/1422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1619 variables, 8/1430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1619 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 14/1633 variables, 7/1437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1633 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 152/1785 variables, 88/1525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1785 variables, 24/1549 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1785 variables, 2/1551 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:11] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 22:10:12] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1785 variables, 2/1553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1785 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 9/1794 variables, 10/1563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1794 variables, 7/1570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1794 variables, 0/1570 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 10/1804 variables, 5/1575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1804 variables, 0/1575 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 115/1919 variables, 79/1654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1919 variables, 26/1680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1919 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 3/1922 variables, 5/1685 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1922 variables, 3/1688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1922 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 26/1948 variables, 16/1704 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1948 variables, 6/1710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:14] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/1948 variables, 1/1711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1948 variables, 0/1711 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (OVERLAPS) 1/1949 variables, 2/1713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1949 variables, 1/1714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1949 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (OVERLAPS) 12/1961 variables, 8/1722 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1961 variables, 4/1726 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1961 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (OVERLAPS) 0/1961 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 1726 constraints, problems are : Problem set: 0 solved, 6 unsolved in 13829 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1063/1063 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 46/46 constraints]
After SMT, in 17585ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 11145 ms.
Support contains 28 out of 1063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1063/1063 places, 898/898 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 1063 transition count 893
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 1058 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 1057 transition count 892
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 1057 transition count 889
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 1054 transition count 889
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 1041 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 1040 transition count 876
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 1040 transition count 874
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 1038 transition count 874
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 1038 transition count 874
Applied a total of 55 rules in 151 ms. Remains 1038 /1063 variables (removed 25) and now considering 874/898 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 1038/1063 places, 874/898 transitions.
RANDOM walk for 40000 steps (8 resets) in 599 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 336 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 133452 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 6
Probabilistic random walk after 133452 steps, saw 112178 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 874 rows 1038 cols
[2024-05-29 22:10:31] [INFO ] Computed 440 invariants in 14 ms
[2024-05-29 22:10:31] [INFO ] State equation strengthened by 178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 636/664 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/664 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 74/738 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 660/1398 variables, 738/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1398 variables, 174/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1398 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 170/1568 variables, 97/1316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1568 variables, 37/1353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1568 variables, 2/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1568 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1575 variables, 7/1362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1575 variables, 7/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1575 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1589 variables, 7/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1589 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 148/1737 variables, 84/1460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1737 variables, 25/1485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1737 variables, 2/1487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1737 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 7/1744 variables, 9/1496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1744 variables, 7/1503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1744 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 10/1754 variables, 5/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1754 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 116/1870 variables, 77/1585 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1870 variables, 26/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1870 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 3/1873 variables, 5/1616 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1873 variables, 3/1619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1873 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 26/1899 variables, 16/1635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1899 variables, 6/1641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1899 variables, 0/1641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1900 variables, 2/1643 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1900 variables, 1/1644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1900 variables, 0/1644 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 12/1912 variables, 8/1652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1912 variables, 4/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1912 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1912 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1912/1912 variables, and 1656 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3576 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1038/1038 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 636/664 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/664 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/664 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 74/738 variables, 32/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 660/1398 variables, 738/1046 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1398 variables, 174/1220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1398 variables, 4/1224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:36] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 3 ms to minimize.
[2024-05-29 22:10:36] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-29 22:10:36] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1398 variables, 3/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1398 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 170/1568 variables, 97/1324 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1568 variables, 37/1361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1568 variables, 2/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1568 variables, 2/1365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:37] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1568 variables, 1/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:37] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:10:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:10:38] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1568 variables, 3/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1568 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 7/1575 variables, 7/1376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1575 variables, 7/1383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1575 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 14/1589 variables, 7/1390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1589 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 148/1737 variables, 84/1474 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1737 variables, 25/1499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1737 variables, 2/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1737 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 7/1744 variables, 9/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1744 variables, 7/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1744 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 10/1754 variables, 5/1522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1754 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 116/1870 variables, 77/1599 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1870 variables, 26/1625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1870 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 3/1873 variables, 5/1630 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1873 variables, 3/1633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1873 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 26/1899 variables, 16/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1899 variables, 6/1655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1899 variables, 0/1655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 1/1900 variables, 2/1657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1900 variables, 1/1658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1900 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 12/1912 variables, 8/1666 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1912 variables, 4/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1912 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 0/1912 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1912/1912 variables, and 1670 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7184 ms.
Refiners :[Positive P Invariants (semi-flows): 440/440 constraints, State Equation: 1038/1038 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 10810ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4072 ms.
Support contains 28 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 874/874 transitions.
Applied a total of 0 rules in 30 ms. Remains 1038 /1038 variables (removed 0) and now considering 874/874 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1038/1038 places, 874/874 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 874/874 transitions.
Applied a total of 0 rules in 23 ms. Remains 1038 /1038 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-29 22:10:46] [INFO ] Invariant cache hit.
[2024-05-29 22:10:47] [INFO ] Implicit Places using invariants in 570 ms returned [1021, 1025]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 587 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1036/1038 places, 874/874 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 872
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 872
Applied a total of 4 rules in 38 ms. Remains 1034 /1036 variables (removed 2) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 1034 cols
[2024-05-29 22:10:47] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 22:10:47] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-29 22:10:47] [INFO ] Invariant cache hit.
[2024-05-29 22:10:48] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-05-29 22:10:50] [INFO ] Implicit Places using invariants and state equation in 2865 ms returned []
Implicit Place search using SMT with State Equation took 3398 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1034/1038 places, 872/874 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4047 ms. Remains : 1034/1038 places, 872/874 transitions.
RANDOM walk for 40000 steps (8 resets) in 465 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 113112 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 6
Probabilistic random walk after 113112 steps, saw 94968 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-29 22:10:54] [INFO ] Invariant cache hit.
[2024-05-29 22:10:54] [INFO ] State equation strengthened by 177 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 634/662 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 74/736 variables, 32/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 659/1395 variables, 736/1042 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1395 variables, 174/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1395 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 170/1565 variables, 97/1313 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1565 variables, 37/1350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1565 variables, 2/1352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1565 variables, 0/1352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1572 variables, 7/1359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1572 variables, 7/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1572 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1586 variables, 7/1373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1586 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 147/1733 variables, 84/1457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1733 variables, 25/1482 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1733 variables, 1/1483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1733 variables, 0/1483 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 7/1740 variables, 9/1492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1740 variables, 7/1499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1740 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 10/1750 variables, 5/1504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1750 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 114/1864 variables, 75/1579 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1864 variables, 25/1604 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1864 variables, 0/1604 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 3/1867 variables, 5/1609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1867 variables, 3/1612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1867 variables, 0/1612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 26/1893 variables, 16/1628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1893 variables, 6/1634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1893 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1/1894 variables, 2/1636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1894 variables, 1/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1894 variables, 0/1637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 12/1906 variables, 8/1645 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1906 variables, 4/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1906 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/1906 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1906/1906 variables, and 1649 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3508 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1034/1034 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 634/662 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:58] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 74/736 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:58] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 22:10:58] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 659/1395 variables, 736/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1395 variables, 174/1219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1395 variables, 4/1223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:59] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-29 22:10:59] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-29 22:10:59] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 5 ms to minimize.
[2024-05-29 22:10:59] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1395 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:10:59] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 3 ms to minimize.
[2024-05-29 22:11:00] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:11:00] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1395 variables, 3/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1395 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 170/1565 variables, 97/1327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1565 variables, 37/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1565 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1565 variables, 2/1368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:11:00] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-29 22:11:01] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1565 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1565 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 7/1572 variables, 7/1377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1572 variables, 7/1384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1572 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 14/1586 variables, 7/1391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1586 variables, 0/1391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 147/1733 variables, 84/1475 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1733 variables, 25/1500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1733 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1733 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 7/1740 variables, 9/1510 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1740 variables, 7/1517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:11:02] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1740 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1740 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 10/1750 variables, 5/1523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1750 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 114/1864 variables, 75/1598 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1864 variables, 25/1623 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 22:11:04] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1864 variables, 1/1624 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1864 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 3/1867 variables, 5/1629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1867 variables, 3/1632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1867 variables, 0/1632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 26/1893 variables, 16/1648 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1893 variables, 6/1654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1893 variables, 0/1654 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 1/1894 variables, 2/1656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1894 variables, 1/1657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1894 variables, 0/1657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 12/1906 variables, 8/1665 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1906 variables, 4/1669 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1906 variables, 0/1669 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (OVERLAPS) 0/1906 variables, 0/1669 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1906/1906 variables, and 1669 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8617 ms.
Refiners :[Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 1034/1034 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 12145ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3996 ms.
Support contains 28 out of 1034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 872/872 transitions.
Applied a total of 0 rules in 22 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1034/1034 places, 872/872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1034/1034 places, 872/872 transitions.
Applied a total of 0 rules in 21 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-29 22:11:10] [INFO ] Invariant cache hit.
[2024-05-29 22:11:11] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-29 22:11:11] [INFO ] Invariant cache hit.
[2024-05-29 22:11:11] [INFO ] State equation strengthened by 177 read => feed constraints.
[2024-05-29 22:11:14] [INFO ] Implicit Places using invariants and state equation in 2775 ms returned []
Implicit Place search using SMT with State Equation took 3257 ms to find 0 implicit places.
[2024-05-29 22:11:14] [INFO ] Redundant transitions in 45 ms returned []
Running 859 sub problems to find dead transitions.
[2024-05-29 22:11:14] [INFO ] Invariant cache hit.
[2024-05-29 22:11:14] [INFO ] State equation strengthened by 177 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1023 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-29 22:11:34] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:11:34] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-29 22:11:35] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 22:11:35] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-29 22:11:36] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1023 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 859 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1023/1906 variables, and 141 constraints, problems are : Problem set: 0 solved, 859 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 136/438 constraints, State Equation: 0/1034 constraints, ReadFeed: 0/177 constraints, PredecessorRefiner: 859/859 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 859 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1023 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1023 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1023 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 859 unsolved
At refinement iteration 3 (OVERLAPS) 11/1034 variables, 302/443 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 22:11:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 22:12:00] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 22:12:01] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 22:12:02] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 22:12:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:12:04] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1034 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-29 22:12:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:12:06] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:12:07] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-29 22:12:08] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 3 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:12:09] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 859 unsolved
[2024-05-29 22:12:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:12:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-29 22:12:12] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:12:12] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 22:12:13] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-29 22:12:13] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-29 22:12:13] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:12:13] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 22:12:13] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:12:13] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:12:14] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-29 22:12:14] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 3 ms to minimize.
[2024-05-29 22:12:14] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 60392ms, After SMT, problems are : Problem set: 0 solved, 859 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63740 ms. Remains : 1034/1034 places, 872/872 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 249 times.
Drop transitions (Partial Free agglomeration) removed 249 transitions
Iterating global reduction 0 with 249 rules applied. Total rules applied 249 place count 1034 transition count 872
Applied a total of 249 rules in 68 ms. Remains 1034 /1034 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 872 rows 1034 cols
[2024-05-29 22:12:14] [INFO ] Computed 438 invariants in 8 ms
[2024-05-29 22:12:14] [INFO ] [Real]Absence check using 438 positive place invariants in 55 ms returned sat
[2024-05-29 22:12:14] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 22:12:15] [INFO ] [Nat]Absence check using 438 positive place invariants in 65 ms returned sat
[2024-05-29 22:12:15] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 22:12:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-29 22:12:16] [INFO ] After 772ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-29 22:12:16] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 3 ms to minimize.
[2024-05-29 22:12:16] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-29 22:12:17] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 22:12:17] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-29 22:12:17] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 3 ms to minimize.
[2024-05-29 22:12:17] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:12:17] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-05-29 22:12:17] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-29 22:12:18] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 2 ms to minimize.
[2024-05-29 22:12:18] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-29 22:12:18] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 4 ms to minimize.
[2024-05-29 22:12:18] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 5 ms to minimize.
[2024-05-29 22:12:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2246 ms
[2024-05-29 22:12:19] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 4 ms to minimize.
[2024-05-29 22:12:19] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
[2024-05-29 22:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2024-05-29 22:12:20] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 2 ms to minimize.
[2024-05-29 22:12:20] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 19 ms to minimize.
[2024-05-29 22:12:20] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-29 22:12:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 670 ms
TRAPS : Iteration 1
[2024-05-29 22:12:20] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-29 22:12:21] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 3 ms to minimize.
[2024-05-29 22:12:21] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-29 22:12:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 493 ms
[2024-05-29 22:12:21] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-05-29 22:12:21] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-29 22:12:21] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-29 22:12:22] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-29 22:12:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 650 ms
[2024-05-29 22:12:22] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-29 22:12:23] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 2 ms to minimize.
[2024-05-29 22:12:23] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-05-29 22:12:23] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-29 22:12:23] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:12:23] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-29 22:12:23] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-29 22:12:24] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-05-29 22:12:24] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2024-05-29 22:12:24] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-05-29 22:12:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1863 ms
TRAPS : Iteration 2
[2024-05-29 22:12:25] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 3 ms to minimize.
[2024-05-29 22:12:26] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-05-29 22:12:26] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-29 22:12:26] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-05-29 22:12:26] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:12:26] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-05-29 22:12:27] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-29 22:12:27] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-29 22:12:27] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-29 22:12:27] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:12:27] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-29 22:12:28] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-05-29 22:12:28] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-05-29 22:12:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2611 ms
TRAPS : Iteration 3
[2024-05-29 22:12:28] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-29 22:12:28] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-29 22:12:28] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:12:29] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-05-29 22:12:29] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 3 ms to minimize.
[2024-05-29 22:12:29] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-29 22:12:29] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-29 22:12:29] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-05-29 22:12:29] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-29 22:12:30] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:12:30] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-29 22:12:30] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-05-29 22:12:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2033 ms
[2024-05-29 22:12:31] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2024-05-29 22:12:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
TRAPS : Iteration 4
[2024-05-29 22:12:31] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-05-29 22:12:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-05-29 22:12:33] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-05-29 22:12:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
TRAPS : Iteration 5
[2024-05-29 22:12:35] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 4 ms to minimize.
[2024-05-29 22:12:35] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-05-29 22:12:35] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-29 22:12:35] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-29 22:12:35] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-05-29 22:12:36] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-29 22:12:36] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-29 22:12:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1406 ms
TRAPS : Iteration 6
[2024-05-29 22:12:36] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 2 ms to minimize.
[2024-05-29 22:12:36] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-29 22:12:37] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-05-29 22:12:37] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 4 ms to minimize.
[2024-05-29 22:12:37] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-29 22:12:37] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-05-29 22:12:37] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-05-29 22:12:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1297 ms
[2024-05-29 22:12:38] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-29 22:12:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
TRAPS : Iteration 7
[2024-05-29 22:12:38] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 3 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-29 22:12:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1156 ms
[2024-05-29 22:12:41] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-29 22:12:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
TRAPS : Iteration 8
[2024-05-29 22:12:42] [INFO ] After 26308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-29 22:12:43] [INFO ] After 28465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 22:12:43] [INFO ] Flatten gal took : 57 ms
[2024-05-29 22:12:43] [INFO ] Flatten gal took : 40 ms
[2024-05-29 22:12:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5122008301570971327.gal : 19 ms
[2024-05-29 22:12:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13673033027467486894.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/ReachabilityCardinality5122008301570971327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13673033027467486894.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13673033027467486894.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 90
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :90 after 270
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :270 after 2430
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2430 after 126849
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00 is true.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :126849 after 127949
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :127949 after 160473
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :160473 after 408438
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :408438 after 1.0389e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.0389e+06 after 3.90066e+08
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3.90066e+08 after 2.31543e+09
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-03 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.31543e+09 after 2.66406e+12
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :2.66406e+12 after 1.58401e+13
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.58401e+13 after 1.2578e+14
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.2578e+14 after 1.24053e+17
Detected timeout of ITS tools.
[2024-05-29 22:12:58] [INFO ] Flatten gal took : 59 ms
[2024-05-29 22:12:58] [INFO ] Applying decomposition
[2024-05-29 22:12:58] [INFO ] Flatten gal took : 41 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/graph8201655348648965172.txt' '-o' '/tmp/graph8201655348648965172.bin' '-w' '/tmp/graph8201655348648965172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8201655348648965172.bin' '-l' '-1' '-v' '-w' '/tmp/graph8201655348648965172.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:12:58] [INFO ] Decomposing Gal with order
[2024-05-29 22:12:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:12:59] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-29 22:12:59] [INFO ] Flatten gal took : 88 ms
[2024-05-29 22:12:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 25 ms.
[2024-05-29 22:12:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1270219646524054173.gal : 15 ms
[2024-05-29 22:12:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12409769247213512199.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/ReachabilityCardinality1270219646524054173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12409769247213512199.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/ReachabilityCardinality12409769247213512199.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :6 after 6
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :6 after 6
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :6 after 10
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :10 after 270
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.02241e+09 after 1.34984e+26
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 59813 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 22:13:14] [INFO ] Flatten gal took : 90 ms
[2024-05-29 22:13:14] [INFO ] Applying decomposition
[2024-05-29 22:13:14] [INFO ] Flatten gal took : 59 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/graph2326091705027211830.txt' '-o' '/tmp/graph2326091705027211830.bin' '-w' '/tmp/graph2326091705027211830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2326091705027211830.bin' '-l' '-1' '-v' '-w' '/tmp/graph2326091705027211830.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:13:14] [INFO ] Decomposing Gal with order
[2024-05-29 22:13:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:13:15] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 22:13:15] [INFO ] Flatten gal took : 136 ms
[2024-05-29 22:13:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-29 22:13:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13491716410596746149.gal : 29 ms
[2024-05-29 22:13:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15119492415274962830.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/ReachabilityCardinality13491716410596746149.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15119492415274962830.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/ReachabilityCardinality15119492415274962830.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 2850
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2850 after 123893
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :123893 after 648916
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :648916 after 648916
ITS-tools command line returned an error code 137
[2024-05-29 22:20:14] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1886777477649682967
[2024-05-29 22:20:14] [INFO ] Applying decomposition
[2024-05-29 22:20:14] [INFO ] Flatten gal took : 53 ms
[2024-05-29 22:20:14] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2024-05-29 22:20:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 22:20:14] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2024-05-29 22:20:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph203991252503547324.txt' '-o' '/tmp/graph203991252503547324.bin' '-w' '/tmp/graph203991252503547324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph203991252503547324.bin' '-l' '-1' '-v' '-w' '/tmp/graph203991252503547324.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:20:14] [INFO ] Decomposing Gal with order
[2024-05-29 22:20:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:20:14] [INFO ] Removed a total of 568 redundant transitions.
[2024-05-29 22:20:14] [INFO ] Flatten gal took : 46 ms
[2024-05-29 22:20:14] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2024-05-29 22:20:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 24 ms.
[2024-05-29 22:20:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8767827659083910967.gal : 12 ms
[2024-05-29 22:20:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12075898972404873997.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/ReachabilityCardinality8767827659083910967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12075898972404873997.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-29 22:20:14] [INFO ] Computation of Completed DNA matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 22:20:14] [INFO ] Built C files in 414ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1886777477649682967
Running compilation step : cd /tmp/ltsmin1886777477649682967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality12075898972404873997.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :3 after 5
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :5 after 7290
Compilation finished in 3297 ms.
Running link step : cd /tmp/ltsmin1886777477649682967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202400==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202408==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202413==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202413==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202400==true'
ITS-tools command line returned an error code 137
[2024-05-29 22:42:52] [INFO ] Applying decomposition
[2024-05-29 22:42:52] [INFO ] Flatten gal took : 105 ms
[2024-05-29 22:42:52] [INFO ] Decomposing Gal with order
[2024-05-29 22:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:42:53] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-29 22:42:53] [INFO ] Flatten gal took : 147 ms
[2024-05-29 22:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 113 ms.
[2024-05-29 22:42:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7693688713522236961.gal : 20 ms
[2024-05-29 22:42:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13417757737312645602.prop : 8 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/ReachabilityCardinality7693688713522236961.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13417757737312645602.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/ReachabilityCardinality13417757737312645602.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 6
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :6 after 6
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :6 after 10
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :10 after 30
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :4.58582e+09 after 7.26649e+25
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin1886777477649682967;'/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' 'ShieldPPPtPT040BReachabilityCardinality202403==true'
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2024-05-29 23:06:23] [INFO ] Flatten gal took : 75 ms
[2024-05-29 23:06:23] [INFO ] Input system was already deterministic with 872 transitions.
[2024-05-29 23:06:23] [INFO ] Transformed 1034 places.
[2024-05-29 23:06:23] [INFO ] Transformed 872 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 23:06:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12314937562796606908.gal : 17 ms
[2024-05-29 23:06:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13933004781310632895.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/ReachabilityCardinality12314937562796606908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13933004781310632895.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...375
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality13933004781310632895.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 60
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :60 after 90
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :90 after 810
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :810 after 150260
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :150260 after 152074
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :152074 after 166241
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :166241 after 209605
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :209605 after 218410
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :218410 after 305939
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :305939 after 644270
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :644270 after 1.22298e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.22298e+06 after 2.30043e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.30043e+06 after 2.60649e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.60649e+07 after 3.93484e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.93484e+07 after 1.26952e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.26952e+08 after 2.17879e+09
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.17879e+09 after 8.05244e+11

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-040B"
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-040B, 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-171683761600670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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