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.r576-smll-171734920200174.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 MedleyA-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 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 MedleyA-PT-22-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717399778842

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-03 07:29:41] [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-06-03 07:29:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 07:29:41] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-06-03 07:29:41] [INFO ] Transformed 307 places.
[2024-06-03 07:29:41] [INFO ] Transformed 740 transitions.
[2024-06-03 07:29:41] [INFO ] Found NUPN structural information;
[2024-06-03 07:29:41] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 07:29:43] [INFO ] Flatten gal took : 432 ms
RANDOM walk for 40000 steps (1162 resets) in 4273 ms. (9 steps per ms) remains 9/11 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 07:29:43] [INFO ] Flatten gal took : 166 ms
[2024-06-03 07:29:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7338870049003273990.gal : 108 ms
[2024-06-03 07:29:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality152215543136103002.prop : 15 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/ReachabilityCardinality7338870049003273990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality152215543136103002.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (252 resets) in 1113 ms. (35 steps per ms) remains 9/9 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 ...327
BEST_FIRST walk for 40004 steps (237 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality152215543136103002.prop.
BEST_FIRST walk for 40002 steps (237 resets) in 951 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (265 resets) in 272 ms. (146 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 47
BEST_FIRST walk for 40004 steps (237 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :47 after 403
BEST_FIRST walk for 40003 steps (234 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (276 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :403 after 1607
BEST_FIRST walk for 40003 steps (242 resets) in 165 ms. (240 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (248 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1607 after 52703
// Phase 1: matrix 740 rows 307 cols
[2024-06-03 07:29:44] [INFO ] Computed 24 invariants in 32 ms
Reachability property MedleyA-PT-22-ReachabilityCardinality-2024-10 is true.
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :52703 after 54502
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :54502 after 57198
Reachability property MedleyA-PT-22-ReachabilityCardinality-2024-13 is true.
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :57198 after 77178
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :77178 after 87260
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 106/235 variables, 10/139 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 106/245 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 2048
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/245 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD size :87260 after 134099
At refinement iteration 5 (OVERLAPS) 72/307 variables, 14/259 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 72/331 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 740/1047 variables, 307/638 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :134099 after 358755
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/638 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 638 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1719 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 113/232 variables, 10/129 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 113/242 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-03 07:29:47] [INFO ] Deduced a trap composed of 46 places in 320 ms of which 42 ms to minimize.
[2024-06-03 07:29:47] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/244 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-03 07:29:47] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-06-03 07:29:47] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 3 ms to minimize.
[2024-06-03 07:29:48] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/247 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/247 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 75/307 variables, 14/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 75/336 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-03 07:29:48] [INFO ] Deduced a trap composed of 71 places in 294 ms of which 3 ms to minimize.
[2024-06-03 07:29:48] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 3 ms to minimize.
[2024-06-03 07:29:49] [INFO ] Deduced a trap composed of 78 places in 294 ms of which 13 ms to minimize.
[2024-06-03 07:29:49] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-06-03 07:29:49] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 3 ms to minimize.
[2024-06-03 07:29:49] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 2 ms to minimize.
[2024-06-03 07:29:50] [INFO ] Deduced a trap composed of 81 places in 247 ms of which 3 ms to minimize.
Invariant property MedleyA-PT-22-ReachabilityCardinality-2024-08 does not hold.
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-06-03 07:29:50] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 3 ms to minimize.
[2024-06-03 07:29:50] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 3 ms to minimize.
[2024-06-03 07:29:50] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 3 ms to minimize.
[2024-06-03 07:29:51] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 3 ms to minimize.
[2024-06-03 07:29:51] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-03 07:29:51] [INFO ] Deduced a trap composed of 70 places in 245 ms of which 2 ms to minimize.
SMT process timed out in 7105ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 305 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 305 transition count 728
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 35 place count 294 transition count 717
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 45 place count 285 transition count 716
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 45 place count 285 transition count 712
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 53 place count 281 transition count 712
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 96 place count 238 transition count 662
Iterating global reduction 3 with 43 rules applied. Total rules applied 139 place count 238 transition count 662
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 238 transition count 660
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 236 transition count 654
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 236 transition count 654
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 235 transition count 652
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 235 transition count 652
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 4 with 26 rules applied. Total rules applied 173 place count 222 transition count 639
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 221 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 221 transition count 638
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 179 place count 219 transition count 657
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 197 place count 219 transition count 639
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 218 transition count 638
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 204 place count 218 transition count 633
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 209 place count 213 transition count 633
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 215 place count 213 transition count 631
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 221 place count 207 transition count 631
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 232 place count 207 transition count 631
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 207 transition count 630
Applied a total of 233 rules in 326 ms. Remains 207 /307 variables (removed 100) and now considering 630/740 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 207/307 places, 630/740 transitions.
RANDOM walk for 40000 steps (1461 resets) in 830 ms. (48 steps per ms) remains 4/5 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (301 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (310 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (351 resets) in 149 ms. (266 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (313 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
[2024-06-03 07:29:52] [INFO ] Flow matrix only has 618 transitions (discarded 12 similar events)
// Phase 1: matrix 618 rows 207 cols
[2024-06-03 07:29:52] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 07:29:52] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/144 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/196 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5/201 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 615/816 variables, 201/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 171/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/824 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/824 variables, 18/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/824 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/825 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/825 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/825 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 419 constraints, problems are : Problem set: 0 solved, 3 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 207/207 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/144 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/196 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 07:29:53] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 2 ms to minimize.
[2024-06-03 07:29:53] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 2 ms to minimize.
[2024-06-03 07:29:54] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-03 07:29:55] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-06-03 07:29:55] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-06-03 07:29:55] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-06-03 07:29:55] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 3 ms to minimize.
[2024-06-03 07:29:55] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-03 07:29:56] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2024-06-03 07:29:56] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 07:29:56] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-03 07:29:56] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 2 ms to minimize.
[2024-06-03 07:29:56] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2024-06-03 07:29:56] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 2 ms to minimize.
[2024-06-03 07:29:57] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
Reachability property MedleyA-PT-22-ReachabilityCardinality-2024-03 is true.
[2024-06-03 07:29:57] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/201 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 615/816 variables, 201/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/816 variables, 171/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 07:29:57] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-06-03 07:29:58] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/816 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/824 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/824 variables, 18/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Invariant property MedleyA-PT-22-ReachabilityCardinality-2024-00 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :358755 after 978097
At refinement iteration 15 (INCLUDED_ONLY) 0/824 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/824 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/825 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/825 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/825 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 446 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6520 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 207/207 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 7382ms problems are : Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :978097 after 1.56743e+06
Parikh walk visited 0 properties in 2828 ms.
Support contains 78 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 630/630 transitions.
Graph (complete) has 911 edges and 207 vertex of which 204 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 204 transition count 624
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 200 transition count 621
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 197 transition count 621
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 197 transition count 620
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 17 place count 196 transition count 620
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 20 place count 193 transition count 614
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 193 transition count 614
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 33 place count 188 transition count 609
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 187 transition count 608
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 187 transition count 608
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 185 transition count 616
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 185 transition count 613
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 45 place count 182 transition count 613
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 50 place count 182 transition count 682
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 56 place count 177 transition count 681
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 177 transition count 680
Applied a total of 57 rules in 139 ms. Remains 177 /207 variables (removed 30) and now considering 680/630 (removed -50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 177/207 places, 680/630 transitions.
RANDOM walk for 40000 steps (1669 resets) in 334 ms. (119 steps per ms) remains 2/3 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (363 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (371 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
[2024-06-03 07:30:03] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 177 cols
[2024-06-03 07:30:03] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 07:30:03] [INFO ] State equation strengthened by 199 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/171 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/175 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 668/843 variables, 175/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 199/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/845 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/845 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/845 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 845/845 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 177/177 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/171 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 07:30:03] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2024-06-03 07:30:04] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-06-03 07:30:04] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 2 ms to minimize.
[2024-06-03 07:30:04] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 2 ms to minimize.
[2024-06-03 07:30:04] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 2 ms to minimize.
[2024-06-03 07:30:04] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
[2024-06-03 07:30:04] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.56743e+06 after 2.03038e+07
[2024-06-03 07:30:05] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 3 ms to minimize.
[2024-06-03 07:30:05] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 4 ms to minimize.
[2024-06-03 07:30:05] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-03 07:30:05] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-03 07:30:05] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 07:30:05] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/175 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 668/843 variables, 175/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/843 variables, 199/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/843 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/845 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/845 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/845 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/845 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 845/845 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3844 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 177/177 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 4394ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 375 ms.
Support contains 56 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 680/680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 177 transition count 676
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 173 transition count 675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 172 transition count 675
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 18 place count 164 transition count 657
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 164 transition count 657
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 163 transition count 643
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 163 transition count 643
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 40 place count 157 transition count 637
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 156 transition count 623
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 156 transition count 623
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 156 transition count 622
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 156 transition count 619
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 153 transition count 619
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 152 transition count 613
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 152 transition count 613
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 152 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 151 transition count 613
Applied a total of 53 rules in 90 ms. Remains 151 /177 variables (removed 26) and now considering 613/680 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 151/177 places, 613/680 transitions.
RANDOM walk for 40000 steps (2132 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (473 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (472 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 417174 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 2
Probabilistic random walk after 417174 steps, saw 83698 distinct states, run finished after 3007 ms. (steps per millisecond=138 ) properties seen :0
[2024-06-03 07:30:11] [INFO ] Flow matrix only has 577 transitions (discarded 36 similar events)
// Phase 1: matrix 577 rows 151 cols
[2024-06-03 07:30:11] [INFO ] Computed 23 invariants in 7 ms
[2024-06-03 07:30:11] [INFO ] State equation strengthened by 193 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/103 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/147 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/149 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 577/726 variables, 149/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 193/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/728 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/728 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/728 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 151/151 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/103 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 44/147 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 07:30:11] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 13 ms to minimize.
[2024-06-03 07:30:12] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 2 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :2.03038e+07 after 3.15515e+07
[2024-06-03 07:30:12] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 2 ms to minimize.
[2024-06-03 07:30:12] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 2 ms to minimize.
[2024-06-03 07:30:12] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 2 ms to minimize.
[2024-06-03 07:30:13] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 2 ms to minimize.
[2024-06-03 07:30:13] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-06-03 07:30:13] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/149 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 577/726 variables, 149/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 193/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/728 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-03 07:30:14] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 2 ms to minimize.
[2024-06-03 07:30:15] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/728 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/728 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/728 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3907 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 151/151 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 4396ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 660 ms.
Support contains 56 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 613/613 transitions.
Applied a total of 0 rules in 19 ms. Remains 151 /151 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 151/151 places, 613/613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 613/613 transitions.
Applied a total of 0 rules in 13 ms. Remains 151 /151 variables (removed 0) and now considering 613/613 (removed 0) transitions.
[2024-06-03 07:30:16] [INFO ] Flow matrix only has 577 transitions (discarded 36 similar events)
[2024-06-03 07:30:16] [INFO ] Invariant cache hit.
[2024-06-03 07:30:16] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-03 07:30:16] [INFO ] Flow matrix only has 577 transitions (discarded 36 similar events)
[2024-06-03 07:30:16] [INFO ] Invariant cache hit.
[2024-06-03 07:30:16] [INFO ] State equation strengthened by 193 read => feed constraints.
[2024-06-03 07:30:17] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2024-06-03 07:30:17] [INFO ] Redundant transitions in 46 ms returned []
Running 612 sub problems to find dead transitions.
[2024-06-03 07:30:17] [INFO ] Flow matrix only has 577 transitions (discarded 36 similar events)
[2024-06-03 07:30:17] [INFO ] Invariant cache hit.
[2024-06-03 07:30:17] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/150 variables, 9/23 constraints. Problems are: Problem set: 144 solved, 468 unsolved
[2024-06-03 07:30:25] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-06-03 07:30:25] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-06-03 07:30:25] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-06-03 07:30:26] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-06-03 07:30:26] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-06-03 07:30:26] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2024-06-03 07:30:26] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-06-03 07:30:26] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-03 07:30:27] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-03 07:30:27] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-03 07:30:28] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-03 07:30:28] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
[2024-06-03 07:30:29] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-06-03 07:30:29] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
Problem TDEAD493 is UNSAT
Problem TDEAD496 is UNSAT
[2024-06-03 07:30:29] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
[2024-06-03 07:30:29] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD533 is UNSAT
[2024-06-03 07:30:30] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2024-06-03 07:30:30] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
Problem TDEAD589 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 18/41 constraints. Problems are: Problem set: 176 solved, 436 unsolved
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :3.15515e+07 after 1.58995e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/41 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 5 (OVERLAPS) 577/727 variables, 150/191 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/727 variables, 193/384 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 0/384 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 8 (OVERLAPS) 1/728 variables, 1/385 constraints. Problems are: Problem set: 176 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/728 variables, and 385 constraints, problems are : Problem set: 176 solved, 436 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 151/151 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 176 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 14/14 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/14 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 9/23 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 18/41 constraints. Problems are: Problem set: 176 solved, 436 unsolved
[2024-06-03 07:30:52] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-03 07:30:54] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/43 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/43 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 6 (OVERLAPS) 577/727 variables, 150/193 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/727 variables, 193/386 constraints. Problems are: Problem set: 176 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/727 variables, 435/821 constraints. Problems are: Problem set: 176 solved, 436 unsolved
[2024-06-03 07:31:12] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-06-03 07:31:12] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-06-03 07:31:13] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-06-03 07:31:13] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2024-06-03 07:31:13] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 131072
[2024-06-03 07:31:13] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
SDD size :1.58995e+08 after 4.29335e+08
[2024-06-03 07:31:14] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-06-03 07:31:14] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
[2024-06-03 07:31:14] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2024-06-03 07:31:14] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 727/728 variables, and 831 constraints, problems are : Problem set: 176 solved, 436 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/151 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 435/612 constraints, Known Traps: 30/30 constraints]
After SMT, in 62869ms problems are : Problem set: 176 solved, 436 unsolved
Search for dead transitions found 176 dead transitions in 62884ms
Found 176 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 176 transitions
Dead transitions reduction (with SMT) removed 176 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 437/613 transitions.
Applied a total of 0 rules in 12 ms. Remains 151 /151 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2024-06-03 07:31:20] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63834 ms. Remains : 151/151 places, 437/613 transitions.
RANDOM walk for 40000 steps (2150 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (470 resets) in 144 ms. (275 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (481 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
// Phase 1: matrix 437 rows 151 cols
[2024-06-03 07:31:20] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 07:31:20] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/93 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/145 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/147 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 435/582 variables, 147/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 89/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/587 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/588 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/588 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 151/151 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/93 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/145 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 07:31:20] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-06-03 07:31:21] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2024-06-03 07:31:21] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/147 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 435/582 variables, 147/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 89/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/587 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/588 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/588 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 588/588 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 151/151 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 33 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 437/437 transitions.
Graph (complete) has 760 edges and 151 vertex of which 149 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) 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 0 with 1 rules applied. Total rules applied 2 place count 149 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 148 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 148 transition count 433
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 146 transition count 433
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 11 place count 142 transition count 428
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 142 transition count 428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 141 transition count 422
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 141 transition count 422
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 36 place count 131 transition count 413
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 128 transition count 430
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 126 transition count 409
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 126 transition count 409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 125 transition count 405
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 125 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 64 place count 125 transition count 389
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 125 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 123 transition count 387
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 123 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 122 transition count 446
Applied a total of 70 rules in 109 ms. Remains 122 /151 variables (removed 29) and now considering 446/437 (removed -9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 122/151 places, 446/437 transitions.
RANDOM walk for 40000 steps (3248 resets) in 292 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (790 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 942403 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :0 out of 1
Probabilistic random walk after 942403 steps, saw 198351 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
// Phase 1: matrix 446 rows 122 cols
[2024-06-03 07:31:25] [INFO ] Computed 22 invariants in 6 ms
[2024-06-03 07:31:25] [INFO ] State equation strengthened by 191 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/121 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 446/567 variables, 121/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 191/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/568 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/568 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/84 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/121 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 446/567 variables, 121/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 191/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/568 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 07:31:26] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/568 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 122/122 constraints, ReadFeed: 191/191 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 33 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 446/446 transitions.
Applied a total of 0 rules in 12 ms. Remains 122 /122 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 122/122 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 446/446 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-06-03 07:31:26] [INFO ] Invariant cache hit.
[2024-06-03 07:31:26] [INFO ] Implicit Places using invariants in 150 ms returned [47, 79]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/122 places, 446/446 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 172 ms. Remains : 120/122 places, 446/446 transitions.
RANDOM walk for 40000 steps (3222 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (806 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1034496 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1034496 steps, saw 218009 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
// Phase 1: matrix 446 rows 120 cols
[2024-06-03 07:31:29] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 07:31:29] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/106 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/119 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 446/565 variables, 119/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 189/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/566 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/106 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 07:31:30] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/110 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/119 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 446/565 variables, 119/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 189/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/566 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/566 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1026ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 33 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 446/446 transitions.
Applied a total of 0 rules in 14 ms. Remains 120 /120 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 120/120 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 446/446 transitions.
Applied a total of 0 rules in 14 ms. Remains 120 /120 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-06-03 07:31:30] [INFO ] Invariant cache hit.
[2024-06-03 07:31:31] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-03 07:31:31] [INFO ] Invariant cache hit.
[2024-06-03 07:31:31] [INFO ] State equation strengthened by 189 read => feed constraints.
[2024-06-03 07:31:31] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-06-03 07:31:31] [INFO ] Redundant transitions in 7 ms returned []
Running 445 sub problems to find dead transitions.
[2024-06-03 07:31:31] [INFO ] Invariant cache hit.
[2024-06-03 07:31:31] [INFO ] State equation strengthened by 189 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-03 07:31:36] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-06-03 07:31:36] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-03 07:31:36] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-03 07:31:37] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-03 07:31:37] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-03 07:31:38] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-03 07:31:38] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-03 07:31:38] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 446/566 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 189/337 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 8 (OVERLAPS) 0/566 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 337 constraints, problems are : Problem set: 0 solved, 445 unsolved in 23689 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 446/566 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 189/337 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 445/782 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-06-03 07:32:22] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 3 ms to minimize.
[2024-06-03 07:32:22] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-06-03 07:32:22] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
[2024-06-03 07:32:22] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-06-03 07:32:22] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 2 ms to minimize.
[2024-06-03 07:32:23] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 788 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 14/14 constraints]
After SMT, in 54994ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 55010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55739 ms. Remains : 120/120 places, 446/446 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 588 edges and 120 vertex of which 115 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 115 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 115 transition count 428
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 115 transition count 480
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 111 transition count 480
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 111 transition count 479
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 111 transition count 479
Applied a total of 36 rules in 41 ms. Remains 111 /120 variables (removed 9) and now considering 479/446 (removed -33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 479 rows 111 cols
[2024-06-03 07:32:26] [INFO ] Computed 16 invariants in 19 ms
[2024-06-03 07:32:26] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 07:32:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-03 07:32:26] [INFO ] [Nat]Absence check using 7 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-03 07:32:27] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 07:32:27] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 07:32:27] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-03 07:32:27] [INFO ] Flatten gal took : 58 ms
[2024-06-03 07:32:27] [INFO ] Flatten gal took : 57 ms
[2024-06-03 07:32:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3130148047815535356.gal : 7 ms
[2024-06-03 07:32:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10240737543160125445.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/ReachabilityCardinality3130148047815535356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10240737543160125445.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/ReachabilityCardinality10240737543160125445.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 35
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :35 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 1335
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1335 after 7372
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7372 after 39690
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :39690 after 339450
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :339450 after 1.0873e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.0873e+06 after 9.14229e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.14229e+06 after 2.66401e+07
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :4.29335e+08 after 1.2383e+09
Detected timeout of ITS tools.
[2024-06-03 07:32:42] [INFO ] Flatten gal took : 65 ms
[2024-06-03 07:32:42] [INFO ] Applying decomposition
[2024-06-03 07:32:42] [INFO ] Flatten gal took : 49 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/graph10832833174796986505.txt' '-o' '/tmp/graph10832833174796986505.bin' '-w' '/tmp/graph10832833174796986505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10832833174796986505.bin' '-l' '-1' '-v' '-w' '/tmp/graph10832833174796986505.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:32:42] [INFO ] Decomposing Gal with order
[2024-06-03 07:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:32:43] [INFO ] Removed a total of 586 redundant transitions.
[2024-06-03 07:32:43] [INFO ] Flatten gal took : 207 ms
[2024-06-03 07:32:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 16 ms.
[2024-06-03 07:32:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7370731699796932744.gal : 11 ms
[2024-06-03 07:32:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8418816451222974585.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/ReachabilityCardinality7370731699796932744.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8418816451222974585.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8418816451222974585.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 46
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :46 after 514
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :514 after 2332
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2332 after 15106
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15106 after 230082
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :230082 after 1.24751e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.24751e+06 after 3.56168e+06
Invariant property MedleyA-PT-22-ReachabilityCardinality-2024-06 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.4035e+07,0.900306,19384,1511,953,22252,11221,519,55984,393,50136,0
Total reachable state count : 84034984

Verifying 1 reachability properties.
Invariant property MedleyA-PT-22-ReachabilityCardinality-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-22-ReachabilityCardinality-2024-06,132420,1.05545,19644,126,215,22252,11221,683,55984,428,50136,0
Over-approximation ignoring read arcs solved 0 properties in 17811 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 07:32:44] [INFO ] Flatten gal took : 43 ms
[2024-06-03 07:32:44] [INFO ] Applying decomposition
[2024-06-03 07:32:44] [INFO ] Flatten gal took : 42 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/graph10183667240703292260.txt' '-o' '/tmp/graph10183667240703292260.bin' '-w' '/tmp/graph10183667240703292260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10183667240703292260.bin' '-l' '-1' '-v' '-w' '/tmp/graph10183667240703292260.weights' '-q' '0' '-e' '0.001'
[2024-06-03 07:32:44] [INFO ] Decomposing Gal with order
[2024-06-03 07:32:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 07:32:45] [INFO ] Removed a total of 1661 redundant transitions.
[2024-06-03 07:32:45] [INFO ] Flatten gal took : 117 ms
[2024-06-03 07:32:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 30 ms.
[2024-06-03 07:32:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9936949765723000016.gal : 11 ms
[2024-06-03 07:32:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6081725346002497089.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/ReachabilityCardinality9936949765723000016.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6081725346002497089.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6081725346002497089.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 76
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :76 after 484
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :484 after 12124
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12124 after 30212
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :30212 after 674934
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5.88284e+07 after 5.26482e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.13142e+09 after 2.85253e+10
Invariant property MedleyA-PT-22-ReachabilityCardinality-2024-06 does not hold.
FORMULA MedleyA-PT-22-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.52476e+11,206.995,2636972,56039,3872,3.07769e+06,22898,898,1.95394e+07,261,311466,0
Total reachable state count : 152475552458

Verifying 1 reachability properties.
Invariant property MedleyA-PT-22-ReachabilityCardinality-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-22-ReachabilityCardinality-2024-06,2.22979e+07,234.977,2636972,1541,407,3.07769e+06,22898,1059,1.95394e+07,291,311466,0
All properties solved without resorting to model-checking.
Total runtime 419201 ms.

BK_STOP 1717400200603

--------------------
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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r576-smll-171734920200174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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