Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r448-tajo-167905989800208.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ShieldRVt-PT-050B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905989800208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 614K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679476843772

Running Version 202205111006
[2023-03-22 09:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-22 09:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:20:45] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-22 09:20:45] [INFO ] Transformed 2503 places.
[2023-03-22 09:20:45] [INFO ] Transformed 2503 transitions.
[2023-03-22 09:20:45] [INFO ] Found NUPN structural information;
[2023-03-22 09:20:45] [INFO ] Parsed PT model containing 2503 places and 2503 transitions in 304 ms.
Structural test allowed to assert that 1001 places are NOT stable. Took 18 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1640 ms. (steps per millisecond=6 ) properties (out of 1502) seen :354
Running SMT prover for 1148 properties.
// Phase 1: matrix 2503 rows 2503 cols
[2023-03-22 09:20:47] [INFO ] Computed 201 place invariants in 28 ms
[2023-03-22 09:21:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:21:12] [INFO ] After 25100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1148 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1148 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 494 place count 2503 transition count 2009
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 496 rules applied. Total rules applied 990 place count 2009 transition count 2007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 991 place count 2008 transition count 2007
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 991 place count 2008 transition count 1957
Deduced a syphon composed of 50 places in 10 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1091 place count 1958 transition count 1957
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 1169 place count 1880 transition count 1879
Iterating global reduction 3 with 78 rules applied. Total rules applied 1247 place count 1880 transition count 1879
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1247 place count 1880 transition count 1848
Deduced a syphon composed of 31 places in 17 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 1309 place count 1849 transition count 1848
Performed 413 Post agglomeration using F-continuation condition.Transition count delta: 413
Deduced a syphon composed of 413 places in 8 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 826 rules applied. Total rules applied 2135 place count 1436 transition count 1435
Renaming transitions due to excessive name length > 1024 char.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 32 places in 8 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 2199 place count 1404 transition count 1464
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2200 place count 1404 transition count 1463
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 2205 place count 1404 transition count 1458
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2210 place count 1399 transition count 1458
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2212 place count 1399 transition count 1456
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2214 place count 1399 transition count 1456
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2216 place count 1399 transition count 1454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2217 place count 1398 transition count 1453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2218 place count 1397 transition count 1453
Applied a total of 2218 rules in 892 ms. Remains 1397 /2503 variables (removed 1106) and now considering 1453/2503 (removed 1050) transitions.
Finished structural reductions, in 1 iterations. Remains : 1397/2503 places, 1453/2503 transitions.
Interrupted random walk after 304785 steps, including 75 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 497
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 651) seen :0
Running SMT prover for 651 properties.
// Phase 1: matrix 1453 rows 1397 cols
[2023-03-22 09:21:44] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-22 09:21:58] [INFO ] After 13542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:651
[2023-03-22 09:22:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-22 09:22:46] [INFO ] After 28937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :651
[2023-03-22 09:23:12] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 7 ms to minimize.
[2023-03-22 09:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-22 09:23:13] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2023-03-22 09:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-22 09:23:23] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-22 09:23:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-22 09:23:30] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 5 ms to minimize.
[2023-03-22 09:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-22 09:23:39] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 09:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-22 09:23:44] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2023-03-22 09:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-22 09:23:49] [INFO ] After 91766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :651
Attempting to minimize the solution found.
Minimization took 39234 ms.
[2023-03-22 09:24:28] [INFO ] After 150098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :651
Fused 651 Parikh solutions to 643 different solutions.
Parikh walk visited 0 properties in 9024 ms.
Support contains 651 out of 1397 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1397/1397 places, 1453/1453 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 1397 transition count 1320
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 1264 transition count 1320
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 266 place count 1264 transition count 1250
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 406 place count 1194 transition count 1250
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 446 place count 1154 transition count 1210
Iterating global reduction 2 with 40 rules applied. Total rules applied 486 place count 1154 transition count 1210
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 486 place count 1154 transition count 1170
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 566 place count 1114 transition count 1170
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 6 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 754 place count 1020 transition count 1076
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 848 place count 973 transition count 1118
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 853 place count 973 transition count 1113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 858 place count 968 transition count 1113
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 862 place count 968 transition count 1109
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 864 place count 968 transition count 1109
Applied a total of 864 rules in 260 ms. Remains 968 /1397 variables (removed 429) and now considering 1109/1453 (removed 344) transitions.
Finished structural reductions, in 1 iterations. Remains : 968/1397 places, 1109/1453 transitions.
Interrupted random walk after 368752 steps, including 98 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 450) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 450) seen :0
Running SMT prover for 450 properties.
// Phase 1: matrix 1109 rows 968 cols
[2023-03-22 09:25:13] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:25:19] [INFO ] After 5906ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:450
[2023-03-22 09:25:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2023-03-22 09:25:37] [INFO ] After 10630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :450
[2023-03-22 09:25:38] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2023-03-22 09:25:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-22 09:25:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2023-03-22 09:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-22 09:25:56] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2023-03-22 09:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-22 09:25:58] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-22 09:25:58] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2023-03-22 09:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-22 09:26:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2023-03-22 09:26:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-22 09:26:10] [INFO ] After 42823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :450
Attempting to minimize the solution found.
Minimization took 18401 ms.
[2023-03-22 09:26:28] [INFO ] After 69483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :450
Fused 450 Parikh solutions to 440 different solutions.
Parikh walk visited 55 properties in 23568 ms.
Support contains 395 out of 968 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 968/968 places, 1109/1109 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 968 transition count 1043
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 902 transition count 1043
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 132 place count 902 transition count 1008
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 202 place count 867 transition count 1008
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 219 place count 850 transition count 991
Iterating global reduction 2 with 17 rules applied. Total rules applied 236 place count 850 transition count 991
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 236 place count 850 transition count 974
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 270 place count 833 transition count 974
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 390 place count 773 transition count 914
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 432 place count 752 transition count 930
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 752 transition count 929
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 440 place count 752 transition count 922
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 447 place count 745 transition count 922
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 745 transition count 921
Applied a total of 448 rules in 81 ms. Remains 745 /968 variables (removed 223) and now considering 921/1109 (removed 188) transitions.
Finished structural reductions, in 1 iterations. Remains : 745/968 places, 921/1109 transitions.
Interrupted random walk after 511080 steps, including 133 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 395) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 395) seen :0
Interrupted probabilistic random walk after 2055950 steps, run timeout after 102001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 2055950 steps, saw 1468220 distinct states, run finished after 102003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 395 properties.
// Phase 1: matrix 921 rows 745 cols
[2023-03-22 09:29:08] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:29:12] [INFO ] After 3764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:395
[2023-03-22 09:29:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:29:26] [INFO ] After 7734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :395
[2023-03-22 09:29:35] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 09:29:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-22 09:29:40] [INFO ] After 21434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :395
Attempting to minimize the solution found.
Minimization took 9845 ms.
[2023-03-22 09:29:50] [INFO ] After 38345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :395
Fused 395 Parikh solutions to 386 different solutions.
Parikh walk visited 6 properties in 28999 ms.
Support contains 389 out of 745 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 745/745 places, 921/921 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 745 transition count 919
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 743 transition count 919
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 740 transition count 916
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 739 transition count 918
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 739 transition count 916
Applied a total of 14 rules in 40 ms. Remains 739 /745 variables (removed 6) and now considering 916/921 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 739/745 places, 916/921 transitions.
Interrupted random walk after 497123 steps, including 120 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 389) seen :0
Interrupted probabilistic random walk after 2176627 steps, run timeout after 102001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 2176627 steps, saw 1555436 distinct states, run finished after 102002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 389 properties.
// Phase 1: matrix 916 rows 739 cols
[2023-03-22 09:32:36] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:32:40] [INFO ] After 4261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:389
[2023-03-22 09:32:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:33:00] [INFO ] After 12035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :389
[2023-03-22 09:33:14] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2023-03-22 09:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-22 09:33:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-22 09:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-22 09:33:19] [INFO ] After 30799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :389
Attempting to minimize the solution found.
Minimization took 7825 ms.
[2023-03-22 09:33:27] [INFO ] After 46942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :389
Fused 389 Parikh solutions to 377 different solutions.
Parikh walk visited 2 properties in 19841 ms.
Support contains 387 out of 739 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 739/739 places, 916/916 transitions.
Drop transitions 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 1 place count 739 transition count 915
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 738 transition count 915
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 737 transition count 917
Applied a total of 4 rules in 28 ms. Remains 737 /739 variables (removed 2) and now considering 917/916 (removed -1) transitions.
Finished structural reductions, in 1 iterations. Remains : 737/739 places, 917/916 transitions.
Interrupted random walk after 516990 steps, including 144 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Interrupted probabilistic random walk after 2216526 steps, run timeout after 102001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 2216526 steps, saw 1582977 distinct states, run finished after 102001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 387 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:36:03] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:36:06] [INFO ] After 3474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2023-03-22 09:36:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 22 ms returned sat
[2023-03-22 09:36:19] [INFO ] After 6829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2023-03-22 09:36:19] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2023-03-22 09:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-22 09:36:29] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-22 09:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-22 09:36:29] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2023-03-22 09:36:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-22 09:36:31] [INFO ] After 18494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 6888 ms.
[2023-03-22 09:36:38] [INFO ] After 31324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Fused 387 Parikh solutions to 377 different solutions.
Parikh walk visited 0 properties in 25820 ms.
Support contains 387 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Applied a total of 0 rules in 13 ms. Remains 737 /737 variables (removed 0) and now considering 917/917 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 737/737 places, 917/917 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Applied a total of 0 rules in 9 ms. Remains 737 /737 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:37:04] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:37:04] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:37:04] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:37:04] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-22 09:37:04] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:37:04] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-22 09:37:05] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 737/737 places, 917/917 transitions.
Incomplete random walk after 100000 steps, including 20 resets, run finished after 6334 ms. (steps per millisecond=15 ) properties (out of 387) seen :0
Running SMT prover for 387 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:37:11] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:37:15] [INFO ] After 3881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2023-03-22 09:37:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:37:35] [INFO ] After 11791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2023-03-22 09:37:35] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2023-03-22 09:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-22 09:37:53] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 09:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-22 09:37:54] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-22 09:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-22 09:37:57] [INFO ] After 33627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 11359 ms.
[2023-03-22 09:38:08] [INFO ] After 52967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Interrupted random walk after 453706 steps, including 118 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 387) seen :0
Interrupted probabilistic random walk after 2210766 steps, run timeout after 102001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 2210766 steps, saw 1578861 distinct states, run finished after 102002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 387 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:40:25] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:40:29] [INFO ] After 4218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2023-03-22 09:40:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 19 ms returned sat
[2023-03-22 09:40:41] [INFO ] After 6718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2023-03-22 09:40:41] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2023-03-22 09:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-22 09:40:57] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-22 09:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-22 09:40:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2023-03-22 09:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-22 09:40:59] [INFO ] After 25099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 8544 ms.
[2023-03-22 09:41:08] [INFO ] After 38588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Fused 387 Parikh solutions to 377 different solutions.
Parikh walk visited 0 properties in 25108 ms.
Support contains 387 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Applied a total of 0 rules in 19 ms. Remains 737 /737 variables (removed 0) and now considering 917/917 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 737/737 places, 917/917 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Applied a total of 0 rules in 10 ms. Remains 737 /737 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:41:33] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:41:33] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:41:33] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:41:34] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-22 09:41:34] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:41:34] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-22 09:41:35] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 737/737 places, 917/917 transitions.
Incomplete random walk after 100000 steps, including 22 resets, run finished after 6324 ms. (steps per millisecond=15 ) properties (out of 387) seen :0
Running SMT prover for 387 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:41:41] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:41:47] [INFO ] After 5720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2023-03-22 09:41:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:42:03] [INFO ] After 8230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2023-03-22 09:42:03] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2023-03-22 09:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-22 09:42:20] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2023-03-22 09:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-22 09:42:21] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 5 ms to minimize.
[2023-03-22 09:42:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-22 09:42:26] [INFO ] After 31446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 10270 ms.
[2023-03-22 09:42:36] [INFO ] After 49494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Incomplete random walk after 10000 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 422307 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422307 steps, saw 299478 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:42:39] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-22 09:42:40] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 58 ms returned sat
[2023-03-22 09:42:40] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:40] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 09:42:40] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 81 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 398269 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398269 steps, saw 281349 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:42:43] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:42:44] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:42:44] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:44] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 09:42:44] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:42:44] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:42:44] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:42:44] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:42:45] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2023-03-22 09:42:45] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:42:45] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:42:45] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 92 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:42:46] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:42:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:46] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-22 09:42:46] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:46] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 09:42:46] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:46] [INFO ] Flatten gal took : 94 ms
[2023-03-22 09:42:46] [INFO ] Flatten gal took : 48 ms
[2023-03-22 09:42:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality872041194524587048.gal : 24 ms
[2023-03-22 09:42:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7897845587800254859.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality872041194524587048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7897845587800254859.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality7897845587800254859.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,182,0.207426,9144,2,806,10,3845,6,0,1806,1507,0
Total reachable state count : 182

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.210847,9144,2,322,10,3845,7,0,1809,1507,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425483 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425483 steps, saw 301947 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:42:50] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-22 09:42:50] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:42:50] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:50] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-22 09:42:50] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 598 place count 438 transition count 618
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 674 place count 400 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 675 place count 400 transition count 654
Applied a total of 675 rules in 68 ms. Remains 400 /737 variables (removed 337) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449299 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449299 steps, saw 318703 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 400 cols
[2023-03-22 09:42:54] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:42:54] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:42:54] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:54] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:42:54] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 400/400 places, 654/654 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 400/400 places, 654/654 transitions.
Applied a total of 0 rules in 9 ms. Remains 400 /400 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 400 cols
[2023-03-22 09:42:54] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:42:54] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 654 rows 400 cols
[2023-03-22 09:42:54] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:42:55] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-22 09:42:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 654 rows 400 cols
[2023-03-22 09:42:55] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:42:55] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 654/654 transitions.
Graph (trivial) has 178 edges and 400 vertex of which 4 / 400 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1379 edges and 398 vertex of which 396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 394 vertex of which 4 / 394 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 392 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 390 vertex of which 6 / 390 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 387 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 384 vertex of which 8 / 384 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 380 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 376 vertex of which 8 / 376 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 372 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 368 vertex of which 8 / 368 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 364 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 360 vertex of which 8 / 360 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 356 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 352 vertex of which 8 / 352 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 348 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 344 vertex of which 6 / 344 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 341 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 338 vertex of which 6 / 338 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 335 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 331 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 330 vertex of which 2 / 330 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 329 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1132 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 322 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 320 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 320 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 320 transition count 518
Applied a total of 175 rules in 48 ms. Remains 320 /400 variables (removed 80) and now considering 518/654 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 320 cols
[2023-03-22 09:42:55] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:42:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:55] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-22 09:42:55] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:55] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 09:42:56] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:42:56] [INFO ] Flatten gal took : 48 ms
[2023-03-22 09:42:56] [INFO ] Flatten gal took : 41 ms
[2023-03-22 09:42:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5492890095578874340.gal : 6 ms
[2023-03-22 09:42:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8306595422379154421.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5492890095578874340.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8306595422379154421.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8306595422379154421.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,405,0.117784,8904,2,822,10,4015,6,0,1801,1686,0
Total reachable state count : 405

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.118728,9344,2,321,10,4015,7,0,1804,1686,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 421131 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 421131 steps, saw 298557 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:42:59] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:42:59] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:42:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:43:00] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:00] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-22 09:43:00] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 76 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440005 steps, run timeout after 3042 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 440005 steps, saw 312118 distinct states, run finished after 3042 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:43:03] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:03] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:43:03] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:03] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:43:03] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:43:03] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:04] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:43:04] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:04] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-22 09:43:04] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:43:04] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:04] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 517
Applied a total of 176 rules in 38 ms. Remains 321 /401 variables (removed 80) and now considering 517/654 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 321 cols
[2023-03-22 09:43:04] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:43:04] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:04] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2023-03-22 09:43:05] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:05] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 09:43:05] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:05] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:43:05] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:43:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6790744905080884744.gal : 2 ms
[2023-03-22 09:43:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3431003032502735232.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6790744905080884744.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3431003032502735232.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3431003032502735232.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,177,0.115866,8900,2,801,10,3826,6,0,1804,1504,0
Total reachable state count : 177

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.116865,9340,2,323,10,3826,7,0,1807,1504,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 448597 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 448597 steps, saw 318183 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:08] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:43:08] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:43:08] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:09] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 09:43:09] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 639 steps, including 29 resets, run visited all 1 properties in 5 ms. (steps per millisecond=127 )
Parikh walk visited 1 properties in 5 ms.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 441853 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 441853 steps, saw 313513 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:12] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:12] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-22 09:43:12] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:12] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:43:12] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 68 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 478239 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 478239 steps, saw 339940 distinct states, run finished after 3007 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:15] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:16] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:43:16] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:16] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:43:16] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:16] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:16] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:16] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:17] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-22 09:43:17] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:17] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:17] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 32 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:43:17] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:43:17] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:17] [INFO ] [Nat]Absence check using 160 positive place invariants in 14 ms returned sat
[2023-03-22 09:43:17] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:17] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 09:43:17] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:17] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:43:17] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:43:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18031383299677141170.gal : 2 ms
[2023-03-22 09:43:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15404354750451940998.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18031383299677141170.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15404354750451940998.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15404354750451940998.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,336,0.11453,8900,2,849,10,3877,6,0,1806,1599,0
Total reachable state count : 336

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,11,0.115461,9340,2,335,10,3877,7,0,1809,1599,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 449147 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 449147 steps, saw 318585 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:20] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:20] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:43:21] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:21] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:43:21] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 40 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486174 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486174 steps, saw 345432 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:24] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:24] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-22 09:43:24] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:24] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:43:25] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:25] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:25] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:25] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:25] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-22 09:43:25] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:43:25] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:26] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 63 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:43:26] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:43:26] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:26] [INFO ] [Nat]Absence check using 160 positive place invariants in 13 ms returned sat
[2023-03-22 09:43:26] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:26] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:43:26] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:26] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:43:26] [INFO ] Flatten gal took : 18 ms
[2023-03-22 09:43:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17611575105268066487.gal : 2 ms
[2023-03-22 09:43:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3748454542715387854.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17611575105268066487.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3748454542715387854.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3748454542715387854.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,384,0.114622,8904,2,840,10,3905,6,0,1806,1650,0
Total reachable state count : 384

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,11,0.11553,9344,2,335,10,3905,7,0,1809,1650,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440348 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440348 steps, saw 312382 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:29] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:29] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:43:30] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:30] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:43:30] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 53 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 500412 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 500412 steps, saw 355632 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:33] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:33] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-22 09:43:33] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:33] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:43:33] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:33] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:34] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:34] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-22 09:43:34] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2023-03-22 09:43:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:34] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:34] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 32 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:43:34] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:43:34] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:34] [INFO ] [Nat]Absence check using 160 positive place invariants in 14 ms returned sat
[2023-03-22 09:43:35] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:35] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 09:43:35] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:35] [INFO ] Flatten gal took : 18 ms
[2023-03-22 09:43:35] [INFO ] Flatten gal took : 24 ms
[2023-03-22 09:43:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10515290099589008233.gal : 2 ms
[2023-03-22 09:43:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11789829813760805201.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10515290099589008233.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11789829813760805201.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11789829813760805201.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,178,0.209129,8888,2,825,10,3886,6,0,1808,1481,0
Total reachable state count : 178

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.211185,9328,2,323,10,3886,7,0,1811,1481,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 462334 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 462334 steps, saw 328026 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:38] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:43:38] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:43:39] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:39] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-22 09:43:39] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 382 place count 546 transition count 691
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 69 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468485 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468485 steps, saw 332791 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:42] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:42] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-22 09:43:42] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:42] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 09:43:42] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:42] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:43] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:43] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-22 09:43:43] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:43] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 65 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:43:43] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:43:43] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:44] [INFO ] [Nat]Absence check using 160 positive place invariants in 34 ms returned sat
[2023-03-22 09:43:44] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:44] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 09:43:44] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:44] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:43:44] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:43:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3979536845338406768.gal : 2 ms
[2023-03-22 09:43:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17953778754911369938.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3979536845338406768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17953778754911369938.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17953778754911369938.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,176,0.168043,8888,2,823,10,3887,6,0,1807,1491,0
Total reachable state count : 176

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.16943,9328,2,323,10,3887,7,0,1810,1491,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 354161 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354161 steps, saw 249220 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:47] [INFO ] Computed 200 place invariants in 8 ms
[2023-03-22 09:43:47] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:43:48] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:48] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:43:48] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 85 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 462899 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 462899 steps, saw 328483 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:51] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:51] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:43:51] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:51] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:43:51] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:51] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:43:52] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:52] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:52] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-22 09:43:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:43:52] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:43:52] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 49 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:43:52] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:43:52] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:53] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2023-03-22 09:43:53] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:53] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:43:53] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:53] [INFO ] Flatten gal took : 18 ms
[2023-03-22 09:43:53] [INFO ] Flatten gal took : 16 ms
[2023-03-22 09:43:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6645145742289261602.gal : 2 ms
[2023-03-22 09:43:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17920758897032417101.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6645145742289261602.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17920758897032417101.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17920758897032417101.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,176,0.198339,8892,2,823,10,3887,6,0,1807,1491,0
Total reachable state count : 176

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.199735,9332,2,323,10,3887,7,0,1810,1491,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 450697 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450697 steps, saw 319759 distinct states, run finished after 3003 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:43:56] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:43:56] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:43:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:43:57] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:43:57] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:43:57] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 42 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437074 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437074 steps, saw 310016 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:00] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:00] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:44:00] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:00] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:44:00] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:00] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:01] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:01] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:01] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-03-22 09:44:01] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:01] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:01] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 517
Applied a total of 176 rules in 56 ms. Remains 321 /401 variables (removed 80) and now considering 517/654 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 321 cols
[2023-03-22 09:44:01] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:44:02] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:02] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-22 09:44:02] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:02] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 09:44:02] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:02] [INFO ] Flatten gal took : 40 ms
[2023-03-22 09:44:02] [INFO ] Flatten gal took : 32 ms
[2023-03-22 09:44:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2509253091622850876.gal : 3 ms
[2023-03-22 09:44:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7607092929496990053.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2509253091622850876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7607092929496990053.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7607092929496990053.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,174,0.211991,8900,2,812,10,3871,6,0,1804,1533,0
Total reachable state count : 174

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.213376,9340,2,322,10,3871,7,0,1807,1533,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 422619 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422619 steps, saw 299727 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:44:05] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:44:05] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:44:06] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:06] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:44:06] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 594 place count 440 transition count 620
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 670 place count 402 transition count 657
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 656
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 401 transition count 654
Applied a total of 674 rules in 55 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 489997 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 489997 steps, saw 348355 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:09] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:09] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-22 09:44:09] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:09] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:44:09] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:09] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:10] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:10] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:10] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-22 09:44:10] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:44:10] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:10] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 177 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 518
Applied a total of 175 rules in 93 ms. Remains 321 /401 variables (removed 80) and now considering 518/654 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 321 cols
[2023-03-22 09:44:11] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:44:11] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:11] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-22 09:44:11] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:11] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:44:11] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:11] [INFO ] Flatten gal took : 15 ms
[2023-03-22 09:44:11] [INFO ] Flatten gal took : 15 ms
[2023-03-22 09:44:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4657155982196438910.gal : 2 ms
[2023-03-22 09:44:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality409320498289294157.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4657155982196438910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality409320498289294157.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality409320498289294157.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,169,0.208018,8900,2,808,10,3791,6,0,1805,1421,0
Total reachable state count : 169

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.209517,9340,2,322,10,3791,7,0,1808,1421,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451363 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451363 steps, saw 320249 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:44:14] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:44:14] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 47 ms returned sat
[2023-03-22 09:44:15] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:15] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-22 09:44:15] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 59 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 492886 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 492886 steps, saw 350463 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:18] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:18] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:44:18] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:19] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:44:19] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:19] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:19] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:19] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:19] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-22 09:44:19] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:19] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:20] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 67 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:44:20] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:44:20] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:20] [INFO ] [Nat]Absence check using 160 positive place invariants in 28 ms returned sat
[2023-03-22 09:44:20] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:20] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 09:44:20] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:20] [INFO ] Flatten gal took : 44 ms
[2023-03-22 09:44:20] [INFO ] Flatten gal took : 33 ms
[2023-03-22 09:44:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16047026974136494271.gal : 3 ms
[2023-03-22 09:44:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5060365005266735121.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16047026974136494271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5060365005266735121.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5060365005266735121.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,176,0.195951,8900,2,812,10,3820,6,0,1806,1461,0
Total reachable state count : 176

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.197332,9340,2,323,10,3820,7,0,1809,1461,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 429767 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 429767 steps, saw 304987 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:44:24] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:44:24] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:44:24] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:24] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:44:24] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 41 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486695 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486695 steps, saw 345814 distinct states, run finished after 3003 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:27] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:44:27] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:44:28] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:28] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:44:28] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:28] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:28] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:28] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:29] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-22 09:44:29] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:29] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:29] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 43 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:44:29] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:44:29] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:29] [INFO ] [Nat]Absence check using 160 positive place invariants in 26 ms returned sat
[2023-03-22 09:44:29] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:29] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:44:29] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:29] [INFO ] Flatten gal took : 37 ms
[2023-03-22 09:44:29] [INFO ] Flatten gal took : 35 ms
[2023-03-22 09:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8594830674499295198.gal : 5 ms
[2023-03-22 09:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality566989983324130533.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8594830674499295198.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality566989983324130533.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality566989983324130533.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,171,0.213806,8904,2,794,10,3797,6,0,1806,1469,0
Total reachable state count : 171

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.216272,9344,2,323,10,3797,7,0,1809,1469,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 435113 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 435113 steps, saw 308701 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:44:33] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:44:33] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:44:33] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:33] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:44:33] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 594 place count 440 transition count 620
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 670 place count 402 transition count 657
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 656
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 656
Applied a total of 672 rules in 45 ms. Remains 402 /737 variables (removed 335) and now considering 656/917 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 656/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 507385 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507385 steps, saw 360662 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:36] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:36] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:44:37] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:37] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:44:37] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:37] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:37] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:37] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:38] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-22 09:44:38] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:38] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:38] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Graph (trivial) has 179 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 176 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 647
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 175 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 638
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 173 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 557
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 150 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 547
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 147 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 535
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 146 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 522
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 520
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 520
Applied a total of 175 rules in 31 ms. Remains 322 /402 variables (removed 80) and now considering 520/656 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 520 rows 322 cols
[2023-03-22 09:44:38] [INFO ] Computed 160 place invariants in 0 ms
[2023-03-22 09:44:38] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:38] [INFO ] [Nat]Absence check using 160 positive place invariants in 24 ms returned sat
[2023-03-22 09:44:38] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:38] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:44:38] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:38] [INFO ] Flatten gal took : 33 ms
[2023-03-22 09:44:38] [INFO ] Flatten gal took : 27 ms
[2023-03-22 09:44:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3624457397618173578.gal : 3 ms
[2023-03-22 09:44:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9826843674960764873.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3624457397618173578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9826843674960764873.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9826843674960764873.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,183,0.196719,8900,2,809,10,3801,6,0,1811,1429,0
Total reachable state count : 183

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.198056,9340,2,323,10,3801,7,0,1814,1429,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 365746 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365746 steps, saw 257801 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:44:42] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:44:42] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:44:42] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:42] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-22 09:44:42] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 3 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 594 place count 440 transition count 620
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 670 place count 402 transition count 657
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 656
Applied a total of 671 rules in 61 ms. Remains 402 /737 variables (removed 335) and now considering 656/917 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 656/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 495293 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 495293 steps, saw 352073 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:45] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:45] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:44:46] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:46] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:44:46] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:46] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:46] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:46] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:47] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-22 09:44:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:44:47] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:47] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 647
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 638
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 557
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 547
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 535
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 522
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 520
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 519
Applied a total of 176 rules in 38 ms. Remains 322 /402 variables (removed 80) and now considering 519/656 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 322 cols
[2023-03-22 09:44:47] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:44:47] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:47] [INFO ] [Nat]Absence check using 160 positive place invariants in 26 ms returned sat
[2023-03-22 09:44:47] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:47] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:44:47] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:47] [INFO ] Flatten gal took : 75 ms
[2023-03-22 09:44:47] [INFO ] Flatten gal took : 24 ms
[2023-03-22 09:44:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality26896080755481293.gal : 2 ms
[2023-03-22 09:44:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17733004183760148849.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality26896080755481293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17733004183760148849.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality17733004183760148849.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,183,0.212155,8900,2,809,10,3793,6,0,1810,1414,0
Total reachable state count : 183

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.213588,9340,2,323,10,3793,7,0,1813,1414,0
Incomplete random walk after 10000 steps, including 6 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386694 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386694 steps, saw 273010 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:44:51] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:44:51] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:44:51] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:51] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:44:51] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 43 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 491529 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 491529 steps, saw 349459 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:55] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:55] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:44:55] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:55] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 09:44:55] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:55] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:55] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:55] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:44:56] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-22 09:44:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:44:56] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:44:56] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 518
Applied a total of 176 rules in 67 ms. Remains 321 /401 variables (removed 80) and now considering 518/655 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 321 cols
[2023-03-22 09:44:56] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:44:56] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:44:56] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:44:56] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:56] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:44:57] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:44:57] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:44:57] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:44:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13438245949769111663.gal : 2 ms
[2023-03-22 09:44:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12738345216707707018.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13438245949769111663.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12738345216707707018.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12738345216707707018.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,171,0.211528,8904,2,794,10,3788,6,0,1805,1456,0
Total reachable state count : 171

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.212868,9344,2,323,10,3788,7,0,1808,1456,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 428837 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 428837 steps, saw 304338 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:00] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:45:00] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:45:01] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:01] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-22 09:45:01] [INFO ] After 602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 67 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 466538 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466538 steps, saw 331349 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:45:04] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:04] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:45:04] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:04] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:45:04] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:45:04] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:05] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:45:05] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:05] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2023-03-22 09:45:05] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:45:05] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:05] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 518
Applied a total of 175 rules in 56 ms. Remains 321 /401 variables (removed 80) and now considering 518/654 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 321 cols
[2023-03-22 09:45:05] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:45:05] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:05] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-22 09:45:06] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:06] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:45:06] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:06] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:45:06] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:45:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17166801126491497351.gal : 3 ms
[2023-03-22 09:45:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18244184370509574200.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17166801126491497351.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18244184370509574200.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality18244184370509574200.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,171,0.207559,8900,2,800,10,3875,6,0,1805,1562,0
Total reachable state count : 171

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.208907,9340,2,322,10,3875,7,0,1808,1562,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426824 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426824 steps, saw 302940 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:09] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:45:09] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-22 09:45:10] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 09:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-22 09:45:10] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 09:45:10] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 652
Applied a total of 673 rules in 84 ms. Remains 401 /737 variables (removed 336) and now considering 652/917 (removed 265) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 652/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 454785 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 454785 steps, saw 322756 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 652 rows 401 cols
[2023-03-22 09:45:13] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:13] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:45:13] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:14] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:45:14] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 652/652 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 652/652 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 652/652 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 652/652 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 652/652 (removed 0) transitions.
// Phase 1: matrix 652 rows 401 cols
[2023-03-22 09:45:14] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:14] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 652 rows 401 cols
[2023-03-22 09:45:14] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:14] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-03-22 09:45:14] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 652 rows 401 cols
[2023-03-22 09:45:14] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:15] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 652/652 transitions.
Graph (trivial) has 177 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 643
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 634
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 581
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 553
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 543
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 529
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 518
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 516
Applied a total of 175 rules in 48 ms. Remains 321 /401 variables (removed 80) and now considering 516/652 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 321 cols
[2023-03-22 09:45:15] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:45:15] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:15] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-22 09:45:15] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:15] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:45:15] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:15] [INFO ] Flatten gal took : 30 ms
[2023-03-22 09:45:15] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:45:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12787959597089683395.gal : 3 ms
[2023-03-22 09:45:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11198144772397216942.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12787959597089683395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11198144772397216942.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11198144772397216942.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,368,0.20952,8892,2,812,10,3870,6,0,1803,1511,0
Total reachable state count : 368

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,8,0.210936,9332,2,329,10,3870,7,0,1806,1511,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436010 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436010 steps, saw 309318 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:18] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:45:19] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:45:19] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 09:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-22 09:45:19] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 09:45:19] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 75 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468918 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468918 steps, saw 333116 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:22] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:23] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:45:23] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:23] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 09:45:23] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:23] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:23] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:23] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:24] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-22 09:45:24] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:24] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:24] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 179 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 176 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 175 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 173 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 150 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 147 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 146 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 52 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:45:24] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:45:24] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:24] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-22 09:45:25] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:25] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:45:25] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:25] [INFO ] Flatten gal took : 86 ms
[2023-03-22 09:45:25] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:45:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18324046214254961652.gal : 2 ms
[2023-03-22 09:45:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1262109250160885018.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18324046214254961652.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1262109250160885018.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1262109250160885018.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,176,0.181467,8900,2,823,10,3848,6,0,1806,1484,0
Total reachable state count : 176

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.183166,9340,2,323,10,3848,7,0,1809,1484,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 418057 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418057 steps, saw 296189 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:28] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:45:28] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:45:29] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:29] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 09:45:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-22 09:45:29] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-22 09:45:29] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 72 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 367941 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 367941 steps, saw 259343 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:32] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:32] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:45:33] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:33] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:45:33] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:33] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:33] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:33] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:34] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-22 09:45:34] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:45:34] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:34] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 179 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 176 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 175 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 173 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 150 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 147 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 146 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 51 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:45:34] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:45:34] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:34] [INFO ] [Nat]Absence check using 160 positive place invariants in 28 ms returned sat
[2023-03-22 09:45:34] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:34] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 09:45:34] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:34] [INFO ] Flatten gal took : 33 ms
[2023-03-22 09:45:35] [INFO ] Flatten gal took : 28 ms
[2023-03-22 09:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4210678508047803467.gal : 4 ms
[2023-03-22 09:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3137210501007544743.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4210678508047803467.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3137210501007544743.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3137210501007544743.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,166,0.216726,8896,2,820,10,3820,6,0,1806,1464,0
Total reachable state count : 166

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.218345,9336,2,322,10,3820,7,0,1809,1464,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440664 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440664 steps, saw 312619 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:38] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:45:38] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:45:39] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:39] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-22 09:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-22 09:45:39] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-22 09:45:39] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 135 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 430099 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430099 steps, saw 305204 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:42] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:42] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-22 09:45:42] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:42] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:45:42] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:43] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:43] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-22 09:45:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:43] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:44] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 90 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:45:44] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:45:44] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:44] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:45:44] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:44] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:45:44] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:44] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:45:44] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:45:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12327742045810996097.gal : 2 ms
[2023-03-22 09:45:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12183622841675759250.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12327742045810996097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12183622841675759250.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12183622841675759250.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,149,0.215909,8892,2,810,10,3783,6,0,1808,1432,0
Total reachable state count : 149

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.217548,9332,2,324,10,3783,7,0,1811,1432,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 418267 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418267 steps, saw 296356 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:47] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:45:48] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:45:48] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 09:45:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-22 09:45:48] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-22 09:45:48] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 382 place count 546 transition count 691
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 80 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 454125 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 454125 steps, saw 322309 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:52] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:52] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 09:45:52] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:52] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:45:52] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 20 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:52] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:52] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:52] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:45:53] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-22 09:45:53] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:45:53] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:53] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 69 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:45:53] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:45:53] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:54] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-22 09:45:54] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:54] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 09:45:54] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:54] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:45:54] [INFO ] Flatten gal took : 19 ms
[2023-03-22 09:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11346727542728606730.gal : 3 ms
[2023-03-22 09:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4617877826932842765.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11346727542728606730.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4617877826932842765.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4617877826932842765.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,149,0.213292,8888,2,810,10,3776,6,0,1808,1407,0
Total reachable state count : 149

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.214907,9328,2,324,10,3776,7,0,1811,1407,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436530 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436530 steps, saw 309661 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:45:57] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:45:57] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:45:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 09:45:58] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:45:58] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-22 09:45:58] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 82 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472394 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472394 steps, saw 335667 distinct states, run finished after 3002 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:01] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:01] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-22 09:46:01] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:02] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:46:02] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:02] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:02] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:02] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:02] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-22 09:46:02] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:02] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:03] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 64 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:46:03] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:46:03] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:03] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:46:03] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:03] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:46:03] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:03] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:46:03] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:46:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality858143140455192931.gal : 3 ms
[2023-03-22 09:46:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2148894959528068755.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality858143140455192931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2148894959528068755.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality2148894959528068755.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,149,0.204128,8884,2,810,10,3776,6,0,1808,1407,0
Total reachable state count : 149

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,2,0.205908,9324,2,324,10,3776,7,0,1811,1407,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 381728 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381728 steps, saw 269258 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:46:07] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:46:07] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:46:07] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-22 09:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-22 09:46:07] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 09:46:07] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 92 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 454333 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 454333 steps, saw 322441 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:11] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:11] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:46:11] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:11] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 09:46:11] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:11] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:12] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:12] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:12] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-22 09:46:12] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:12] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:13] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 518
Applied a total of 175 rules in 57 ms. Remains 321 /401 variables (removed 80) and now considering 518/654 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 321 cols
[2023-03-22 09:46:13] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:46:13] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:13] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:46:13] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:13] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:46:13] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:13] [INFO ] Flatten gal took : 15 ms
[2023-03-22 09:46:13] [INFO ] Flatten gal took : 15 ms
[2023-03-22 09:46:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1801950023798065306.gal : 2 ms
[2023-03-22 09:46:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6771265895939040865.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1801950023798065306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6771265895939040865.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6771265895939040865.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,291,0.118827,8900,2,849,10,3901,6,0,1805,1616,0
Total reachable state count : 291

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,4,0.1208,9340,2,330,10,3901,7,0,1808,1616,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437516 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437516 steps, saw 310328 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:46:16] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:46:16] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:46:17] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:17] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:46:17] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 54 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 447372 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447372 steps, saw 317288 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:20] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:20] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:46:20] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:20] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:46:20] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 108 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:21] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:21] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:21] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:21] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-22 09:46:21] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:46:21] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:22] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 517
Applied a total of 176 rules in 61 ms. Remains 321 /401 variables (removed 80) and now considering 517/654 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 321 cols
[2023-03-22 09:46:22] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:46:22] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:22] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-22 09:46:22] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:22] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 09:46:22] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:22] [INFO ] Flatten gal took : 19 ms
[2023-03-22 09:46:22] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:46:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality383845250899931229.gal : 3 ms
[2023-03-22 09:46:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16530505770778249932.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality383845250899931229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16530505770778249932.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality16530505770778249932.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,292,0.205375,8904,2,812,10,3922,6,0,1804,1606,0
Total reachable state count : 292

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.206767,9344,2,322,10,3922,7,0,1807,1606,0
Incomplete random walk after 10000 steps, including 6 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 350986 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 350986 steps, saw 246899 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:46:25] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:46:26] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-22 09:46:26] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:26] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:46:26] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 652
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 401 transition count 651
Applied a total of 674 rules in 58 ms. Remains 401 /737 variables (removed 336) and now considering 651/917 (removed 266) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 651/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493404 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493404 steps, saw 350825 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:46:29] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:29] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-22 09:46:30] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:30] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:46:30] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 651/651 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 651/651 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 651/651 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 651/651 (removed 0) transitions.
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:46:30] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:30] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:46:30] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:30] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-22 09:46:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:46:30] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:31] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 651/651 transitions.
Graph (trivial) has 176 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 173 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 642
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 172 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 633
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 170 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 622
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 608
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 594
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 580
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 566
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 552
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 147 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 144 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 143 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 528
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 517
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 515
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 515
Applied a total of 175 rules in 70 ms. Remains 321 /401 variables (removed 80) and now considering 515/651 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 321 cols
[2023-03-22 09:46:31] [INFO ] Computed 160 place invariants in 0 ms
[2023-03-22 09:46:31] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:31] [INFO ] [Nat]Absence check using 160 positive place invariants in 13 ms returned sat
[2023-03-22 09:46:31] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:31] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 09:46:31] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:31] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:46:31] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:46:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14527506295175139945.gal : 1 ms
[2023-03-22 09:46:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11998857065849145177.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14527506295175139945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11998857065849145177.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11998857065849145177.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,319,0.114214,8888,2,837,10,3788,6,0,1802,1485,0
Total reachable state count : 319

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,4,0.115153,9328,2,328,10,3788,7,0,1805,1485,0
Incomplete random walk after 10000 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481433 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481433 steps, saw 342279 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:46:34] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:46:34] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:46:35] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:35] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 09:46:35] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 54 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 501526 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 501526 steps, saw 356407 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:38] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:38] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:46:38] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:38] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 09:46:38] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:38] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:39] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:39] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:39] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-22 09:46:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:39] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:39] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 37 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:46:39] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:46:39] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:40] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-22 09:46:40] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:40] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 09:46:40] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:40] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:46:40] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:46:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2524886760414376428.gal : 2 ms
[2023-03-22 09:46:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2379750113259259980.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2524886760414376428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2379750113259259980.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2379750113259259980.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,328,0.208703,8908,2,801,10,3847,6,0,1806,1529,0
Total reachable state count : 328

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,14,0.210168,9348,2,332,10,3847,7,0,1809,1529,0
Incomplete random walk after 10000 steps, including 6 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 478057 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 478057 steps, saw 339816 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:46:43] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:46:43] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-22 09:46:44] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:44] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:46:44] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 77 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 502103 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502103 steps, saw 356834 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:47] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:47] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:46:47] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:47] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:46:47] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:47] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:47] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:47] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:48] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-22 09:46:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:46:48] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:48] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 32 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:46:48] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:46:48] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:48] [INFO ] [Nat]Absence check using 160 positive place invariants in 28 ms returned sat
[2023-03-22 09:46:49] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:49] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:46:49] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:49] [INFO ] Flatten gal took : 30 ms
[2023-03-22 09:46:49] [INFO ] Flatten gal took : 26 ms
[2023-03-22 09:46:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10141824462320438742.gal : 2 ms
[2023-03-22 09:46:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14265850631498002877.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10141824462320438742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14265850631498002877.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14265850631498002877.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,171,0.185031,8900,2,792,10,3793,6,0,1806,1471,0
Total reachable state count : 171

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,8,0.186567,9340,2,332,10,3793,7,0,1809,1471,0
Incomplete random walk after 10000 steps, including 5 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 431405 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431405 steps, saw 306116 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:46:52] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:46:52] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:46:53] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:53] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 09:46:53] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 46 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 453383 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 453383 steps, saw 321797 distinct states, run finished after 3002 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:56] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:56] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:46:56] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:56] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 09:46:56] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:56] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:46:56] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:56] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:57] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2023-03-22 09:46:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:46:57] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:46:57] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 42 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:46:57] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:46:57] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:46:57] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:46:58] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:58] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 09:46:58] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:46:58] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:46:58] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:46:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17008447348934759617.gal : 2 ms
[2023-03-22 09:46:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8900639493741260365.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17008447348934759617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8900639493741260365.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8900639493741260365.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,262,0.204816,8888,2,818,10,3693,6,0,1808,1393,0
Total reachable state count : 262

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,4,0.206428,9328,2,330,10,3693,7,0,1811,1393,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 413964 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 413964 steps, saw 292956 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:01] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:47:01] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:47:02] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:02] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:47:02] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 382 place count 546 transition count 691
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 45 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 524660 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524660 steps, saw 373213 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:05] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:05] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-22 09:47:05] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:05] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 09:47:05] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 59 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:05] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:05] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:05] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:06] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2023-03-22 09:47:06] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:06] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:06] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 51 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:47:07] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:47:07] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:07] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-22 09:47:07] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:07] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 09:47:07] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:07] [INFO ] Flatten gal took : 31 ms
[2023-03-22 09:47:07] [INFO ] Flatten gal took : 27 ms
[2023-03-22 09:47:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8059343580682229245.gal : 4 ms
[2023-03-22 09:47:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8324835356593728240.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8059343580682229245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8324835356593728240.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8324835356593728240.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,279,0.210333,8892,2,829,10,3754,6,0,1807,1433,0
Total reachable state count : 279

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,4,0.211635,9332,2,329,10,3754,7,0,1810,1433,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 420250 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 420250 steps, saw 297902 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:10] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:47:10] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:47:11] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:11] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:47:11] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 43 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 379831 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379831 steps, saw 267744 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:14] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:14] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-22 09:47:14] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:14] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 09:47:15] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:15] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:15] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:15] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:15] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2023-03-22 09:47:15] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:47:15] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:16] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 50 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:47:16] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:47:16] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:16] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:47:16] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:16] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:47:16] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:16] [INFO ] Flatten gal took : 37 ms
[2023-03-22 09:47:16] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:47:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15840609873252807322.gal : 2 ms
[2023-03-22 09:47:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3925473572229900368.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15840609873252807322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3925473572229900368.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3925473572229900368.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,279,0.206809,8884,2,829,10,3754,6,0,1807,1433,0
Total reachable state count : 279

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,4,0.208155,9324,2,329,10,3754,7,0,1810,1433,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 445323 steps, run timeout after 3002 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445323 steps, saw 315947 distinct states, run finished after 3003 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:20] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:47:20] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:47:20] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:20] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 09:47:20] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 108 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 470290 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470290 steps, saw 334169 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:24] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:24] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:47:24] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:24] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 09:47:24] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:24] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:25] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:25] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:25] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-22 09:47:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:25] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:25] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 517
Applied a total of 176 rules in 43 ms. Remains 321 /401 variables (removed 80) and now considering 517/654 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 321 cols
[2023-03-22 09:47:25] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:47:25] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:26] [INFO ] [Nat]Absence check using 160 positive place invariants in 31 ms returned sat
[2023-03-22 09:47:26] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:26] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-22 09:47:26] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:26] [INFO ] Flatten gal took : 97 ms
[2023-03-22 09:47:26] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5795135251915980486.gal : 3 ms
[2023-03-22 09:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14077147133762125941.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5795135251915980486.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14077147133762125941.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14077147133762125941.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,269,0.172984,8900,2,845,10,3822,6,0,1804,1538,0
Total reachable state count : 269

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,4,0.174365,9340,2,332,10,3822,7,0,1807,1538,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 394145 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394145 steps, saw 278254 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:29] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:47:29] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 09:47:30] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:30] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-22 09:47:30] [INFO ] After 650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 69 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 423250 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423250 steps, saw 300223 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:33] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:33] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:47:34] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:34] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 09:47:34] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:34] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:34] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:34] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:35] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2023-03-22 09:47:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:47:35] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:35] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 517
Applied a total of 176 rules in 75 ms. Remains 321 /401 variables (removed 80) and now considering 517/654 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 321 cols
[2023-03-22 09:47:35] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:47:35] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:35] [INFO ] [Nat]Absence check using 160 positive place invariants in 29 ms returned sat
[2023-03-22 09:47:35] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:35] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:47:35] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:35] [INFO ] Flatten gal took : 33 ms
[2023-03-22 09:47:35] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:47:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12442073334290962620.gal : 3 ms
[2023-03-22 09:47:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality529042513169627537.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12442073334290962620.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality529042513169627537.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality529042513169627537.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,267,0.212851,8900,2,805,10,3841,6,0,1804,1505,0
Total reachable state count : 267

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,1,0.21575,9340,2,322,10,3841,7,0,1807,1505,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 304342 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 304342 steps, saw 213862 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:39] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:47:39] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-22 09:47:39] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:39] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:47:39] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 652
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 401 transition count 651
Applied a total of 674 rules in 57 ms. Remains 401 /737 variables (removed 336) and now considering 651/917 (removed 266) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 651/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493933 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493933 steps, saw 351150 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:47:43] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:43] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:43] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:47:43] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:43] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 09:47:43] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 651/651 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 651/651 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 651/651 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 651/651 (removed 0) transitions.
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:47:43] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:47:43] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:47:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:44] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-22 09:47:44] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:47:44] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:47:44] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 651/651 transitions.
Graph (trivial) has 176 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 173 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 642
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 172 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 633
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 170 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 622
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 608
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 594
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 580
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 566
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 552
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 147 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 144 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 143 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 528
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 517
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 515
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 515
Applied a total of 175 rules in 47 ms. Remains 321 /401 variables (removed 80) and now considering 515/651 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 321 cols
[2023-03-22 09:47:44] [INFO ] Computed 160 place invariants in 0 ms
[2023-03-22 09:47:44] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:45] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-22 09:47:45] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:45] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:47:45] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:45] [INFO ] Flatten gal took : 30 ms
[2023-03-22 09:47:45] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:47:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13329501168944962144.gal : 3 ms
[2023-03-22 09:47:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4691774711433567677.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13329501168944962144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4691774711433567677.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4691774711433567677.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,332,0.209753,8888,2,802,10,3875,6,0,1802,1529,0
Total reachable state count : 332

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.212906,9328,2,341,10,3875,7,0,1805,1529,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386541 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386541 steps, saw 272918 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:48] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:48] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:47:49] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:49] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:47:49] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 56 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425080 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425080 steps, saw 301650 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:47:52] [INFO ] Computed 200 place invariants in 0 ms
[2023-03-22 09:47:52] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-22 09:47:52] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:52] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-22 09:47:52] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:47:52] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:53] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:47:53] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:47:53] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-22 09:47:53] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:47:53] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:47:53] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 43 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:47:53] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:47:53] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:54] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-22 09:47:54] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:54] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:47:54] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:54] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:47:54] [INFO ] Flatten gal took : 19 ms
[2023-03-22 09:47:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18054057563096743618.gal : 3 ms
[2023-03-22 09:47:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13938567095475606544.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18054057563096743618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13938567095475606544.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13938567095475606544.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :100 after 261
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,12389,0.150219,8900,2,837,11,4781,6,0,1806,2354,0
Total reachable state count : 12389

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,256,0.151277,9340,2,330,11,4781,7,0,1809,2354,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 365691 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 365691 steps, saw 257763 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:47:57] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:47:57] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:47:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:47:58] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:47:58] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 09:47:58] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 78 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 463561 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463561 steps, saw 329016 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:01] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:01] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:48:01] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:01] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:48:01] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:01] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:02] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:02] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:02] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-22 09:48:02] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:02] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:03] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 43 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:48:03] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:48:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:03] [INFO ] [Nat]Absence check using 160 positive place invariants in 26 ms returned sat
[2023-03-22 09:48:03] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:03] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:48:03] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:03] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:48:03] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:48:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13522875515613521599.gal : 3 ms
[2023-03-22 09:48:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11913086571742155595.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13522875515613521599.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11913086571742155595.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11913086571742155595.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :100 after 261
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,17752,0.208119,8904,2,856,11,4774,6,0,1806,2394,0
Total reachable state count : 17752

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,256,0.209619,9344,2,330,11,4774,7,0,1809,2394,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396110 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 396110 steps, saw 279726 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:06] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:48:06] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:48:07] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:07] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 09:48:07] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 63 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 431775 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431775 steps, saw 306383 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:10] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:10] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 45 ms returned sat
[2023-03-22 09:48:11] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:11] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 09:48:11] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:11] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:11] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:11] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:12] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-03-22 09:48:12] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:12] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:12] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 31 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:48:12] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:48:12] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:12] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-22 09:48:12] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:12] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 09:48:12] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:12] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:48:12] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:48:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13615700179713285572.gal : 2 ms
[2023-03-22 09:48:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16508279417244823076.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13615700179713285572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16508279417244823076.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16508279417244823076.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,431,0.178023,8892,2,871,10,3947,6,0,1808,1686,0
Total reachable state count : 431

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.179471,9332,2,342,10,3947,7,0,1811,1686,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 422149 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422149 steps, saw 299351 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:16] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:48:16] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-22 09:48:16] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:16] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:48:16] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 382 place count 546 transition count 691
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 41 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 502033 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502033 steps, saw 356779 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:19] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:19] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-22 09:48:20] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:20] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:48:20] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:20] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:20] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:20] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:20] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-03-22 09:48:20] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:20] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:21] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 35 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:48:21] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:48:21] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:21] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2023-03-22 09:48:21] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:21] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:48:21] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:21] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:48:21] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:48:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17569455253100949707.gal : 4 ms
[2023-03-22 09:48:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality604671370226481634.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17569455253100949707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality604671370226481634.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality604671370226481634.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,590,0.215307,8888,2,851,10,3943,6,0,1807,1664,0
Total reachable state count : 590

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.216792,9328,2,342,10,3943,7,0,1810,1664,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425014 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425014 steps, saw 301601 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:25] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:25] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 09:48:25] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:25] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-22 09:48:25] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 103 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 462781 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 462781 steps, saw 328391 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:29] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:29] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-22 09:48:29] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:29] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:48:29] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:29] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:29] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:29] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:30] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-03-22 09:48:30] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:48:30] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:30] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 48 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:48:30] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:48:30] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:30] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2023-03-22 09:48:31] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:31] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:48:31] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:31] [INFO ] Flatten gal took : 23 ms
[2023-03-22 09:48:31] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:48:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8062691277638129189.gal : 3 ms
[2023-03-22 09:48:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16931446880466059452.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8062691277638129189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16931446880466059452.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16931446880466059452.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,590,0.213023,8888,2,851,10,3943,6,0,1807,1664,0
Total reachable state count : 590

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.214816,9328,2,342,10,3943,7,0,1810,1664,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 375594 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375594 steps, saw 264760 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:34] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:48:34] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:48:35] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:35] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 09:48:35] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2497 steps, including 61 resets, run visited all 1 properties in 12 ms. (steps per millisecond=208 )
Parikh walk visited 1 properties in 11 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 482443 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 482443 steps, saw 342878 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:38] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:48:38] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 09:48:38] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:39] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 09:48:39] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 594 place count 440 transition count 620
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 670 place count 402 transition count 657
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 656
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 401 transition count 654
Applied a total of 674 rules in 152 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481990 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481990 steps, saw 342576 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:48:42] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:42] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 20 ms returned sat
[2023-03-22 09:48:42] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:42] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:48:42] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 6 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 5 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:48:42] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:43] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:48:43] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:43] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-22 09:48:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:48:43] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:43] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 177 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 518
Applied a total of 175 rules in 49 ms. Remains 321 /401 variables (removed 80) and now considering 518/654 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 321 cols
[2023-03-22 09:48:43] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:48:43] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:43] [INFO ] [Nat]Absence check using 160 positive place invariants in 12 ms returned sat
[2023-03-22 09:48:43] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:43] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 09:48:43] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:43] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:48:43] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:48:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5807311410719800972.gal : 1 ms
[2023-03-22 09:48:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16110639395546972735.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5807311410719800972.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16110639395546972735.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16110639395546972735.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,306,0.109808,8904,2,823,10,3795,6,0,1805,1505,0
Total reachable state count : 306

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.110804,9344,2,335,10,3795,7,0,1808,1505,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468706 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468706 steps, saw 332961 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:47] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:48:47] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 09:48:47] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:47] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-22 09:48:47] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 73 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 472443 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 472443 steps, saw 335700 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:51] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:51] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:48:51] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:51] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:48:51] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:51] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:51] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:51] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:48:52] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-22 09:48:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:48:52] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:48:52] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 38 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:48:52] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:48:52] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:52] [INFO ] [Nat]Absence check using 160 positive place invariants in 23 ms returned sat
[2023-03-22 09:48:52] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:52] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:48:52] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:52] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:48:52] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:48:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality912921474628806687.gal : 2 ms
[2023-03-22 09:48:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality581601740882388670.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality912921474628806687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality581601740882388670.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...317
Loading property file /tmp/ReachabilityCardinality581601740882388670.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,368,0.170171,8896,2,830,10,3803,6,0,1806,1517,0
Total reachable state count : 368

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,54,0.171586,9336,2,344,10,3803,7,0,1809,1517,0
Incomplete random walk after 10000 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 422221 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422221 steps, saw 299411 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:48:56] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:48:56] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:48:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:48:56] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:48:56] [INFO ] After 426ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-22 09:48:57] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 89 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 463809 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463809 steps, saw 329208 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:00] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:00] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:49:00] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:00] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:49:00] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:00] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:01] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:01] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:49:01] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2023-03-22 09:49:01] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:01] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:49:02] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 52 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:49:02] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:49:02] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:02] [INFO ] [Nat]Absence check using 160 positive place invariants in 31 ms returned sat
[2023-03-22 09:49:02] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:02] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:49:02] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:02] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:49:02] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:49:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7198125428642013171.gal : 3 ms
[2023-03-22 09:49:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4422534571251026979.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7198125428642013171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4422534571251026979.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4422534571251026979.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,306,0.217319,8904,2,824,10,3794,6,0,1806,1510,0
Total reachable state count : 306

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.218909,9344,2,335,10,3794,7,0,1809,1510,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 358605 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358605 steps, saw 252564 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:49:06] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:06] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:49:06] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:06] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:49:06] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 594 place count 440 transition count 620
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 670 place count 402 transition count 657
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 656
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 656
Applied a total of 672 rules in 61 ms. Remains 402 /737 variables (removed 335) and now considering 656/917 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 656/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 357384 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357384 steps, saw 251681 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:09] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:10] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:49:10] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:10] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:49:10] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:10] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:10] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:10] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:49:11] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-03-22 09:49:11] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:11] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:49:11] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Graph (trivial) has 179 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 176 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 647
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 175 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 638
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 173 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 557
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 150 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 547
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 147 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 535
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 146 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 522
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 520
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 520
Applied a total of 175 rules in 101 ms. Remains 322 /402 variables (removed 80) and now considering 520/656 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 520 rows 322 cols
[2023-03-22 09:49:11] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:49:11] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:11] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-22 09:49:12] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:12] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:49:12] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:12] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:49:12] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:49:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11326362978242609309.gal : 2 ms
[2023-03-22 09:49:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11164603379262781616.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11326362978242609309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11164603379262781616.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11164603379262781616.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,346,0.204651,8908,2,835,10,3807,6,0,1811,1480,0
Total reachable state count : 346

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.20673,9348,2,336,10,3807,7,0,1814,1480,0
Incomplete random walk after 10000 steps, including 6 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 417330 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417330 steps, saw 295589 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:49:15] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:15] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 09:49:16] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:16] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-22 09:49:16] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 3 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 594 place count 440 transition count 620
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 670 place count 402 transition count 657
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 656
Applied a total of 671 rules in 74 ms. Remains 402 /737 variables (removed 335) and now considering 656/917 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 656/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425176 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425176 steps, saw 301721 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:19] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:19] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 09:49:20] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:20] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 09:49:20] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 14 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 656/656 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 656/656 (removed 0) transitions.
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:20] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:20] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:20] [INFO ] Computed 200 place invariants in 0 ms
[2023-03-22 09:49:21] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-22 09:49:21] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 656 rows 402 cols
[2023-03-22 09:49:21] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:21] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 656/656 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 647
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 638
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 557
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 547
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 535
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 522
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 520
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 519
Applied a total of 176 rules in 63 ms. Remains 322 /402 variables (removed 80) and now considering 519/656 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 322 cols
[2023-03-22 09:49:21] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:49:21] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:21] [INFO ] [Nat]Absence check using 160 positive place invariants in 23 ms returned sat
[2023-03-22 09:49:21] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:21] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:49:21] [INFO ] After 277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:21] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:49:21] [INFO ] Flatten gal took : 22 ms
[2023-03-22 09:49:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18273713189529427271.gal : 2 ms
[2023-03-22 09:49:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5110292891920628473.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18273713189529427271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5110292891920628473.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5110292891920628473.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,346,0.213574,8900,2,835,10,3805,6,0,1810,1475,0
Total reachable state count : 346

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.215214,9340,2,336,10,3805,7,0,1813,1475,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 352318 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352318 steps, saw 247808 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:49:25] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:49:25] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 09:49:26] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:26] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 09:49:26] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 76 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 459228 steps, run timeout after 3028 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 459228 steps, saw 325744 distinct states, run finished after 3028 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:29] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:29] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 17 ms returned sat
[2023-03-22 09:49:29] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:29] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 09:49:29] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:29] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:30] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:30] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:30] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-22 09:49:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:30] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:31] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 518
Applied a total of 176 rules in 46 ms. Remains 321 /401 variables (removed 80) and now considering 518/655 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 518 rows 321 cols
[2023-03-22 09:49:31] [INFO ] Computed 160 place invariants in 0 ms
[2023-03-22 09:49:31] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:31] [INFO ] [Nat]Absence check using 160 positive place invariants in 13 ms returned sat
[2023-03-22 09:49:31] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:31] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 09:49:31] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:31] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:49:31] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:49:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality96539257641767128.gal : 1 ms
[2023-03-22 09:49:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality283804475971016766.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality96539257641767128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality283804475971016766.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...316
Loading property file /tmp/ReachabilityCardinality283804475971016766.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,306,0.111044,8904,2,823,10,3794,6,0,1805,1505,0
Total reachable state count : 306

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.112285,9344,2,335,10,3794,7,0,1808,1505,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436630 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436630 steps, saw 309721 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:49:34] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:34] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:49:35] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 09:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-22 09:49:35] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 09:49:35] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 77 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 446229 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446229 steps, saw 316523 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:49:38] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:38] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:49:39] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:39] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 09:49:39] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 654/654 transitions.
Applied a total of 0 rules in 9 ms. Remains 401 /401 variables (removed 0) and now considering 654/654 (removed 0) transitions.
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:49:39] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:39] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:49:39] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:39] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-03-22 09:49:40] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 654 rows 401 cols
[2023-03-22 09:49:40] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:40] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 654/654 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 399 vertex of which 397 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 645
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 636
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 533
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 531
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 520
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 518
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 321 transition count 517
Applied a total of 176 rules in 59 ms. Remains 321 /401 variables (removed 80) and now considering 517/654 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 321 cols
[2023-03-22 09:49:40] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:49:40] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:40] [INFO ] [Nat]Absence check using 160 positive place invariants in 35 ms returned sat
[2023-03-22 09:49:40] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:40] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:49:40] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:40] [INFO ] Flatten gal took : 34 ms
[2023-03-22 09:49:40] [INFO ] Flatten gal took : 29 ms
[2023-03-22 09:49:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6361410716825905913.gal : 3 ms
[2023-03-22 09:49:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16036434846030102069.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6361410716825905913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16036434846030102069.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16036434846030102069.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,496,0.180114,8904,2,826,10,4013,6,0,1804,1694,0
Total reachable state count : 496

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,44,0.181536,9344,2,342,10,4013,7,0,1807,1694,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 411274 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 411274 steps, saw 290843 distinct states, run finished after 3003 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:49:44] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:49:44] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:49:44] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:45] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-22 09:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-22 09:49:45] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-22 09:49:45] [INFO ] After 628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 672 place count 402 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 652
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 674 place count 401 transition count 651
Applied a total of 674 rules in 109 ms. Remains 401 /737 variables (removed 336) and now considering 651/917 (removed 266) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 651/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451275 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451275 steps, saw 320185 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:49:48] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:48] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:49:48] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:48] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 09:49:48] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 651/651 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 651/651 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 651/651 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 651/651 (removed 0) transitions.
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:49:48] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:49] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:49:49] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:49] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2023-03-22 09:49:49] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 651 rows 401 cols
[2023-03-22 09:49:49] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:49:50] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 651/651 transitions.
Graph (trivial) has 176 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1381 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 173 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 642
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 172 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 633
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 170 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 622
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 608
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 594
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 580
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 566
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 552
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 147 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 144 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 143 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 528
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1134 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 517
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 515
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 515
Applied a total of 175 rules in 37 ms. Remains 321 /401 variables (removed 80) and now considering 515/651 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 321 cols
[2023-03-22 09:49:50] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:49:50] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:50] [INFO ] [Nat]Absence check using 160 positive place invariants in 14 ms returned sat
[2023-03-22 09:49:50] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:50] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:49:50] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:50] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:49:50] [INFO ] Flatten gal took : 13 ms
[2023-03-22 09:49:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16997834329460620479.gal : 2 ms
[2023-03-22 09:49:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15595646163216769396.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16997834329460620479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15595646163216769396.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15595646163216769396.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :100 after 176
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 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,4693,0.260427,8892,2,812,11,4725,6,0,1802,2204,0
Total reachable state count : 4693

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,254,0.261974,9332,2,346,11,4725,7,0,1805,2204,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 407879 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407879 steps, saw 288326 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:49:53] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:54] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 09:49:54] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:54] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-22 09:49:54] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 2 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 382 place count 546 transition count 690
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 454 place count 510 transition count 690
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 85 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 405952 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405952 steps, saw 286942 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:58] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:49:58] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:49:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 09:49:58] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:49:58] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 09:49:58] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:58] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-22 09:49:58] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:58] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:49:59] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-22 09:49:59] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:49:59] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:49:59] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 51 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 105 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:50:00] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-22 09:50:00] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:00] [INFO ] [Nat]Absence check using 160 positive place invariants in 26 ms returned sat
[2023-03-22 09:50:00] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:00] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:50:00] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:00] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:50:00] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:50:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5069276267127469952.gal : 2 ms
[2023-03-22 09:50:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11951385646256479219.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5069276267127469952.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11951385646256479219.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11951385646256479219.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,368,0.178108,8904,2,833,10,3833,6,0,1806,1540,0
Total reachable state count : 368

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.179704,9344,2,335,10,3833,7,0,1809,1540,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 418073 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418073 steps, saw 296203 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:50:03] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 09:50:03] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:50:04] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:04] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:50:04] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 656
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 655
Applied a total of 673 rules in 39 ms. Remains 401 /737 variables (removed 336) and now considering 655/917 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 655/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 346629 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346629 steps, saw 243607 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:50:07] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:07] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-22 09:50:08] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:08] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-22 09:50:08] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 401/401 places, 655/655 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 655/655 (removed 0) transitions.
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:50:08] [INFO ] Computed 200 place invariants in 14 ms
[2023-03-22 09:50:08] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:50:08] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:08] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2023-03-22 09:50:08] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 655 rows 401 cols
[2023-03-22 09:50:08] [INFO ] Computed 200 place invariants in 0 ms
[2023-03-22 09:50:09] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 655/655 transitions.
Graph (trivial) has 178 edges and 401 vertex of which 4 / 401 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1380 edges and 399 vertex of which 397 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 395 vertex of which 4 / 395 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 393 transition count 646
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 391 vertex of which 6 / 391 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 388 transition count 637
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 381 transition count 626
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 373 transition count 612
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 369 vertex of which 8 / 369 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 365 transition count 598
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 361 vertex of which 8 / 361 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 357 transition count 584
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 353 vertex of which 8 / 353 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 349 transition count 570
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 345 vertex of which 6 / 345 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 556
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 339 vertex of which 6 / 339 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 336 transition count 546
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 333 vertex of which 2 / 333 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 332 transition count 534
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 330 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1133 edges and 329 vertex of which 323 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 323 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 321 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 321 transition count 519
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 321 transition count 519
Applied a total of 175 rules in 53 ms. Remains 321 /401 variables (removed 80) and now considering 519/655 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 321 cols
[2023-03-22 09:50:09] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:50:09] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:09] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-22 09:50:09] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:09] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 09:50:09] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:09] [INFO ] Flatten gal took : 35 ms
[2023-03-22 09:50:09] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:50:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11780087145187789183.gal : 2 ms
[2023-03-22 09:50:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7837526832312733928.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11780087145187789183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7837526832312733928.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7837526832312733928.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,306,0.207174,8900,2,826,10,3818,6,0,1806,1541,0
Total reachable state count : 306

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,22,0.208493,9340,2,335,10,3818,7,0,1809,1541,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 432335 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432335 steps, saw 306775 distinct states, run finished after 3002 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:50:13] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:50:13] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:50:13] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:13] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 09:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-22 09:50:13] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 09:50:13] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 737 transition count 813
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 633 transition count 813
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 208 place count 633 transition count 763
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 380 place count 547 transition count 691
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 72 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486840 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486840 steps, saw 345912 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:17] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:50:17] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 55 ms returned sat
[2023-03-22 09:50:17] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:17] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 09:50:17] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 6 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:17] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:17] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:17] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:50:18] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-22 09:50:18] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:18] [INFO ] Computed 200 place invariants in 0 ms
[2023-03-22 09:50:18] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 178 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 175 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 174 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 172 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 152 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 149 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 146 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 145 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 517
Applied a total of 175 rules in 54 ms. Remains 322 /402 variables (removed 80) and now considering 517/653 (removed 136) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 517 rows 322 cols
[2023-03-22 09:50:18] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:50:18] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:18] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-22 09:50:18] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:18] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 09:50:18] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:18] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:50:19] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:50:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17712407877100086773.gal : 2 ms
[2023-03-22 09:50:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17389473762620833081.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17712407877100086773.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17389473762620833081.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17389473762620833081.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,290,0.168686,8892,2,824,10,3718,6,0,1808,1412,0
Total reachable state count : 290

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,3,0.171281,9332,2,327,10,3718,7,0,1811,1412,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 422568 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422568 steps, saw 299686 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:50:22] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:50:22] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:50:22] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
[2023-03-22 09:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-22 09:50:23] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-22 09:50:23] [INFO ] After 667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 737 transition count 814
Reduce places removed 103 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 634 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 346 place count 546 transition count 726
Iterating global reduction 3 with 36 rules applied. Total rules applied 382 place count 546 transition count 726
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 382 place count 546 transition count 691
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 452 place count 511 transition count 691
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 70 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 429149 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 429149 steps, saw 304564 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:26] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:50:26] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-22 09:50:26] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:26] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 09:50:26] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:26] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:27] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:27] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:27] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-22 09:50:27] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:27] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:27] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 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 removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 48 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:50:27] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:50:27] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:27] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-22 09:50:28] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:28] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 09:50:28] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:28] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:50:28] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:50:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2667982486458789428.gal : 2 ms
[2023-03-22 09:50:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8989695818135064890.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2667982486458789428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8989695818135064890.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8989695818135064890.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,290,0.205202,8892,2,826,10,3698,6,0,1807,1397,0
Total reachable state count : 290

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,3,0.206624,9332,2,326,10,3698,7,0,1810,1397,0
Incomplete random walk after 10000 steps, including 4 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396617 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396617 steps, saw 280133 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:50:31] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:50:31] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-22 09:50:32] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:32] [INFO ] After 339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:50:32] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 210 place count 632 transition count 763
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 308 place count 583 transition count 763
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 344 place count 547 transition count 727
Iterating global reduction 2 with 36 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 670 place count 402 transition count 654
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 671 place count 402 transition count 653
Applied a total of 671 rules in 44 ms. Remains 402 /737 variables (removed 335) and now considering 653/917 (removed 264) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/737 places, 653/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 450859 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450859 steps, saw 319875 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:35] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:50:35] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:35] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 09:50:35] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:35] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 09:50:35] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 402/402 places, 653/653 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:35] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-22 09:50:36] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:36] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:50:36] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-03-22 09:50:36] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 653 rows 402 cols
[2023-03-22 09:50:36] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 09:50:36] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 653/653 transitions.
Graph (trivial) has 177 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 174 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 644
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 173 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 635
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 171 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 596
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 159 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 582
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 155 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 568
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 151 edges and 346 vertex of which 6 / 346 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 554
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 148 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 337 transition count 544
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 145 edges and 334 vertex of which 2 / 334 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 144 edges and 332 vertex of which 2 / 332 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 4 rules applied. Total rules applied 164 place count 331 transition count 530
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1135 edges and 330 vertex of which 324 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 170 place count 324 transition count 519
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 173 place count 322 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 174 place count 322 transition count 517
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 175 place count 322 transition count 516
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 176 place count 322 transition count 516
Applied a total of 176 rules in 136 ms. Remains 322 /402 variables (removed 80) and now considering 516/653 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 516 rows 322 cols
[2023-03-22 09:50:37] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-22 09:50:37] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:37] [INFO ] [Nat]Absence check using 160 positive place invariants in 29 ms returned sat
[2023-03-22 09:50:37] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:37] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 09:50:37] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:37] [INFO ] Flatten gal took : 32 ms
[2023-03-22 09:50:37] [INFO ] Flatten gal took : 25 ms
[2023-03-22 09:50:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12827828739951125608.gal : 3 ms
[2023-03-22 09:50:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality291555955545842860.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10038179949104467108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12827828739951125608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality291555955545842860.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality291555955545842860.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 100
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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,290,0.203993,8888,2,826,10,3698,6,0,1807,1397,0
Total reachable state count : 290

Verifying 1 reachability properties.
Invariant property AtomicProp 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
AtomicProp,3,0.20559,9328,2,326,10,3698,7,0,1810,1397,0
Incomplete random walk after 10000 steps, including 3 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 425577 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425577 steps, saw 302019 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 917 rows 737 cols
[2023-03-22 09:50:40] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 09:50:41] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:50:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-22 09:50:41] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:50:41] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 09:50:41] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 737/737 places, 917/917 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 737 transition count 812
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 632 transition count 812
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 210 place count 632 transition count 762
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 310 place count 582 transition count 762
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 345 place count 547 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 380 place count 547 transition count 727
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 380 place count 547 transition count 692
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 450 place count 512 transition count 692
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 596 place count 439 transition count 619
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 672 place count 401 transition count 655
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 401 transition count 654
Applied a total of 673 rules in 116 ms. Remains 401 /737 variables (removed 336) and now considering 654/917 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/737 places, 654/917 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m